Volume 133, Number 3, February 2021
|Number of page(s)||7|
|Published online||30 March 2021|
Erasing a majority-logic bit
1 Department of Physics, University of Luxembourg - Luxembourg, Luxembourg
2 Hasselt University - B-3590 Diepenbeek, Belgium
3 Department of Physics, Simon Fraser University - Burnaby, B.C., V5A 1S6, Canada
Received: 29 October 2020
Accepted: 7 January 2021
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. We show that although a single unit bit is easier to erase in the slow-driving limit, the majority-logic bit in general outperforms the single unit bit in the fast-erasure limit. Our results also suggest optimal design principles for majority-logic bits under limited control.
PACS: 05.70.Ln – Nonequilibrium and irreversible thermodynamics / 05.40.-a – Fluctuation phenomena, random processes, noise, and Brownian motion / 89.70.-a – Information and communication theory
© 2021 EPLA
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.