Quantum Interactive Proofs with Competing Provers

This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other that tries to convince the verifier to reject. We prove that every language having an ordinary quantum interactive proof system also has a quantum refereed game in which the verifier exchanges just one round of messages with each prover. A key part of our proof is the fact that there exists a single quantum measurement that reliably distinguishes between mixed states chosen arbitrarily from disjoint convex sets having large minimal trace distance from one another. We also show how to reduce the probability of error for some classes of quantum refereed games.

[1]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[2]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[3]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[4]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[5]  John H. Reif,et al.  The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..

[6]  Bill Rosgen,et al.  On the hardness of distinguishing mixed-state quantum computations , 2004, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[7]  U. Feige,et al.  Making Games Short , 2006 .

[8]  R. Bhatia.  Matrix Analysis , 1996 .

[9]  Uriel Feige,et al.  Making games short (extended abstract) , 1997, STOC '97.

[10]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[11]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[12]  John Watrous.  PSPACE has constant-round quantum interactive proof systems , 2003, Theor. Comput. Sci..

[13]  D. Koller,et al.  The complexity of two-person zero-sum games in extensive form , 1992 .

[14]  Alexei Y. Kitaev,et al.  Parallelization, amplification, and exponential time simulation of quantum interactive proof systems , 2000, STOC '00.

[15]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[16]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[17]  Noam Nisan,et al.  Quantum circuits with mixed states , 1998, STOC '98.

[18]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[19]  Joan Feigenbaum,et al.  A game-theoretic classification of interactive complexity classes , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[20]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[21]  Alexander Shen.  IP = SPACE: simplified proof , 1992, JACM.

[22]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[23]  Jeroen van de Graaf,et al.  Cryptographic Distinguishability Measures for Quantum-Mechanical States , 1997, IEEE Trans. Inf. Theory.

[24]  Adi Shamir,et al.  Multi-Oracle Interactive Protocols with Constant Space Verifiers , 1992, J. Comput. Syst. Sci..

[25]  Moshe Tennenholtz,et al.  The Noisy Oracle Problem , 1988, CRYPTO.