Preparation of low-energy quantum many-body states has a wide range of applications in quantum information processing and condensed-matter physics. Quantum cooling algorithms offer a promising alternative to other methods based, for instance, on variational and adiabatic principles, or on dissipative state preparation. In this work, we investigate a set of cooling algorithms in a simple, solvable fermionic model that allows us to identify the mechanisms that underlie the cooling process and, also, those that prevent it. We derive analytical expressions for the cooling dynamics, steady states, and cooling rates in the weak-coupling limit. We find that multifrequency and randomized cycle strategies can significantly enhance the performance of the quantum algorithm and circumvent some of the obstacles. We also analyze the effects of noise and evaluate the conditions under which cooling remains feasible. Furthermore, we present optimized cooling protocols that can significantly enhance cooling performance in the presence of noise. Additionally, we compare cooling and dissipative state preparation and show that, in the model analyzed here, cooling generally achieves lower energies and is more resilient to noise.
Preparation of low-energy quantum many-body states has a wide range of applications in quantum information processing and condensed-matter physics. Quantum cooling algorithms offer a promising alternative to other methods based, for instance, on variational and adiabatic principles, or on dissipative state preparation. In this work, we investigate a set of cooling algorithms in a simple, solvable fermionic model that allows us to identify the mechanisms that underlie the cooling process and, also, those that prevent it. We derive analytical expressions for the cooling dynamics, steady states, and cooling rates in the weak-coupling limit. We find that multifrequency and randomized cycle strategies can significantly enhance the performance of the quantum algorithm and circumvent some of the obstacles. We also analyze the effects of noise and evaluate the conditions under which cooling remains feasible. Furthermore, we present optimized cooling protocols that can significantly enhance cooling performance in the presence of noise. Additionally, we compare cooling and dissipative state preparation and show that, in the model analyzed here, cooling generally achieves lower energies and is more resilient to noise.
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.
Probing correlated states of many-body systems is one of the central tasks for quantum simulators and processors. A promising approach to state preparation is to realize desired correlated states as steady states of engineered dissipative evolution. A recent experiment with a Google superconducting quantum processor [X. Mi , Science 383, 1332 (2024)] demonstrated a cooling algorithm utilizing auxiliary degrees of freedom that are periodically reset to remove quasiparticles from the system, thereby driving it towards its ground state. In this work, we develop a kinetic-theory framework to describe quasiparticle cooling dynamics, and employ it to compare the efficiency of different cooling algorithms. In particular, we introduce a protocol where coupling to auxiliaries is modulated in time to minimize heating processes, and demonstrate that it allows a high-fidelity preparation of ground states in different quantum phases. We verify the validity of the kinetic-theory description by an extensive comparison with numerical simulations for the examples of a one-dimensional transverse-field Ising model, the transverse-field Ising model with an additional integrability-breaking field, and a nonintegrable antiferromagnetic Heisenberg spin ladder. In all cases, we are able to efficiently cool into the many-body ground state. The effects of noise, which limits efficiency of variational quantum algorithms in near-term quantum processors, are investigated through the lens of the kinetic theory: we show how the steady-state quasiparticle populations depend on the noise rate, and we establish maximum noise values for achieving high-fidelity ground states. This work establishes quasiparticle cooling algorithms as a practical, robust method for many-body state preparation on near-term quantum processors.
We compare the performance of representative cooling, adiabatic, and optimization algorithms for ground-state preparation in the presence of noise. Using an exactly solvable family of quadratic fermionic Hamiltonians subject to depolarizing noise, we derive the scaling of the achievable relative energy as a function of the noise rate and support these results with numerical simulations. The Hamiltonian exhibits two phases, separated by a quantum phase transition. As expected, the performance of the different algorithms depends on the phase: adiabatic evolution is favorable in the trivial phase, while a multi-frequency cooling algorithm, as proposed in [1], becomes competitive or superior in the topological phase, where gap-closing limits adiabatic protocols. We further present numerical results for the quantum approximate optimization algorithm [2], showing that it performs competitively with cooling in the trivial phase but is typically outperformed in the topological regime. Finally, we show that for this model the cooling protocol exhibits enhanced robustness to parameter imperfections, highlighting its potential advantage for realistic implementations of noisy quantum state preparation.
The analytical approach developed here, in conjunction with numerical validation, establishes an extendable approach to benchmarking ground-state preparation algorithms.
We compare the performance of representative cooling, adiabatic, and optimization algorithms for ground-state preparation in the presence of noise. Using an exactly solvable family of quadratic fermionic Hamiltonians subject to depolarizing noise, we derive the scaling of the achievable relative energy as a function of the noise rate and support these results with numerical simulations. The Hamiltonian exhibits two phases, separated by a quantum phase transition. As expected, the performance of the different algorithms depends on the phase: adiabatic evolution is favorable in the trivial phase, while a multi-frequency cooling algorithm, as proposed in [1], becomes competitive or superior in the topological phase, where gap-closing limits adiabatic protocols. We further present numerical results for the quantum approximate optimization algorithm [2], showing that it performs competitively with cooling in the trivial phase but is typically outperformed in the topological regime. Finally, we show that for this model the cooling protocol exhibits enhanced robustness to parameter imperfections, highlighting its potential advantage for realistic implementations of noisy quantum state preparation. The analytical approach developed here, in conjunction with numerical validation, establishes an extendable approach to benchmarking ground-state preparation algorithms.
We investigate and compare two particle number-conserving protocols for the preparation of a topologically nontrivial state. The first is derived from thermally coupling the system to a cold bath, while the second is based on engineered dissipation. We numerically study the time required to reach the target state as well as its robustness against physically important perturbations. Crucially, in both protocols, the cooling capability is limited by dissipatively induced diffusion processes. The resulting quadratic scaling of the cooling time with system size is also corroborated analytically using mean-field approximations and a purely classical random-walk model. Furthermore, we find that the engineered protocol admits a unique and stable dark state, which contributes to an ongoing discussion regarding the applicability of dissipative state preparation to many-body systems.
The field of quantum information has inspired new methods for cooling physical systems at the quantum scale by manipulating entropy in an algorithmic way, such as heat-bath algorithmic cooling (HBAC). These methods not only provide fundamental insight into quantum thermodynamics, but they are also at the core of practical applications in quantum science and quantum technologies. Arguably, the most promising practical applications are in quantum computing, for the preparation of pure states. The ability to prepare highly pure states is required both for initializing qubits in most quantum algorithms and for supplying reliable low-noise ancilla qubits that satisfy the fault-tolerance threshold for quantum error correction (achieving the high levels of purity required represents one of the major challenges not only for ensemble implementations but also for technologies with strong but not perfect projective measurements). \n \n \nThe heat bath algorithmic cooling protocols have inspired the work within this thesis, which examines and proposes powerful new techniques that significantly enhance cooling by taking advantage of classical and quantum correlations. These new methods go beyond the limits of conventional cooling techniques, providing a novel way to cool that allows a generalized interaction of the system with the environment, which has not been taken into account in previous work. Concretely, I have contributed to elucidating our understanding of these algorithmic cooling mechanisms by using techniques from quantum information theory and quantum thermodynamics. First, I found the analytical solution of the maximum achievable cooling of these algorithmic cooling methods, which had been a longstanding problem that remained open for almost 15 years. Then, I showed how to circumvent the cooling limits of the conventional algorithmic cooling – which were widely believed to be optimal –, creating novel methods that show how correlations can be used to significantly improve cooling. On the one hand, we fundamentally changed the way previous methods considered the interactions between the system and environment and showed how correlated relaxation processes can be essential for enhancing cooling. On the other hand, we demonstrated that correlations present in the initial state due to internal interactions can be exploited to improve cooling. Finally, we showed how, by using ideas and concepts from resource theory, it is possible to find the optimal entropy compression required for HBAC by studying the n-to-1 distillation of athermality of two level systems.