Universal Bound on Energy Cost of Bit Reset in Finite Time
- URL: http://arxiv.org/abs/2106.00580v2
- Date: Thu, 14 Oct 2021 02:21:44 GMT
- Title: Universal Bound on Energy Cost of Bit Reset in Finite Time
- Authors: Yi-Zheng Zhen, Dario Egloff, Kavan Modi, Oscar Dahlsten
- Abstract summary: We consider how the energy cost of bit reset scales with the time duration of the protocol.
We derive a closed-form lower bound on the work penalty as a function of the time taken for the protocol and the bit reset error.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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
extra energy is dissipated as heat in the computer, inducing a fundamental
limit on the speed of irreversible computers. We formulate a
hardware-independent expression for this limit in the framework of stochastic
processes. We derive a closed-form lower bound on the work penalty as a
function of the time taken for the protocol and bit reset error. It holds for
discrete as well as continuous systems, assuming only that the master equation
respects detailed balance.
Related papers
- Optimally Fast Qubit Reset [7.2589497361729975]
We determine the minimal thermodynamic cost and the optimal protocol for arbitrary resetting speeds.
Our results suggest that the super-Ohmic bosonic heat bath is a suitable choice for qubit reset.
arXiv Detail & Related papers (2024-12-06T09:25:13Z) - On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
We decompose arbitrary exponentials into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.
We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
arXiv Detail & Related papers (2024-08-15T17:09:08Z) - Qubit Reset with a Shortcut-to-Isothermal Scheme [0.9803970018221114]
Landauer's principle shows that the minimum energy cost to reset a classical bit in a bath with temperature $T$ is $k_BTln2$ in the infinite time.
We design a shortcut-to-isothermal scheme to reset a qubit in finite time $tau$ with limited controllability.
arXiv Detail & Related papers (2023-10-29T12:49:01Z) - A Shortcut to Finite-time Memory Erasure [1.7818230914983046]
We propose a shortcut strategy that incorporates an auxiliary control to guide the system towards an equilibrium state.
We derive an optimal shortcut protocol for erasure processes that minimizes the energy cost.
arXiv Detail & Related papers (2023-07-03T12:32:25Z) - Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices.
circuit cutting techniques enable the distribution of quantum computations through classical communication.
Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots.
We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
arXiv Detail & Related papers (2023-06-21T08:03:34Z) - Qubit Number Optimization for Restriction Terms of QUBO Hamiltonians [62.997667081978825]
It is mathematically allowed to ask for fractional values of $R$.
We show how they can reduce the number of qubits needed to implement the restriction hamiltonian even further.
Finally, we characterize the response of DWave's Advantage$_$system4.1 Quantum Annealer (QA) when faced with the implementation of FRCs.
arXiv Detail & Related papers (2023-06-12T08:25:56Z) - Quantum state preparation via engineered ancilla resetting [0.0]
We study a protocol that incorporates periodic quantum resetting to prepare ground states of frustration-free parent Hamiltonians.
This protocol uses a steering Hamiltonian that enables local coupling between the system and ancillary degrees of freedom.
Our numerical results show that ancilla system entanglement is essential for faster convergence.
arXiv Detail & Related papers (2023-05-15T13:34:07Z) - Simulating scalar field theories on quantum computers with limited
resources [62.997667081978825]
We present a quantum algorithm for implementing $phi4$ lattice scalar field theory on qubit computers.
The algorithm allows efficient $phi4$ state preparation for a large range of input parameters in both the normal and broken symmetry phases.
arXiv Detail & Related papers (2022-10-14T17:28:15Z) - Inverse linear versus exponential scaling of work penalty in finite-time
bit reset [0.0]
Bit reset costs work and dissipates energy in the computer, creating a limit on speeds and energy efficiency of future irreversible computers.
An important question is to understand under what protocol parameters, including bit reset error and maximum energy shift, this penalty decreases exponentially vs inverse linearly in the protocol time.
Here we provide several analytical results to address this question, as well as numerical simulations of specific examples of protocols.
arXiv Detail & Related papers (2021-12-20T11:21:05Z) - Acting in Delayed Environments with Non-Stationary Markov Policies [57.52103323209643]
We introduce a framework for learning and planning in MDPs where the decision-maker commits actions that are executed with a delay of $m$ steps.
We prove that with execution delay, deterministic Markov policies in the original state-space are sufficient for attaining maximal reward, but need to be non-stationary.
We devise a non-stationary Q-learning style model-based algorithm that solves delayed execution tasks without resorting to state-augmentation.
arXiv Detail & Related papers (2021-01-28T13:35:37Z) - Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum
Computer Using Inherent Qubit Decoherence [53.20999552522241]
We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems.
We present three methods for implementing the thermal relaxation.
We find excellent agreement between our results, experimental data, and the theoretical prediction.
arXiv Detail & Related papers (2020-01-03T11:48:11Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.