Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to reject. In quantum refereed games, the provers and verifier may perform quantum computations and exchange quantum messages. One may consider games with a bounded or unbounded number of rounds of messages between the verifier and provers. In this paper, we prove classical upper bounds on the power of both one-round and many-round quantum refereed games. In particular, we use semidefinite programming to show that many-round quantum refereed games are contained in NEXP. It then follows from the symmetric nature of these games that they are also contained in coNEXP. We also show that one-round quantum refereed games are contained in EXP by supplying a separation oracle for use with the ellipsoid method for convex feasibility.