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
520
Ethan Bernstein, Umesh Vazirani · SIAM Journal on Computing · 1997 · 1.5K citations
Ethan Bernstein, Umesh Vazirani · 1993 · 1.3K citations
Harry Buhrman, Richard Cleve, John Watrous et al. · Physical Review Letters · 2001 · 1.2K citations · Full text
Computing, Computer Science, Physics +12
1–5 of 520
803
16
h-index
15
h-index
14
h-index
11
h-index
10
h-index
1–5 of 803
434

University of Waterloo
Waterloo, Canada
22 h-index
49 publications
3K citations
University of California, Berkeley
Berkeley, United States
21 h-index
33 publications
2.8K citations

Perimeter Institute
Waterloo, Canada
21 h-index
41 publications
4.9K citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
20 h-index
41 publications
6.9K citations
California Institute of Technology
Pasadena, United States
17 h-index
30 publications
2K citations
Massachusetts Institute of Technology
Cambridge, United States
16 h-index
37 publications
3.9K citations

University of Latvia
Riga, Latvia
14 h-index
27 publications
868 citations
Hebrew University of Jerusalem
Jerusalem, Israel
14 h-index
23 publications
1.4K citations
1–8 of 434
JHEP · 38 publications · 3.2K citations
30
h-index
PRL · 28 publications · 5.8K citations
27
h-index
PRD · 22 publications · 2K citations
19
h-index
Repository · 46 publications · 1K citations
19
h-index
Repository · 26 publications · 666 citations
15
h-index
1–5