Fetching the paper…
Reading the bibliography…
We give a simpler proof of one of the results of Kobayashi, Le Gall, and Nishimura [arXiv:1210.1290v2], which shows that any QMA protocol can be converted to a one-sided error protocol, in which Arthur and Merlin initially share a constant number of EPR pairs and then Merlin sends his proof to Arthur.
Trading group theory for randomness
László Babai · 1985
Earlier work this paper cites.
Private coins versus public coins in interactive proof systems
Shafi Goldwasser and Michael Sipser · 1986
Earlier work this paper cites.
Probabalistic quantifiers vs. distrustful adversaries
Stathis Zachos and Martin Fürer · 1987
Earlier work this paper cites.
The knowledge complexity of interactive proof systems
Shafi Goldwasser, Silvio Micali, and Charles Rackoff · 1989
Earlier work this paper cites.
Algebraic methods for interactive proof systems
Carsten Lund, Lance Fortnow, Howard Karloff, and Noam Nisan · 1992
Earlier work this paper cites.
IP = PSPACE
Adi Shamir · 1992
Earlier work this paper cites.
IP = PSPACE: Simplified proof
A. Shen · 1992
Earlier work this paper cites.
Quantum randomness and nondeterminism
Emanuel Knill · 1996
Earlier work this paper cites.
Stabilization of quantum computations by symmetrization
Adriano Barenco, André Berthiaume, David Deutsch, Artur Ekert, Richard Jozsa, and Chiara Macchiavello · 1997
Earlier work this paper cites.
Coding Theorems of Quantum Information Theory
Andreas Winter · 1999
Earlier work this paper cites.
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
Alexei Kitaev and John Watrous · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Earlier work this paper cites.
Succinct quantum proofs for properties of finite groups
John Watrous · 2000
Earlier work this paper cites.
Quantum fingerprinting
Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf · 2001
Earlier work this paper cites.
Quantum NP - a survey
Dorit Aharonov and Tomer Naveh · 2002
Cited alongside, same era.
Classical and Quantum Computation
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Cited alongside, same era.
Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur?
Hirotada Kobayashi, Keiji Matsumoto, and Tomoyuki Yamakami · 2003
Cited alongside, same era.
QMA = PP implies that PP contains PH
Mikhail N. Vyalyi · 2003
Cited alongside, same era.
PSPACE has constant-round quantum interactive proof systems
John Watrous · 2003
Cited alongside, same era.
Quantum Arthur-Merlin games
Chris Marriott and John Watrous · 2005
Cited alongside, same era.
Efficient algorithm for a quantum analogue of 2-SAT
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, and Peter Shor · 2009
Later among the works it cites.
All languages in NP have very short quantum proofs
Hugue Blier and Alain Tapp · 2009
Later among the works it cites.
Daniel Nagaj, Pawel Wocjan, and Yong Zhang · 2009
Later among the works it cites.
Zero-knowledge against quantum attacks
John Watrous · 2009
Later among the works it cites.
An efficient test for product states with applications to quantum Merlin-Arthur games
Aram W. Harrow and Ashley Montanaro · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sergey Bravyi · 2006
Cited alongside, same era.
The complexity of the local hamiltonian problem
Julia Kempe, Alexei Kitaev, and Oded Regev · 2006
Cited alongside, same era.
One-and-a-half quantum de Finetti theorems
Matthias Christandl, Robert König, Graeme Mitchison, and Renato Renner · 2007
Cited alongside, same era.
Using entanglement in quantum multi-prover interactive proofs
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, and Thomas Vidick · 2008
Cited alongside, same era.
Quantum computational complexity
John Watrous · 2008
Cited alongside, same era.
Theory of quantum information
John Watrous · 2008
Cited alongside, same era.
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous · 2010
Later among the works it cites.
Quantum interactive proofs with short messages
Salman Beigi, Peter Shor, and John Watrous · 2011
Later among the works it cites.
Adam D. Bookatz · 2012
Later among the works it cites.
Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems
Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, and Harumichi Nishimura · 2012
Later among the works it cites.
Short proofs of the quantum substate theorem
Rahul Jain and Ashwin Nayak · 2012
Later among the works it cites.
Multi-prover quantum Merlin-Arthur proof systems with small gap
Attila Pereszlényi · 2012
Later among the works it cites.
Quantum 3-SAT is QMA 1 -complete
David Gosset and Daniel Nagaj · 2013
Closest in time.
Stronger methods of making quantum interactive proofs perfectly complete
Hirotada Kobayashi, François Le Gall, and Harumichi Nishimura · 2013
Closest in time.