Inverse linear versus exponential scaling of work penalty in finite-time bit reset

• URL: http://arxiv.org/abs/2112.10449v3
• Date: Sun, 29 May 2022 09:06:27 GMT
• Title: Inverse linear versus exponential scaling of work penalty in finite-time bit reset
• Authors: Yi-Zheng Zhen, Dario Egloff, Kavan Modi, Oscar Dahlsten
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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. 127, 190602 (2021)] that for a finite-time reset protocol, the additional work on top of the quasistatic protocol can always be minimized by considering a two-level system, and then be lower bounded through a thermodynamical speed limit. 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.

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)
• To reset, or not to reset -- that is the question [2.749898166276854]
  Text-book quantum error correction demands that qubits are reset after measurement. Many cutting-edge quantum error correction experiments are opting for the no-reset approach. We find that unconditionally resetting qubits can reduce the duration of fault-tolerant logical operation by up to a factor of two.
  arXiv  Detail & Related papers  (2024-08-01T17:57:56Z)
• Collective advantages in qubit reset: effect of coherent qubits [7.2589497361729975]
  We explore the collective advantage of qubit reset of coherent qubits in three aspects. For the quasistatic process, the thermodynamic cost of collective reset is remarkably lower than parallel reset. We show that qubit reset performance enhances with the increase in the number of qubits.
  arXiv  Detail & Related papers  (2024-07-03T13:35:29Z)
• 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)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• Universal Bound on Energy Cost of Bit Reset in Finite Time [0.0]
  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.
  arXiv  Detail & Related papers  (2021-06-01T15:47:38Z)
• Activation Relaxation: A Local Dynamical Approximation to Backpropagation in the Brain [62.997667081978825]
  Activation Relaxation (AR) is motivated by constructing the backpropagation gradient as the equilibrium point of a dynamical system. Our algorithm converges rapidly and robustly to the correct backpropagation gradients, requires only a single type of computational unit, and can operate on arbitrary computation graphs.
  arXiv  Detail & Related papers  (2020-09-11T11:56:34Z)
• 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.