Asymptotic bound for heat-bath algorithmic cooling

Generalized Zurek's bound on the cost of an individual classical or quantum computation

We consider the minimal thermodynamic cost of an individual computation, where a single input x is mapped to a single output y. In prior work, Zurek proposed that this cost was given by K(x|y), the conditional Kolmogorov complexity of x given y (up to an additive constant that does not depend on x or y). However, this result was derived from an informal argument, applied only to deterministic computations, and had an arbitrary dependence on the choice of protocol (via the additive constant). Here we use stochastic thermodynamics to derive a generalized version of Zurek's bound from a rigorous Hamiltonian formulation. Our bound applies to all quantum and classical processes, whether noisy or deterministic, and it explicitly captures the dependence on the protocol. We show that K(x|y) is a minimal cost of mapping x to y that must be paid using some combination of heat, noise, and protocol complexity, implying a trade-off between these three resources. Our result is a kind of "algorithmic fluctuation theorem" with implications for the relationship between the second law and the Physical Church-Turing thesis.

Optimizing Thermalization

We present a rigorous approach, based on the concept of continuous thermomajorization, to algorithmically characterize the full set of energy occupations of a quantum system accessible from a given initial state through weak interactions with a heat bath. The algorithm can be deployed to solve complex optimization problems in out-of-equilibrium setups and it returns explicit elementary control sequences realizing optimal transformations. We illustrate this by finding optimal protocols in the context of cooling, work extraction, and catalysis. The same tools also allow one to quantitatively assess the role played by memory effects in the performance of thermodynamic protocols. We obtained exhaustive solutions on a laptop machine for systems with dimension d≤7, but with heuristic methods one could access much higher d.

Thermodynamics of a Minimal Algorithmic Cooling Refrigerator

We investigate, theoretically and experimentally, the thermodynamic performance of a minimal three-qubit heat-bath algorithmic cooling refrigerator. We analytically compute the coefficient of performance, the cooling power, and the polarization of the target qubit for an arbitrary number of cycles, taking realistic experimental imperfections into account. We determine their fundamental upper bounds in the ideal reversible limit and show that these values may be experimentally approached using a system of three qubits in a nitrogen-vacancy center in diamond.

Algorithmic cooling of nuclear spins using long-lived singlet order

Algorithmic cooling methods manipulate an open quantum system in order to lower its temperature below that of the environment. We achieve significant cooling of an ensemble of nuclear spin-pair systems by exploiting the long-lived nuclear singlet state, which is an antisymmetric quantum superposition of the "up" and "down" Zeeman states. The effect is demonstrated by nuclear magnetic resonance experiments on a molecular system containing a coupled pair of near-equivalent ¹³C nuclei. The populations of the system are subjected to a repeating sequence of cyclic permutations separated by relaxation intervals. The long-lived nuclear singlet order is pumped well beyond the unitary limit. The pumped singlet order is converted into nuclear magnetization which is enhanced by 21% relative to its thermal equilibrium value.

Unifying paradigms of quantum refrigeration: Fundamental limits of cooling and associated work costs

In classical thermodynamics the work cost of control can typically be neglected. On the contrary, in quantum thermodynamics the cost of control constitutes a fundamental contribution to the total work cost. Here, focusing on quantum refrigeration, we investigate how the level of control determines the fundamental limits to cooling and how much work is expended in the corresponding process. We compare two extremal levels of control: first, coherent operations, where the entropy of the resource is left unchanged, and, second, incoherent operations, where only energy at maximum entropy (i.e., heat) is extracted from the resource. For minimal machines, we find that the lowest achievable temperature and associated work cost depend strongly on the type of control, in both single-cycle and asymptotic regimes. We also extend our analysis to general machines. Our work provides a unified picture of the different approaches to quantum refrigeration developed in the literature, including algorithmic cooling, autonomous quantum refrigerators, and the resource theory of quantum thermodynamics.

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

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.

Algorithmic quantum heat engines

We suggest alternative quantum Otto engines, using heat bath algorithmic cooling with a partner pairing algorithm instead of isochoric cooling and using quantum swap operations instead of quantum adiabatic processes. Liquid state nuclear magnetic resonance systems in a single entropy sink are treated as working fluids. The extractable work and thermal efficiency are analyzed in detail for four-stroke and two-stroke types of alternative quantum Otto engines. The role of the heat bath algorithmic cooling in these cycles is to use a single entropy sink instead of two so that a single incoherent energy resource can be harvested and processed using an algorithmic quantum heat engine. Our results indicate a path to programmable quantum heat engines as analogs of quantum computers beyond traditional heat engine cycles. We find that for our NMR system example implementation of quantum algorithmic heat engine stages yields more power due to increased cycle speeds.

Novel Technique for Robust Optimal Algorithmic Cooling

Heat-bath algorithmic cooling provides algorithmic ways to improve the purity of quantum states. These techniques are complex iterative processes that change from each iteration to the next and this poses a significant challenge to implementing these algorithms. Here, we introduce a new technique that on a fundamental level, shows that it is possible to do algorithmic cooling and even reach the cooling limit without any knowledge of the state and using only a single fixed operation, and on a practical level, presents a more feasible and robust alternative for implementing heat-bath algorithmic cooling. We also show that our new technique converges to the asymptotic state of heat-bath algorithmic cooling and that the cooling algorithm can be efficiently implemented; however, the saturation could require exponentially many iterations and remains impractical. This brings heat-bath algorithmic cooling to the realm of feasibility and makes it a viable option for realistic application in quantum technologies.

Von Neumann Entropy from Unitarity

The von Neumann entropy is a key quantity in quantum information theory and, roughly speaking, quantifies the amount of quantum information contained in a state when many identical and independent (i.i.d.) copies of the state are available, in a regime that is often referred to as being asymptotic. In this Letter, we provide a new operational characterization of the von Neumann entropy which neither requires an i.i.d. limit nor any explicit randomness. We do so by showing that the von Neumann entropy fully characterizes single-shot state transitions in unitary quantum mechanics, as long as one has access to a catalyst-an ancillary system that can be reused after the transition-and an environment which has the effect of dephasing in a preferred basis. Building upon these insights, we formulate and provide evidence for the catalytic entropy conjecture, which states that the above result holds true even in the absence of decoherence. If true, this would prove an intimate connection between single-shot state transitions in unitary quantum mechanics and the von Neumann entropy. Our results add significant support to recent insights that, contrary to common wisdom, the standard von Neumann entropy also characterizes single-shot situations and opens up the possibility for operational single-shot interpretations of other standard entropic quantities. We discuss implications of these insights to readings of the third law of quantum thermodynamics and hint at potentially profound implications to holography.

Correlation-Enhanced Algorithmic Cooling

We propose a method for increasing the purity of interacting quantum systems that takes advantage of correlations present due to the internal interaction. In particular, when this interaction is sufficiently strong, we show that by using the system's quantum correlations one can achieve cooling beyond established limits of previous conventional algorithmic cooling proposals which assume no interaction.

Achievable Polarization for Heat-Bath Algorithmic Cooling

Pure quantum states play a central role in applications of quantum information, both as initial states for quantum algorithms and as resources for quantum error correction. Preparation of highly pure states that satisfy the threshold for quantum error correction remains a challenge, not only for ensemble implementations like NMR or ESR but also for other technologies. Heat-bath algorithmic cooling is a method to increase the purity of a set of qubits coupled to a bath. We investigated the achievable polarization by analyzing the limit when no more entropy can be extracted from the system. In particular, we give an analytic form for the maximum polarization achievable for the case when the initial state of the qubits is totally mixed, and the corresponding steady state of the whole system. It is, however, possible to reach higher polarization while starting with certain states; thus, our result provides an achievable bound. We also give the number of steps needed to get a specific required polarization.