Title
Quantum Proofs.
Abstract
Quantum Proofs provides an overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complexity classes they define. In particular, it discusses non-interactive proofs and the complexity class QMA, single-prover quantum interactive proof systems and the complexity class QIP, statistical zero-knowledge quantum interactive proof systems and the complexity class QSZK, and multiprover interactive proof systems and the complexity classes QMIP, QMIP*, and MIP*. Quantum Proofs is mainly intended for non-specialists having a basic background in complexity theory and quantum information. A typical reader may be a student or researcher in either area desiring to learn about the fundamentals of the (actively developing) theory of quantum interactive proofs.
Year
DOI
Venue
2016
10.1561/0400000068
Foundations and Trends in Theoretical Computer Science
DocType
Volume
Issue
Journal
11
1-2
ISSN
Citations 
PageRank 
Foundations and Trends in Theoretical Computer Science, Vol. 11, No. 1-2 (2015) 1-215
1
0.36
References 
Authors
0
2
Name
Order
Citations
PageRank
Thomas Vidick137731.69
John Watrous2142.10