Erasing a majority-logic bit

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 (9)

• High-precision test of Landauer's principle in a feedback trap
• Ensemble and Trajectory Thermodynamics: A Brief Introduction
• Finite-time Landauer principle
• Large work extraction and the Landauer limit in a continuous Maxwell demon
• Efficiency of molecular motors at maximum power
• Erasure without work in an asymmetric, double-well potential
• Finite-time erasing of information stored in fermionic bits
• Optimal finite-time bit erasure under full control
• Thermodynamics of majority-logic decoding in information erasure