• Corpus ID: 221586326

# Short proof of a spectral Chernoff bound for local Hamiltonians

@article{Abrahamsen2020ShortPO,
title={Short proof of a spectral Chernoff bound for local Hamiltonians},
author={Nilin Abrahamsen},
journal={arXiv: Quantum Physics},
year={2020}
}
• Nilin Abrahamsen
• Published 10 September 2020
• Mathematics, Physics
• arXiv: Quantum Physics
We give a simple proof of a Chernoff bound for the spectrum of a $k$-local Hamiltonian based on Weyl's inequalities. The complexity of estimating the spectrum's $\epsilon(n)$-th quantile up to constant relative error thus exhibits the following dichotomy: For $\epsilon(n)=d^{-n}$ the problem is NP-hard and maybe even QMA-hard, yet there exists constant $a>1$ such that the problem is trivial for $\epsilon(n)=a^{-n}$. We note that a related Chernoff bound due to Kuwahara and Saito (Ann. Phys. '20…

## References

SHOWING 1-10 OF 33 REFERENCES
The Complexity of the Local Hamiltonian Problem
• Computer Science, Mathematics
SIAM J. Comput.
• 2006
This paper settles the question and shows that the 2-LOCAL HAMILTONIAN problem is QMA-complete, and demonstrates that adiabatic computation with two-local interactions on qubits is equivalent to standard quantum computation.
Approximation algorithms for quantum many-body problems
• Physics, Mathematics
Journal of Mathematical Physics
• 2019
We discuss classical algorithms for approximating the largest eigenvalue of quantum spin and fermionic Hamiltonians based on semidefinite programming relaxation methods. First, we consider traceless
An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem
• Computer Science, Mathematics
APPROX-RANDOM
• 2020
This work works in the product state space and extends the framework of Goemans and Williamson for approximating MAX-2-CSPs, and achieves an approximation ratio of 0.328, which is the first example of an approximation algorithm beating the random quantum assignment ratio of0.25 by a constant factor.
Connecting the probability distributions of different operators and generalization of the Chernoff–Hoeffding inequality
This work aimed to explore the fundamental aspects of the spectral properties of few-body general operators. We first consider the following question: when we know the probability distributions of a
Product-state approximations to quantum ground states
• Computer Science, Mathematics
STOC '13
• 2013
A new quantum version of the de Finetti theorem is proved which does not require the usual assumption of symmetry and is described a way to analyze the application of the Lasserre/Parrilo SDP hierarchy to local quantum Hamiltonians.
Spectra and Eigenstates of Spin Chain Hamiltonians
• Physics, Mathematics
• 2015
We prove that translationally invariant Hamiltonians of a chain of n qubits with nearest-neighbour interactions have two seemingly contradictory features. Firstly in the limit {n \rightarrow
Concentration bounds for quantum states with finite correlation length on quantum spin lattice systems
We consider the problem of determining the energy distribution of quantum states that satisfy exponential decay of correlation and product states, with respect to a quantum local Hamiltonian on a
Guest column: the quantum PCP conjecture
• Computer Science
SIGA
• 2013
The story of this study starts with classical complexity and takes unexpected turns providing fascinating vistas on the foundations of quantum mechanics and multipartite entanglement, topology and the so-called phenomenon of topological order.
Some applications of hypercontractive inequalities in quantum information theory
Hypercontractive inequalities have become important tools in theoretical computer science and have recently found applications in quantum computation. In this note we discuss how hypercontractive