Quantum cooling is important for reliable quantum computation but involves a trade-off between cooling performance and implementation resources. Although reservoir memory can improve particular aspects of cooling performance, the associated resource cost, particularly for circuit implementation, remains insufficiently understood. Here, we investigate how reservoir memory affects the trade-off between cooling performance quantified by the cooling-step count and geometric implementation cost in single-qubit heat-bath algorithmic cooling. Using a pseudomode mapping, we represent the non-Markovian damped Jaynes--Cummings dynamics by a repeated collision circuit and evaluate its geometric implementation cost. Using matrix-based simulations and an implementation on the ibm_kawasaki Heron r2 processor, we identify a trade-off: suppressing reservoir memory reduces the cooling-step count but generally increases the geometric protocol cost. Our work provides a resource-based perspective on reservoir engineering for algorithmic cooling.
Quantum cooling is important for reliable quantum computation but involves a trade-off between cooling performance and implementation resources. Although reservoir memory can improve particular aspects of cooling performance, the associated resource cost, particularly for circuit implementation, remains insufficiently understood. Here, we investigate how reservoir memory affects the trade-off between cooling performance quantified by the cooling-step count and geometric implementation cost in single-qubit heat-bath algorithmic cooling. Using a pseudomode mapping, we represent the non-Markovian damped Jaynes--Cummings dynamics by a repeated collision circuit and evaluate its geometric implementation cost. Using matrix-based simulations and an implementation on the ibm_kawasaki Heron r2 processor, we identify a trade-off: suppressing reservoir memory reduces the cooling-step count but generally increases the geometric protocol cost. Our work provides a resource-based perspective on reservoir engineering for algorithmic cooling.
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.
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.
Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features, while training is typically confined to a classical readout. This separation reduces reliance on repeated quantum parameter updates and avoids the barren plateaus associated with variational circuit training. Its computational power is often attributed to the exponentially large Hilbert space of the quantum system. However, the memory, nonlinearity, and expressivity that determine what a reservoir can actually compute depend jointly on the input encoding, quantum evolution, observables, measurement, and readout, not on Hilbert space dimension alone. On hardware, these capabilities are further constrained by finite sampling, hardware noise, measurement backaction, and the cost of estimating observables, so a large state space alone does not guarantee useful computation. In this survey, we develop a common system model that connects these components and use it to organize QRC foundations, computational properties, reservoir architectures, operating protocols, and physical implementations. We examine spin, photonic, superconducting, bosonic, neutral atom, and other analog platforms, together with applications, software and high performance computing support, benchmarking, and reproducibility. The analysis distinguishes hardware demonstrations from simulations and identifies the assumptions and resources that govern comparisons across implementations. Current results do not establish a broad quantum advantage over well matched classical reservoirs. We therefore specify the resource accounting, benchmark standards, and theoretical criteria needed to evaluate claims of quantum advantage.
Heat-Bath Algorithmic Cooling is a technique for producing pure quantum systems by utilizing a surrounding heat-bath. Here we connect the study of these cooling techniques to the resource theory of thermal operations, enabling us to derive provably optimal cooling protocols under a variety of experimental restrictions on the available control. For qubit systems, we find that a surprisingly simple, optimal protocol consisting of repeated application of a Pauli X unitary and a thermal operation can achieve purity converging exponentially quickly to one. What is more, this thermal operation can be well approximated using a Jaynes Cummings interaction between the system and a single thermal bosonic mode and we consider experimental implementations of this. In addition, we investigate the role of quantum coherence and non-Markovianity in cooling protocols and extend our results to higher dimensional systems. Finally, by considering the role of correlations with auxiliary systems in cooling, we show that purity arbitrary close to one can be achieved in a fixed number of operations. Our results serve to find practical applications for the resource theoretic approach to quantum thermodynamics and suggest relevant experimental implementations.
Heat-Bath Algorithmic Cooling is a set of techniques for producing highly pure quantum systems by utilizing a surrounding heat-bath and unitary interactions. These techniques originally used the thermal environment only to fully thermalize ancillas at the environment temperature. Here we extend HBAC protocols by optimizing over the thermalization strategy. We find, for any d -dimensional system in an arbitrary initial state, provably optimal cooling protocols with surprisingly simple structure and exponential convergence to the ground state. Compared to the standard ones, these schemes can use fewer or no ancillas and exploit memory effects to enhance cooling. We verify that the optimal protocols are robusts to various deviations from the ideal scenario. For a single target qubit, the optimal protocol can be well approximated with a Jaynes-Cummings interaction between the system and a single thermal bosonic mode for a wide range of environmental temperatures. This admits an experimental implementation close to the setup of a micromaser, with a performance competitive with leading proposals in the literature. The proposed protocol provides an experimental setup that illustrates how non-Markovianity can be harnessed to improve cooling. On the technical side we 1. introduce a new class of states called maximally active states and discuss their thermodynamic significance in terms of optimal unitary control, 2. introduce a new set of thermodynamic processes, called β-permutations , whose access is sufficient to simulate a generic thermalization process, 3. show how to use abstract toolbox developed within the resource theory approach to thermodynamics to perform challenging optimizations, while combining it with open quantum system dynamics tools to approximate optimal solutions within physically realistic setups.
Quantum reservoir computing provides a framework for processing complex temporal data, yet its fundamental computational and energetic limits remain unresolved. Here, we establish a non-equilibrium thermodynamic framework that links the macroscopic predictive performance of driven open quantum systems to their microscopic energetic costs. By mapping Holevo capacities onto the Bogoliubov-Kubo-Mori geometric manifold, we analytically prove that the computational peak within the quantum critical region originates from a spectral resonance: the closing of the intrinsic energy gap forces the reservoir's internal transition frequencies to align with the chaotic drive. To evaluate the associated thermodynamic costs, we introduce quantum informational dissipation to quantify the non-predictive historical data retained by the reservoir. This allows us to derive a generalized Landauer bound for continuous temporal processing, which reveals a fundamental thermodynamic trade-off: the critical resonance that maximizes predictive capacity simultaneously maximizes informational dissipation and the irreversible work required for environmental erasure. Furthermore, coherence decomposition demonstrates that quantum coherences amplify predictive capacity without demanding additional mechanical work. These findings establish the fundamental energetic limits of quantum learning devices, providing theoretical principles for designing energy-efficient quantum neuromorphic hardware.