Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1602.01210 · Physical review. B./Physical review. B

Simple proof of the detectability lemma and spectral gap amplification

Anurag Anshu, Itai Arad, Thomas Vidick

Published May 23, 2016• 45 citations
arXivHTMLPDF

Abstract

The detectability lemma is a useful tool for probing the structure of gapped ground states of frustration-free Hamiltonians of lattice spin models. The lemma provides an estimate on the error incurred by approximating the ground space projector with a product of local projectors. We provide a simpler proof for the detectability lemma which applies to an arbitrary ordering of the local projectors, and show that it is tight up to a constant factor. As an application, we show how the lemma can be combined with a strong converse by Gao to obtain local spectral gap amplification: We show that by coarse graining a local frustration-free Hamiltonian with a spectral gap $\ensuremath{\gamma}>0$ to a length scale $O\left({\ensuremath{\gamma}}^{\ensuremath{-}1/2}\right)$, one gets a Hamiltonian with an $\mathrm{\ensuremath{\Omega}}\left(1\right)$ spectral gap.

DOI
10.1103/physrevb.93.205142

Related papers

Simple proofs for the detectability lemma and its converse

Anurag Anshu, Itai Arad, Thomas Vidick

The detectability lemma is a useful tool for probing the structure of gapped ground states of frustration-free Hamiltonians of lattice spin models. The lemma provides an estimate on the error incurred by approximating the ground space projector with a product of local projectors. We provide a new, simpler proof for the detectability lemma, which applies to an arbitrary ordering of the local projectors, and show that it is tight up to a constant factor. As an application we show how the lemma can be combined with a strong converse by Gao to obtain local spectral gap amplification: we show that by coarse-graining a local frustration-free Hamiltonian with a spectral gap $\gamma>0$ to a length scale $O(\gamma^{-1/2})$, one gets an Hamiltonian with an $\Omega(1)$ spectral gap.

•Feb 3, 2016•0 citations

Improved local spectral gap thresholds for lattices of finite size

Anurag Anshu

Knabe's theorem lower bounds the spectral gap of a one-dimensional frustration-free local Hamiltonian in terms of the local spectral gaps of finite regions. It also provides a local spectral gap threshold for Hamiltonians that are gapless in the thermodynamic limit, showing that the local spectral gap must scale inverse linearly with the length of the region for such systems. Recent works have further improved upon this threshold, tightening it in the one-dimensional case and extending it to higher dimensions. Here, we show a local spectral gap threshold for frustration-free Hamiltonians on a finite-dimensional lattice that is optimal up to a constant factor that depends on the dimension of the lattice. Our proof is based on the detectability lemma framework and uses the notion of a coarse-grained Hamiltonian (introduced in [Anshu et al., Phys. Rev. B 93, 205142]) as a link connecting the (global) spectral gap and the local spectral gap.

arXiv:1909.01516•Physical review. B./Physical review. B•Apr 6, 2020•24 citations

The detectability lemma and quantum gap amplification

Dorit Aharonov, Itai Arad, Zeph A. Landau +1 more

The quantum analogue of a constraint satisfaction problem is a sum of local Hamiltonians - each local Hamiltonian specifies a local constraint whose violation contributes to the energy of the given quantum state. Formalizing the intuitive connection between the ground (minimal) energy of the Hamiltonian and the minimum number of violated constraints is problematic, since the number of constraints being violated is not well defined when the terms in the Hamiltonian do not commute. The detectability lemma proved in this paper provides precisely such a quantitative connection. We apply the lemma to derive a quantum analogue of a basic primitive in classical complexity: amplification of probabilities by random walks on expander graphs. It holds under the restriction that the interaction graph of the local Hamiltonian is an expander. Our proofs are based on a novel structure imposed on the Hilbert space that we call the $XY$ decomposition, which enables a reduction from the quantum non-commuting case to the commuting case (where many classical arguments go through). The results may have several interesting implications. First, proving a quantum analogue to the PCP theorem is one of the most important challenges in quantum complexity theory. Our quantum gap amplification lemma may be viewed as the quantum analogue of the first of the three main steps in Dinur's PCP proof. Quantum gap amplification may also be related to spectral gap amplification, and in particular, to fault tolerance of adiabatic computation. Finally, the detectability lemma, and the $XY$ decomposition provide a handle on the structure of local Hamiltonians and their ground states.

arXiv:0811.3412•ACM Symposium on Theory of Computing (STOC)•May 31, 2009•109 citations

Divide and conquer method for proving gaps of frustration free Hamiltonians

Michael J Kastoryano, Angelo Lucia

Abstract Providing system-size independent lower bounds on the spectral gap of local Hamiltonian is in general a hard problem. For the case of finite-range, frustration free Hamiltonians on a spin lattice of arbitrary dimension, we show that a property of the ground state space is sufficient to obtain such a bound. We furthermore show that such a condition is necessary and equivalent to a constant spectral gap. Thanks to this equivalence, we can prove that for gapless models in any dimension, the spectral gap on regions of diameter n is at most o ( log ⁡ ( n ) 2 + ε n ) for any positive ϵ.

arXiv:1705.09491•Journal of Statistical Mechanics Theory and Experiment•Mar 1, 2018•25 citations

Efficient Verification of Ground States of Frustration-Free Hamiltonians

Huangjun Zhu, Yunting Li, Tianyi Chen

Ground states of local Hamiltonians are of key interest in many-body physics and also in quantum information processing. Efficient verification of these states are crucial to many applications, but very challenging. Here we propose a simple, but powerful recipe for verifying the ground states of general frustration-free Hamiltonians based on local measurements. Moreover, we derive rigorous bounds on the sample complexity by virtue of the quantum detectability lemma (with improvement) and quantum union bound. Notably, the number of samples required does not increase with the system size when the underlying Hamiltonian is local and gapped, which is the case of most interest. As an application, we propose a general approach for verifying Affleck-Kennedy-Lieb-Tasaki (AKLT) states on arbitrary graphs based on local spin measurements, which requires only a constant number of samples for AKLT states defined on various lattices. Our work is of interest not only to many tasks in quantum information processing, but also to the study of many-body physics.

arXiv:2206.15292•Quantum•Jan 10, 2024•14 citations

The detectability lemma and its applications to quantum Hamiltonian complexity

Dorit Aharonov, Itai Arad, Umesh V. Vazirani +1 more

Quantum Hamiltonian complexity studies computational complexity aspects of local Hamiltonians and ground states; these questions can be viewed as generalizations of classical computational complexity problems related to local constraint satisfaction (such as SAT), with the additional ingredient of multi-particle entanglement. This additional ingredient of course makes generalizations of celebrated theorems such as the PCP theorem from classical to the quantum domain highly non-trivial; it also raises entirely new questions such as bounds on entanglement and correlations in ground states, and in particular area laws. We propose a simple combinatorial tool that helps to handle such questions: it is a simplified, yet more general version of the detectability lemma introduced by us in the more restricted context on quantum gap amplification a year ago. Here, we argue that this lemma is applicable in much more general contexts. We use it to provide a simplified and more combinatorial proof of Hastings' 1D area law, together with a less than 1 page proof of the decay of correlations in gapped local Hamiltonian systems in any constant dimension. We explain how the detectability lemma can replace the Lieb-Robinson bound in various other contexts, and argue that it constitutes a basic tool for the study of local Hamiltonians and their ground states in relation to various questions in quantum Hamiltonian complexity.

arXiv:1011.3445•New Journal of Physics•Nov 30, 2011•48 citations
The detectability lemma is a useful tool for probing the structure of gapped ground states of frustration-free Hamiltonians of lattice spin models. The lemma provides an estimate on the error incurred by approximating the ground space projector with a product of local projectors. We provide a simpler proof for the detectability lemma which applies to an arbitrary ordering of the local projectors, and show that it is tight up to a constant factor. As an application, we show how the lemma can be combined with a strong converse by Gao to obtain local spectral gap amplification: We show that by coarse graining a local frustration-free Hamiltonian with a spectral gap \ensuremathγ>0\ensuremath{\gamma}>0\ensuremathγ>0 to a length scale O(\ensuremathγ\ensuremath−1/2)O\left({\ensuremath{\gamma}}^{\ensuremath{-}1/2}\right)O(\ensuremathγ\ensuremath−1/2), one gets a Hamiltonian with an \ensuremathΩ(1)\mathrm{\ensuremath{\Omega}}\left(1\right)\ensuremathΩ(1) spectral gap.
The detectability lemma is a useful tool for probing the structure of gapped ground states of frustration-free Hamiltonians of lattice spin models. The lemma provides an estimate on the error incurred by approximating the ground space projector with a product of local projectors. We provide a new, simpler proof for the detectability lemma, which applies to an arbitrary ordering of the local projectors, and show that it is tight up to a constant factor. As an application we show how the lemma can be combined with a strong converse by Gao to obtain local spectral gap amplification: we show that by coarse-graining a local frustration-free Hamiltonian with a spectral gap γ>0\gamma>0γ>0 to a length scale O(γ−1/2)O(\gamma^{-1/2})O(γ−1/2), one gets an Hamiltonian with an Ω(1)\Omega(1)Ω(1) spectral gap.
Knabe's theorem lower bounds the spectral gap of a one-dimensional frustration-free local Hamiltonian in terms of the local spectral gaps of finite regions. It also provides a local spectral gap threshold for Hamiltonians that are gapless in the thermodynamic limit, showing that the local spectral gap must scale inverse linearly with the length of the region for such systems. Recent works have further improved upon this threshold, tightening it in the one-dimensional case and extending it to higher dimensions. Here, we show a local spectral gap threshold for frustration-free Hamiltonians on a finite-dimensional lattice that is optimal up to a constant factor that depends on the dimension of the lattice. Our proof is based on the detectability lemma framework and uses the notion of a coarse-grained Hamiltonian (introduced in [Anshu et al., Phys. Rev. B 93, 205142]) as a link connecting the (global) spectral gap and the local spectral gap.
The quantum analogue of a constraint satisfaction problem is a sum of local Hamiltonians - each local Hamiltonian specifies a local constraint whose violation contributes to the energy of the given quantum state. Formalizing the intuitive connection between the ground (minimal) energy of the Hamiltonian and the minimum number of violated constraints is problematic, since the number of constraints being violated is not well defined when the terms in the Hamiltonian do not commute. The detectability lemma proved in this paper provides precisely such a quantitative connection. We apply the lemma to derive a quantum analogue of a basic primitive in classical complexity: amplification of probabilities by random walks on expander graphs. It holds under the restriction that the interaction graph of the local Hamiltonian is an expander. Our proofs are based on a novel structure imposed on the Hilbert space that we call the XYXYXY decomposition, which enables a reduction from the quantum non-commuting case to the commuting case (where many classical arguments go through). The results may have several interesting implications. First, proving a quantum analogue to the PCP theorem is one of the most important challenges in quantum complexity theory. Our quantum gap amplification lemma may be viewed as the quantum analogue of the first of the three main steps in Dinur's PCP proof. Quantum gap amplification may also be related to spectral gap amplification, and in particular, to fault tolerance of adiabatic computation. Finally, the detectability lemma, and the XYXYXY decomposition provide a handle on the structure of local Hamiltonians and their ground states.
Abstract Providing system-size independent lower bounds on the spectral gap of local Hamiltonian is in general a hard problem. For the case of finite-range, frustration free Hamiltonians on a spin lattice of arbitrary dimension, we show that a property of the ground state space is sufficient to obtain such a bound. We furthermore show that such a condition is necessary and equivalent to a constant spectral gap. Thanks to this equivalence, we can prove that for gapless models in any dimension, the spectral gap on regions of diameter n is at most o ( log ⁡ ( n ) 2 + ε n ) for any positive ϵ.
Ground states of local Hamiltonians are of key interest in many-body physics and also in quantum information processing. Efficient verification of these states are crucial to many applications, but very challenging. Here we propose a simple, but powerful recipe for verifying the ground states of general frustration-free Hamiltonians based on local measurements. Moreover, we derive rigorous bounds on the sample complexity by virtue of the quantum detectability lemma (with improvement) and quantum union bound. Notably, the number of samples required does not increase with the system size when the underlying Hamiltonian is local and gapped, which is the case of most interest. As an application, we propose a general approach for verifying Affleck-Kennedy-Lieb-Tasaki (AKLT) states on arbitrary graphs based on local spin measurements, which requires only a constant number of samples for AKLT states defined on various lattices. Our work is of interest not only to many tasks in quantum information processing, but also to the study of many-body physics.
Quantum Hamiltonian complexity studies computational complexity aspects of local Hamiltonians and ground states; these questions can be viewed as generalizations of classical computational complexity problems related to local constraint satisfaction (such as SAT), with the additional ingredient of multi-particle entanglement. This additional ingredient of course makes generalizations of celebrated theorems such as the PCP theorem from classical to the quantum domain highly non-trivial; it also raises entirely new questions such as bounds on entanglement and correlations in ground states, and in particular area laws. We propose a simple combinatorial tool that helps to handle such questions: it is a simplified, yet more general version of the detectability lemma introduced by us in the more restricted context on quantum gap amplification a year ago. Here, we argue that this lemma is applicable in much more general contexts. We use it to provide a simplified and more combinatorial proof of Hastings' 1D area law, together with a less than 1 page proof of the decay of correlations in gapped local Hamiltonian systems in any constant dimension. We explain how the detectability lemma can replace the Lieb-Robinson bound in various other contexts, and argue that it constitutes a basic tool for the study of local Hamiltonians and their ground states in relation to various questions in quantum Hamiltonian complexity.