Quantum multi-prover interactive proof systems with limited prior entanglement

Journal of Computer and System Sciences

Volumn 66, Issue 3, 2003, Pages 429-450

  Kobayashi, Hirotada ^a,b   Matsumoto, Keiji ^a  

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Computational complexity; Interactive proof systems; Quantum computing

Indexed keywords

ALGORITHMS; INTERACTIVE COMPUTER SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

QUANTUM COMPUTING; QUANTUM MULTI-PROVER INTERACTIVE PROOF SYSTEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0037561420     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00035-7     Document Type: Article

References (33)

1. D. Aharonov, A. Yu. Kitaev, N. Nisan. Quantum circuits with mixed states. in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 20-30.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy. Proof verification and the hardness of approximation problems, J. ACM 45 (3) (1998) 501-555.
3. S. Arora, S. Safra, Probabilistic checking of proofs: a new characterization of NP, J. ACM 45 (1) (1998) 70-122.
4. L. Babai, Trading group theory for randomness, in: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 421-429.
5. L. Babai, L.J. Fortnow, C. Lund, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity 1(1) (1991)3-40.
6. M. Bellare, U. Feige, J. Kilian, On the role of shared randomness in two prover proof systems. in: Proceedings of the Third Israel Symposium on the Theory of Computing and Systems, 1995, pp. 199-208.
7. M. Ben-Or, S. Goldwasser, J. Kilian, A. Wigderson, Multi-prover interactive proofs: how to remove the intractability assumptions. in: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 113-131.
8. C.H. Bennett, E. Bernstein, G. Brassard, U.V. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Comput. 26 (5) 1510-1523.
9. P.O. Boykin, T. Mor, M. Pulver, V.P. Roychowdhury, F. Vatan, A new universal and fault-tolerant quantum basis. Inform. Process. Lett. 75 (3) (2000) 101-107.
10. J.-Y. Cai, A. Condon, R.J. Lipton, On bounded round multi-prover interactive proof systems. in: Proceedings of the Fifth Annual Structure in Complexity Theory Conference, 1990, pp. 45-54.
11. J.-Y. Cai, A. Condon, R.J. Lipton, PSPACE is provable by two provers in one round, J. Comput. System Sci. 48 (1) (1994) 183-193.
12. R.E. Cleve, An entangled pair of provers can cheat, talk at the Workshop on Quantum Computation and Information, California Institute of Technology, November 2000.
13. D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. London A 400 (1985) 97-117.
14. U. Feige, On the success probability of two provers in one-round proof systems, in: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991, pp. 116-123.
15. U. Feige, L. Lovász, Two-prover one-round proof systems: their power and their problems (extended abstract), in: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 733-744.
16. L.J. Fortnow, Complexity-theoretic aspects of interactive proof systems, Ph.D. Thesis, Department of Mathematics, Massachussetts Institute of Technology, May 1989.
17. L.J. Fortnow, J. Rompel, M. Sipser, On the power of multi-prover interactive protocols, Theoret. Comput. Sci. 134 (2) (1994) 545-557.
18. S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J. Comput. 18 (1) (1989) 186-208.
19. S. Goldwasser, M. Sipser, Private coins versus public coins in interactive proof systems, in: S. Micali (Ed.), Randomness and Computation, Advances in Computing Research, Vol. 5, JAI Press, 1989, pp. 73-90.
20. J. Gruska, Quantum Computing, McGraw-Hill, New York, 1999.
21. L.P. Hughston, R. Jozsa, W.K. Wootters, A complete classification of quantum ensembles having a given density matrix. Phys. Lett. A 183 (1993) 14-18.
22. A. Yu. Kitaev, J.H. Watrous, Parallelization, amplification, and exponential time simulation of quantum interactive proof systems, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 608-617.
23. H. Kobayashi, K. Matsumoto, T. Yamakami, Quantum certificate verification: single versus multiple quantum certificates, Los Alamos e-print archive, quant-ph/0110006, 2001.
24. D. Lapidot, A. Shamir, Fully parallelized multi prover protocols for NEXP-time, J. Comput. System Sci. 54 (2) (1997) 215-220.
25. C. Lund, L.J. Fortnow, H. Karloff, N. Nisan, Algebraic methods for interactive proof systems, J. ACM 39 (4) (1992) 859-868.
26. M. A. Nielsen, Entanglement and distributed quantum computation, talk at the Fourth Workshop on Quantum Information Processing, Amsterdam, January 2001.
27. M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000.
28. C.H. Papadimitriou, Games against nature, J. Comput. System Sci. 31 (2) (1985) 288-301.
29. A. Shamir, IP = PSPACE. J. ACM 39 (4) (1992).
30. P.W. Shor, Fault-tolerant quantum computation, in: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 56-65.
31. P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26 (5) (1997) 1484-1509.
32. A. Uhlman, Parallel transport and "quantum holonomy" along density operators, Rep. Math. Phys. 24 (1986) 229-240.
33. J.H. Watrous, PSPACE has constant-round quantum interactive proof systems, Theoret. Comput. Sci. 292 (2003) 575-588.