Quantum interactive proofs with competing provers

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 605-616

  Gus, Gutoski ^a   Watrous, John ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIT ERROR RATE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; PROBABILITY; QUANTUM THEORY; SET THEORY;

DISJOINT CONVEX SETS; PROOF SYSTEMS; QUANTUM MEASUREMENT;

GAME THEORY;

EID: 24144474939     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18 (1989) 186-208
2. Babai, L.: Trading group theory for randomness. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing. (1985) 421-429
3. Babai, L., Moran, S.: Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences 36 (1988) 254-276
4. Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-prover interactive proofs: how to remove intractability assumptions. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing. (1988) 113-131
5. Reif, J.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences 29 (1984) 274-301
6. Feige, U., Shamir, A., Tennenholtz, M.: The noisy oracle problem. In: Advances in Cryptology - Proceedings of Crypto'88. Volume 403 of Lecture Notes in Computer Science., Springer-Verlag (1990) 284-296
7. Feige, U., Shamir, A.: Multi-oracle interactive protocols with constant space verifiers. Journal of Computer and System Sciences 44 (1992) 259-271
8. Koller, D., Megiddo, N.: The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior 4 (1992) 528-552
9. Feigenbaum, J., Koller, D., Shor, P.: A game-theoretic classification of interactive complexity classes. In: Proceedings of the 10th Conference on Structure in Complexity Theory. (1995) 227-237
10. Feige, U., Kilian, J.: Making games short. In: Proceedings of the Twenty-Ninth annual ACM Symposium on Theory of Computing. (1997) 506-516
11. Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. Journal of the ACM 39 (1992) 859-868
12. Shamir, A.: IP = PSPACE. Journal of the ACM 39 (1992) 869-877
13. Shen, A.: IP = PSPACE: simplified proof. Journal of the ACM 39 (1992) 878-880
14. Watrous, J.: PSPACE has constant-round quantum interactive proof systems. Theoretical Computer Science 292 (2003) 575-588
15. Kitaev, A., 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) 608-617
16. Aharonov, D., Kitaev, A., Nisan, N.: Quantum circuits with mixed states. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. (1998) 20-30
17. Rosgen, B., Watrous, J.: On the hardness of distinguishing mixed-state quantum computations. arXiv.org e-Print cs.CC/0407056 (2004)
18. Bhatia, R.: Matrix Analysis. Springer (1997)
19. Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)
20. Fuchs, C., van de Graaf, J.: Cryptographic distinguishability measures for quantum-mechanical states. IEEE Transactions on Information Theory 45 (1999) 1216-1227
21. Raz, R.: A parallel repetition theorem. SIAM Journal of Computing 27 (1998) 763-803
22. Kitaev, A., Shen, A., Vyalyi, M.: Classical and Quantum Computation. Volume 47 of Graduate Studies in Mathematics. American Mathematical Society (2002)