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:2506.10059 · PRX Quantum

Cooling a Qubit Using n Others

Jake Xuereb, Benjamin Stratton, Alberto Rolandi, Jinming He, Marcus Huber, Pharnam Bakhshinezhad

Published Oct 29, 2025• 5 citations
arXivHTMLPDF

Abstract

In the task of unitarily cooling a quantum system with access to a larger quantum system, known as the machine or reservoir, ? Focusing on the task of cooling a single qubit given access to n separable, thermal qubits with arbitrary energy structure, we answer these questions by giving two new perspectives on this task. First, we show that a set of inequalities related to the energetic structure of the n -qubit machine determines the protocol which cools the qubit to the coldest reachable state, which parts of the machine contribute to this protocol and give rise to a Carnot-like bound. Second, we show that cooling protocols can be represented as perfect matchings on bipartite graphs enabling the optimization of cost functions, e.g., gate complexity or dissipation. Our results generalize the algorithmic cooling problem, establish new fundamental bounds on quantum cooling and offer a framework for designing novel autonomous thermal machines and cooling algorithms.

DOI
10.1103/hrph-dbv7

Related papers

Unifying Paradigms of Quantum Refrigeration: A Universal and Attainable Bound on Cooling

Fabien Clivaz, Ralph Silva, Géraldine Haack +3 more

Cooling quantum systems is arguably one of the most important thermodynamic tasks connected to modern quantum technologies and an interesting question from a foundational perspective. It is thus of no surprise that many different theoretical cooling schemes have been proposed, differing in the assumed control paradigm and complexity, and operating either in a single cycle or in steady state limits. Working out bounds on quantum cooling has since been a highly context dependent task with multiple answers, with no general result that holds independent of assumptions. In this Letter we derive a universal bound for cooling quantum systems in the limit of infinite cycles (or steady state regimes) that is valid for any control paradigm and machine size. The bound only depends on a single parameter of the refrigerator and is theoretically attainable in all control paradigms. For qubit targets we prove that this bound is achievable in a single cycle and by autonomous machines.

arXiv:1903.04970•Physical Review Letters•Oct 22, 2019•76 citations

Minimizing Dissipation in Multiqubit Erasure via Engineered Quantum Reservoirs

Sergio Arias

The erasure of quantum information is governed by two fundamental thermodynamic bounds: Landauer’s principle, which establishes the absolute minimum energetic cost of resetting a state, and Nernst’s unattainability principle, which dictates that perfect cooling to absolute zero entropy requires infinite resources. Under finite constraints, conventional cooling protocols utilizing thermal baths composed of n non-interacting particles are bottlenecked by a linear dissipation barrier (O(1/n)). In this thesis, we establish the ultimate thermodynamic limits of finite-resource multiqubit erasure and introduce the most thermodynamically efficient cooling protocol currently known. Building upon the max-cooling framework—a global unitary operation that systematically sorts the eigenvalues of the joint system-bath state to pack the highest probability mass into the target’s ground state—we engineer a bath Hamiltonian with specific, target-dependent degeneracies for arbitrary m-qubit systems. This collective protocol achieves an optimal asymptotic entropy production scaling of Σ = O(mˆ2/nˆ2), successfully saturating the scaling of the fundamental theoretical lower bound. This degeneracy-optimized approach strictly outperforms both standard non-interacting reservoirs and the best-known protocol for the independent cooling of single qubits using a reservoir of interacting particles (O(mˆ3/nˆ2)). Furthermore, we establish that surpassing conventional dissipation barriers requires an operational threshold of just n ≥ 2mˆ2 bath particles to achieve this optimal scaling.

•Aug 24, 2026•0 citations

Exponential Improvement for Quantum Cooling through Finite-Memory Effects

Philip Taranto, Faraj Bakhshinezhad, Philipp Schüttelkopf +2 more

Practical implementations of quantum technologies require preparation of states with a high degree of purity---or, in thermodynamic terms, very low temperatures. Given finite resources, the third law of thermodynamics prohibits perfect cooling; nonetheless, attainable upper bounds for the asymptotic ground-state population of a system repeatedly interacting with quantum thermal machines have been derived. These bounds apply within a memoryless (Markovian) setting, in which each refrigeration step proceeds independently of those previous. Here, we expand this framework to study the effects of memory on quantum cooling. By introducing a memory mechanism through a generalized collision model that permits a Markovian embedding, we derive achievable bounds that provide an exponential advantage over the memoryless case. For qubits, our bound coincides with that of heat-bath algorithmic cooling, which our framework generalizes to arbitrary dimensions. We lastly describe the adaptive stepwise optimal protocol that outperforms all standard procedures.

arXiv:2004.00323•Physical Review Applied•Nov 4, 2020•32 citations

Thermalization of finite complexity and its application to heat-bath algorithmic cooling

Xueyuan Hu, Valerio Scarani

We introduce a class of thermal operations based on the collision model, where the system sequentially interacts with uncorrelated bath molecules via energy-preserving unitaries. To ensure finite complexity, each molecule is constrained to be no larger than the system. We identify a necessary condition for cooling below the bath temperature via a single collision: The system must initially lack a well-defined effective temperature, even a negative one. By constructing an iterative protocol, we demonstrate that sub-bath cooling is achievable without a machine under these restricted thermal operations. Moreover, introducing a qubit machine further enhances both the cooling limit and energy efficiency. These findings contribute to the broader study of cooling with finite resources.

arXiv:2505.10054•Physical Review A•Sep 22, 2025•3 citations

Optimal Dynamic Cooling of Multiple Qubits

Mattia Reda, Massimiliano Sacchi, Chiara Macchiavello +1 more

We solve the closed-system problem of cooling $M$ qubits, selected from $N$ identical thermal qubits, to the lowest common local temperature allowed by unitarity. The optimal protocol consists of two conceptually distinct steps. First, a passive rearrangement assigns the largest eigenvalues of the initial state to target sectors of lowest Hamming weight, thereby minimizing the total target energy. Second, a target-only complex-Hadamard transformation within each fixed-Hamming-weight subspace equalizes the one-qubit target marginals without changing any target-sector probability or the total energy. Consequently, imposing a common local temperature costs neither cooling depth nor additional work: the constrained optimum coincides with the unconstrained passive minimum for every $N>M$ and every initial temperature. The complex-Hadamard correction may nevertheless be costly at the circuit level. We therefore derive an exact arithmetic criterion for when the same optimum can be attained by a temperature-independent computational-basis permutation alone, and exhaustively classify the resulting finite-size islands of feasibility for $M+2\leq N\leq 128$. At isolated temperatures, further optimal permutations can arise through numerical cancellations between different thermal eigenvalue shells. These alternative realizations may reduce implementation complexity, but they cannot improve the cooling curve already attained by the universal protocol. We also derive the exact cooling curve, prove that at least two ancillary qubits are necessary and sufficient for nontrivial cooling, and show that joint many-target cooling can strictly outperform parallel single-target strategies.

quant-pharXiv:2607.23641•Jul 28, 2026•0 citations

Finite-resource cooling of qudits beyond thermodynamic length

Ansh Mishra, Aryan Senthilkumar

Cooling a quantum system with $N$ thermal machines costs more than Landauer's bound. For swap-based collision models the excess is set by thermodynamic length, which is optimal for qubits and was suggested by numerics to be optimal in general. We show that for qudits, permutations of energy eigenstates that use several resonant transitions at once do better for every spectrum, reducing the excess by up to 83% near the ground state. To second order, coherent collisions do no better, and at infinite temperature $d_M$-level machines reduce the excess by at most a factor $d_M-1$.

quant-pharXiv:2610.40709•Oct 30, 2026•0 citations
In the task of unitarily cooling a quantum system with access to a larger quantum system, known as the machine or reservoir, ? Focusing on the task of cooling a single qubit given access to n separable, thermal qubits with arbitrary energy structure, we answer these questions by giving two new perspectives on this task. First, we show that a set of inequalities related to the energetic structure of the n -qubit machine determines the protocol which cools the qubit to the coldest reachable state, which parts of the machine contribute to this protocol and give rise to a Carnot-like bound. Second, we show that cooling protocols can be represented as perfect matchings on bipartite graphs enabling the optimization of cost functions, e.g., gate complexity or dissipation. Our results generalize the algorithmic cooling problem, establish new fundamental bounds on quantum cooling and offer a framework for designing novel autonomous thermal machines and cooling algorithms.
Cooling quantum systems is arguably one of the most important thermodynamic tasks connected to modern quantum technologies and an interesting question from a foundational perspective. It is thus of no surprise that many different theoretical cooling schemes have been proposed, differing in the assumed control paradigm and complexity, and operating either in a single cycle or in steady state limits. Working out bounds on quantum cooling has since been a highly context dependent task with multiple answers, with no general result that holds independent of assumptions. In this Letter we derive a universal bound for cooling quantum systems in the limit of infinite cycles (or steady state regimes) that is valid for any control paradigm and machine size. The bound only depends on a single parameter of the refrigerator and is theoretically attainable in all control paradigms. For qubit targets we prove that this bound is achievable in a single cycle and by autonomous machines.
The erasure of quantum information is governed by two fundamental thermodynamic bounds: Landauer’s principle, which establishes the absolute minimum energetic cost of resetting a state, and Nernst’s unattainability principle, which dictates that perfect cooling to absolute zero entropy requires infinite resources. Under finite constraints, conventional cooling protocols utilizing thermal baths composed of n non-interacting particles are bottlenecked by a linear dissipation barrier (O(1/n)). In this thesis, we establish the ultimate thermodynamic limits of finite-resource multiqubit erasure and introduce the most thermodynamically efficient cooling protocol currently known. Building upon the max-cooling framework—a global unitary operation that systematically sorts the eigenvalues of the joint system-bath state to pack the highest probability mass into the target’s ground state—we engineer a bath Hamiltonian with specific, target-dependent degeneracies for arbitrary m-qubit systems. This collective protocol achieves an optimal asymptotic entropy production scaling of Σ = O(mˆ2/nˆ2), successfully saturating the scaling of the fundamental theoretical lower bound. This degeneracy-optimized approach strictly outperforms both standard non-interacting reservoirs and the best-known protocol for the independent cooling of single qubits using a reservoir of interacting particles (O(mˆ3/nˆ2)). Furthermore, we establish that surpassing conventional dissipation barriers requires an operational threshold of just n ≥ 2mˆ2 bath particles to achieve this optimal scaling.
Practical implementations of quantum technologies require preparation of states with a high degree of purity---or, in thermodynamic terms, very low temperatures. Given finite resources, the third law of thermodynamics prohibits perfect cooling; nonetheless, attainable upper bounds for the asymptotic ground-state population of a system repeatedly interacting with quantum thermal machines have been derived. These bounds apply within a memoryless (Markovian) setting, in which each refrigeration step proceeds independently of those previous. Here, we expand this framework to study the effects of memory on quantum cooling. By introducing a memory mechanism through a generalized collision model that permits a Markovian embedding, we derive achievable bounds that provide an exponential advantage over the memoryless case. For qubits, our bound coincides with that of heat-bath algorithmic cooling, which our framework generalizes to arbitrary dimensions. We lastly describe the adaptive stepwise optimal protocol that outperforms all standard procedures.
We introduce a class of thermal operations based on the collision model, where the system sequentially interacts with uncorrelated bath molecules via energy-preserving unitaries. To ensure finite complexity, each molecule is constrained to be no larger than the system. We identify a necessary condition for cooling below the bath temperature via a single collision: The system must initially lack a well-defined effective temperature, even a negative one. By constructing an iterative protocol, we demonstrate that sub-bath cooling is achievable without a machine under these restricted thermal operations. Moreover, introducing a qubit machine further enhances both the cooling limit and energy efficiency. These findings contribute to the broader study of cooling with finite resources.
We solve the closed-system problem of cooling MMM qubits, selected from NNN identical thermal qubits, to the lowest common local temperature allowed by unitarity. The optimal protocol consists of two conceptually distinct steps. First, a passive rearrangement assigns the largest eigenvalues of the initial state to target sectors of lowest Hamming weight, thereby minimizing the total target energy. Second, a target-only complex-Hadamard transformation within each fixed-Hamming-weight subspace equalizes the one-qubit target marginals without changing any target-sector probability or the total energy. Consequently, imposing a common local temperature costs neither cooling depth nor additional work: the constrained optimum coincides with the unconstrained passive minimum for every N>MN>MN>M and every initial temperature. The complex-Hadamard correction may nevertheless be costly at the circuit level. We therefore derive an exact arithmetic criterion for when the same optimum can be attained by a temperature-independent computational-basis permutation alone, and exhaustively classify the resulting finite-size islands of feasibility for M+2≤N≤128M+2\leq N\leq 128M+2≤N≤128. At isolated temperatures, further optimal permutations can arise through numerical cancellations between different thermal eigenvalue shells. These alternative realizations may reduce implementation complexity, but they cannot improve the cooling curve already attained by the universal protocol. We also derive the exact cooling curve, prove that at least two ancillary qubits are necessary and sufficient for nontrivial cooling, and show that joint many-target cooling can strictly outperform parallel single-target strategies.
Cooling a quantum system with NNN thermal machines costs more than Landauer's bound. For swap-based collision models the excess is set by thermodynamic length, which is optimal for qubits and was suggested by numerics to be optimal in general. We show that for qudits, permutations of energy eigenstates that use several resonant transitions at once do better for every spectrum, reducing the excess by up to 83% near the ground state. To second order, coherent collisions do no better, and at infinite temperature dMd_MdM​-level machines reduce the excess by at most a factor dM−1d_M-1dM​−1.