Fetching the paper…
Reading the bibliography…
We prove that approximating the ground energy of the antiferromagnetic XY model on a simple graph at fixed magnetization (given as part of the instance specification) is QMA-complete.
Alexei Yu. Kitaev, Alexander H. Shen, and Mikhail N. Vyalyi, Classical and quantum computation , American Mathematical Society, 2002
2002
Earlier work this paper cites.
Ari Mizel, Daniel A. Lidar, and Morgan Mitchell, Simple proof of equivalence between adiabatic quantum computation and the circuit model , Physical Review Letters 99
2007
Earlier work this paper cites.
2009
Earlier work this paper cites.
2009
Cited alongside, same era.
Adam D. Bookatz, QMA-complete problems , Quantum Information and Computation 14
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Later among the works it cites.
2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…