Quantum Complexity Classes

Quantum Complexity Classes is a theoretical framework in computational complexity theory that categorizes computational problems based on the quantum computational resources required to solve them, distinguishing them from classical complexity classes by incorporating the principles of quantum mechanics such as superposition and entanglement.

116

Publications

8.9K

Citations

198

Authors

137

Institutions

Publications per year

2017–2026

26

Authors

198

  1. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    8 publications · 448 citations

    8

    h-index

  2. TS
    Toby S. Cubitt

    University College London, United Kingdom

    4 publications · 139 citations

    4

    h-index

  3. JW
    John Watrous

    University of Calgary, Canada

    4 publications · 146 citations

    4

    h-index

  4. RJ
    Richard Jozsa

    University of Bristol, United Kingdom

    3 publications · 98 citations

    3

    h-index

  5. HB
    Hugue Blier

    Université de Montréal, Canada

    3 publications · 69 citations

    3

    h-index

1–5 of 198

Venues

  1. Quantum Information and Computation

    QIC · 11 publications · 391 citations

    11

    h-index

  2. arXiv (Cornell University)

    Repository · 10 publications · 151 citations

    10

    h-index

  3. ArXiv.org

    Repository · 9 publications · 254 citations

    9

    h-index

  4. SIAM Journal on Computing

    6 publications · 1.9K citations

    6

    h-index

  5. Physical Review Letters

    PRL · 6 publications · 1.6K citations

    6

    h-index

1–5