Toward a general theory of quantum games

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 565-574

  Gutoski, Gus ^a   Watrous, John ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Choi Jamiolkowski representation; Coin flipping; Interactive proof systems; Quantum game theory; Quantum strategies

Indexed keywords

GAME THEORY; INFORMATION THEORY;

CHOI-JAMIOLKOWSKI REPRESENTATION; COIN-FLIPPING; INTERACTIVE PROOF SYSTEMS; QUANTUM GAME THEORY; QUANTUM STRATEGIES;

QUANTUM THEORY;

EID: 35448951300     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250873     Document Type: Conference Paper

References (34)

1. AMBAINIS, A. A new protocol and lower bounds for quantum coin flipping. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (2001), pp. 134-142.
2. AMBAINIS, A., BUHRMAN, H., DODIS, Y., AND RÖHRIG, H. Multiparty quantum, coin flipping. In Proceedings of the 19th Annual IEEE Conference on Computational Complexity (2004), pp. 250-259.
3. BABAI, L. Trading group theory for randomness. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing (1985), pp. 421-429.
4. BABAI, L., AND MORAN, S. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences 36, 2 (1988), 254-276.
5. BENJAMIN, S., AND HAYDEN, P. Comment on "Quantum games and quantum strategies". Physical Review Letters 87, 6 (2001), article 069801.
6. BRASSARD, G., BROADBENT, A., AND TAPP, A. Quantum pseudo-telepathy. Foundations of Physics 35, 11 (2005), 1877-1907.
7. CHOI, M.-D. Completely positive linear maps on complex matrices. Linear Algebra and Its Applications 10, 3 (1975), 285-290.
8. CLEVE, R., HØYER, P., TONER, B., AND WATROUS, J. Consequences and limits of nonlocal strategies. In Proceedings of the 19th Annual IEEE Conference on Computational Complexity (2004), pp. 236-249.
9. EISERT, J., WILKENS, M., AND LEVINSTEIN, M. Quantum games and quantum strategies. Physical Review Letters 83, 15 (1999), 3077-3080.
10. ENK, S. v., AND PIKE, R. Classical rules in quantum games. Physical Review A 66 (2002), article 024306.
11. FAN, K. Minimax theorems. Proceedings of the National Academy of Sciences 39 (1953), 42-47.
12. FEIGE, U., AND KILIAN, J. Making games short. In Proceedings of the Twenty-Ninth annual ACM Symposium on Theory of Computing (1997), pp. 506-516.
13. FEIGE, U., AND SHAMIR, A. Multi-oracle interactive protocols with constant space verifiers. Journal of Computer and System Sciences 44 (1992), 259-271.
14. FEIGE, U., SHAMIR, A., AND TENNENHOLTZ, M. The noisy oracle problem. In Advances in Cryptology - Proceedings of Crypto'88 (1990), vol. 403 of Lecture Notes in Computer Science, Springer-Verlag, pp. 284-296.
15. FEIGENBAUM, J., KOLLER, D., AND SHOR, P. A game-theoretic classification of interactive complexity classes. In Proceedings of the 10th Conference on Structure in Complexity Theory (1995), pp. 227-237.
16. GOLDWASSER, S., MICALI, S., AND RACKOFF, C. The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18, 1 (1989), 186-208.
17. GRÖTSCHEL, M., LOVÁSZ, L., AND SCHRIJVER, A. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1988.
18. GUTOSKI, G. Upper bounds for quantum interactive proofs with competing provers. In Proceedings of the 20th Annual IEEE Conference on Computational Complexity (2005), pp. 334-343.
19. GUTOSKI, G., AND WATROUS, J. Quantum interactive proofs with competing provers. In Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science (2005), vol. 3404 of Lecture Notes in Computer Science, Springer, pp. 605-616.
20. JAMIOLKOWSKI, A. Linear transformations which preserve trace and positive semidefiniteness of operators. Reports on Mathematical Physics 3, 4 (1972), 275-278.
21. KHACHIYAN, L. A polynomial time algorithm in linear programming. Soviet Mathematics Doklady 20 (1979), 191-194.
22. KITAEV, A. Quantum coin-flipping. Presentation at the 6th Workshop on Quantum Information Processing (QIP 2003), 2002.
23. KITAEV, A., SHEN, A., AND VYALYI, M. Classical and Quantum Computation, vol. 47 of Graduate Studies in Mathematics. American Mathematical Society, 2002.
24. KITAEV, A., AND WATROUS, J. Parallelization, amplification, and exponential time simulation of quantum interactive proof system. In Proceedings of the 32nd ACM Symposium on Theory of Computing (2000), pp. 608-617.
25. KOLLER, D., AND MEGIDDO, N. The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior 4 (1992), 528-552.
26. LEE, C.-F., AND JOHNSON, N. Efficiency and formalism of quantum games. Physical Review A 67 (2003), article 022311.
27. MEYER, D. Quantum strategies. Physical Review Letters 82, 5 (1999), 1052-1055.
28. MOCHON, C. Quantum weak coin-flipping with bias of 0.192. In 45th Annual IEEE Symposium on Foundations of Computer Science (2004), pp. 2-11.
29. NESTEROV, Y., AND NEMIROVSKI, A. Interior point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics 13 (1994).
30. NIELSEN, M. A., AND CHUANG, I. L. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
31. ROCKAFELLAR, R. T. Convex Analysis. Princeton University Press, 1970.
32. RÖHRIG, H. Quantum Query Complexity and Distributed Computing. PhD thesis, Centrum voor Wiskunde en Informatica, 2004.
33. VILLE, J. Sur la théorie générale des jeux oú intervient l'habileté des joueurs. Traité du calcul des probabilités et des applications IV, 2 (1938), 105-113.
34. WATROUS, J. PSPACE has constant-round quantum interactive proof systems. Theoretical Computer Science 292, 3 (2003), 575-588.