Concepedia

Quantum Advice Complexity

Quantum Advice Complexity is a computational complexity measure that characterizes the minimum amount of quantum information, or advice, required by a quantum algorithm to solve a problem efficiently, distinguishing it from classical advice complexity by leveraging quantum states as non-uniform computational resources.

4

Publications

75

Citations

5

Authors

4

Institutions

Publications per year

2017–2026

1

Parents

Publications

4

1–4 of 4

Authors

5

  1. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    3 publications · 45 citations

    3

    h-index

  2. KK
    Kamil Khadiev

    Kazan Federal University, Russia

    1 publications · 30 citations

    1

    h-index

  3. IM
    Ilnaz Mannapov

    Kazan Federal University, Russia

    1 publications · 30 citations

    1

    h-index

  4. AD
    Andrew Drucker

    Massachusetts Institute of Technology, United States

    1 publications · 10 citations

    1

    h-index

  5. AK
    Aliya Khadieva

    Kazan Federal University, Russia

    1 publications · 30 citations

    1

    h-index

1–5 of 5

Institutions

4

  1. University of Latvia

    Riga, Latvia

    1 h-index

    1 publications

    30 citations

  2. University of Waterloo

    Waterloo, Canada

    1 h-index

    1 publications

    19 citations

  3. Kazan Federal University

    Kazan’, Russia

    1 h-index

    3 publications

    90 citations

  4. Russian Quantum Center

    Moscow, Russia

    1 h-index

    1 publications

    30 citations

1–4 of 4

Venues

  1. ArXiv.org

    Repository · 1 publications · 16 citations

    1

    h-index

  2. SIAM Journal on Computing

    1 publications · 10 citations

    1

    h-index

  3. Lobachevskii Journal of Mathematics

    LJM · 1 publications · 30 citations

    1

    h-index

1–3