Fetching the paper…
Reading the bibliography…
The class QMA(k), introduced by Kobayashi et al., consists of all languages that can be verified using k unentangled quantum proofs.
A birthday problem
D. M. Bloom and W. Knight · 1973
Earlier work this paper cites.
Multi-prover interactive proofs: how to remove the intractability assumptions
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson · 1988
Earlier work this paper cites.
Optimization, approximation, and complexity classes
C. H. Papadimitriou and M. H. Yannakakis · 1991
Earlier work this paper cites.
Teleporting an unknown quantum state by dual classical and EPR channels
C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. Wootters · 1993
Earlier work this paper cites.
Quantum Entropy and its Use
M. Ohya and D. Petz · 1993
Earlier work this paper cites.
Event-ready-detectors: Bell experiment via entanglement swapping
M. Zukowski, A. Zeilinger, M. A. Horne, and A. K. Ekert · 1993
Earlier work this paper cites.
A parallel repetition theorem
R. Raz · 1995
Earlier work this paper cites.
Mixed-state entanglement and quantum error correction
C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters · 1996
Earlier work this paper cites.
Quantum randomness and nondeterminism
E. Knill · 1996
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Entanglement measures and purification procedures
V. Vedral and M. B. Plenio · 1998
Cited alongside, same era.
The approximability of constraint satisfaction problems
S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson · 2000
Cited alongside, same era.
Quantum Computation and Quantum Information
M. Nielsen and I. Chuang · 2000
Cited alongside, same era.
Succinct quantum proofs for properties of finite groups
J. Watrous · 2000
Cited alongside, same era.
Interaction in quantum communication
H. Klauck, A. Nayak, A. Ta-Shma, and D. Zuckerman · 2001
Cited alongside, same era.
Quantum NP - a survey
D. Aharonov and T. Naveh · 2002
Cited alongside, same era.
Classical and Quantum Computation
Equivalence of additivity questions in quantum information theory
P. W. Shor · 2004
Later among the works it cites.
A de Finetti representation for finite symmetric quantum states
R. König and R. Renner · 2005
Later among the works it cites.
Quantum Arthur-Merlin games
C. Marriott and J. Watrous · 2005
Later among the works it cites.
Quantum versus classical proofs and advice
S. Aaronson and G. Kuperberg · 2007
Later among the works it cites.
All languages in NP have very short quantum proofs
H. Blier and A. Tapp · 2007
Later among the works it cites.
The PCP theorem by gap amplification
I. Dinur · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Kitaev, A. Shen, and M. N. Vyalyi · 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.
Quantum Merlin-Arthur proof systems: are multiple Merlins more helpful to Arthur?
H. Kobayashi, K. Matsumoto, and T. Yamakami · 2003
Cited alongside, same era.
”Squashed entanglement” - an additive entanglement measure
M. Christandl and A. Winter · 2004
Cited alongside, same era.
N-representability is QMA-complete
Y.-K. Liu, M. Christandl, and F. Verstraete · 2007
Later among the works it cites.
Entanglement Theory and the Quantum Simulation of Many-Body Physics
F. Brandao · 2008
Closest in time.
On the role of shared entanglement
D. Gavinsky · 2008
Closest in time.
A counterexample to additivity of minimum output entropy
M. B. Hastings · 2008
Closest in time.