Quantum information and the PCP theorem

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 459-468

  Raz, Ran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LOW DEGREE EXTENSION; PCP THEOREM; QUANTUM STATES; STRING OF BITS;

COMPUTATIONAL METHODS; COMPUTER SCIENCE; POLYNOMIAL APPROXIMATION; PROBABILISTIC LOGICS; PROBLEM SOLVING;

THEOREM PROVING;

EID: 33745189567     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.62     Document Type: Conference Paper

References (25)

1. Scott Aaronson: Limitations of Quantum Advice and One-Way Communication. Theory of Computing 1(1): 1-28 (2005)
2. Dorit Aharonov: Quantum Computation- A Review. Annual Review of Computational Physics, World Scientific, volume VI, ed. Dietrich Stauffer (1998)
3. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy: Proof Verification and the Hardness of Approximation Problems. J. ACM 45(3): 501-555 (1998)
4. Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense Quantum Coding and Quantum Finite Automata. J. ACM 49(4): 496-511 (2002)
5. Sanjeev Arora, Shmuel Safra: Probabilistic Checking of Proofs: A New Characterization of NP. J. ACM 45(1): 70-122 (1998)
6. Sanjeev Arora, Madhu Sudan: Improved Low-Degree Testing and its Applications. Combinatorica 23(3): 365-426 (2003)
7. Laszlo Babai: Trading Group Theory for Randomness. STOC 1985: 421-429
8. Laszlo Babai, Lance Fortnow, Garsten Lund: Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Computational Complexity 1: 3-40 (1991)
9. Laszlo Babai, Shlomo Moran: Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes. J. Comput. Syst. Sci. 36(2): 254-276 (1988)
10. Richard Cleve, Peter Hoyer, Benjamin Toner, John Watrous: Consequences and Limits of Nonlocal Strategies. IEEE Conference on Computational Complexity 2004: 236-249
11. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC 1999: 29-40
12. Uriel Feige, Shafi Goldwasser, Laszlo Lovasz, Shmuel Safra, Mario Szegedy: Interactive Proofs and the Hardness of Approximating Cliques. J. ACM 43(2): 268-292 (1996)
13. Shaft Goldwasser, Silvio Micali, Charles Rackoff: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18(1): 186-208 (1989)
14. Alexander S. Holevo: Some Estimates for the Amount of Information Transmittable by a Quantum Communications Channel. Problemy Peredaci Informacii 9(3): 3-11 (1973).
15. English translation: Problems of Information Transmission 9(3): 177-183 (1973)
16. Alexei Kitaev, John Watrous: Parallelization, Amplification, and Exponential Time Simulation of Quantum Interactive Proof Systems. STOC2000: 608-617
17. Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan: Algebraic Methods for Interactive Proof Systems. J. ACM 39(4): 859-868 (1992)
18. Ashwin Nayak: Optimal Lower Bounds for Quantum Automata and Random Access Codes. FOCS 1999: 369-377
19. Michael A Nielsen, Isaac L Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
20. Harumichi Nishimura, Tomoyuki Yamakami: Polynomial Time Quantum Computation with Advice. Electronic Colloquium on Computational Complexity (ECCC)(059): (2003)
21. Ran Raz: A Parallel Repetition Theorem. SIAM J. Comput. 27(3): 763-803 (1998)
22. Ronitt Rubinfeld, Madhu Sudan: Robust Characterizations of Polynomials with Applications to Program Testing. SIAM J. Comput. 25(2): 252-271 (1996)
23. Ran Raz, Shmuel Safra: A Sub-Constant Error-Probability Low-Degree Test and a Sub-Constant Error-Probability PCP Characterization of NP. STOC 1997: 475-484
24. Adi Shamir: IP = PSPACE. J. ACM 39(4): 869-877 (1992)
25. John Watrous: PSPACE has Constant-Round Quantum Interactive Proof Systems. Theor. Comput. Sci. 292(3): 575-588 (2003)