Fetching the paper…
Reading the bibliography…
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with one-sided error, has been an open problem for years.
Relative to a random oracle A, P A ≠ N P A ≠ c o N P A P^{A}\neq NP^{A}\neq coNP^{A} with probability 1
C. H. Bennett and J. Gill · 1981
Earlier work this paper cites.
BPP and the polynomial hierarchy
C. Lautemann · 1983
Earlier work this paper cites.
Trading group theory for randomness
L. Babai · 1985
Earlier work this paper cites.
Probabilistic quantifiers vs. distrustful adversaries
S. Zachos and M. Fürer · 1987
Earlier work this paper cites.
Quantum complexity theory
E. Bernstein and U. Vazirani · 1993
Earlier work this paper cites.
Another proof that B P P ⊆ P H BPP\subseteq PH (and more)
O. Goldreich and D. Zuckerman · 1997
Cited alongside, same era.
Choosing roots of polynomials smoothly
D. Alekseevsky, A. Kriegl, M. Losik, and P. W. Michor · 1998
Cited alongside, same era.
Quantum lower bounds by polynomials
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf · 1998
Cited alongside, same era.
Parallelization, amplification, and exponential-time simulation of quantum interactive proof systems
A. Kitaev and J. Watrous · 2000
Cited alongside, same era.
Succinct quantum proofs for properties of finite groups
J. Watrous · 2000
Cited alongside, same era.
Quantum NP - a survey
D. Aharonov and T. Naveh · 2002
Later among the works it cites.
Classical and Quantum Computation
A. Kitaev, A. Shen, and M. N. Vyalyi · 2002
Later among the works it cites.
Quantum Arthur-Merlin games
C. Marriott and J. Watrous · 2005
Later among the works it cites.
Efficient algorithm for a quantum analogue of 2-SAT
S. Bravyi · 2006
Later among the works it cites.
Quantum versus classical proofs and advice
S. Aaronson and G. Kuperberg · 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…