A Shortcut to Finite-time Memory Erasure

• URL: http://arxiv.org/abs/2307.00964v1
• Date: Mon, 3 Jul 2023 12:32:25 GMT
• Title: A Shortcut to Finite-time Memory Erasure
• Authors: Geng Li and Hui Dong
• Abstract summary: 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.
• Score: 1.7818230914983046
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 finite time. To address this challenge, we propose a shortcut strategy that incorporates an auxiliary control to guide the system towards an equilibrium state that corresponds to the intended control, thus enabling accurate memory reset. Through the application of thermodynamic geometry, we derive an optimal shortcut protocol for erasure processes that minimizes the energy cost. This research provides an effective design principle for realizing the finite-time erasure process while simultaneously reducing the energy cost, thereby alleviating the burden of heat dissipation.

Related papers

• Temporal Feature Matters: A Framework for Diffusion Model Quantization [105.3033493564844]
  Diffusion models rely on the time-step for the multi-round denoising. We introduce a novel quantization framework that includes three strategies. This framework preserves most of the temporal information and ensures high-quality end-to-end generation.
  arXiv  Detail & Related papers  (2024-07-28T17:46:15Z)
• Efficiently Cooling Quantum Systems with Finite Resources: Insights from Thermodynamic Geometry [0.0]
  Landauer's limit on heat dissipation during information erasure is critical as devices shrink. We address the challenge of cooling quantum systems with finite resources.
  arXiv  Detail & Related papers  (2024-04-09T22:57:42Z)
• Growing Q-Networks: Solving Continuous Control Tasks with Adaptive Control Resolution [51.83951489847344]
  In robotics applications, smooth control signals are commonly preferred to reduce system wear and energy efficiency. In this work, we aim to bridge this performance gap by growing discrete action spaces from coarse to fine control resolution. Our work indicates that an adaptive control resolution in combination with value decomposition yields simple critic-only algorithms that yield surprisingly strong performance on continuous control tasks.
  arXiv  Detail & Related papers  (2024-04-05T17:58:37Z)
• Learning Non-myopic Power Allocation in Constrained Scenarios [42.63629364161481]
  We propose a learning-based framework for efficient power allocation in ad hoc interference networks under episodic constraints. We employ an actor-critic algorithm to obtain the constraint-aware power allocation at each step.
  arXiv  Detail & Related papers  (2024-01-18T04:44:34Z)
• 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)
• Adaptive Planning Search Algorithm for Analog Circuit Verification [53.97809573610992]
  We propose a machine learning (ML) approach, which uses less simulations. We show that the proposed approach is able to provide OCCs closer to the specifications for all circuits.
  arXiv  Detail & Related papers  (2023-06-23T12:57:46Z)
• Universal shortcuts to adiabaticity of finite-time and weak processes [0.0]
  shortcuts to adiabaticity for any switching time and any thermally isolated system performing a finite-time and weak process is presented. It is based on the universal solution of the optimal protocols of weak processes, where the extension to adiabatic processes was made by means of the concept of waiting time.
  arXiv  Detail & Related papers  (2023-05-28T19:27:18Z)
• Geodesic path for the minimal energy cost in shortcuts to isothermality [4.156535226615695]
  Shortcut to isothermality is a driving strategy to steer the system to its equilibrium states within finite time. Finding optimal scheme to minimize the energy cost is of critical importance in applications of this strategy in pharmaceutical drug test, biological selection, and quantum computation.
  arXiv  Detail & Related papers  (2021-10-18T09:44:29Z)
• 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)
• Delay-Tolerant Constrained OCO with Application to Network Resource Allocation [44.67787270821051]
  We consider online convex optimization (OCO) with multi-slot feedback delay. An agent makes a sequence of online decisions to minimize the accumulation of time-varying convex loss functions. We propose Delay-Tolerant Constrained-OCO, which uses a novel constraint penalty with double regularization to tackle the asynchrony between information feedback and decision updates.
  arXiv  Detail & Related papers  (2021-05-09T19:32:33Z)
• Targeted free energy estimation via learned mappings [66.20146549150475]
  Free energy perturbation (FEP) was proposed by Zwanzig more than six decades ago as a method to estimate free energy differences. FEP suffers from a severe limitation: the requirement of sufficient overlap between distributions. One strategy to mitigate this problem, called Targeted Free Energy Perturbation, uses a high-dimensional mapping in configuration space to increase overlap.
  arXiv  Detail & Related papers  (2020-02-12T11:10:00Z)

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.