Quantum Complexity Theory

Quantum Complexity Theory is a branch of theoretical computer science that studies the computational complexity of problems solvable by quantum computers, distinguishing itself from classical complexity theory by characterizing the resources required for quantum algorithms and the inherent difficulty of problems within quantum models of computation.

873

Publications

58.6K

Citations

1.1K

Authors

523

Institutions

Publications per year

2017–2026

298

Authors

1.1K

  1. AA
    Andris Ambainis

    University of Latvia, Latvia

    33 publications · 2.2K citations

    21

    h-index

  2. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    37 publications · 2.9K citations

    19

    h-index

  3. RD
    Ronald de Wolf

    Centrum Wiskunde & Informatica, Netherlands

    27 publications · 2K citations

    19

    h-index

  4. JW
    John Watrous

    University of Calgary, Canada

    24 publications · 1.6K citations

    18

    h-index

  5. RC
    Richard Cleve

    University of Calgary, Canada

    13 publications · 1.7K citations

    13

    h-index

1–5 of 1.1K

Venues

  1. SIAM Journal on Computing

    32 publications · 6.3K citations

    25

    h-index

  2. arXiv (Cornell University)

    Repository · 92 publications · 2.1K citations

    25

    h-index

  3. Physical Review Letters

    PRL · 26 publications · 3.7K citations

    24

    h-index

  4. Journal of High Energy Physics

    JHEP · 28 publications · 2.3K citations

    24

    h-index

  5. Quantum Information and Computation

    QIC · 41 publications · 1.4K citations

    23

    h-index

1–5