Erasing memory is a fundamental operational task in quantum information processing, governed by Landauer's principle, which links information loss to thermodynamic work. We introduce and analyze assisted quantum erasure, where correlations with a remote system reduce the energetic cost of resetting a memory. We identify exclusive control of erasure as the central operational requirement: only a designated party should be able to achieve the minimal cost, while any adversary necessarily fails. In the device-dependent regime, we show that entanglement of formation exactly characterizes exclusivity, establishing entanglement as the decisive thermodynamic resource. Moving to a one-sided device-independent scenario, in which only the memory holder's device is trusted, we develop an operational erasure protocol based on random dephasing and conditional operations. These results elevate quantum erasure from a thermodynamic constraint to an operational primitive: the erasure work cost quantifies secure, exclusive control over quantum memory, guaranteeing that an unauthorized agent cannot fully erase information under bounded work.
Erasing memory is a fundamental operational task in quantum information processing, governed by Landauer's principle, which links information loss to thermodynamic work. We introduce and analyze assisted quantum erasure, where correlations with a remote system reduce the energetic cost of resetting a memory. We identify exclusive control of erasure as the central operational requirement: only a designated party should be able to achieve the minimal cost, while any adversary necessarily fails. In the device-dependent regime, we show that entanglement of formation exactly characterizes exclusivity, establishing entanglement as the decisive thermodynamic resource. Moving to a one-sided device-independent scenario, in which only the memory holder's device is trusted, we develop an operational erasure protocol based on random dephasing and conditional operations. These results elevate quantum erasure from a thermodynamic constraint to an operational primitive: the erasure work cost quantifies secure, exclusive control over quantum memory, guaranteeing that an unauthorized agent cannot fully erase information under bounded work.
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.
Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the process’s complexity is restricted. We focus on the prototypical task of information erasure, or Landauer erasure, wherein an n -qubit memory is reset to the all-zero state. We show that the minimum thermodynamic work required to reset an arbitrary state in our model, via a complexity-constrained process, is quantified by the state’s . The complexity entropy therefore quantifies a trade-off between the work cost and complexity cost of resetting a state. If the qubits have a nontrivial (but product) Hamiltonian, the optimal work cost is determined by the . The complexity entropy quantifies the amount of randomness a system appears to have to a computationally limited observer. Similarly, the complexity relative entropy quantifies such an observer’s ability to distinguish two states. We prove elementary properties of the complexity (relative) entropy. In a random circuit—a simple model for quantum chaotic dynamics—the complexity entropy transitions from zero to its maximal value around the time corresponding to the observer’s computational-power limit. Also, we identify information-theoretic applications of the complexity entropy. The complexity entropy quantifies the resources required for data compression if the compression algorithm must use a restricted number of gates. We further introduce a , which arises naturally in a complexity-constrained variant of information-theoretic decoupling. Assuming that this entropy obeys a conjectured chain rule, we show that the entropy bounds the number of qubits that one can decouple from a reference system, as judged by a computationally bounded referee. Overall, our framework extends the resource-theoretic approach to thermodynamics to integrate a notion of , as quantified by .
Abstract The erasure of information is fundamentally an irreversible logical operation, carrying profound consequences for the energetics of computation and information processing. We investigate the thermodynamic costs associated with erasing (and preparing) quantum processes. Specifically, we analyze an arbitrary bipartite unitary gate acting on logical and ancillary input-output systems, where the ancillary input is always initialized in the ground state. We focus on the adversarial erasure cost of the reduced dynamics—that is, the minimal thermodynamic work cost to erase the logical output of the gate for any logical input, assuming full access to the ancilla but no access to any purifying reference of the logical input state. We determine that this adversarial erasure cost is directly proportional to the negative min-entropy of the reduced dynamics, thereby giving the dynamical min-entropy a clear operational meaning. The dynamical min-entropy can take positive and negative values, depending on the underlying quantum dynamics. The negative value of the erasure cost implies that the extraction of thermodynamic work is possible instead of its consumption during the process. A key foundation of this result is the quantum process decoupling theorem, which quantitatively relates the decoupling ability of a process with its min-entropy. This insight bridges thermodynamics, information theory, and the fundamental limits of quantum computation.
The erasure of quantum information is governed by two fundamental thermodynamic bounds: Landauer’s principle, which establishes the absolute minimum energetic cost of resetting a state, and Nernst’s unattainability principle, which dictates that perfect cooling to absolute zero entropy requires infinite resources. Under finite constraints, conventional cooling protocols utilizing thermal baths composed of n non-interacting particles are bottlenecked by a linear dissipation barrier (O(1/n)). In this thesis, we establish the ultimate thermodynamic limits of finite-resource multiqubit erasure and introduce the most thermodynamically efficient cooling protocol currently known. Building upon the max-cooling framework—a global unitary operation that systematically sorts the eigenvalues of the joint system-bath state to pack the highest probability mass into the target’s ground state—we engineer a bath Hamiltonian with specific, target-dependent degeneracies for arbitrary m-qubit systems. This collective protocol achieves an optimal asymptotic entropy production scaling of Σ = O(mˆ2/nˆ2), successfully saturating the scaling of the fundamental theoretical lower bound. This degeneracy-optimized approach strictly outperforms both standard non-interacting reservoirs and the best-known protocol for the independent cooling of single qubits using a reservoir of interacting particles (O(mˆ3/nˆ2)). Furthermore, we establish that surpassing conventional dissipation barriers requires an operational threshold of just n ≥ 2mˆ2 bath particles to achieve this optimal scaling.
We investigate how nonequilibrium quantum initial states can reduce the finite-time thermodynamic cost of Landauer erasure. Considering a general finite-dimensional quantum memory coupled to a thermal reservoir via a Davies generator, we show that the dissipated heat at a fixed operational erasure fidelity is largely controlled by the overlap of the initial state with the slowest Liouvillian relaxation mode. We derive a modified finite-time Landauer bound in which the excess dissipation above the quasistatic limit scales quadratically with this slow mode projection, and we prove a sufficient Mpemba Landauer condition under which a hotter state can erase faster and dissipate less heat than a colder preparation, without violating Landauer's principle. A minimal qutrit model illustrates these quantum Mpemba speedups and reveals broad parameter regimes where coherence and Hamiltonian-induced modes conspire to suppress finite-time entropy production. We further identify practical control knobs, including temperature tuning, coherence engineering, and Hamiltonian shaping of Liouvillian spectra, which enable Mpemba-enhanced erasure to be directly tested on platforms such as superconducting circuits, trapped ions, semiconductor quantum dots, and solid-state spins.
The Landauer's principle, a cornerstone of information thermodynamics, provides a fundamental lower bound on the energetic cost of information erasure in terms of the information content change. However, its traditional formulation is largely confined to systems exchanging solely energy with an ideal thermal bath. In this work, we derive general information-cost trade-off relations that go beyond the scope of Landauer's principle by developing a thermodynamic inference approach based on the maximum entropy principle. These relations require only information about the system and are applicable to complex quantum scenarios involving multiple conserved charges and non-thermal environments. Specifically, we present two key results: (i) In scenarios where only the mean values of observables are accessible, we derive an information-content-informed upper bound on the thermodynamic cost which complements an existing generalized Landauer lower bound. (ii) When second-order fluctuations can also be measured, we obtain an information-content-informed lower bound on the change in variances of observables, thereby extending the Landauer's principle to constrain higher-order fluctuation costs. We numerically validate our information-cost trade-off relations using a coupled-qubit system exchanging energy and excitations, a driven qubit implementing an information erasure process, and a driven double quantum dot system that can operate as an inelastic heat engine. Our results underscore the broad utility of maximum-entropy inference in constraining thermodynamic costs for generic finite-time quantum processes, with direct relevance to quantum information processing and quantum thermodynamic applications.