Fetching the paper…
Reading the bibliography…
In this paper, we study variants of the canonical Local-Hamiltonian problem where, in addition, the witness is promised to be separable.
Non-deterministic exponential time has two-prover interactive protocols
L. Babai, L. Fortnow, and C. Lund · 1991
Earlier work this paper cites.
Theory of matrices
S. Perlis · 1991
Earlier work this paper cites.
Algebraic methods for interactive proof systems
C. Lund, L. Fortnow, H. Karloff, and N. Nisan · 1992
Earlier work this paper cites.
IP= PSPACE
A. Shamir · 1992
Earlier work this paper cites.
Cryptographic distinguishability measures for quantum-mechanical states
C. A. Fuchs and J. van de Graaf · 1999
Earlier work this paper cites.
Quantum computation and quantum information
M.A. Nielsen and I.L. Chuang · 2000
Earlier work this paper cites.
Succinct quantum proofs for properties of finite groups
J. Watrous · 2000
Earlier work this paper cites.
Quantum NP-A Survey
D. Aharonov and T. Naveh · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Cited alongside, same era.
Adiabatic quantum state generation and statistical zero knowledge
D. Aharonov and A. Ta-Shma · 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.
The complexity of the local hamiltonian problem
J. Kempe, A. Kitaev, and O. Regev · 2004
Cited alongside, same era.
Quantum arthur-merlin games
C. Marriott and J. Watrous · 2005
Cited alongside, same era.
Consistency of local density matrices is QMA-Complete
Y.K. Liu · 2006
Cited alongside, same era.
The power of unentanglement
S. Aaronson, S. Beigi, A. Drucker, B. Fefferman, and P.W. Shor · 2008
Later among the works it cites.
The detectability lemma and quantum gap amplification
D. Aharonov, I. Arad, Z. Landau, and U. Vazirani · 2009
Later among the works it cites.
All languages in np have very short quantum proofs
H. Blier and A. Tapp · 2009
Later among the works it cites.
NP vs QMA_log(2)
S. Beigi · 2010
Later among the works it cites.
An efficient test for product states with applications to quantum merlin-arthur games
A.W. Harrow and A. Montanaro · 2010
Later among the works it cites.
A quasipolynomial-time algorithm for the quantum separability problem
F.G.S.L. Brandão, M. Christandl, and J. Yard · 2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Wocjan and S. Zhang · 2006
Cited alongside, same era.
Quantum computational complexity of the n-representability problem: Qma complete
Y.K. Liu, M. Christandl, and F. Verstraete · 2007
Cited alongside, same era.
F. Le Gall, S. Nakagawa, and H. Nishimura · 2011
Closest in time.
T.J. Osborne · 2011
Closest in time.