Fetching the paper…
Reading the bibliography…
Approximation algorithms for constraint satisfaction problems (CSPs) are a central direction of study in theoretical computer science.
Zur Theorie der Metalle
H. Bethe · 1931
Earlier work this paper cites.
Pairs of two-level systems
U. Fano · 1983
Earlier work this paper cites.
Matrix Analysis
R. A. Horn and C. H. Johnson · 1990
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M. Goemans and D. Williamson · 1995
Earlier work this paper cites.
Information-theoretic aspects of quantum inseparability of mixed states
R. Horodecki and M. Horodecki · 1996
Earlier work this paper cites.
Perfect correlations in the Einstein-Podolsky-Rosen experiment and Bell’s inequalities
R. Horodecki and P. Horodecki · 1996
Earlier work this paper cites.
Approximation Algorithms for NP-Hard Problems
D. Hochbaum · 1997
Earlier work this paper cites.
Proof verification and the hardness of approximation problems
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy · 1998
Earlier work this paper cites.
Probabilistic checking of proofs: A new characterization of NP
S. Arora and S. Safra · 1998
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Earlier work this paper cites.
Approximation Algorithms
V. Vazirani · 2001
Cited alongside, same era.
Classical and Quantum Computation
A. Kitaev, A. Shen, and M. Vyalyi · 2002
Cited alongside, same era.
Maximizing quadratic programs: Extending grothendieck’s inequality
Moses Charikar and Anthony Wirth · 2004
Cited alongside, same era.
The detectibility lemma and quantum gap amplification
D. Aharonov, I. Arad, Z. Landau, and U. Vazirani · 2009
Cited alongside, same era.
Classical approximation schemes for the ground-state energy of quantum and classical Ising spin Hamiltonians on planar graphs
N. Bansal, S. Bravyi, and B. M. Terhal · 2009
Cited alongside, same era.
Approximation algorithms for QMA-complete problems
S. Gharibian and J. Kempe · 2012
Cited alongside, same era.
On complexity of the quantum Ising model
S. Bravyi and M. Hastings · 2014
Later among the works it cites.
Grothendieck inequalities for semidefinite programs with rank constraint
J. Briët, F. M. de Oliveira Filho, and F. Vallentin · 2014
Later among the works it cites.
Quantum hamiltonian complexity
Sevag Gharibian, Yichen Huang, Zeph Landau, and Seung Woo Shin · 2014
Later among the works it cites.
Monte Carlo simulation of stoquastic Hamiltonians
S. Bravyi · 2015
Later among the works it cites.
Complexity classification of local Hamiltonian problems
T. Cubitt and A. Montanaro · 2016
Later among the works it cites.
Polynomial-time classical simulation of quantum ferromagnets
Sergey Bravyi and David Gosset · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hardness of approximation for quantum problems
S. Gharibian and J. Kempe · 2012
Cited alongside, same era.
Hamiltonian complexity
T. J. Osborne · 2012
Cited alongside, same era.
Guest column: The quantum PCP conjecture
Dorit Aharonov, Itai Arad, and Thomas Vidick · 2013
Cited alongside, same era.
Product-state approximations to quantum ground states
F. Brandão and A. Harrow · 2013
Cited alongside, same era.
The complexity of antiferromagnetic interactions and 2d lattices
Stephen Piddock and Ashley Montanaro · 2017
Later among the works it cites.
Approximation algorithms for quantum many-body problems
S. Bravyi, D. Gosset, R. Koenig, and K. Temme · 2018
Later among the works it cites.
Low-degree testing for quantum states, and a quantum entangled games pcp for qma
A. Natarajan and T. Vidick · 2018
Later among the works it cites.
Approximation of MAX-2-local Hamiltonians
E. Lee and S. Hallgren · 2019
Closest in time.