Entanglement in interactive proof systems with binary answers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3884 LNCS, Issue , 2006, Pages 162-171

  Wehner, Stephanie ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PARAMETER ESTIMATION; QUANTUM THEORY;

COMPLETENESS PARAMETERS; ENTANGLED STATE; ENTANGLEMENT; INTERACTIVE PROOF SYSTEMS;

INTERACTIVE COMPUTER SYSTEMS;

EID: 33745606676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_12     Document Type: Conference Paper

References (30)

1. L. Babai. Trading group theory for randomness. In Proceedings of 17th ACM STOC, pages 421-429, 1985.
2. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
3. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi prover interactive proofs: How to remove intractability. In Proceedings of 20th ACM STOC, pages 113-131, 1988.
4. J. Cai, A. Condon, and R. Lipton. On bounded round multi-prover interactive proof systems. In Proceedings of the Fifth Annual Conference on Structure in Complexity Theory, pages 45-54, 1990.
5. J. Clauser, M. Horne, A. Shimony, and R. Holt. Proposed experiment to test local hidden-variable theories. Physical Review Letters, 23:880-884, 1969.
6. R. Cleve, P. Høyer, B. Toner, and J. Watrous. Consequences and limits of nonlocal strategies. In Proceedings of 19th IEEE Conference on Computational Complexity, pages 236-249, 2004. quant-ph/0404076.
7. R. Cleve, P. Høyer, B. Toner, and J. Watrous. Consequences and limits of nonlocal strategies. Presentation at 19th IEEE Conference on Computational Complexity, 2004.
8. U. Feige. On the success probability of two provers in one-round proof systems. In Proceedings of the Sixth Annual Conference on Structure in Complexity Theory, pages 116-123, 1991.
9. U. Feige. Error reduction by parallel repetition - the state of the art. Technical Report CS95-32, Weizmann Institute, 1, 1995.
10. U. Feige and L. Lovász. Two-prover one-round proof systems: their power and their problems. In Proceedings of 24th ACM STOC, pages 733-744, 1992.
11. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 1(18):186-208, 1989.
12. A. Kitaev and J. Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In Proceedings of 32nd ACM STOC, pages 608-617, 2000.
13. H. Kobayashi and K. Matsumoto. Quantum Multi-Prover Interactive Proof Systems with Limited Prior Entanglement J. of Computer and System Sciences, 66(3):pages 429-450, 2003.
14. D. Lapidot and A. Shamir. Fully parallelized multi prover protocols for NEXP-time. In Proceedings of 32nd FOCS, pages 13-18, 1991.
15. C. Marriott and J. Watrous. Quantum Arthur-Merlin games. cs.CC/0506068.
16. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
17. S. Popescu and D. Rohrlich. Quantum nonlocality as an axiom. Foundations of Physics, 24(3):379-385, 1994.
18. S. Popescu and D. Rohrlich. Nonlocality as an axiom for quantum theory. In The dilemma of Einstein, Podolsky and Rosen, 60 years later: International symposium in honour of Nathan Rosen, 1996. quant-ph/9508009.
19. S. Popescu and D. Rohrlich. Causality and nonlocality as axioms for quantum mechanics. In Proceedings of the Symposium of Causality and Locality in Modern Physics and Astronomy: Open Questions and Possible Solutions, 1997. quant-ph/9709026.
20. D. Preda. Non-local multi-prover interactive proofs. CWI Seminar, 21 June, 2005.
21. R. Raz. Quantum information and the PCP theorem, quant-ph/0504075. To appear in FOCS 2005.
22. A. Shamir. IP = PSPACE. Journal of the ACM, 39(4):869-877, 1992.
23. A. Shen. IP = PSPACE: simplified proof. Journal of the ACM, 39(4):878-880, 1992.
24. B. Tsirelson. Quantum analogues of Bell inequalities: The case of two spatially separated domains. Journal of Soviet Mathematics, 36:557-570, 1987.
25. B. Tsirelson. Some results and problems on quantum Bell-type inequalities. Hadronic Journal Supplement, 8(4):329-345, 1993.
26. B. Cirel'son (Tsirelson). Quantum generalizations of Bell's inequality. Letters in Mathematical Physics, 4:93-100, 1980.
27. W. van Dam. Nonlocality & Communication Complexity. PhD thesis, University of Oxford, Department of Physics, 2000.
28. W. van Dam. Impossible consequences of superstrong nonlocality. quant-ph/0501159, 2005.
29. M. Vyalyi. QMA=PP implies that PP contains PH. Electronic Colloquium on Computational Complexity, TR03-021, 2003.
30. J. Watrous. PSPACE has constant-round quantum interactive proof systems. In Proceedings of 40th IEEE FOCS, pages 112-119, 1999. cs.CC/9901015.