Qma
QMA is a complexity class in quantum computational complexity theory that consists of decision problems for which a quantum verifier can efficiently check a quantum proof with bounded error, distinguishing it from other complexity classes by its reliance on quantum witnesses and quantum computation.
111
Publications
5.3K
Citations
176
Authors
113
Institutions
Publications per year
2017–2026
15
Parents
111
Steven R. Brown · Operant Subjectivity · 1993 · 485 citations · Full text
Robinson Am, Bruce W. Drinkwater, RS Dwyer-Joyce · 1999 · 353 citations
Chris Marriott, John Watrous · Computational Complexity · 2005 · 253 citations · Full text
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
Toward a general theory of quantum games
2006 · 155 citations
1–5 of 111
176
8
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 176
113

University of Waterloo
Waterloo, Canada
10 h-index
16 publications
740 citations

University of Ottawa
Ottawa, Canada
6 h-index
6 publications
109 citations

Chinese Academy of Sciences
Beijing, China
5 h-index
10 publications
261 citations
California Institute of Technology
Pasadena, United States
5 h-index
6 publications
162 citations
Hebrew University of Jerusalem
Jerusalem, Israel
5 h-index
5 publications
329 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
9 publications
380 citations

Perimeter Institute
Waterloo, Canada
5 h-index
7 publications
451 citations
Slovak Academy of Sciences
Bratislava, Slovakia
4 h-index
4 publications
100 citations
1–8 of 113
Repository · 11 publications · 224 citations
10
h-index
QIC · 9 publications · 434 citations
9
h-index
Repository · 7 publications · 217 citations
7
h-index
5 publications · 138 citations
5
h-index
IJQI · 2 publications · 83 citations
2
h-index
1–5