Parallel Approximation of Non-interactive Zero-sum Quantum Games

This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement on the two states to determine the players' payoffs. We prove that an equilibrium point of any such game can be approximated by means of an efficient parallel algorithm, which implies that one-turn quantum refereed games, wherein the referee is specified by a quantum circuit, can be simulated in polynomial space.

[1]  Yoav Freund,et al.  Game theory, on-line prediction and boosting , 1996, COLT '96.

[2]  Peter Høyer,et al.  Consequences and limits of nonlocal strategies , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[3]  Carlos Mochon.  Quantum weak coin-flipping with bias of 0.192 , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[4]  Sanjeev Arora,et al.  Fast algorithms for approximate semidefinite programming using the multiplicative weights update method , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[5]  Ran Canetti.  More on BPP and the Polynomial-Time Hierarchy , 1996, Inf. Process. Lett..

[6]  Neal E. Young,et al.  Sequential and parallel algorithms for mixed packing and covering , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[7]  Keiji Matsumoto,et al.  Entangled Games are Hard to Approximate , 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[8]  R W Spekkens,et al.  Quantum protocol for cheat-sensitive weak coin flipping. , 2002, Physical review letters.

[9]  Rahul Jain,et al.  Two-Message Quantum Interactive Proofs Are in PSPACE , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[10]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

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

[12]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[13]  Sanjeev Arora,et al.  A combinatorial, primal-dual approach to semidefinite programs , 2007, STOC '07.

[14]  Keiji Matsumoto,et al.  Quantum multi-prover interactive proof systems with limited prior entanglement , 2001, J. Comput. Syst. Sci..

[15]  Alexander Russell,et al.  Symmetric alternation captures BPP , 1998, computational complexity.

[16]  Keiji Matsumoto,et al.  Using Entanglement in Quantum Multi-Prover Interactive Proofs , 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.

[17]  Gus Gutoski,et al.  Quantum Interactive Proofs with Competing Provers , 2004, STACS.

[18]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

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

[20]  Noam Nisan,et al.  A parallel approximation algorithm for positive linear programming , 1993, STOC.

[21]  C. Mochon.  Quantum weak coin flipping with arbitrarily small bias , 2007, 0711.4114.

[22]  Gunnar Rätsch,et al.  Matrix Exponentiated Gradient Updates for On-line Learning and Bregman Projection , 2004, J. Mach. Learn. Res..

[23]  J. Davenport.  Editor , 1960 .

[24]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .

[25]  K Fan,et al.  Minimax Theorems. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[26]  Jean-Pierre Bourguignon,et al.  Mathematische Annalen , 1893 .

[27]  Gus Gutoski,et al.  Upper bounds for quantum interactive proofs with competing provers , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[28]  Satyen Kale.  Efficient algorithms using the multiplicative weights update method , 2007 .

[29]  Gus Gutoski,et al.  Toward a general theory of quantum games , 2006, STOC '07.

[30]  Andris Ambainis,et al.  A new protocol and lower bounds for quantum coin flipping , 2001, STOC '01.