Fetching the paper…

Reading the bibliography…

2015

Extremal eigenvalues of local Hamiltonians

Harrow, Aram W., Montanaro, Ashley

Original
PDF
Post on X

Understand

We apply classical algorithms for approximately solving constraint satisfaction problems to find bounds on extremal eigenvalues of local Hamiltonians.

We consider spin Hamiltonians for which we have an upper bound on the number of terms in which each spin participates, and find extensive bounds for the operator norm and ground-state energy of such Hamiltonians under this constraint.
In each case the bound is achieved by a product state which can be found efficiently using a classical algorithm.

Extremal eigenvalues of local Hamiltonians · Around

Built on

Spherical codes and designs
P. Delsarte, J. Goethals, and J. Seidel · 1977
Earlier work this paper cites.
On bounded occurrence constraint satisfaction
J. Håstad · 2000
Earlier work this paper cites.
Symmetric informationally complete quantum measurements
J. Renes, R. Blume-Kohout, A. J. Scott, and C. Caves · 2003
Earlier work this paper cites.
Gaussian quantum fluctuations in interacting many particle systems
M. Hartmann, G. Mahler, and O. Hess · 2004
Earlier work this paper cites.
Minimal qubit tomography
J. Řeháček, B.-G. Englert, and D. Kaszlikowski · 2004
Earlier work this paper cites.
Product-state approximations to quantum ground states
Original
F. G. S. L. Brandão and A. W. Harrow · 2006
Earlier work this paper cites.

Similar

On the Fourier tails of bounded functions over the discrete cube
I. Dinur, E. Friedgut, G. Kindler, and R. O’Donnell · 2007
Cited alongside, same era.
Classical approximation schemes for the ground-state energy of quantum and classical Ising spin hamiltonians on planar graphs
Original
N. Bansal, S. Bravyi, and B. Terhal · 2009
Cited alongside, same era.
Some applications of hypercontractive inequalities in quantum information theory
Original
A. Montanaro · 2012
Cited alongside, same era.
Quantum systems on non- k k -hyperfinite complexes: A generalization of classical statistical mechanics on expander graphs, 2013, arXiv:1301.1363
Original
M. H. Freedman and M. B. Hastings · 2013
Cited alongside, same era.
A quantum approximate optimization algorithm
Original

Then

A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem
Original
E. Farhi, J. Goldstone, and S. Gutmann · 2014
Later among the works it cites.
Analysis of Boolean Functions
R. O’Donnell · 2014
Later among the works it cites.
Beating the random assignment on constraint satisfaction problems of bounded degree, 2015, arXiv:1505.03424
Original
B. Barak, A. Moitra, R. O’Donnell, P. Raghavendra, O. Regev, D. Steurer, L. Trevisan, A. Vijayaraghavan, D. Witmer, and J. Wright · 2015
Closest in time.
Equivalence of statistical mechanical ensembles for non-critical quantum systems, 2015, arXiv:1502.03263
Original
F. G. S. L. Brandao and M. Cramer · 2015
Closest in time.
Improved bounds for bounded occurrence constraint satisfaction, 2015
J. Håstad · 2015
Closest in time.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

E. Farhi, J. Goldstone, and S. Gutmann · 2014

Cited alongside, same era.