Erasing a majority-logic bit

Abstract We study finite-time bit erasure in the context of majority-logic decoding. In particular, we calculate minimum amount work needed to erase a when one has full control over system dynamics. show that although single unit is easier slow-driving limit, general outperforms fast-erasure limit. Our results also suggest optimal design principles for bits under limited control.