Quantum Multi Prover Interactive Proofs with Communicating Provers

M. Ben-Or, S. Goldwasser, J. Kilian, A. Wigderson “Efficient Identification Schemes Using Two Prover Interactive Proofs ,” CRYPTO’89: 498-506, 1989

1989

Earlier work this paper cites.

A. Shamir, “IP=PSPACE”, FOCS’90 11-15, see also JACM’92: 869-877, 1990

Original

1990

Earlier work this paper cites.

Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy, “Proof Verification and Hardness of Approximation Problems,” FOCS’92: 14-23, 1992

1992

Earlier work this paper cites.

L. Babai, L. Fortnow, C. Lund “ Addendum to Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols,” Computational Complexity 2: 374, 1992

1992

Earlier work this paper cites.

H. Barnum, M. Nielsen, B. Schumacher “ Information Transmission Through a Noisy Quantum Channel ,” quant-ph9702049, 1997

1997

Earlier work this paper cites.

S. Popescu, D. Rohrlich “Causality and Nonlocality as Axioms for Quantum Mechanics,” Proceedings of the symposium on Causality and Locality in Modern Physics and Astronomy: Open Questions and Possible Solutions, 25-29, 1997

1997

Earlier work this paper cites.

S. Arora, S. Safra “Probabilistic Checking of Proofs: a New Characterization of NP,” J. ACM 45(1): 70-122, 1998

1998

Earlier work this paper cites.

C. Bennett, D. DiVincenzo, C. Fuchs, T. Mor, E. Rains, P. Shor, J. Smolin, W. Wootters “Quantum Nonlocality Without Entanglement ,” quant-ph9804053, 1998

1998

Earlier work this paper cites.

B. Chor, O. Goldreich, E. Kushilevitz, M. Sudan “Private Information Retrieval,” FOCS95:41-50, 1995, see also J. ACM (JACM) 45(6):965-981, 1998

1998

Earlier work this paper cites.

R. Raz “A Parallel Repetition Theorem,” STOC’95, 447-456, 2005. See also SIAM J. Comput. 27(3): 763-803, 1998

1998

Earlier work this paper cites.

A. Kitaev, J. Watrous “Parallelization, Amplification, and Exponential Time Simulation of Quantum Interactive Proof Systems,” STOC’00: 608-617, 2000

2000

Cited alongside, same era.

M. Nielsen and I. Chuang, “Quantum Computation and Quantum Information,” Cambridge University Press ,2000

2000

Cited alongside, same era.

H. Buhrman, R. Cleve, J. Watrous, R. de Wolf. “Quantum Fingerprinting,” Phys. Rev. Lett., 87(16), 2001

2001

Cited alongside, same era.

J. Håstad “ Some Optimal Inapproximability Results ,” STOC’97: 1-10, 1997, and J. ACM 48(4): 798-859, 2001

2001

Cited alongside, same era.

H. Kobayashi, K. Matsumoto, T. Yamakami “Quantum Certificate Verification: Single versus Multiple Quantum Certificates” quant-ph/0110006, 2001

2001

Cited alongside, same era.

R. Cleve, W. Slofstra, F. Unger, S. Upadhyay “Strong Parallel Repetition Theorem for Quantum XOR Proof Systems” quant-ph/0608146, 2006

2006

Later among the works it cites.

H. Blier, A. Tapp “All Languages in NP Have Very Short Quantum Proofs” quant-ph/0709.0738, 2007

2007

Later among the works it cites.

R. Cleve, D. Gavinsly, R. Jain “Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems,” quant-ph/07071729, 2007

2007

Later among the works it cites.

I. Dinur “ The PCP Theorem by Gap Amplification,” STOC’06: 241-250, 2006 and J. ACM (JACM) 54(3):12, 2007

2007

Later among the works it cites.

V. Giovannetti, S. Lloyd, L. Maccone, “Quantum Private Queries” quant-ph/0708.2992, 2007

2007

Later among the works it cites.