Quantum Complexity Classes
Quantum Complexity Classes is a theoretical framework in computational complexity theory that categorizes computational problems based on the quantum computational resources required to solve them, distinguishing them from classical complexity classes by incorporating the principles of quantum mechanics such as superposition and entanglement.
116
Publications
8.9K
Citations
198
Authors
137
Institutions
Publications per year
2017–2026
26
Parents
116
On the Power of Quantum Computation
Daniel Simón · SIAM Journal on Computing · 1997 · 1.3K citations
Computing, Computer Science, Physics +14
Quantum-inspired genetic algorithms
A. Narayanan, Matthew Moore · 2002 · 644 citations
Computing, Computer Science, Physics +12
On the power of quantum computation
Damien Simon · 2002 · 495 citations
Computing, Computer Science, Physics +14
1–5 of 116
198
8
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 198
137
California Institute of Technology
Pasadena, United States
9 h-index
9 publications
328 citations
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
16 publications
613 citations

University of Waterloo
Waterloo, Canada
5 h-index
7 publications
554 citations

University of Bristol
Bristol, United Kingdom
5 h-index
7 publications
216 citations
University of Oxford
Oxford, United Kingdom
4 h-index
9 publications
373 citations
Université de Montréal
Montreal, Canada
4 h-index
7 publications
277 citations

Perimeter Institute
Waterloo, Canada
3 h-index
5 publications
226 citations
Princeton University
Princeton, United States
3 h-index
3 publications
193 citations
1–8 of 137
QIC · 11 publications · 391 citations
11
h-index
Repository · 10 publications · 151 citations
10
h-index
Repository · 9 publications · 254 citations
9
h-index
6 publications · 1.9K citations
6
h-index
PRL · 6 publications · 1.6K citations
6
h-index
1–5