Related papers: Optimally Fast Qubit Reset
Landauer's principle shows that the minimum energy cost to reset a classical bit in a bath with temperature $T$ is $k_{B}T\ln2$ in the infinite time. However, the task to reset the bit in finite time has posted a new challenge, especially…
The thermodynamic cost of resetting an arbitrary initial state to a particular desired state is lower bounded by Landauer's bound. However, here we demonstrate that this lower bound is necessarily unachievable for nearly every initial…
Qubit reset is a basic prerequisite for operating quantum devices, requiring the export of entropy. The fastest and most accurate way to reset a qubit is obtained by coupling the qubit to an ancilla on demand. Here, we derive fundamental…
The Landauer principle sets a lower bound on the thermodynamic cost of qubit reset, which is only attainable for the quasistatic process. In this Letter, we explore the collective advantage of qubit reset of coherent qubits in three…
Fast and reliable reset of a qubit is a key prerequisite for any quantum technology. For real world open quantum systems undergoing non-Markovian dynamics, reset implies not only purification, but in particular erasure of initial…
Landauer's principle states that it costs at least kTln2 of work to reset one bit in the presence of a heat bath at temperature T. The bound of kTln2 is achieved in the unphysical infinite-time limit. Here we ask what is possible if one is…
We consider how the energy cost of bit reset scales with the time duration of the protocol. Bit reset necessarily takes place in finite time, where there is an extra penalty on top of the quasistatic work cost derived by Landauer. This…
The goal of thermodynamic optimal control theory is to find protocols to change the state of a system from an initial to a desired final distribution, within a finite time, with the least possible expenditure of work. The optimal protocol…
We develop an exact theory of coherence-selective stroboscopic resetting for quadratic open quantum systems within the single-particle density-matrix formalism. We focus on the survival of coherences and the associated thermodynamic cost at…
Fast qubit reset is essential for qubit reuse in the noisy intermediate-scale quantum computing era, yet it conflicts with the weak decoherence required for high-fidelity computation. We solve the time-optimal reset problem for a…
We determine how to optimally reset a superconducting qubit which interacts with a thermal environment in such a way that the coupling strength is tunable. Describing the system in terms of a time-local master equation with time-dependent…
Recent experiments have implemented resetting by means of a time-varying external harmonic trap whereby the trap stiffness is changed from an initial to a final value in finite-time and then the system is reset when it relaxes to an…
To achieve fast computation, it is crucial to reset the memory to a desired state within a limited time. However, the inherent delay in the system's response often prevents reaching the desired state once the control process is completed in…
Rapid and accurate initialization of qubits, reset, is a crucial building block for various tasks in quantum information processing, such as quantum error-correction and estimation of statistics of noisy quantum devices with many qubits. We…
Bit reset is a basic operation in irreversible computing. This costs work and dissipates energy in the computer, creating a limit on speeds and energy efficiency of future irreversible computers. It was recently shown in [Phys. Rev. Lett.…
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…
Achieving sufficiently low residual excited-state populations remains a key challenge in superconducting quantum circuits, particularly for protocols operating close to noise limits or requiring repeated qubit initialization. Existing…
Near-term quantum computations are limited by high error rates, the scarcity of qubits and low qubit connectivity. Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse that may…
Many quantum algorithms demand a large number of repetitions to obtain reliable statistical results. Thus, at each repetition it is necessary to reset the qubits efficiently and precisely in the shortest possible time, so that quantum…
Landauer's bound is the minimum thermodynamic cost for erasing one bit of information. As this bound is achievable only for quasistatic processes, finite-time operation incurs additional energetic costs. We find a tight finite-time…