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:1010.4130

Energy gaps of Hamiltonians from graph Laplacians

Abbas Al-Shimary, Jiannis K. Pachos

Published Oct 20, 2010• 5 citations
arXivHTMLPDF

Abstract

The Cheeger inequalities give an upper and lower bound on the spectral gap of discrete Laplacians defined on a graph in terms of the geometric characteristics of the graph. We generalise this approach and we employ it to determine if a given discrete Hamiltonian with non-positive elements is gapped or not in the thermodynamic limit. First, we define the graph that corresponds to such a generic Hamiltonian. Then we present a suitable generalisation of the Cheeger inequalities that overcomes scaling deficiencies of the original version. By employing simple examples we illustrate how the generalised Cheeger inequalities can successfully identify gapped or gapless phases and we comment on the computational complexity of this approach.

DOI
10.48550/arxiv.1010.4130

Related papers

Hamiltonian surgery: Cheeger-type gap inequalities for nonpositive (stoquastic), real, and Hermitian matrices

Michael Jarret

Cheeger inequalities bound the spectral gap $γ$ of a space by isoperimetric properties of that space and vice versa. In this paper, I derive Cheeger-type inequalities for nonpositive matrices (aka stoquastic Hamiltonians), real matrices, and Hermitian matrices. For matrices written $H = L+W$, where $L$ is either a combinatorial or normalized graph Laplacian, I show that: (1) when $W$ is diagonal and $L$ has maximum degree $d_{\max}$, $2h \geq γ\geq \sqrt{h^2 + d_{\max}^2}-d_\max$; (2) when $W$ is real, we can often route negative-weighted edges along positive-weighted edges such that the Cheeger constant of the resulting graph obeys an inequality similar to that above; and (3) when $W$ is Hermitian, the weighted Cheeger constant obeys $2h \geq γ$ here $h$ is the weighted Cheeger constant of $H$. This constant reduces bounds on $γ$ to information contained in the underlying graph and the Hamiltonian's ground-state. If efficiently computable, the constant opens up a very clear path towards adaptive quantum adiabatic algorithms, those that adjust the adiabatic path based on spectral structure. I sketch a bashful adiabatic algorithm that aborts the adiabatic process early, uses the resulting state to approximate the weighted Cheeger constant, and restarts the process using the updated information. Should this approach work, it would provide more rigorous foundations for adiabatic quantum computing without \textit{a priori} knowledge of the spectral gap.

arXiv:1804.06857•Apr 18, 2018•12 citations

The bulk spectral gap is certifiable from above but uncomputable from below

Xiangling Xu, Matthias Schötz, Jie Wang +4 more

Determining spectral gaps in the thermodynamic limit is a central challenge in quantum many-body physics. When a fixed boundary condition is imposed, this problem is undecidable: no algorithm, even with unlimited resources, can decide for every Hamiltonian whether it is gapped. Yet the thermodynamic limit is meant to capture the intrinsic properties of very large systems, which should not depend on how their boundaries are chosen. We therefore consider the bulk spectral gap, which concerns only the intrinsic excitations of the infinite system, and ask what can and cannot be computed about it. First, we give a general algorithm producing a hierarchy of certified upper bounds on the bulk gap, arbitrarily tight at the cost of more computation. Second, we prove that the spectral gap problem remains undecidable in the bulk, already for translationally invariant nearest-neighbour chains of fixed local dimension. Hence no general algorithm produces convergent lower bounds, and no convergent upper-bounding algorithm, ours included, admits a computable convergence rate. The bulk spectral gap is thus certifiable from above but uncomputable from below; more precisely, the bulk-gaplessness promise problem is RE-complete, exactly as hard as the halting problem. The same construction shows that no general algorithm can decide whether a given product state is a ground state, and that convergent bounds on ground-state expectation values admit no computable convergence rate in general. Finally, we obtain the first nontrivial certified upper bounds on the bulk gap of the spin-1/2 kagome Heisenberg antiferromagnet.

quant-pharXiv:2606.03836•Jun 3, 2026•1 citation

Generic Local Hamiltonians are Gapless

Ramis Movassagh

We prove that generic quantum local Hamiltonians are gapless. In fact, we prove that there is a continuous density of states above the ground state. The Hamiltonian can be on a lattice in any spatial dimension or on a graph with a bounded maximum vertex degree. The type of interactions allowed for include translational invariance in a disorder (i.e., probabilistic) sense with some assumptions on the local distributions. Examples include many-body localization and random spin models. We calculate the scaling of the gap with the system's size when the local terms are distributed according to a Gaussian β orthogonal random matrix ensemble. As a corollary, there exist finite size partitions with respect to which the ground state is arbitrarily close to a product state. When the local eigenvalue distribution is discrete, in addition to the lack of an energy gap in the limit, we prove that the ground state has finite size degeneracies. The proofs are simple and constructive. This work excludes the important class of truly translationally invariant Hamiltonians where the local terms are all equal.

arXiv:1606.09313•Physical Review Letters•Nov 29, 2017•24 citations

Universal witnesses of vanishing energy gap

Konrad Szymański, Karol Życzkowski

Abstract Energy gap, the difference between the energy of the ground-state of a given Hamiltonian and the energy of its first excited state, is a parameter of a critical importance in analysis of phase transitions and adiabatic quantum computation. We present a concrete technique to determine an upper bound for the energy gap of a Hamiltonian H 0 based on properties of the set of expectation values of H 0 and an additional auxiliary Hamiltonian V . This formalism can be applied to obtain an effective criterion of gaplessness, which we illustrate with a concrete example of the XY model —a physical system with vanishing energy gap.

arXiv:2104.13884•Europhysics Letters (EPL)•Nov 1, 2021•4 citations

Gapped and gapless phases of frustration-free spin-12 chains

Sergey B. Bravyi, David Gosset

We consider a family of translation-invariant quantum spin chains with nearest-neighbor interactions and derive necessary and sufficient conditions for these systems to be gapped in the thermodynamic limit. More precisely, let ψ be an arbitrary two-qubit state. We consider a chain of n qubits with open boundary conditions and Hamiltonian Hn(ψ) which is defined as the sum of rank-1 projectors onto ψ applied to consecutive pairs of qubits. We show that the spectral gap of Hn(ψ) is upper bounded by 1/(n − 1) if the eigenvalues of a certain 2 × 2 matrix simply related to ψ have equal non-zero absolute value. Otherwise, the spectral gap is lower bounded by a positive constant independent of n (depending only on ψ). A key ingredient in the proof is a new operator inequality for the ground space projector which expresses a monotonicity under the partial trace. This monotonicity property appears to be very general and might be interesting in its own right. As an extension of our main result, we obtain a complete classification of gapped and gapless phases of frustration-free translation-invariant spin-1/2 chains with nearest-neighbor interactions.

arXiv:1503.04035•Journal of Mathematical Physics•Jun 1, 2015•40 citations

A Hierarchy of Exact Lower Bounds on the Laughlin Spectral Gap

Michael G. Scheer, Eslam Khalaf

We develop a bootstrap approach to deriving lower bounds on the spectral gap of the first Haldane pseudopotential Hamiltonian on the sphere with $N_Φ$ flux quanta for arbitrary $N_Φ$, including in the thermodynamic limit $N_Φ\to \infty$. This method can in principle be generalized to pseudopotentials describing other model wavefunctions such as the Moore--Read state or Read--Rezayi sequence. Our approach is based on Knabe's observation that if $H$ is a Hamiltonian with ground state energy zero then the spectral gap is at least $ε> 0$ if and only if $H^2 \succeq εH$. To show this inequality, we split $H^2$ into two parts, one that can be analytically bounded and another that can be bounded using a finite semidefinite program (SDP). Crucially, the size of this program is determined only by cutoff parameters, and the program depends on $N_Φ$ only parametrically, allowing us to obtain numerically exact (up to solver precision) lower bounds on the gap. In order to turn these numerical bounds into mathematically rigorous results, we introduce an algorithm that can produce nearly-optimal exact interior feasible points for large rational SDPs even if the affine constraints are highly redundant and ill-conditioned. We additionally provide an algorithm that establishes the rank stability of the SDP in the $N_Φ\to \infty$ limit, which is needed to certify the bound in the thermodynamic limit. Beyond establishing a Laughlin gap greater than $1/100$ in the thermodynamic limit and revealing a potential method for deriving spectral gap lower bounds for other pseudopotentials, our work provides a general method for turning numerical SDP bounds into rigorous mathematical proofs, which may have wide applicability. In particular, this work demonstrates that bootstrap methods can be used to rigorously resolve major open problems in quantum many-body physics.

arXiv:2610.18854•Oct 13, 2026•2 citations
The Cheeger inequalities give an upper and lower bound on the spectral gap of discrete Laplacians defined on a graph in terms of the geometric characteristics of the graph. We generalise this approach and we employ it to determine if a given discrete Hamiltonian with non-positive elements is gapped or not in the thermodynamic limit. First, we define the graph that corresponds to such a generic Hamiltonian. Then we present a suitable generalisation of the Cheeger inequalities that overcomes scaling deficiencies of the original version. By employing simple examples we illustrate how the generalised Cheeger inequalities can successfully identify gapped or gapless phases and we comment on the computational complexity of this approach.
Cheeger inequalities bound the spectral gap γγγ of a space by isoperimetric properties of that space and vice versa. In this paper, I derive Cheeger-type inequalities for nonpositive matrices (aka stoquastic Hamiltonians), real matrices, and Hermitian matrices. For matrices written H=L+WH = L+WH=L+W, where LLL is either a combinatorial or normalized graph Laplacian, I show that: (1) when WWW is diagonal and LLL has maximum degree dmax⁡d_{\max}dmax​, $2h \geq γ\geq \sqrt{h^2 + d_{\max}^2}-d_\max$; (2) when WWW is real, we can often route negative-weighted edges along positive-weighted edges such that the Cheeger constant of the resulting graph obeys an inequality similar to that above; and (3) when WWW is Hermitian, the weighted Cheeger constant obeys 2h≥γ2h \geq γ2h≥γ here hhh is the weighted Cheeger constant of HHH. This constant reduces bounds on γγγ to information contained in the underlying graph and the Hamiltonian's ground-state. If efficiently computable, the constant opens up a very clear path towards adaptive quantum adiabatic algorithms, those that adjust the adiabatic path based on spectral structure. I sketch a bashful adiabatic algorithm that aborts the adiabatic process early, uses the resulting state to approximate the weighted Cheeger constant, and restarts the process using the updated information. Should this approach work, it would provide more rigorous foundations for adiabatic quantum computing without \textit{a priori} knowledge of the spectral gap.
Determining spectral gaps in the thermodynamic limit is a central challenge in quantum many-body physics. When a fixed boundary condition is imposed, this problem is undecidable: no algorithm, even with unlimited resources, can decide for every Hamiltonian whether it is gapped. Yet the thermodynamic limit is meant to capture the intrinsic properties of very large systems, which should not depend on how their boundaries are chosen. We therefore consider the bulk spectral gap, which concerns only the intrinsic excitations of the infinite system, and ask what can and cannot be computed about it. First, we give a general algorithm producing a hierarchy of certified upper bounds on the bulk gap, arbitrarily tight at the cost of more computation. Second, we prove that the spectral gap problem remains undecidable in the bulk, already for translationally invariant nearest-neighbour chains of fixed local dimension. Hence no general algorithm produces convergent lower bounds, and no convergent upper-bounding algorithm, ours included, admits a computable convergence rate. The bulk spectral gap is thus certifiable from above but uncomputable from below; more precisely, the bulk-gaplessness promise problem is RE-complete, exactly as hard as the halting problem. The same construction shows that no general algorithm can decide whether a given product state is a ground state, and that convergent bounds on ground-state expectation values admit no computable convergence rate in general. Finally, we obtain the first nontrivial certified upper bounds on the bulk gap of the spin-1/2 kagome Heisenberg antiferromagnet.
We prove that generic quantum local Hamiltonians are gapless. In fact, we prove that there is a continuous density of states above the ground state. The Hamiltonian can be on a lattice in any spatial dimension or on a graph with a bounded maximum vertex degree. The type of interactions allowed for include translational invariance in a disorder (i.e., probabilistic) sense with some assumptions on the local distributions. Examples include many-body localization and random spin models. We calculate the scaling of the gap with the system's size when the local terms are distributed according to a Gaussian β orthogonal random matrix ensemble. As a corollary, there exist finite size partitions with respect to which the ground state is arbitrarily close to a product state. When the local eigenvalue distribution is discrete, in addition to the lack of an energy gap in the limit, we prove that the ground state has finite size degeneracies. The proofs are simple and constructive. This work excludes the important class of truly translationally invariant Hamiltonians where the local terms are all equal.
Abstract Energy gap, the difference between the energy of the ground-state of a given Hamiltonian and the energy of its first excited state, is a parameter of a critical importance in analysis of phase transitions and adiabatic quantum computation. We present a concrete technique to determine an upper bound for the energy gap of a Hamiltonian H 0 based on properties of the set of expectation values of H 0 and an additional auxiliary Hamiltonian V . This formalism can be applied to obtain an effective criterion of gaplessness, which we illustrate with a concrete example of the XY model —a physical system with vanishing energy gap.
We consider a family of translation-invariant quantum spin chains with nearest-neighbor interactions and derive necessary and sufficient conditions for these systems to be gapped in the thermodynamic limit. More precisely, let ψ be an arbitrary two-qubit state. We consider a chain of n qubits with open boundary conditions and Hamiltonian Hn(ψ) which is defined as the sum of rank-1 projectors onto ψ applied to consecutive pairs of qubits. We show that the spectral gap of Hn(ψ) is upper bounded by 1/(n − 1) if the eigenvalues of a certain 2 × 2 matrix simply related to ψ have equal non-zero absolute value. Otherwise, the spectral gap is lower bounded by a positive constant independent of n (depending only on ψ). A key ingredient in the proof is a new operator inequality for the ground space projector which expresses a monotonicity under the partial trace. This monotonicity property appears to be very general and might be interesting in its own right. As an extension of our main result, we obtain a complete classification of gapped and gapless phases of frustration-free translation-invariant spin-1/2 chains with nearest-neighbor interactions.
We develop a bootstrap approach to deriving lower bounds on the spectral gap of the first Haldane pseudopotential Hamiltonian on the sphere with NΦN_ΦNΦ​ flux quanta for arbitrary NΦN_ΦNΦ​, including in the thermodynamic limit NΦ→∞N_Φ\to \inftyNΦ​→∞. This method can in principle be generalized to pseudopotentials describing other model wavefunctions such as the Moore--Read state or Read--Rezayi sequence. Our approach is based on Knabe's observation that if HHH is a Hamiltonian with ground state energy zero then the spectral gap is at least ε>0ε> 0ε>0 if and only if H2⪰εHH^2 \succeq εHH2⪰εH. To show this inequality, we split H2H^2H2 into two parts, one that can be analytically bounded and another that can be bounded using a finite semidefinite program (SDP). Crucially, the size of this program is determined only by cutoff parameters, and the program depends on NΦN_ΦNΦ​ only parametrically, allowing us to obtain numerically exact (up to solver precision) lower bounds on the gap. In order to turn these numerical bounds into mathematically rigorous results, we introduce an algorithm that can produce nearly-optimal exact interior feasible points for large rational SDPs even if the affine constraints are highly redundant and ill-conditioned. We additionally provide an algorithm that establishes the rank stability of the SDP in the NΦ→∞N_Φ\to \inftyNΦ​→∞ limit, which is needed to certify the bound in the thermodynamic limit. Beyond establishing a Laughlin gap greater than 1/1001/1001/100 in the thermodynamic limit and revealing a potential method for deriving spectral gap lower bounds for other pseudopotentials, our work provides a general method for turning numerical SDP bounds into rigorous mathematical proofs, which may have wide applicability. In particular, this work demonstrates that bootstrap methods can be used to rigorously resolve major open problems in quantum many-body physics.