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

Finite-resource cooling of qudits beyond thermodynamic length

Ansh Mishra, Aryan Senthilkumar

quant-phSubmitted Oct 28, 2026• Announced Oct 30, 2026
arXivHTMLPDF

Abstract

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$.

AI Summary

The paper asks whether thermodynamic length determines the minimum excess Landauer cost of cooling with $N$ fresh thermal machines. Optimal swap protocols dissipate $(L^*)^2/(2N)+O(N^{-2})$. This is optimal for qubit systems with qubit machines; previous numerics suggested broader optimality. For qudits, resonant permutations of joint system–machine eigenstates distribute population transfer across several channels and beat swaps. A second-order expansion defines a local cost whose convexification gives a generally Finsler, rather than Fisher–Rao, geometry. A theorem using Kubo–Mori metric monotonicity and Birkhoff decomposition shows that arbitrary coherent collisions near dissipationless ones are dominated by mixtures of resonant permutations for first-order spectral changes. Constructions beat swaps near infinite temperature for every nondegenerate spectrum with $d\geq3$, using machines of the same dimension. Near the ground state, with a nondegenerate first excited level, the dominant-transfer cost approaches $1/(d-1)$ of the swap cost. Exact 41-machine protocols reduce excess dissipation by approximately 50% for qutrits and 83% for eight-level systems. Enumeration and primal–dual cone programs characterize the qutrit local geometry. A second theorem bounds the improvement at a maximally mixed system by a factor $d_M-1$; two-level transfers attain this bound. The optimality statements are local and perturbative, not unrestricted finite-$N$ results. Protocol bounds assume uniformly quasistatic collisions and populations bounded away from zero. Whether the $d_M-1$ bound holds at all temperatures remains conjectural for $d_M\geq3$. Near-resonant offsets may provide additional gains, intermediate-temperature improvements can depend on commensurability, and the general higher-dimensional geometry remains unresolved.

No sign of AI-generated text

Error found: The claim that the final swap removes a residual of approximately 10^-7 or less is incorrect for the qutrit 0.01→0.05 protocol, whose preceding π_A collisions preserve the middle-level population and leave it approximately 2.665×10^-4 from its target.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
5 pages, 2 figures, 1 table, plus 7 pages of Supplemental Material. Code and data: https://github.com/anshM123/Resonant-Collision-Cooling

Related papers

Efficiently Cooling Quantum Systems with Finite Resources: Insights from Thermodynamic Geometry

Philip Taranto, Patryk Lipka-Bartosik, Nayeli A. Rodríguez-Briones +4 more

Landauer's limit on heat dissipation during information erasure is critical as devices shrink, requiring optimal pure-state preparation to minimize errors. However, Nernst's third law states this demands infinite resources in energy, time, or control complexity. We address the challenge of cooling quantum systems with finite resources. Using Markovian collision models, we explore resource trade-offs and present efficient cooling protocols (that are optimal for qubits) for coherent and incoherent control. Leveraging thermodynamic length, we derive bounds on heat dissipation for swap-based strategies and discuss the limitations of preparing pure states efficiently.

arXiv:2404.06649•Physical Review Letters•Feb 18, 2025•12 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•29 citations

Cooling performance in Markovian vs non-Markovian quantum collisional models

Swastik Srivastava

This paper compares the cooling performance of Markovian and non-Markovian quantum collisional models for nanoscale thermodynamic devices. A minimal setup is considered: a single qubit system repeatedly collides with qubit ancillas acting as a heat bath, while a local cooling “demon” operates on the system after each collision. Two regimes are analyzed: (i) a Markovian protocol where the system interacts with a fresh thermal ancilla at every step and the ancilla is subsequently rethermalized, and (ii) a non-Markovian protocol where the system repeatedly interacts with the same initially thermal environment qubit with no reset, allowing correlations (memory) to build up. A central contribution is an efficiency definition that explicitly includes all external energetic resources, counting both the energy removed by the demon and the otherwise hidden work cost of rethermalizing the ancillas in the Markovian implementation. The demon is modeled as an amplitude damping channel; via an explicit Stinespring dilation, the extracted energy is interpreted as heat dumped into an auxiliary cold reservoir, and the paper discusses how additional demon memory/erasure (Landauer) costs would further reduce operational efficiency. Numerical simulations show that the non-Markovian protocol can cool the system to much lower final energies and achieve substantially higher efficiency than the Markovian protocol across a wide range of collision (coupling) and damping strengths. The enhancement is traced to the finite environment’s initial energy and its capacity to store correlations as usable thermodynamic resources. The results emphasize that bounds and benchmarks derived under Markovian assumptions may significantly underestimate performance in finite, memoryful environments, and that reported efficiencies should be interpreted as upper bounds when demon implementation costs are not fully modeled.

•Mar 7, 2026•0 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•2 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

Cooling a Qubit Using n Others

Jake Xuereb, Benjamin Stratton, Alberto Rolandi +3 more

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.

arXiv:2506.10059•PRX Quantum•Oct 29, 2025•2 citations
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.
The paper asks whether thermodynamic length determines the minimum excess Landauer cost of cooling with NNN fresh thermal machines. Optimal swap protocols dissipate (L∗)2/(2N)+O(N−2)(L^*)^2/(2N)+O(N^{-2})(L∗)2/(2N)+O(N−2). This is optimal for qubit systems with qubit machines; previous numerics suggested broader optimality.
For qudits, resonant permutations of joint system–machine eigenstates distribute population transfer across several channels and beat swaps. A second-order expansion defines a local cost whose convexification gives a generally Finsler, rather than Fisher–Rao, geometry. A theorem using Kubo–Mori metric monotonicity and Birkhoff decomposition shows that arbitrary coherent collisions near dissipationless ones are dominated by mixtures of resonant permutations for first-order spectral changes.
Constructions beat swaps near infinite temperature for every nondegenerate spectrum with d≥3d\geq3d≥3, using machines of the same dimension. Near the ground state, with a nondegenerate first excited level, the dominant-transfer cost approaches 1/(d−1)1/(d-1)1/(d−1) of the swap cost. Exact 41-machine protocols reduce excess dissipation by approximately 50% for qutrits and 83% for eight-level systems. Enumeration and primal–dual cone programs characterize the qutrit local geometry. A second theorem bounds the improvement at a maximally mixed system by a factor dM−1d_M-1dM​−1; two-level transfers attain this bound.
The optimality statements are local and perturbative, not unrestricted finite-NNN results. Protocol bounds assume uniformly quasistatic collisions and populations bounded away from zero. Whether the dM−1d_M-1dM​−1 bound holds at all temperatures remains conjectural for dM≥3d_M\geq3dM​≥3. Near-resonant offsets may provide additional gains, intermediate-temperature improvements can depend on commensurability, and the general higher-dimensional geometry remains unresolved.
Landauer's limit on heat dissipation during information erasure is critical as devices shrink, requiring optimal pure-state preparation to minimize errors. However, Nernst's third law states this demands infinite resources in energy, time, or control complexity. We address the challenge of cooling quantum systems with finite resources. Using Markovian collision models, we explore resource trade-offs and present efficient cooling protocols (that are optimal for qubits) for coherent and incoherent control. Leveraging thermodynamic length, we derive bounds on heat dissipation for swap-based strategies and discuss the limitations of preparing pure states efficiently.
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.
This paper compares the cooling performance of Markovian and non-Markovian quantum collisional models for nanoscale thermodynamic devices. A minimal setup is considered: a single qubit system repeatedly collides with qubit ancillas acting as a heat bath, while a local cooling “demon” operates on the system after each collision. Two regimes are analyzed: (i) a Markovian protocol where the system interacts with a fresh thermal ancilla at every step and the ancilla is subsequently rethermalized, and (ii) a non-Markovian protocol where the system repeatedly interacts with the same initially thermal environment qubit with no reset, allowing correlations (memory) to build up. A central contribution is an efficiency definition that explicitly includes all external energetic resources, counting both the energy removed by the demon and the otherwise hidden work cost of rethermalizing the ancillas in the Markovian implementation. The demon is modeled as an amplitude damping channel; via an explicit Stinespring dilation, the extracted energy is interpreted as heat dumped into an auxiliary cold reservoir, and the paper discusses how additional demon memory/erasure (Landauer) costs would further reduce operational efficiency. Numerical simulations show that the non-Markovian protocol can cool the system to much lower final energies and achieve substantially higher efficiency than the Markovian protocol across a wide range of collision (coupling) and damping strengths. The enhancement is traced to the finite environment’s initial energy and its capacity to store correlations as usable thermodynamic resources. The results emphasize that bounds and benchmarks derived under Markovian assumptions may significantly underestimate performance in finite, memoryful environments, and that reported efficiencies should be interpreted as upper bounds when demon implementation costs are not fully modeled.
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.
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.