Abstract Erasure is fundamental for information processing. It is also key in connecting information theory and thermodynamics, as it is a logically irreversible task. We provide a new angle on this connection, noting that there may be an additional cost to erasure, that is not captured by standard results such as Landauer’s principle. To make this point we use a model of irreversibility based on constructor theory—a recently proposed generalization of the quantum theory of computation. The model uses a machine called the ‘quantum homogenizer’, which has the ability to approximately realise the transformation of a qubit from any state to any other state and remain approximately unchanged, through overall entirely unitary interactions. We argue that when performing erasure via quantum homogenization there is an additional cost to performing the erasure step of the Szilard’s engine, because it is more difficult to reliably produce pure states in a cycle than to produce maximally mixed states. We also discuss the implications of this result for the cost of erasure in more general terms.
Abstract Erasure is fundamental for information processing. It is also key in connecting information theory and thermodynamics, as it is a logically irreversible task. We provide a new angle on this connection, noting that there may be an additional cost to erasure, that is not captured by standard results such as Landauer’s principle. To make this point we use a model of irreversibility based on constructor theory—a recently proposed generalization of the quantum theory of computation. The model uses a machine called the ‘quantum homogenizer’, which has the ability to approximately realise the transformation of a qubit from any state to any other state and remain approximately unchanged, through overall entirely unitary interactions. We argue that when performing erasure via quantum homogenization there is an additional cost to performing the erasure step of the Szilard’s engine, because it is more difficult to reliably produce pure states in a cycle than to produce maximally mixed states. We also discuss the implications of this result for the cost of erasure in more general terms.
Is it possible to fit irreversibility exactly in a universe whose laws are time-reversal symmetric? This vexed open problem, dating back to the origin of statistical mechanics, is crucial for the realisability of logically irreversible computations such as erasure. A well-known type of irreversibility is epitomised by Joule's experiment, involving a volume of fluid and a stirrer powered by mechanical means, e.g. a suspended weight: while it is possible to construct a cycle heating up the water by mechanical means only, it is impossible to cool the water down via a cycle that likewise utilises mechanical means only. This irreversibility is of particular interest because, unlike others, it is based on a system that performs some transformation, or task, operating in a cycle. First introduced via a thermodynamic cycle (e.g. Carnot's), this idea was generalised by von Neumann to a constructor - a system that can perform a given task on another system and crucially retains the ability to perform the task again. On this ground, a task is possible if there is no limitation to how well it can be performed by some constructor; it is impossible otherwise. Here we shall define a irreversibility, generalising Joule's, requiring that a task T is possible, while the transpose task (where T's input and output are switched) is not. We shall demonstrate the compatibility of this constructor-based irreversibility with quantum theory's time-reversal symmetric laws, confining attention to an example using the universal quantum homogeniser. This result is an essential further step for understanding irreversibility within quantum theory, one of the most fundamental theories of physics we posses at present. We will also simulate the irreversibility experimentally with high-quality photon qubits.
Quantum Szilard engine constitutes an adequate interplay of thermodynamics, information theory and quantum mechanics. Szilard engines are in general operated by a Maxwell's Demon where Landauer's principle resolves the apparent paradoxes. Here we propose a Szilard engine setup without featuring an explicit Maxwell's demon. In a demonless Szilard engine, the acquisition of which-side information is not required, but the erasure and related heat dissipation still take place implicitly. We explore a quantum Szilard engine considering quantum size effects. We see that insertion of the partition does not localize the particle to one side, instead creating a superposition state of the particle being in both sides. To be able to extract work from the system, particle has to be localized at one side. The localization occurs as a result of quantum measurement on the particle, which shows the importance of the measurement process regardless of whether one uses the acquired information or not. In accordance with Landauer's principle, localization by quantum measurement corresponds to a logically irreversible operation and for this reason it must be accompanied by the corresponding heat dissipation. This shows the validity of Landauer's principle even in quantum Szilard engines without Maxwell's demon.
Quantum state engineering and quantum computation rely on information erasure procedures that, up to some fidelity, prepare a quantum object in a pure state. Such processes occur within Landauer's framework if they rely on an interaction between the object and a thermal reservoir. Landauer's principle dictates that this must dissipate a minimum quantity of heat, proportional to the entropy reduction that is incurred by the object, to the thermal reservoir. However, this lower bound is only reachable for some specific physical situations, and it is not necessarily achievable for any given reservoir. The main task of our work can be stated as the minimisation of heat dissipation given probabilistic information erasure, i.e., minimising the amount of energy transferred to the thermal reservoir as heat if we require that the probability of preparing the object in a specific pure state | φ 1 ⟩ be no smaller than p φ 1 max − δ . Here p φ 1 max is the maximum probability of information erasure that is permissible by the physical context, and δ ⩾ 0 the error. To determine the achievable minimal heat dissipation of quantum information erasure within a given physical context, we explicitly optimise over all possible unitary operators that act on the composite system of object and reservoir. Specifically, we characterise the equivalence class of such optimal unitary operators, using tools from majorisation theory, when we are restricted to finite-dimensional Hilbert spaces. Furthermore, we discuss how pure state preparation processes could be achieved with a smaller heat cost than Landauer's limit, by operating outside of Landauer's framework.
Abstract Landauer’s principle introduces a symmetry between computational and physical processes: erasure of information, a logically irreversible operation, must be underlain by an irreversible transformation dissipating energy. Monitoring micro- and nano-systems needs to enter into the energetic balance of their control; hence, finding the ultimate limits is instrumental to the development of future thermal machines operating at the quantum level. We report on the experimental investigation of a lower bound to the irreversible entropy associated to generalized quantum measurements on a quantum bit. We adopted a quantum photonics gate to implement a device interpolating from the weakly disturbing to the fully invasive and maximally informative regime. Our experiment prompted us to introduce a bound taking into account both the classical result of the measurement and the outcoming quantum state; unlike previous investigation, our entropic bound is based uniquely on measurable quantities. Our results highlight what insights the information-theoretic approach provides on building blocks of quantum information processors.
Irreversibility has a fundamental thermodynamic cost, erasing information inevitably generates heat. This connection is quantified by the Landauer bound, which gives the minimum dissipation needed to erase a single bit of information. While this bound applies in both classical and quantum settings, it is saturated only in idealised limits of infinite resources. Here, we provide a unified first principles description of finite-resource erasure in both classical and quantum systems. We begin by proving the communal folklore that in the idealised regime the erasure cost of a bit encoded in a quantum or classical system is the same. Despite this, we show that their practical implementation differs substantially: achieving comparable erasure quality in quantum systems requires more control, larger accessible energy gaps and longer operation times. Classical protocols can achieve the erasure of a comparable quantum protocol under far weaker constraints which we expose in trade-off relations. Our results explain why practical erasure schemes fall short of Landauer's bound and show that classical systems enjoy several fundamental thermodynamic advantages.
A restricted form of Landauer’s principle, independent of computational considerations, is shown to hold for thermal systems by reference to the joint entropy associated with conjugate observables. It is shown that the source of the compensating entropy for irreversible physical processes is due to the ontological uncertainty attending values of such mutually incompatible observables, rather than due to epistemic uncertainty, as traditionally assumed in the information-theoretic approach. In particular, it is explicitly shown that erasure of logical (epistemic) information via reset operations is not equivalent to erasure of thermodynamic entropy, so that the traditional, information-theoretic form of Landauer’s principle is not supported by the physics. A further implication of the analysis is that, in principle, there can be no Maxwell’s Demon in the real world.