Erasing a majority-logic bit

TL;DR

This paper investigates the thermodynamics of erasing majority-logic bits, revealing that they outperform single-unit bits in fast erasure scenarios and providing design principles for their optimal control.

Contribution

It introduces a detailed analysis of finite-time erasure for majority-logic bits, highlighting their advantages over single-unit bits in specific regimes and proposing optimal control strategies.

Findings

Majority-logic bits outperform single-unit bits in fast erasure.

Minimum work for erasure depends on control speed and system design.

Optimal control principles are identified for majority-logic bits.

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.