Qubit Reset with a Shortcut-to-Isothermal Scheme

• URL: http://arxiv.org/abs/2310.18997v1
• Date: Sun, 29 Oct 2023 12:49:01 GMT
• Title: Qubit Reset with a Shortcut-to-Isothermal Scheme
• Authors: Hong-Bo Huang, Geng Li and Hui Dong
• Abstract summary: 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.
• Score: 0.9803970018221114
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: 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 for quantum bit (qubit) where both the operation time and controllability are limited. We design a shortcut-to-isothermal scheme to reset a qubit in finite time $\tau$ with limited controllability. The energy cost is minimized with the optimal control scheme with and without nonholonomic constraint. This optimal control scheme can provide a reference to realize qubit reset with minimum energy cost for the limited time.

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)
• Novel Quadratic Constraints for Extending LipSDP beyond Slope-Restricted Activations [52.031701581294804]
  Lipschitz bounds for neural networks can be computed with upper time preservation guarantees. Our paper bridges the gap and extends Lipschitz beyond slope-restricted activation functions. Our proposed analysis is general and provides a unified approach for estimating $ell$ and $ell_infty$ Lipschitz bounds.
  arXiv  Detail & Related papers  (2024-01-25T09:23:31Z)
• Settling the Sample Complexity of Online Reinforcement Learning [92.02082223856479]
  We show how to achieve minimax-optimal regret without incurring any burn-in cost. We extend our theory to unveil the influences of problem-dependent quantities like the optimal value/cost and certain variances.
  arXiv  Detail & Related papers  (2023-07-25T15:42:11Z)
• 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)
• 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)
• A Unifying Framework for Online Optimization with Long-Term Constraints [62.35194099438855]
  We study online learning problems in which a decision maker has to take a sequence of decisions subject to $m$ long-term constraints. The goal is to maximize their total reward, while at the same time achieving small cumulative violation across the $T$ rounds. We present the first best-of-both-world type algorithm for this general class problems, with no-regret guarantees both in the case in which rewards and constraints are selected according to an unknown model, and in the case in which they are selected at each round by an adversary.
  arXiv  Detail & Related papers  (2022-09-15T16:59:19Z)
• 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)
• Minimal Energy Cost to Initialize a Quantum Bit with Tolerable Error [2.6930669375071323]
  Landauer's principle imposes a fundamental limit on the energy cost to perfectly initialize a classical bit. We find a raise-up of energy cost by $mathcalL2(epsilon)/tau$ from the Landaeur's limit. optimal protocol to reach the bound of minimal energy cost is proposed.
  arXiv  Detail & Related papers  (2021-12-14T11:35:58Z)
• 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)
• Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret [144.6358229217845]
  We study the problem of learning in the shortest path (SSP) setting, where an agent seeks to minimize the expected cost accumulated before reaching a goal state. We design a novel model-based algorithm EB-SSP that carefully skews the empirical transitions and perturbs the empirical costs with an exploration bonus. We prove that EB-SSP achieves the minimax regret rate $widetildeO(B_star sqrtS A K)$, where $K$ is the number of episodes, $S$ is the number of states, $A$
  arXiv  Detail & Related papers  (2021-04-22T17:20:48Z)
• Controlling Rayleigh-B\'enard convection via Reinforcement Learning [62.997667081978825]
  The identification of effective control strategies to suppress or enhance the convective heat exchange under fixed external thermal gradients is an outstanding fundamental and technological issue. In this work, we explore a novel approach, based on a state-of-the-art Reinforcement Learning (RL) algorithm. We show that our RL-based control is able to stabilize the conductive regime and bring the onset of convection up to a Rayleigh number.
  arXiv  Detail & Related papers  (2020-03-31T16:39:25Z)

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.