Quantum Interactive Proof System is a computational model in quantum complexity theory where a computationally bounded quantum verifier interacts with an all-powerful quantum prover through quantum communication to decide membership in a language, with completeness and soundness conditions enforced by the laws of quantum mechanics.
64
Publications
3.6K
Citations
84
Authors
63
Institutions
Publications per year
2017–2026
10
Variants
Qip Systems
Parents
Publications
64
Consequences and Limits of Nonlocal Strategies
2004 · 310 citations
Chris Marriott, John Watrous · Computational Complexity · 2005 · 253 citations · Full text
1–5 of 64
Authors
84
- JW
17
h-index
- HK
7
h-index
- TV
6
h-index
- ZJ
6
h-index
- SU
6
h-index
1–5 of 84
Institutions
63
University of Calgary
Calgary, Canada
11 h-index
16 publications
1.6K citations
University of Waterloo
Waterloo, Canada
11 h-index
21 publications
653 citations
California Institute of Technology
Pasadena, United States
6 h-index
9 publications
553 citations
National Institute of Informatics
Tokyo, Japan
6 h-index
9 publications
328 citations
National University of Singapore
Singapore, Singapore
5 h-index
5 publications
460 citations
Canadian Institute for Advanced Research
Toronto, Canada
4 h-index
4 publications
76 citations
University of Technology Sydney
Sydney, Australia
4 h-index
4 publications
117 citations
Institute of Software
Beijing, China
4 h-index
4 publications
151 citations
1–8 of 63
Venues
- ArXiv.org
Repository · 5 publications · 163 citations
5
h-index
- Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
3 publications · 406 citations
3
h-index
- arXiv (Cornell University)
Repository · 3 publications · 62 citations
3
h-index
- Physical review. A/Physical review, A
PRA · 2 publications · 290 citations
2
h-index
- Theoretical Computer Science
2 publications · 107 citations
2
h-index
1–5