Erasing a majority-logic bit
Statistical Mechanics
2021-04-01 v1
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.
Cite
@article{arxiv.2010.15885,
title = {Erasing a majority-logic bit},
author = {Karel Proesmans and John Bechhoefer},
journal= {arXiv preprint arXiv:2010.15885},
year = {2021}
}