Fetching the paper…
Reading the bibliography…
We consider a computational problem where the goal is to approximate the maximum eigenvalue of a two-local Hamiltonian that describes Heisenberg interactions between qubits located at the vertices of a graph.
Ordering energy levels of interacting spin systems
Elliott Lieb and Daniel Mattis · 1962
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X Goemans and David P Williamson · 1995
Earlier work this paper cites.
Proof verification and the hardness of approximation problems
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy · 1998
Earlier work this paper cites.
A note on laplacian graph eigenvalues
Russell Merris · 1998
Earlier work this paper cites.
Classical and quantum computation
Alexei Yu Kitaev, Alexander Shen, and Mikhail N Vyalyi · 2002
Earlier work this paper cites.
Maximizing quadratic programs: Extending grothendieck’s inequality
Moses Charikar and Anthony Wirth · 2004
Earlier work this paper cites.
The complexity of the local hamiltonian problem
Julia Kempe, Alexei Kitaev, and Oded Regev · 2004
Cited alongside, same era.
Nikhil Bansal, Sergey Bravyi, and Barbara M Terhal · 2007
Cited alongside, same era.
The positive semidefinite grothendieck problem with rank constraint
Jop Briët, Fernando Mário de Oliveira Filho, and Frank Vallentin · 2010
Cited alongside, same era.
Approximation algorithms for qma-complete problems
Sevag Gharibian and Julia Kempe · 2012
Cited alongside, same era.
A quantum approximate optimization algorithm
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Cited alongside, same era.
Product-state approximations to quantum states
Fernando GSL Brandao and Aram W Harrow · 2016
Later among the works it cites.
Extremal eigenvalues of local hamiltonians
Aram W Harrow and Ashley Montanaro · 2017
Later among the works it cites.
Approximation algorithms for quantum many-body problems
Sergey Bravyi, David Gosset, Robert König, and Kristan Temme · 2019
Later among the works it cites.
Almost optimal classical approximation algorithms for a quantum generalization of max-cut
Sevag Gharibian and Ojas Parekh · 2019
Later among the works it cites.
Hallgren, Lee, Parekh 2019. Announced in a contributed talk at QIP 2020 in Shenzhen, China
2020
Closest in time.
Approximation algorithms for the quantum heisenberg model
Sevag Gharibian and Yi-Kai Liu · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stephen Piddock and Ashley Montanaro · 2015
Cited alongside, same era.