Perfect parallel repetition theorem for quantum XOR proof systems

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 109-114

  Cleve, Richard ^a   Slofstra, William ^a,b   Unger, Falk ^c   Upadhyay, Sarvagya ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; INTERACTIVE COMPUTER SYSTEMS; NUMERICAL METHODS; PARALLEL PROCESSING SYSTEMS; THEOREM PROVING;

ENTANGLED QUANTUM STATES; INTERACTIVE PROOF SYSTEMS; PARALLEL REPETITION THEOREM; QUANTUM PROOF SYSTEMS;

QUANTUM COMPUTERS;

EID: 34748922466     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.24     Document Type: Conference Paper

References (22)

1. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
2. J. Barrett, D. Collins, L. Hardy, A. Kent, and S. Popescu. Quantum nonlocality, Bell inequalities and the memory loophole. Physical Review A 66:042111, 2002.
3. J. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1(3):195-200, 1964.
4. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and non-approximability - towards tight results. SIAM Journal on Computing, 27(3):804-915, 1998.
5. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: how to remove intractability assumptions. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 113-131, 1988.
6. S. Boyd and L. Vandenberghe. Semidefinite programming. SIAM Review, 38(1):49-95, 1996.
7. J. F. Clauser, M. A. Home, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Physical Review Letters, 23(15):880-884, 1969.
8. R. Cleve, P. Høyer, B. Toner, J. Watrous. Consequences and limits of nonlocal strategies. In Proceedings of the 19th IEEE Conference on Computational Complexity, pages 236-249, 2004.
9. R. Cleve, P. Høyer, B. Toner, J. Watrous. Consequences and limits of nonlocal strategies. Presentation given at Ninteenth IEEE Conference on Computational Complexity, June 2004.
10. 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.
11. U. Feige and L. Lovász. Two-prover one-round proof systems: their power and their problems. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pages 733-744, 1992.
12. L. Fortnow, J. Rompei, and M. Sipser. On the power of multi-prover interactive protocols. Theoretical Computer Science, 134:545-557, 1994.
13. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
14. T. Holenstein. Parallel repetition: simplifications and the no-signaling case. In Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, 2007.
15. A. Kitaev and J. Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pages 608-617, 2000.
16. H. Kobayashi and K. Matsumoto. Quantum multi-prover interactive proof systems with limited prior entanglement. Journal of Computer and System Sciences, 66(3):429-450, 2003.
17. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.
18. B. S. (Tsirelson) Cirel'son. Quantum generalizations of Bell's inequality. Letters in Mathematical Physics, 4(2):93-100, 1980.
19. B. S. (Tsirelson) Tsirel'son. Quantum analogues of the Bell inequalities: The case of two spatially separated domains. Journal of Soviet Mathematics, 36:557-570, 1987.
20. J. Watrous. PSPACE has constant-round quantum interactive proof systems, in Proceedings of the Fourtieth Annual Symposium on Foundations of Computer Science, pages 112-119, 1999.
21. J. Watrous. Personal communication, 2004.
22. S. Wehner. Entanglement in interactive proof systems with binary answers. In Proceedings of STACS 2006, pages 162-171, 2006.