QIP = PSPACE

Communications of the ACM

Volumn 53, Issue 12, 2010, Pages 102-109

  Jain, Rahul ^a   Ji, Zhengfeng ^c   Upadhyay, Sarvagya ^b   Watrous, John ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF WATERLOO   (Canada)

^c PERIMETER INSTITUTE FOR THEORETICAL PHYSICS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL MODEL; COMPUTATIONAL COMPLEXITY THEORY; COMPUTATIONAL POWER; COMPUTATIONAL PROBLEM; EXPRESSIVE POWER; INTERACTIVE PROOF SYSTEM; QUANTUM COMPUTING; QUANTUM INTERACTIVE PROOF SYSTEMS;

PROGRAMMABLE LOGIC CONTROLLERS; QUANTUM COMPUTERS;

COMPUTATIONAL COMPLEXITY;

EID: 78650148999     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1859204.1859231     Document Type: Article

References (17)

1. A rora, S., Kale, S. A combinatorial, primal-dual approach to semidefinite programs. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (2007), 227-236.
2. Babai, L. Trading group theory for randomness. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing (1985), 421-429.
3. Bennett, C., Brassard, G. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing (1984), 175-179.
4. Bennett, C., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W. Teleporting an unknown quantum state via dual classical and EPR channels. Phys. Rev. Lett. 70, 12 (1993), 1895-1899.
5. B orodin, A. On relating time and space to size and depth. SIAM J. Comput. 6 (1977), 733-744.
6. D eutsch, D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A400 (1985), 97-117.
7. Feynman, R. Simulating physics with computers. Int. J. Theor. Phys. 21, 6/7 (1982), 467-488.
8. G oldwasser, S., Micali, S., Rackoff, C. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18, 1 (1989), 186-208. A preliminary version appeared in Proceedings of the 17th Annual ACM Symposium on Theory of Computing (1985), 291-304.
9. Kitaev, A., Watrous, J. Parallelization, amplification, and exponential time simulation of quantum interactive proof system. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (2000), 608-617.
10. L und, C., Fortnow, L., Karloff, H., Algebraic methods for interactive proof systems. J. ACM 39, 4 (1992), 859-868. A preliminary version appeared in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (1990), 2-10.
11. Marriott, C., Watrous, J. Quantum Arthur-Merlin games. Comput. Complex. 14, 2 (2005), 122-152.
12. Nielsen, M., Chuang, I. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
13. Raz, R. Exponential separation of quantum and classical communication complexity. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (1999), 358-376.
14. Shamir, A. IP = PSPA CE. J. ACM 39, 4 (1992), 869-877. A preliminary version appeared in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (1990), 11-15.
15. Shor, P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 5 (1997), 1484-1509. A preliminary version appeared with the title "Algorithms for quantum computation: discrete logarithms and factoring" in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (1994), 124-134.
16. Warmuth, M., Kuzmin, D. Online variance minimization. In Proceedings of the 19th Annual Conference on Learning Theory, volume 4005 of Lecture Notes in Computer Science (Springer, 2006), 514-528.
17. Watrous, J. PSPA CE has constantround quantum interactive proof systems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (1999), 112-119.