Fetching the paper…
Reading the bibliography…
StoqMA characterizes the computational hardness of stoquastic local Hamiltonians, which is a family of Hamiltonians that does not suffer from the sign problem.
“The complexity of satisfiability problems”
Thomas J. Schaefer · 1978
Earlier work this paper cites.
“Trading group theory for randomness”
László Babai · 1985
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.
“Succinct quantum proofs for properties of finite groups”
John Watrous · 2000
Earlier work this paper cites.
“A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem”
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua Lapan, Andrew Lundgren, and Daniel Preda · 2001
Earlier work this paper cites.
“Classical and quantum computation”
Alexei Yu Kitaev, Alexander Shen, and Mikhail N Vyalyi · 2002
Earlier work this paper cites.
“Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses”
Adam R Klivans and Dieter van Melkebeek · 2002
Earlier work this paper cites.
“Quantum computation and quantum information” (2002)
Michael A Nielsen and Isaac Chuang · 2002
Earlier work this paper cites.
“3-local hamiltonian is QMA-complete”
Julia Kempe and Oded Regev · 2003
Earlier work this paper cites.
“Derandomizing arthur–merlin games using hitting sets”
Peter Bro Miltersen and N Variyam Vinodchandran · 2005
Earlier work this paper cites.
“The complexity of the local hamiltonian problem”
Julia Kempe, Alexei Kitaev, and Oded Regev · 2006
Cited alongside, same era.
“Merlin-arthur games and stoquastic complexity” (2006)
Sergey Bravyi, Arvid J Bessen, and Barbara M Terhal · 2006
Cited alongside, same era.
“Markov chains and mixing times”
David A. Levin, Yuval Peres, and Elizabeth L. Wilmer · 2006
Cited alongside, same era.
“The complexity of quantum spin systems on a two-dimensional square lattice”
Roberto Oliveira and Barbara M Terhal · 2008
Cited alongside, same era.
“The complexity of stoquastic local hamiltonian problems”
Sergey Bravyi, David P. Divincenzo, Roberto Oliveira, and Barbara M. Terhal · 2008
Cited alongside, same era.
“The power of quantum systems on a line”
Dorit Aharonov, Daniel Gottesman, Sandy Irani, and Julia Kempe · 2009
Cited alongside, same era.
“Approximating the expansion profile and almost optimal local graph clustering”
Shayan Oveis Gharan and Luca Trevisan · 2012
Later among the works it cites.
“Testing product states, quantum merlin-arthur games and tensor optimization”
Aram W Harrow and Ashley Montanaro · 2013
Later among the works it cites.
“The bose-hubbard model is 𝖰𝖬𝖠 \mathsf{QMA} -complete”
Andrew M. Childs, David Gosset, and Zak Webb · 2014
Later among the works it cites.
“Complexity classification of local hamiltonian problems”
Toby Cubitt and Ashley Montanaro · 2016
Later among the works it cites.
“On complexity of the quantum ising model”
Sergey Bravyi and Matthew Hastings · 2017
Later among the works it cites.
“Adiabatic quantum computation”
Tameem Albash and Daniel A Lidar · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?”
Hirotada Kobayashi, Keiji Matsumoto, and Tomoyuki Yamakami · 2009
Cited alongside, same era.
“Complexity of stoquastic frustration-free hamiltonians”
Sergey Bravyi and Barbara Terhal · 2010
Cited alongside, same era.
“Quantum annealing with manufactured spins”
Mark W Johnson, Mohammad HS Amin, Suzanne Gildert, Trevor Lanting, Firas Hamze, Neil Dickson, Richard Harris, Andrew J Berkley, Jan Johansson, Paul Bunyk, et al · 2011
Cited alongside, same era.
“Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems”
Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, and Harumichi Nishimura · 2012
Cited alongside, same era.
“Oracle separation of BQP and PH”
Ran Raz and Avishay Tal · 2019
Later among the works it cites.
“Stoquastic pcp vs. randomness”
Dorit Aharonov and Alex Bredariol Grilo · 2019
Later among the works it cites.
“Two-local qubit hamiltonians: when are they stoquastic?”
Joel Klassen and Barbara M Terhal · 2019
Later among the works it cites.
“Two combinatorial MA-complete problems”
Dorit Aharonov and Alex B. Grilo · 2021
Closest in time.