Quantum Proof Verification
Quantum Proof Verification is a computational framework in quantum complexity theory that distinguishes quantum proofs from classical proofs by verifying the validity of a claimed solution to a computational problem using quantum states and measurements, ensuring correctness through bounded-error quantum polynomial-time procedures.
6
Publications
283
Citations
9
Authors
8
Institutions
Publications per year
2017–2026
0
Parents
6
Succinct quantum proofs for properties of finite groups
John Watrous · 2002 · 127 citations
All Languages in NP Have Very Short Quantum Proofs
Hugue Blier, Alain Tapp · 2009 · 49 citations
Classical verification of quantum proofs
Zhengfeng Ji · 2016 · 40 citations
Computing, Computer Science, Physics +15
Succinct quantum proofs for properties of finite groups
John Watrous · ArXiv.org · 2000 · 30 citations · Full text
Scott Aaronson, Salman Beigi, Andrew Drucker et al. · 2008 · 27 citations
1–5 of 6
9
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 9
8
Université de Montréal
Montreal, Canada
2 h-index
4 publications
118 citations

University of Calgary
Calgary, Canada
2 h-index
2 publications
157 citations
University of Chicago
Chicago, United States
1 h-index
1 publications
27 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
3 publications
81 citations
Institute of Software
Beijing, China
1 h-index
1 publications
40 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
40 citations

Chinese Academy of Sciences
Beijing, China
1 h-index
1 publications
40 citations
University of Technology Sydney
Sydney, Australia
1 h-index
1 publications
40 citations
1–8 of 8
Repository · 1 publications · 10 citations
1
h-index
Repository · 1 publications · 30 citations
1
h-index
1–2