Fetching the paper…
Reading the bibliography…
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science.
Probability inequalities for sums of bounded random variables
W. Höffding · 1964
Earlier work this paper cites.
Density matrix formulation for quantum renormalization groups
S. R. White · 1992
Earlier work this paper cites.
Randomness in interactive proofs
M. Bellare, O. Goldreich, and S. Goldwasser · 1993
Earlier work this paper cites.
A Chernoff bound for random walks on expanders
D. Gillman · 1993
Earlier work this paper cites.
Geometric Algorithms and Combinatorial Optimization
M. Grötschel, L. Lovàsz, and A. Schrijver · 1993
Earlier work this paper cites.
Density-matrix algorithms for quantum renormalization groups
S. R. White · 1993
Earlier work this paper cites.
Randomness-efficient oblivious sampling
M. Bellare and J. Rompel · 1994
Earlier work this paper cites.
Thermodynamic limit of density matrix renormalization
S. Östlund and S. Rommer · 1995
Earlier work this paper cites.
MAX-CUT has a randomized approximation scheme in dense graphs
W. F. de la Vega · 1996
Earlier work this paper cites.
The regularity lemma and approximation schemes dense problems
A. M. Frieze and R. Kannan · 1996
Earlier work this paper cites.
Some optimal inapproximability results
J. Håstad · 1997
Earlier work this paper cites.
Approximation Algorithms for NP-Hard Problems
D. Hochbaum · 1997
Earlier work this paper cites.
Class of ansatz wave functions for one-dimensional spin systems and their relation to the density matrix renormalization group
S. Rommer and S. Östlund · 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.
Property testing and its connection to learning and approximation
O. Goldreich, S. Goldwasser, and D. Ron · 1998
Earlier work this paper cites.
Density-matrix renormalization - a new numerical method in physics
I. Peschel, X. Wang, M. Kaulke, and K. Hallberg (Edgs.) · 1998
Earlier work this paper cites.
Parallel approximation algorithms by positive linear programming
L. Trevisan · 1998
Earlier work this paper cites.
Polynomial time approximation schemes for dense instances of NP-hard problems
S. Arora, D. Karger, and M. Karpinski · 1999
Earlier work this paper cites.
Polynomial time approximation of dense weighted instances of MAX-CUT
W. F. de la Vega and M. Karpinski · 2000
Earlier work this paper cites.
The approximability of constraint satisfaction problems
S. Khanna, M. Sudan, L. Trevisan, and D. Williamson · 2001
Earlier work this paper cites.
Approximation Algorithms
V. Vazirani · 2001
Earlier work this paper cites.
Random sampling and approximation of MAX-CSP problems
N. Alon, W. F. de la Vega, R. Kannan, and M. Karpinski · 2002
Cited alongside, same era.
On the power of unique 2-prover 1-round games
S. Khot · 2002
Cited alongside, same era.
Classical and Quantum Computation
A. Kitaev, A. Shen, and M. Vyalyi · 2002
Cited alongside, same era.
Improved rounding techniques for MAX 2-SAT and MAX DI-CUT problems
M. Lewin, D. Livnat, and U. Zwick · 2002
Cited alongside, same era.
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
C. Bazgan, W. F. de la Vega, and M. Karpinski · 2003
Cited alongside, same era.
The Bloch vector for N-level systems
G. Kimura · 2003
Cited alongside, same era.
On the approximation resistance of a random predicate
J. Håstad · 2007
Later among the works it cites.
Quantum computational complexity of the N-representability problem: QMA complete
Y.-K. Liu, M. Christandl, and F. Verstraete · 2007
Later among the works it cites.
Approximation resistant predicates from pairwise independence
P. Austrin and E. Mossel · 2008
Later among the works it cites.
The complexity of the stoquastic local Hamiltonian problems
S. Bravyi, D. P. Divincenzo, R. Oliveira, and B. M. Terhal · 2008
Later among the works it cites.
The complexity of quantum spin systems on a two-dimensional square lattice
R. Oliveira and B. M. Terhal · 2008
Later among the works it cites.
The detectibility lemma and quantum gap amplification
D. Aharonov, I. Arad, Z. Landau, and U. Vazirani · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
3-local Hamiltonian is QMA-complete
J. Kempe and O. Regev · 2003
Cited alongside, same era.
Geometric measure of entanglement and applications to bipartite and multipartite quantum states
T.-C. Wei and P. M. Goldbart · 2003
Cited alongside, same era.
Complete family of separability criteria
A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri · 2004
Cited alongside, same era.
Commutative version of the local Hamiltonian problem and common eigenspace problem
S. Bravyi and M. Vyalyi · 2005
Cited alongside, same era.
Tensor decomposition and approximation schemes for constraint satisfaction problems
W. F. de la Vega, M. Karpinski, R. Kannan, and S. Vempala · 2005
Cited alongside, same era.
Approximating Max kCSP - outperforming a random assignment with almost a linear factor
G. Hast · 2005
Cited alongside, same era.
Computational Complexity: A Modern Approach
S. Arora and B. Barak · 2009
Later among the works it cites.
The power of quantum systems on a line
D. Aharonov, D. Gottesman, S. Irani, and J. Kempe · 2009
Later among the works it cites.
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
Later among the works it cites.
Renormalization and tensor product states in spin chains and lattices
J. I. Cirac and F. Verstraete · 2009
Later among the works it cites.
Testing non-isometry is QMA-complete
B. Rosgen · 2009
Later among the works it cites.
Computational complexity of interacting electrons and fundamental limitations of density functional theory
N. Schuch and F. Verstraete · 2009
Later among the works it cites.
Maximally entangled three-qubit states via geometric measure of entanglement
S. Tamaryan, T.-C. Wei, and D. Park · 2009
Later among the works it cites.
Semidefinite programs for completely bounded norms
J. Watrous · 2009
Later among the works it cites.
Efficient algorithm for approximating one-dimensional ground states
D. Aharonov, I. Arad, and S. Irani · 2010
Later among the works it cites.
QMA-complete problems for stoquastic Hamiltonians and Markov matrices
S. P. Jordan, D. Gosset, and P. J. Love · 2010
Later among the works it cites.
QIP=PSPACE
R. Jain, Z. Ji, S. Upadhyay, and J. Watrous · 2010
Later among the works it cites.
Product, generic, and random generic quantum satisfiability
C. .R. Laumann, A. M. Läuchli, R. Moessner, A. Scardicchio, and S. L. Sondhi · 2010
Later among the works it cites.
T. Lee, R. Mittal, B. W. Reichardt, and R. Spalek · 2010
Later among the works it cites.
Matrix product state and mean-field solutions for one-dimensional systems can be found efficiently
N. Schuch and J. I. Cirac · 2010
Later among the works it cites.
Interacting boson problems can be QMA hard
T.-C. Wei, M. Mosca, and A. Nayak · 2010
Later among the works it cites.