QMA with subset state witnesses

The complexity of theorem proving procedures

S. A. Cook · 1971

Earlier work this paper cites.

Universal sequential search problems

L. A. Levin · 1973

Earlier work this paper cites.

Proof verification and the hardness of approximation problems

S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy · 1998

Earlier work this paper cites.

Probabilistic checking of proofs: A new characterization of NP

S. Arora and S. Safra · 1998

Earlier work this paper cites.

Succinct quantum proofs for properties of finite groups

J. Watrous · 2000

Earlier work this paper cites.

Classical and quantum computation

A. Kitaev, A. Shen, and M. N. Vyalyi · 2002

Earlier work this paper cites.

3-local Hamiltonian is QMA-complete

J. Kempe and O. Regev · 2003

Earlier work this paper cites.

Two QCMA-complete problems

P. Wocjan, D. Janzing, and T. Beth · 2003

Earlier work this paper cites.

Quantum Arthur-Merlin games

C. Marriott and J. Watrous · 2005

Cited alongside, same era.

Using entanglement in quantum multi-prover interactive proofs

J. Kempe, H. Kobayashi, K. Matsumoto, and T. Vidick · 2008

Cited alongside, same era.

The complexity of quantum spin systems on a two-dimensional square lattice

R. Oliveira and B. M. Terhal · 2008

Cited alongside, same era.

On perfect completeness for QMA

S. Aaronson · 2009

Cited alongside, same era.

All languages in NP have very short quantum proofs

H. Blier and A. Tapp · 2009

Cited alongside, same era.

Two-message quantum interactive proofs are in PSPACE

R. Jain, S. Upadhyay, and J. Watrous · 2009

Cited alongside, same era.

Quantum computational complexity

Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems

S. P. Jordan, H. Kobayashi, D. Nagaj, and H. Nishimura · 2012

Later among the works it cites.

Guest column: The quantum PCP conjecture

D. Aharonov, I. Arad, and T. Vidick · 2013

Later among the works it cites.

QMA variants with polynomially many provers

S. Gharibian, J. Sikora, and S. Upadhyay · 2013

Later among the works it cites.

Testing product states, quantum Merlin-Arthur games and tensor optimization

A. W. Harrow and A. Montanaro · 2013

Later among the works it cites.

The local Hamiltonian problem on a line with eight states is QMA-complete

S. Hallgren, D. Nagaj, and S. Narayanaswami · 2013

Later among the works it cites.

Stronger methods of making quantum interactive proofs perfectly complete

H. Kobayashi, F. Le Gall, and H. Nishimura · 2013