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:2403.14506 · Quantum

Efficient Quantum Cooling Algorithm for Fermionic Systems

Lucas Marti, Refik Mansuroglu, Michael J. Hartmann

Published Feb 18, 2025• 9 citations
arXivHTMLPDF

Abstract

We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known ground state. We derive suitable interaction Hamiltonians that originate from ladder operators of the free theory and initiate resonant gaps between system and fridge. We further propose a spectroscopic scan to find the relevant eigenenergies of the system using energy measurements on the fridge. With these insights, we design a ground state cooling algorithm for fermionic systems that is efficient, i.e. its runtime is polynomial in the system size, as long as the initial state is prepared in a low-energy sector of polynomial size. We achieve the latter via a pseudo-adiabatic sweep from a parameter regime whose ground state can be easily prepared. We estimate that our algorithm has a polynomial runtime for systems where the spectral gap decreases at most polynomially in system size, and is faster than the adiabatic algorithm for a large range of settings. We generalize the algorithm to prepare thermal states and demonstrate our findings on the Fermi-Hubbard model.

DOI
10.22331/q-2025-02-18-1635

Related papers

Ground State Preparation via Dynamical Cooling

Danial Motlagh, Modjtaba Shokrian Zini, Juan Miguel Arrazola +1 more

Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which can be challenging for large, strongly-correlated systems. This issue has motivated the study of physically-inspired dynamical approaches such as thermodynamic cooling. In this work, we introduce a ground-state preparation algorithm based on the simulation of quantum dynamics. Our main insight is to transform the Hamiltonian by a shifted sign function via quantum signal processing, effectively mapping eigenvalues into positive and negative subspaces separated by a large gap. This automatically ensures that all states within each subspace conserve energy with respect to the transformed Hamiltonian. Subsequent time-evolution with a perturbed Hamiltonian induces transitions to lower-energy states while preventing unwanted jumps to higher energy states. The approach does not rely on a priori knowledge of energy gaps and requires no additional qubits to model a bath. Furthermore, it makes $\tilde{\mathcal{O}}(d^{\,3/2}/ε)$ queries to the time-evolution operator of the system and $\tilde{\mathcal{O}}(d^{\,3/2})$ queries to a block-encoding of the perturbation, for $d$ cooling steps and an $ε$-accurate energy resolution. Our results provide a framework for combining quantum signal processing and Hamiltonian simulation to design heuristic quantum algorithms for ground-state preparation.

arXiv:2404.05810•Apr 8, 2024•26 citations

Polynomial-time quantum Gibbs sampling for the weak and strong coupling regime of the Fermi-Hubbard model at any temperature

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

Quantum computers hold the potential to revolutionise the simulation of quantum many-body systems, with profound implications for fundamental physics and applications like molecular and material design. However, demonstrating quantum advantage in simulating quantum systems of practical relevance remains a significant challenge. In this work, we introduce a quantum algorithm for preparing Gibbs states of interacting fermions on a lattice with provable polynomial resource requirements. Our approach builds on recent progress in theoretical computer science that extends classical Markov chain Monte Carlo methods to the quantum domain. We derive a bound on the mixing time for quantum Gibbs state preparation by showing that the generator of the quantum Markovian evolution is gapped at any temperature up to a maximal interaction strength. This enables the efficient preparation of low-temperature states of weakly interacting fermions and the calculation of their free energy. We present exact numerical simulations for small system sizes that support our results and identify well-suited algorithmic choices for simulating the Fermi-Hubbard model beyond our rigorous guarantees.

arXiv:2501.01412•Nature Communications•Nov 28, 2025•34 citations

Sublinear thermal state and ground state preparation for free fermions via system-bath interaction

Zhiyan Ding, Lin Lin, Ke Wang

Dissipative algorithms for preparing thermal and ground states typically require a total Hamiltonian simulation time that grows at least linearly with system size $N$, even when their mixing time grows only polylogarithmically. We achieve sublinear simulation time for free fermions by engineering local interactions with a bath whose size grows in proportion to the system size. Starting from arbitrary initial states, our thermal state preparation algorithm achieves trace-norm error $ε$ in total simulation time $\widetilde{O}(\sqrt{N}/ε)$ at fixed inverse temperature and bounded single-particle bandwidth, while ground state preparation of gapped systems requires only $\mathrm{polylog}(N/ε)$ time. We further establish lower bounds for thermal state preparation within the bath protocols considered, identifying two obstacles to faster preparation, namely fourth-order deviations from the target thermal state and fluctuations induced by a random frequency shared by all bath qubits. Our results demonstrate that the linear simulation time barrier in dissipative state preparation can be overcome and clarify the bath and filter-design constraints that govern further complexity improvements.

quant-pharXiv:2610.35370•Oct 27, 2026•0 citations

Quantum digital cooling

Stefano Polla, Yaroslav Herasymenko, Thomas E. O’Brien

We introduce a method for digital preparation of ground states of simulated Hamiltonians, inspired by cooling in nature and adapted to leverage the capabilities of digital quantum hardware. The cold bath is simulated by a single ancillary qubit, which is reset periodically and coupled to the system nonperturbatively. Studying this cooling method on a 1-qubit system toy model, we optimize two cooling protocols based on weak-coupling and strong-coupling approaches. Extending the insight from the 1-qubit system model, we develop two scalable protocols for larger systems. The LogSweep protocol extends the weak-coupling approach by sweeping energies to resonantly match any targeted transition. We test LogSweep on the 1D transverse-field Ising model, demonstrating approximate ground-state preparation with an error that can be made polynomially small in the computation time for all three phases of the system. The BangBang protocol extends the strong-coupling approach, and exploits a heuristics for local Hamiltonians to maximize the probability of deexciting system transitions in the shortest possible time. Although this protocol does not promise long-time convergence, it allows for a rapid cooling to an approximation of the ground state, making this protocol appealing for near-term demonstrations.

arXiv:1909.10538•Physical Review A•Jul 15, 2021•38 citations

Model-agnostic cooling algorithms for strongly interacting fermions

Henning Schlömer, Liyuan Chen, Susanne F. Yelin +1 more

Strongly interacting fermions underpin some of the most challenging problems in condensed matter physics, such as high-temperature superconductivity. The low-energy states of these systems encode their essential microscopic properties, yet remain largely inaccessible to classical methods. Quantum simulation offers a promising path forward, and among state-preparation strategies, engineered dissipation has emerged as a particularly compelling approach. Existing cooling protocols, however, typically rely on knowledge of the quasiparticle spectrum or mappings to free-fermion limits. In this letter, we introduce a randomized, symmetry-preserving cooling algorithm that requires no spectral information, using only local coupling operators to ancilla degrees of freedom with randomly sampled energy splittings to drive generic fermionic systems toward their low-energy manifold. We benchmark the protocol on canonical correlated fermionic models relevant to high-temperature superconductors, spanning metallic, density-wave, paired, superconducting, and phase-separated phases. Across all models, we observe universal cooling behavior: monotonic energy relaxation, concentration of spectral weight at low energies, and stabilization of correlated ground-state order. Our results establish randomized dissipative cooling as a general strategy for preparing strongly correlated fermionic states on programmable quantum devices.

cond-mat.str-elCross-listedarXiv:2605.01029•May 5, 2026•4 citations

Efficiently preparing chiral states via fermionic cooling on bosonic quantum hardware

Gilad Kishony, Mark Spencer Rudner, Erez Berg

Simulating many-body systems is one of the most promising applications of near-term quantum computers. An important open question is how to efficiently prepare the ground states of arbitrary fermionic Hamiltonians, especially those with nontrivial topology. Here, we propose an efficient protocol for preparing low-energy states of fermionic Hamiltonians on a noisy bosonic quantum simulator by adiabatic cooling using a simulated bath. We arrange the couplings such that the simulated system and bath together obtain a local fermionic description in which fermionic excitations can be extracted individually, via coherent hopping to the bath, rather than in pairs as would otherwise be required by fermion parity conservation. This approach thus achieves a linear (rather than quadratic) scaling of the cooling rate vs. excitation density at low densities. We show that certain topological phases such as the chiral (non-Abelian) phase of the Kitaev honeycomb model can be prepared efficiently using our protocol. Our protocol performs favorably in the presence of noise, making it suitable for execution on near-term quantum devices. Simulating many-body systems is a promising application of near-term quantum computers; however, preparing ground states of fermions on a quantum computer is challenging, especially if the ground state is topologically non-trivial. The authors propose a protocol to prepare the ground state of arbitrary fermionic Hamiltonians, which is particularly suitable for topological chiral states.

arXiv:2409.02177•Communications Physics•Feb 21, 2025•1 citation
We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known ground state. We derive suitable interaction Hamiltonians that originate from ladder operators of the free theory and initiate resonant gaps between system and fridge. We further propose a spectroscopic scan to find the relevant eigenenergies of the system using energy measurements on the fridge. With these insights, we design a ground state cooling algorithm for fermionic systems that is efficient, i.e. its runtime is polynomial in the system size, as long as the initial state is prepared in a low-energy sector of polynomial size. We achieve the latter via a pseudo-adiabatic sweep from a parameter regime whose ground state can be easily prepared. We estimate that our algorithm has a polynomial runtime for systems where the spectral gap decreases at most polynomially in system size, and is faster than the adiabatic algorithm for a large range of settings. We generalize the algorithm to prepare thermal states and demonstrate our findings on the Fermi-Hubbard model.
Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which can be challenging for large, strongly-correlated systems. This issue has motivated the study of physically-inspired dynamical approaches such as thermodynamic cooling. In this work, we introduce a ground-state preparation algorithm based on the simulation of quantum dynamics. Our main insight is to transform the Hamiltonian by a shifted sign function via quantum signal processing, effectively mapping eigenvalues into positive and negative subspaces separated by a large gap. This automatically ensures that all states within each subspace conserve energy with respect to the transformed Hamiltonian. Subsequent time-evolution with a perturbed Hamiltonian induces transitions to lower-energy states while preventing unwanted jumps to higher energy states. The approach does not rely on a priori knowledge of energy gaps and requires no additional qubits to model a bath. Furthermore, it makes O~(d 3/2/ε)\tilde{\mathcal{O}}(d^{\,3/2}/ε)O~(d3/2/ε) queries to the time-evolution operator of the system and O~(d 3/2)\tilde{\mathcal{O}}(d^{\,3/2})O~(d3/2) queries to a block-encoding of the perturbation, for ddd cooling steps and an εεε-accurate energy resolution. Our results provide a framework for combining quantum signal processing and Hamiltonian simulation to design heuristic quantum algorithms for ground-state preparation.
Quantum computers hold the potential to revolutionise the simulation of quantum many-body systems, with profound implications for fundamental physics and applications like molecular and material design. However, demonstrating quantum advantage in simulating quantum systems of practical relevance remains a significant challenge. In this work, we introduce a quantum algorithm for preparing Gibbs states of interacting fermions on a lattice with provable polynomial resource requirements. Our approach builds on recent progress in theoretical computer science that extends classical Markov chain Monte Carlo methods to the quantum domain. We derive a bound on the mixing time for quantum Gibbs state preparation by showing that the generator of the quantum Markovian evolution is gapped at any temperature up to a maximal interaction strength. This enables the efficient preparation of low-temperature states of weakly interacting fermions and the calculation of their free energy. We present exact numerical simulations for small system sizes that support our results and identify well-suited algorithmic choices for simulating the Fermi-Hubbard model beyond our rigorous guarantees.
Dissipative algorithms for preparing thermal and ground states typically require a total Hamiltonian simulation time that grows at least linearly with system size NNN, even when their mixing time grows only polylogarithmically. We achieve sublinear simulation time for free fermions by engineering local interactions with a bath whose size grows in proportion to the system size. Starting from arbitrary initial states, our thermal state preparation algorithm achieves trace-norm error εεε in total simulation time O~(N/ε)\widetilde{O}(\sqrt{N}/ε)O(N​/ε) at fixed inverse temperature and bounded single-particle bandwidth, while ground state preparation of gapped systems requires only polylog(N/ε)\mathrm{polylog}(N/ε)polylog(N/ε) time. We further establish lower bounds for thermal state preparation within the bath protocols considered, identifying two obstacles to faster preparation, namely fourth-order deviations from the target thermal state and fluctuations induced by a random frequency shared by all bath qubits. Our results demonstrate that the linear simulation time barrier in dissipative state preparation can be overcome and clarify the bath and filter-design constraints that govern further complexity improvements.
We introduce a method for digital preparation of ground states of simulated Hamiltonians, inspired by cooling in nature and adapted to leverage the capabilities of digital quantum hardware. The cold bath is simulated by a single ancillary qubit, which is reset periodically and coupled to the system nonperturbatively. Studying this cooling method on a 1-qubit system toy model, we optimize two cooling protocols based on weak-coupling and strong-coupling approaches. Extending the insight from the 1-qubit system model, we develop two scalable protocols for larger systems. The LogSweep protocol extends the weak-coupling approach by sweeping energies to resonantly match any targeted transition. We test LogSweep on the 1D transverse-field Ising model, demonstrating approximate ground-state preparation with an error that can be made polynomially small in the computation time for all three phases of the system. The BangBang protocol extends the strong-coupling approach, and exploits a heuristics for local Hamiltonians to maximize the probability of deexciting system transitions in the shortest possible time. Although this protocol does not promise long-time convergence, it allows for a rapid cooling to an approximation of the ground state, making this protocol appealing for near-term demonstrations.
Strongly interacting fermions underpin some of the most challenging problems in condensed matter physics, such as high-temperature superconductivity. The low-energy states of these systems encode their essential microscopic properties, yet remain largely inaccessible to classical methods. Quantum simulation offers a promising path forward, and among state-preparation strategies, engineered dissipation has emerged as a particularly compelling approach. Existing cooling protocols, however, typically rely on knowledge of the quasiparticle spectrum or mappings to free-fermion limits. In this letter, we introduce a randomized, symmetry-preserving cooling algorithm that requires no spectral information, using only local coupling operators to ancilla degrees of freedom with randomly sampled energy splittings to drive generic fermionic systems toward their low-energy manifold. We benchmark the protocol on canonical correlated fermionic models relevant to high-temperature superconductors, spanning metallic, density-wave, paired, superconducting, and phase-separated phases. Across all models, we observe universal cooling behavior: monotonic energy relaxation, concentration of spectral weight at low energies, and stabilization of correlated ground-state order. Our results establish randomized dissipative cooling as a general strategy for preparing strongly correlated fermionic states on programmable quantum devices.
Simulating many-body systems is one of the most promising applications of near-term quantum computers. An important open question is how to efficiently prepare the ground states of arbitrary fermionic Hamiltonians, especially those with nontrivial topology. Here, we propose an efficient protocol for preparing low-energy states of fermionic Hamiltonians on a noisy bosonic quantum simulator by adiabatic cooling using a simulated bath. We arrange the couplings such that the simulated system and bath together obtain a local fermionic description in which fermionic excitations can be extracted individually, via coherent hopping to the bath, rather than in pairs as would otherwise be required by fermion parity conservation. This approach thus achieves a linear (rather than quadratic) scaling of the cooling rate vs. excitation density at low densities. We show that certain topological phases such as the chiral (non-Abelian) phase of the Kitaev honeycomb model can be prepared efficiently using our protocol. Our protocol performs favorably in the presence of noise, making it suitable for execution on near-term quantum devices. Simulating many-body systems is a promising application of near-term quantum computers; however, preparing ground states of fermions on a quantum computer is challenging, especially if the ground state is topologically non-trivial. The authors propose a protocol to prepare the ground state of arbitrary fermionic Hamiltonians, which is particularly suitable for topological chiral states.