Quantum Complexity

Quantum Complexity is a theoretical framework within computational complexity theory that classifies computational problems based on the resources required for their solution by quantum computers, distinguishing it from classical complexity frameworks by its reliance on quantum mechanical principles such as superposition, entanglement, and interference.

520

Publications

35.7K

Citations

803

Authors

434

Institutions

Publications per year

2017–2026

193

Variants

Quantum Computational Complexity

Authors

803

  1. RD
    Ronald de Wolf

    Centrum Wiskunde & Informatica, Netherlands

    20 publications · 2.8K citations

    16

    h-index

  2. AA
    Andris Ambainis

    University of Latvia, Latvia

    17 publications · 719 citations

    15

    h-index

  3. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    22 publications · 1.6K citations

    14

    h-index

  4. HB
    Harry Buhrman

    Centrum Wiskunde & Informatica, Netherlands

    11 publications · 2.5K citations

    11

    h-index

  5. LS
    Leonard Susskind

    Stanford University, United States

    10 publications · 2.3K citations

    10

    h-index

1–5 of 803

Venues

  1. Journal of High Energy Physics

    JHEP · 38 publications · 3.2K citations

    30

    h-index

  2. Physical Review Letters

    PRL · 28 publications · 5.8K citations

    27

    h-index

  3. Physical review. D/Physical review. D.

    PRD · 22 publications · 2K citations

    19

    h-index

  4. arXiv (Cornell University)

    Repository · 46 publications · 1K citations

    19

    h-index

  5. ArXiv.org

    Repository · 26 publications · 666 citations

    15

    h-index

1–5