Fetching the paper…
Reading the bibliography…
This paper proves that classical-witness quantum Merlin-Arthur proof systems can achieve perfect completeness.
The complexity of promise problems with applications to public-key cryptography
Shimon Even, Alan L. Selman, and Yacov Yacobi · 1984
Earlier work this paper cites.
Trading group theory for randomness
László Babai · 1985
Earlier work this paper cites.
Interactive proof systems: Provers that never fail and random selection (extended abstract)
Oded Goldreich, Yishay Mansour, and Michael Sipser · 1987
Earlier work this paper cites.
Probabalistic quantifiers vs. distrustful adversaries
Stathis Zachos and Martin Furer · 1987
Earlier work this paper cites.
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
László Babai and Shlomo Moran · 1988
Earlier work this paper cites.
Multi-prover interactive proofs: How to remove intractability assumptions
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, and Avi Wigderson · 1988
Earlier work this paper cites.
On completeness and soundness in interactive proof systems
Martin Furer, Oded Goldreich, Yishay Mansour, Michael Sipser, and Stathis Zachos · 1989
Earlier work this paper cites.
Quantum randomness and nondeterminism
Emanuel Knill · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation
Peter W. Shor · 1996
Earlier work this paper cites.
Another proof that BPP ⊆ PH \mathrm{BPP}\subseteq\mathrm{PH} (and more)
Oded Goldreich and David Zuckerman · 1997
Earlier work this paper cites.
Quantum circuits with mixed states
Dorit Aharonov, Alexei Kitaev, and Noam Nisan · 1998
Cited alongside, same era.
Quantum database search by a single query
Dong Pyo Chi and Jinsoo Kim · 1998
Cited alongside, same era.
Quantum NP
Alexei Yu. Kitaev · 1999
Cited alongside, same era.
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
Alexei Kitaev and John Watrous · 2000
Cited alongside, same era.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Cited alongside, same era.
Succinct quantum proofs for properties of finite groups
John Watrous · 2000
Cited alongside, same era.
Quantum NP - A survey
A simple proof that Toffoli and Hadamard are quantum universal
Dorit Aharonov · 2003
Later among the works it cites.
Two QCMA-complete problems
Pawel Wocjan, Dominik Janzing, and Thomas Beth · 2003
Later among the works it cites.
Quantum Arthur-Merlin games
Chris Marriott and John Watrous · 2005
Later among the works it cites.
Efficient algorithm for a quantum analogue of 2-SAT
Sergey Bravyi · 2006
Later among the works it cites.
On perfect completeness for QMA
Scott Aaronson · 2009
Later among the works it cites.
Using entanglement in quantum multi-prover interactive proofs
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, and Thomas Vidick · 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dorit Aharonov and Tomer Naveh · 2002
Cited alongside, same era.
Quantum amplitude amplification and estimation
Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp · 2002
Cited alongside, same era.
Classical and Quantum Computation
Alexei Yu. Kitaev, Alexander H. Shen, and Mikhail N. Vyalyi · 2002
Cited alongside, same era.
Both Toffoli and Controlled-NOT need little help to do universal quantum computing
Yaoyun Shi · 2002
Cited alongside, same era.
Later among the works it cites.
Daniel Nagaj, Pawel Wocjan, and Yong Zhang · 2009
Later among the works it cites.
Quantum computational complexity
John Watrous · 2009
Later among the works it cites.
Zero-knowledge against quantum attacks
John Watrous · 2009
Later among the works it cites.
QMA variants with polynomially many provers
Sevag Gharibian, Jamie Sikora, and Sarvagya Upadhyay · 2011
Closest in time.