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

Modular-Annihilator Parent Hamiltonians for Purified Gibbs States: Spectral Design and Controlled Approximation

Changhao Yi, Jun Takahashi, Cunlu Zhou

quant-phSubmitted Aug 31, 2026• Announced Sep 1, 2026• 3 citations
arXivHTMLPDF

Abstract

Purified Gibbs states provide a bridge between finite-temperature physics, dissipative dynamics, and ground-state methods. In this work, we study the exact finite sum-of-squares (SoS) construction of their parent Hamiltonians and the associated Lindbladian based on modular annihilators. Given a finite set of Hermitian generators, the corresponding modular annihilators yield a frustration-free SoS representation without continuous time integrals or an explicit decomposition into Bohr-frequency sectors. The purified Gibbs state remains a common zero mode while the freedom to choose and combine the generators can be used to optimize the spectral properties of the parent Hamiltonian. For free-fermion Hamiltonians, modular transformations act linearly on Majorana operators, leading to an analytically solvable family of parent Hamiltonians parameterized by a real symmetric coefficient matrix \(S\). For the scalar-functional subclass $S=f(h)$, we show that, at fixed operator norm, the choice $S_{\mathrm{opt}}\propto 1/\sqrt{\cosh(2βh)}$ has mixing time upper bound $2\log(2N/ε)$ for any $β$, which exhibits rapid mixing and is irrelevant to the inverse temperature $β$. For interacting systems, where the modularly dressed generators are not available in closed form, we introduce a Krylov--Lanczos approximation scheme and bound the resulting ground-state error in terms of the modular-approximation error and the parent-Hamiltonian gap. Numerical results illustrate the free-fermion spectral advantage and show how the accuracy of the interacting construction depends on temperature, interaction strength, and Krylov dimension.

Comments
41 pages, 4 figures

Related papers

Rapid Mixing of Quantum Gibbs Samplers for Weakly-Interacting Quantum Systems

Štěpán Šmíd, Meister, Richard, Mario Berta +1 more

Dissipative quantum algorithms for state preparation in many-body systems are increasingly recognised as promising candidates for achieving large quantum advantages in application-relevant tasks. Recent advances in algorithmic, detailed-balance Lindbladians enable the efficient simulation of open-system dynamics converging towards desired target states. However, the overall complexity of such schemes is governed by system-size dependent mixing times. In this work, we analyse algorithmic Lindbladians for Gibbs state preparation and prove that they exhibit rapid mixing, i.e., convergence in time poly-logarithmic in the system size. We first establish this for non-interacting spin systems, free fermions, and free bosons, and then show that these rapid mixing results are stable under perturbations, covering weakly interacting qudits and perturbed non-hopping fermions. Further, we adapt the techniques from separable qudits to the fermionic setting and prove rapid mixing of the strongly-interacting regime of the Fermi-Hubbard model, for which we also explicitly evaluate the guaranteed parameter regimes. Our results constitute the first efficient mixing bounds for non-commuting qudit models and bosonic systems at arbitrary temperatures. Compared to prior spectral-gap-based results for fermions, we achieve exponentially faster mixing, further featuring explicit constants on the maximal allowed interaction strength. This not only improves the overall polynomial runtime for quantum Gibbs state preparation, but also enhances robustness against noise. Our analysis relies on oscillator norm techniques from mathematical physics, where we introduce tailored variants adapted to specific Lindbladians $\unicode{x2014}$ an innovation that we expect to significantly broaden the scope of these methods.

arXiv:2510.04954•Oct 6, 2025•29 citations

From Heat to Homology: Spectral Gap Transfer for Exact Quantum Gibbs Sampling at All Temperatures

Caesnan M. G. Leditto, Kuo-Chin Chen, Min-Hsiu Hsieh

Preparing Gibbs states through dissipative dynamics requires controlling convergence for the chosen Hamiltonian $H$ and coupling operators. However, efficient implementation requires convergence guarantees from the spectral gap of the generator of the dynamics, which remains a crucial challenge. Recent results address the challenge by restricting the dynamics with structural assumptions about the Hamiltonian and its interactions. For the Chen-Kastoryano-Gilyen (CKG) construction and arbitrary finite-dimensional Hamiltonians, we prove an explicit comparison that converts a spectral gap estimate for the infinite-temperature generator into a lower bound on the spectral gap of the CKG quantum Gibbs sampler at every finite positive inverse temperature $β$. It allows a single spectral gap estimate at infinite temperature to certify convergence across Hamiltonians and temperatures. Such an estimate is often known from a classical spectral gap estimate, such as the classical random walk spectral gap. For Hodge Laplacians of simplicial complexes as Hamiltonians, we construct coupling operators whose generator at infinite temperature has the same spectral gap as a classical simplicial down-up walk. A positive spectral gap of the walk and bounded spectral width $W=λ_{\max}(H)-λ_{\min}(H)$ give a generator spectral gap independent of the number of simplices at every fixed temperature. We then establish conditions under which the sampler approximately prepares zero-energy (harmonic) states in polynomial evolution time. This provides a conditional convergence guarantee for the state preparation in the thermal approach to quantum topological data analysis.

quant-pharXiv:2610.02859•Oct 5, 2026•0 citations

Quantum Gibbs sampling through the detectability lemma

Di Fang, Jianfeng Lu, Yu Tong +1 more

Gibbs state preparation is an important subroutine in quantum computing. In this work we use the detectability lemma to improve Gibbs state preparation. Specifically, we design new Gibbs state preparation methods that do not rely on simulating Lindbladian evolution, thus avoiding the overhead from it. For local Lindbladians consisting of $M$ terms, this approach reduces the cost by a factor of $O(M)$. We also combine the detectability lemma operator and quantum singular value transformation to implement ground state projection operators of frustration-free Hamiltonians, resulting in a quadratic speedup in the spectral gap dependence. Applying this method to Lindbladians for the Gibbs state of local commuting Hamiltonians, we achieve quadratically better dependence on the Lindbladian spectral gap.

quant-pharXiv:2604.07214•PRX Quantum•Apr 9, 2026•7 citations

An efficient and exact noncommutative quantum Gibbs sampler

Chi-Fang Chen, Michael J. Kastoryano, András Gilyén

Preparing thermal and ground states is an essential quantum algorithmic task for quantum simulation. In this work, we construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary noncommutative Hamiltonians. Our construction can also be regarded as a continuous-time quantum analog of the Metropolis-Hastings algorithm. To prepare the quantum Gibbs state, our algorithm invokes Hamiltonian simulation for a time proportional to the mixing time and the inverse temperature $β$, up to polylogarithmic factors. Moreover, the gate complexity reduces significantly for lattice Hamiltonians as the corresponding Lindblad operators are (quasi-) local (with radius $\simβ$) and only depend on local Hamiltonian patches. Meanwhile, purifying our Lindbladians yields a temperature-dependent family of frustration-free "parent Hamiltonians", prescribing an adiabatic path for the canonical purified Gibbs state (i.e., the Thermal Field Double state). These favorable features suggest that our construction serves as a quantum algorithmic counterpart to classical Markov chain Monte Carlo sampling.

arXiv:2311.09207•Nov 15, 2023•204 citations

Exhaustive Construction of Generalized Parent Hamiltonians for Matrix Product States

He-Ran Wang, Lorenzo Gotta, Sanjay Moudgalya

Characterizing local Hamiltonians that host interesting many-body states as eigenstates has been an important problem in quantum many-body physics. For matrix product states (MPS), there is a well-known construction of parent Hamiltonians that have the MPS as the frustration-free ground state. However, recent results on quantum many-body scars have shown that such a construction does not exhaust all possible Hamiltonians that have the MPS as an eigenstate. In this work, we develop an exhaustive construction of generalized parent Hamiltonians that have a given translation-invariant MPS as an eigenstate. These go beyond the conventional projector-based construction of frustration-free parent Hamiltonians, where each local Hermitian term has the MPS as an eigenstate, by allowing non-Hermitian telescoping terms that cancel out with periodic boundary conditions (PBC). We derive a local tensor equation that establishes a correspondence between inequivalent classes of generalized parent Hamiltonians, i.e., those that cannot be related using linear combinations with frustration-free Hamiltonians, and the MPS transfer matrix spectrum. We illustrate the connection to intrinsic physical properties, including non-Abelian symmetries and zero correlation length, and further extend this construction to block-injective MPS. Our framework hence provides a systematic bridge between generalized parent Hamiltonians and the local structure of quantum states.

quant-pharXiv:2611.00203•Nov 3, 2026•0 citations

Mixing Time of Quantum Gibbs Sampling for Random Sparse Hamiltonians

Akshar Ramkumar, Mehdi Soleimanifar

Providing evidence that quantum computers can efficiently prepare low-energy or thermal states of physically relevant interacting quantum systems is a major challenge in quantum information science. A newly developed quantum Gibbs sampling algorithm [Chen et al., 2023] provides an efficient simulation of the detailed-balanced dissipative dynamics of non-commutative quantum systems. The running time of this algorithm depends on the mixing time of the corresponding quantum Markov chain, which has not been rigorously bounded except in the high-temperature regime. In this work, we establish a polylog(n) upper bound on its mixing time for various families of random n × n sparse Hamiltonians at any constant temperature. We further analyze how the choice of the jump operators for the algorithm and the spectral properties of these sparse Hamiltonians influence the mixing time. Our result places this method for Gibbs sampling on par with other efficient algorithms for preparing low-energy states of quantumly easy Hamiltonians.

arXiv:2411.04454•Leibniz international proceedings in informatics•Nov 7, 2024•19 citations
Purified Gibbs states provide a bridge between finite-temperature physics, dissipative dynamics, and ground-state methods. In this work, we study the exact finite sum-of-squares (SoS) construction of their parent Hamiltonians and the associated Lindbladian based on modular annihilators. Given a finite set of Hermitian generators, the corresponding modular annihilators yield a frustration-free SoS representation without continuous time integrals or an explicit decomposition into Bohr-frequency sectors. The purified Gibbs state remains a common zero mode while the freedom to choose and combine the generators can be used to optimize the spectral properties of the parent Hamiltonian. For free-fermion Hamiltonians, modular transformations act linearly on Majorana operators, leading to an analytically solvable family of parent Hamiltonians parameterized by a real symmetric coefficient matrix (S). For the scalar-functional subclass S=f(h)S=f(h)S=f(h), we show that, at fixed operator norm, the choice Sopt∝1/cosh⁡(2βh)S_{\mathrm{opt}}\propto 1/\sqrt{\cosh(2βh)}Sopt​∝1/cosh(2βh)​ has mixing time upper bound 2log⁡(2N/ε)2\log(2N/ε)2log(2N/ε) for any βββ, which exhibits rapid mixing and is irrelevant to the inverse temperature βββ. For interacting systems, where the modularly dressed generators are not available in closed form, we introduce a Krylov--Lanczos approximation scheme and bound the resulting ground-state error in terms of the modular-approximation error and the parent-Hamiltonian gap. Numerical results illustrate the free-fermion spectral advantage and show how the accuracy of the interacting construction depends on temperature, interaction strength, and Krylov dimension.
Dissipative quantum algorithms for state preparation in many-body systems are increasingly recognised as promising candidates for achieving large quantum advantages in application-relevant tasks. Recent advances in algorithmic, detailed-balance Lindbladians enable the efficient simulation of open-system dynamics converging towards desired target states. However, the overall complexity of such schemes is governed by system-size dependent mixing times. In this work, we analyse algorithmic Lindbladians for Gibbs state preparation and prove that they exhibit rapid mixing, i.e., convergence in time poly-logarithmic in the system size. We first establish this for non-interacting spin systems, free fermions, and free bosons, and then show that these rapid mixing results are stable under perturbations, covering weakly interacting qudits and perturbed non-hopping fermions. Further, we adapt the techniques from separable qudits to the fermionic setting and prove rapid mixing of the strongly-interacting regime of the Fermi-Hubbard model, for which we also explicitly evaluate the guaranteed parameter regimes. Our results constitute the first efficient mixing bounds for non-commuting qudit models and bosonic systems at arbitrary temperatures. Compared to prior spectral-gap-based results for fermions, we achieve exponentially faster mixing, further featuring explicit constants on the maximal allowed interaction strength. This not only improves the overall polynomial runtime for quantum Gibbs state preparation, but also enhances robustness against noise. Our analysis relies on oscillator norm techniques from mathematical physics, where we introduce tailored variants adapted to specific Lindbladians $\unicode{x2014}$ an innovation that we expect to significantly broaden the scope of these methods.
Preparing Gibbs states through dissipative dynamics requires controlling convergence for the chosen Hamiltonian HHH and coupling operators. However, efficient implementation requires convergence guarantees from the spectral gap of the generator of the dynamics, which remains a crucial challenge. Recent results address the challenge by restricting the dynamics with structural assumptions about the Hamiltonian and its interactions. For the Chen-Kastoryano-Gilyen (CKG) construction and arbitrary finite-dimensional Hamiltonians, we prove an explicit comparison that converts a spectral gap estimate for the infinite-temperature generator into a lower bound on the spectral gap of the CKG quantum Gibbs sampler at every finite positive inverse temperature βββ. It allows a single spectral gap estimate at infinite temperature to certify convergence across Hamiltonians and temperatures. Such an estimate is often known from a classical spectral gap estimate, such as the classical random walk spectral gap. For Hodge Laplacians of simplicial complexes as Hamiltonians, we construct coupling operators whose generator at infinite temperature has the same spectral gap as a classical simplicial down-up walk. A positive spectral gap of the walk and bounded spectral width W=λmax⁡(H)−λmin⁡(H)W=λ_{\max}(H)-λ_{\min}(H)W=λmax​(H)−λmin​(H) give a generator spectral gap independent of the number of simplices at every fixed temperature. We then establish conditions under which the sampler approximately prepares zero-energy (harmonic) states in polynomial evolution time. This provides a conditional convergence guarantee for the state preparation in the thermal approach to quantum topological data analysis.
Gibbs state preparation is an important subroutine in quantum computing. In this work we use the detectability lemma to improve Gibbs state preparation. Specifically, we design new Gibbs state preparation methods that do not rely on simulating Lindbladian evolution, thus avoiding the overhead from it. For local Lindbladians consisting of MMM terms, this approach reduces the cost by a factor of O(M)O(M)O(M). We also combine the detectability lemma operator and quantum singular value transformation to implement ground state projection operators of frustration-free Hamiltonians, resulting in a quadratic speedup in the spectral gap dependence. Applying this method to Lindbladians for the Gibbs state of local commuting Hamiltonians, we achieve quadratically better dependence on the Lindbladian spectral gap.
Preparing thermal and ground states is an essential quantum algorithmic task for quantum simulation. In this work, we construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary noncommutative Hamiltonians. Our construction can also be regarded as a continuous-time quantum analog of the Metropolis-Hastings algorithm. To prepare the quantum Gibbs state, our algorithm invokes Hamiltonian simulation for a time proportional to the mixing time and the inverse temperature βββ, up to polylogarithmic factors. Moreover, the gate complexity reduces significantly for lattice Hamiltonians as the corresponding Lindblad operators are (quasi-) local (with radius ∼β\simβ∼β) and only depend on local Hamiltonian patches. Meanwhile, purifying our Lindbladians yields a temperature-dependent family of frustration-free "parent Hamiltonians", prescribing an adiabatic path for the canonical purified Gibbs state (i.e., the Thermal Field Double state). These favorable features suggest that our construction serves as a quantum algorithmic counterpart to classical Markov chain Monte Carlo sampling.
Characterizing local Hamiltonians that host interesting many-body states as eigenstates has been an important problem in quantum many-body physics. For matrix product states (MPS), there is a well-known construction of parent Hamiltonians that have the MPS as the frustration-free ground state. However, recent results on quantum many-body scars have shown that such a construction does not exhaust all possible Hamiltonians that have the MPS as an eigenstate. In this work, we develop an exhaustive construction of generalized parent Hamiltonians that have a given translation-invariant MPS as an eigenstate. These go beyond the conventional projector-based construction of frustration-free parent Hamiltonians, where each local Hermitian term has the MPS as an eigenstate, by allowing non-Hermitian telescoping terms that cancel out with periodic boundary conditions (PBC). We derive a local tensor equation that establishes a correspondence between inequivalent classes of generalized parent Hamiltonians, i.e., those that cannot be related using linear combinations with frustration-free Hamiltonians, and the MPS transfer matrix spectrum. We illustrate the connection to intrinsic physical properties, including non-Abelian symmetries and zero correlation length, and further extend this construction to block-injective MPS. Our framework hence provides a systematic bridge between generalized parent Hamiltonians and the local structure of quantum states.
Providing evidence that quantum computers can efficiently prepare low-energy or thermal states of physically relevant interacting quantum systems is a major challenge in quantum information science. A newly developed quantum Gibbs sampling algorithm [Chen et al., 2023] provides an efficient simulation of the detailed-balanced dissipative dynamics of non-commutative quantum systems. The running time of this algorithm depends on the mixing time of the corresponding quantum Markov chain, which has not been rigorously bounded except in the high-temperature regime. In this work, we establish a polylog(n) upper bound on its mixing time for various families of random n × n sparse Hamiltonians at any constant temperature. We further analyze how the choice of the jump operators for the algorithm and the spectral properties of these sparse Hamiltonians influence the mixing time. Our result places this method for Gibbs sampling on par with other efficient algorithms for preparing low-energy states of quantumly easy Hamiltonians.