Erasing a majority-logic bit
arXiv:2010.15885 · doi:10.1209/0295-5075/133/30002
Abstract
We study finite-time bit erasure in the context of majority-logic decoding. In particular, we calculate the minimum amount of work needed to erase a majority-logic bit when one has full control over the system dynamics. Although a single unit bit is easier to erase in the slow-driving limit, the majority-logic bit outperforms the single unit bit in the fast-erasure limit. Our results also suggest optimal design principles for majority-logic bits under limited control.
References in corpus (20)
- Stochastic thermodynamics, fluctuation theorems, and molecular machines
- High-precision test of Landauer's principle in a feedback trap
- Ensemble and Trajectory Thermodynamics: A Brief Introduction
- Optimal protocols and optimal transport in stochastic thermodynamics
- Refined Second Law of Thermodynamics for fast random processes
- Finite-time Landauer principle
- Large work extraction and the Landauer limit in a continuous Maxwell demon
- Efficiency of molecular motors at maximum power
- Optimal finite-time erasure of a classical bit
- Memory erasure in small systems
- Erasure without work in an asymmetric, double-well potential
- Finite-time erasing of information stored in fermionic bits
- Direct measurement of nonequilibrium system entropy is consistent with Gibbs-Shannon form
- Optimal finite-time bit erasure under full control
- Phase transition in protocols minimizing work fluctuations
- Detailed Jarzynski Equality applied on a Logically Irreversible Procedure
- Nonequilibrium thermodynamics of erasure with superconducting flux logic
- Balancing Error and Dissipation in Computing
- Optimization of stochastic thermodynamic machines
- Thermodynamics of majority-logic decoding in information erasure