Fetching the paper…
Reading the bibliography…
Quantum satisfiability is a constraint satisfaction problem that generalizes classical boolean satisfiability.
Quantum mechanical computers
Richard Feynman · 1985
Earlier work this paper cites.
Probabilistic quantifiers vs. distrustful adversaries
Stathis Zachos and Martin Furer · 1987
Earlier work this paper cites.
Eigenvalues, diameter, and mean distance in graphs
Bojan Mohar · 1991
Earlier work this paper cites.
Classical and Quantum Computation
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Earlier work this paper cites.
Quantum arthur—merlin games
Chris Marriott and John Watrous · 2005
Earlier work this paper cites.
The complexity of the local hamiltonian problem
Julia Kempe, Alexei Kitaev, and Oded Regev · 2006
Earlier work this paper cites.
New construction for a QMA complete three-local Hamiltonian
D. Nagaj and S. Mozes · 2007
Earlier work this paper cites.
Quantum sat for a qutrit-cinquit pair is qma1-complete
Lior Eldar and Oded Regev · 2008
Earlier work this paper cites.
On perfect completeness for qma
Scott Aaronson · 2009
Cited alongside, same era.
A quantum lovász local lemma
A. Ambainis, J. Kempe, and O. Sattath · 2010
Cited alongside, same era.
Bounds on the quantum satisfiability threshold
Sergey Bravyi, Cristopher Moore, and Alexander Russell · 2010
Cited alongside, same era.
Product, generic, and random generic quantum satisfiability
C. R. Laumann, A. M. Läuchli, R. Moessner, A. Scardicchio, and S. L. Sondhi · 2010
Cited alongside, same era.
Random quantum satisfiability
Christopher R. Laumann, R. Moessner, Antonello Scarddichio, and S. L. Sondhi · 2010
Cited alongside, same era.
Unfrustrated qudit chains and their ground states
R. Movassagh, E. Farhi, J. Goldstone, D. Nagaj, T. J. Osborne, and P. W. Shor · 2010
Cited alongside, same era.
Complete characterization of the ground-space structure of two-body frustration-free hamiltonians for qubits
Zhengfeng Ji, Zhaohui Wei, and Bei Zeng · 2011
Later among the works it cites.
Fast amplification of qma
Daniel Nagaj, Pawel Wocjan, and Yong Zhang · 2011
Later among the works it cites.
Criticality without frustration for quantum spin-1 chains
Sergey Bravyi, Libor Caha, Ramis Movassagh, Daniel Nagaj, and Peter W. Shor · 2012
Later among the works it cites.
Unfrustration Condition and Degeneracy of Qudits on Trees
M. Coudron and R. Movassagh · 2012
Later among the works it cites.
Exact synthesis of multi-qubit Clifford+T circuits
B. Giles and P. Selinger · 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
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast universal quantum computation with railroad-switch local Hamiltonians
D. Nagaj · 2010
Cited alongside, same era.
Efficient algorithm for a quantum analogue of 2-SAT
S. Bravyi · 2011
Cited alongside, same era.
Sergey Bravyi, personal communication
Cited in the paper.
Later among the works it cites.
Hamiltonian complexity
T. J. Osborne · 2012
Later among the works it cites.
Stronger methods of making quantum interactive proofs perfectly complete
Hirotada Kobayashi, François Le Gall, and Harumichi Nishimura · 2013
Closest in time.