Bqp

BQP is the complexity class of decision problems solvable by a quantum computer in polynomial time with bounded error probability, distinguishing it from classical complexity classes by its reliance on quantum-mechanical principles such as superposition and entanglement.

61

Publications

3.5K

Citations

104

Authors

85

Institutions

Publications per year

2017–2026

17

Variants

Bounded-error Quantum Polynomial Time

Authors

104

  1. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    14 publications · 511 citations

    12

    h-index

  2. DA
    Dorit Aharonov

    Hebrew University of Jerusalem, Israel

    7 publications · 874 citations

    7

    h-index

  3. SP
    Stephen P. Jordan

    California Institute of Technology, United States

    3 publications · 247 citations

    3

    h-index

  4. VF
    Vaughan F. R. Jones

    University of California, Berkeley, United States

    3 publications · 438 citations

    3

    h-index

  5. ZL
    Zeph Landau

    University of California, Berkeley, United States

    3 publications · 438 citations

    3

    h-index

1–5 of 104

Venues

  1. Quantum Information and Computation

    QIC · 5 publications · 241 citations

    5

    h-index

  2. ArXiv.org

    Repository · 4 publications · 161 citations

    4

    h-index

  3. arXiv (Cornell University)

    Repository · 3 publications · 44 citations

    3

    h-index

  4. Physical Review Letters

    PRL · 3 publications · 181 citations

    3

    h-index

  5. Journal of Global Optimization

    2 publications · 42 citations

    2

    h-index

1–5