Algorithmic cooling can be used to find correlated states of many-body quantum systems. It is based on quantum circuits that perform nonunitary operations, whose implementation can be challenging on near-term quantum computers. In this work we develop a method that uses inherent qubit noise to implement nonunitary operations and algorithmic cooling. In our approach, qubit decay during quantum computation is used to simulate dissipation of auxiliary-spin bath, which cools down a simulated system towards its ground state. We test the algorithm on IBM-Q devices and demonstrate the relaxation of system spins to ferromagnetic and antiferromagnetic ordering, controlled by the definition of the system Hamiltonian. The ordering is stable as long as the algorithm is run. We are able to perform cooling and state stabilization for global systems of up to three system spins and four auxiliary spins. Our work paves the way for useful quantum simulations of many-body quantum systems on near-term quantum computers.
Algorithmic cooling can be used to find correlated states of many-body quantum systems. It is based on quantum circuits that perform nonunitary operations, whose implementation can be challenging on near-term quantum computers. In this work we develop a method that uses inherent qubit noise to implement nonunitary operations and algorithmic cooling. In our approach, qubit decay during quantum computation is used to simulate dissipation of auxiliary-spin bath, which cools down a simulated system towards its ground state. We test the algorithm on IBM-Q devices and demonstrate the relaxation of system spins to ferromagnetic and antiferromagnetic ordering, controlled by the definition of the system Hamiltonian. The ordering is stable as long as the algorithm is run. We are able to perform cooling and state stabilization for global systems of up to three system spins and four auxiliary spins. Our work paves the way for useful quantum simulations of many-body quantum systems on near-term quantum computers.
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.
Quantum cooling, a deterministic process that drives any state to the lowest eigenstate, has been widely used from studying ground state properties of chemistry and condensed matter quantum physics, to general optimization problems. However, the cooling procedure is generally non-unitary, hence its realization on a quantum computer either requires deep circuits or assumes specific input states with variational circuits. Here, we propose universal quantum cooling algorithms that overcome these limitations. By utilizing a dual phase representation of decaying functions, we show how to universally and deterministically realize a general cooling procedure with shallow quantum circuits. We demonstrate its applications in cooling an arbitrary input state with known ground state energy, corresponding to satisfactory, linear algebra tasks, and quantum state compiling tasks, and preparing unknown eigenvalues and eigenstates, corresponding to quantum many-body problems. Compared to quantum phase estimation, our method uses only one ancillary qubit and much shallower circuits, showing exponential improvement of the circuit complexity with respect to the final state infidelity. We numerically benchmark the algorithms for the 8-qubit Heisenberg model and verify its feasibility for accurately finding eigenenergies and obtaining eigenstate measurements. Our work paves the way for efficient and universal quantum algorithmic cooling with near-term as well as universal fault-tolerant quantum devices.
We introduce a Basis Adaptive (BA) algorithm for hybrid quantum-classical simulation of correlated quantum many-body systems. Starting from a small set of physically motivated bitstrings, the algorithm iteratively applies a single-step first-order Trotterized circuit on a quantum processor, filters the sampled configurations by enforcing U(1) spin conservation and lattice reflection symmetry, and classically diagonalizes the Hamiltonian in the resulting reduced Hilbert space. This design avoids the variational optimization overhead of VQE, the deep coherent circuits required by QPE, and the symmetry-violating subspaces that arise in SKQD. The ground-state energy error is bounded analytically by 8∥H∥(1−αDT)1/2, where αDT is the probability weight captured by the DT sampled basis states. This bound connects algorithm performance directly to ground-state sparsity and explains the observed accuracy hierarchy across different phases. Benchmarked on the spin-1/2 Heisenberg XXZ chain (up to N=62 qubits on the IBM Heron processor), the algorithm achieves a 3.5% energy error in the gapped Neel phase (Δ=2.0) and below 0.5% at the ferromagnetic boundary (Δ=−1.0). The accuracy degrades to 28.7% in the strongly quasi-long-range-ordered regime (Δ=0.5). Spin-spin correlation functions are reproduced across all regimes, confirming that symmetry-filtered real-time sampling provides a practical and noise-resilient pathway to ground-state properties on near-term quantum hardware.
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.
We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field—the Hubbard atom. These problems are solved using IBM quantum computers, showing no signs of decreasing fidelity at long times. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware. Our two examples show promise that the driven-dissipative quantum many-body problem can eventually be solved on quantum computers.
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.