A central task in finite-time thermodynamics is to minimize the excess or dissipated work when manipulating the state of a system immersed in a thermal bath. We consider this task for an -body system whose constituents are identical and uncorrelated at the beginning and end of the process. In the regime of slow but finite-time processes, we show that can be dramatically reduced by considering collective protocols in which interactions are suitably created along the protocol. This can even lead to a sublinear growth of with : with ; to be contrasted to the expected satisfied in any noninteracting protocol. We derive the fundamental limits to such collective advantages and show that is in principle possible; however, it requires long-range interactions. We explore collective processes with spin models featuring two-body interactions and achieve noticeable gains under realistic levels of control in simple interaction architectures. As an application of these results, we focus on the erasure of information in finite time and prove a faster convergence to Landauer’s bound.
11 November 2025 in Quantum Science and Technology
The last two decades have seen quantum thermodynamics become a well established field of research in its own right. In that time, it has demonstrated a remarkably broad applicability, ranging from providing foundational advances in the understanding of how thermodynamic principles apply at the nano-scale and in the presence of quantum coherence, to providing a guiding framework for the development of efficient quantum devices. Exquisite levels of control have allowed state-of-the-art experimental platforms to explore energetics and thermodynamics at the smallest scales which has in turn helped to drive theoretical advances. This Roadmap provides an overview of the recent developments across many of the field's sub-disciplines, assessing the key challenges and future prospects, providing a guide for its near term progress.
The full optimization of a quantum heat engine requires operating at high power, high efficiency, and high stability (i.e., low power fluctuations). However, these three objectives cannot be simultaneously optimized—as indicated by the so-called thermodynamic uncertainty relations—and a systematic approach to finding optimal balances between them including power fluctuations has, as yet, been elusive. Here we propose such a general framework to identify Pareto-optimal cycles for driven quantum heat engines that trade off power, efficiency, and fluctuations. We then employ reinforcement learning to identify the Pareto front of a quantum dot-based engine and find abrupt changes in the form of optimal cycles when switching between optimizing two and three objectives. We further derive analytical results in the fast- and slow-driving regimes that accurately describe different regions of the Pareto front.
To achieve efficient and reliable control of microscopic systems one should look for driving protocols that mitigate both the average dissipation and stochastic fluctuations in work. This is especially important in fast driving regimes in which the system is driven far out of equilibrium, potentially creating large amounts of unwanted entropy production. Here we characterise these optimal protocols in rapidly driven classical and quantum systems and prove that they consist of two discontinuous jumps in the full set of control variables. These jumps can be tuned to interpolate between processes with either minimal dissipation or minimal fluctuations, and in some situations allow for simultaneous minimisation. We illustrate our general results with rapidly driven closed quantum systems, classical bit erasure and a dissipative Ising chain driven close to a quantum phase transition.
The conversion of thermal energy into work is usually more efficient in the slow-driving regime, where the power output is vanishingly small. Efficient work extraction for fast-driving protocols remains an outstanding challenge at the nanoscale, where fluctuations play a significant role. In this Letter, we use a quantum-dot Szilard engine to extract work from thermal fluctuations with maximum efficiency over two decades of driving speed. We design and implement a family of optimized protocols ranging from the slow- to the fast-driving regime, and we measure the engine's efficiency as well as the mean and variance of its power output in each case. These optimized protocols exhibit significant improvements in power and efficiency compared to the naive approach. Our results also show that, when optimizing for efficiency, boosting the power output of a Szilard engine inevitably comes at the cost of increased power fluctuations. Published by the American Physical Society 2025
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.