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
Parents
61
Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang · SIAM Journal on Computing · 1997 · 275 citations
Chris Marriott, John Watrous · Computational Complexity · 2005 · 253 citations · Full text
BQP and the polynomial hierarchy
Scott Aaronson · 2010 · 230 citations
The Power of Quantum Systems on a Line
Dorit Aharonov, Daniel Gottesman, Sandy Irani et al. · Communications in Mathematical Physics · 2009 · 219 citations · Full text
1–5 of 61
104
12
h-index
7
h-index
3
h-index
3
h-index
3
h-index
1–5 of 104
85
Hebrew University of Jerusalem
Jerusalem, Israel
8 h-index
11 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
13 publications
704 citations
University of California, Berkeley
Berkeley, United States
6 h-index
6 publications
502 citations
Princeton University
Princeton, United States
5 h-index
5 publications
202 citations

Perimeter Institute
Waterloo, Canada
4 h-index
5 publications
341 citations

University of Waterloo
Waterloo, Canada
3 h-index
4 publications
198 citations
California Institute of Technology
Pasadena, United States
3 h-index
3 publications
145 citations
City College of New York
New York, United States
3 h-index
3 publications
438 citations
1–8 of 85
QIC · 5 publications · 241 citations
5
h-index
Repository · 4 publications · 161 citations
4
h-index
Repository · 3 publications · 44 citations
3
h-index
PRL · 3 publications · 181 citations
3
h-index
2 publications · 42 citations
2
h-index
1–5