Fetching the paper…
Reading the bibliography…
The central question in quantum multi-prover interactive proof systems is whether or not entanglement shared between provers affects the verification power of the proof system.
Trading group theory for randomness
L. Babai · 1985
Earlier work this paper cites.
Multi-prover interactive proofs: How to remove intractability assumptions
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson · 1988
Earlier work this paper cites.
The knowledge complexity of interactive proof systems
S. Goldwasser, S. Micali, and C. W. Rackoff · 1989
Earlier work this paper cites.
Non-deterministic exponential time has two-prover interactive protocols
L. Babai, L. J. Fortnow, and C. Lund · 1991
Earlier work this paper cites.
Two-prover one-round proof systems: Their power and their problems (extended abstract)
U. Feige and L. Lovász · 1992
Earlier work this paper cites.
PSPACE \mathrm{PSPACE} is provable by two provers in one round
J.-Y. Cai, A. Condon, and R. J. Lipton · 1994
Earlier work this paper cites.
On the power of multi-prover interactive protocols
L. J. Fortnow, J. Rompel, and M. Sipser · 1994
Earlier work this paper cites.
Interactive proofs and the hardness of approximating cliques
U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation
P. W. Shor · 1996
Earlier work this paper cites.
Quantum circuits with mixed states
D. Aharonov, A. Yu. Kitaev, and N. Nisan · 1998
Cited alongside, same era.
Proof verification and the hardness of approximation problems
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy · 1998
Cited alongside, same era.
Probabilistic checking of proofs: A new characterization of NP \mathrm{NP}
S. Arora and S. Safra · 1998
Cited alongside, same era.
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
A. Yu. Kitaev and J. H. Watrous · 2000
Cited alongside, same era.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Cited alongside, same era.
Classical and Quantum Computation , volume 47 of Graduate Studies in Mathematics
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Cited alongside, same era.
PSPACE \mathrm{PSPACE} has constant-round quantum interactive proof systems
J. H. Watrous · 2003
Later among the works it cites.
Consequences and limits of nonlocal strategies
R. E. Cleve, P. Høyer, B. F. Toner, and J. H. Watrous · 2004
Later among the works it cites.
Quantum Arthur-Merlin games
C. Marriott and J. H. Watrous · 2005
Later among the works it cites.
Zero-knowledge against quantum attacks
J. H. Watrous · 2006
Later among the works it cites.
Entanglement in interactive proof systems with binary answers
S. Wehner · 2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Degrees of concealment and bindingness in quantum bit-commitment protocols
R. W. Spekkens and T. Rudolph · 2002
Cited alongside, same era.
Quantum multi-prover interactive proof systems with limited prior entanglement
H. Kobayashi and K. Matsumoto · 2003
Cited alongside, same era.
Bit-commitment-based quantum coin flipping
A. Nayak and P. W. Shor · 2003
Cited alongside, same era.
R. E. Cleve, D. Gavinsky, and R. Jain · 2007
Closest in time.
Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems, 2007
T. Ito, H. Kobayashi, D. Preda, X. Sun, and A. C.-C. Yao · 2007
Closest in time.
Entangled games are hard to approximate, 2007
J. Kempe, H. Kobayashi, K. Matsumoto, B. F. Toner, and T. Vidick · 2007
Closest in time.