论文标题
抹去多数逻辑的位
Erasing a majority-logic bit
论文作者
论文摘要
我们在多数逻辑解码的背景下研究有限的时间擦除。特别是，当人们完全控制系统动力学时，我们计算删除多数持续位数所需的最小工作量。尽管一个单位位更容易在慢速驾驶极限下擦除，但大多数位位比在快速射击极限中优于单个单元位。我们的结果还表明，在有限的控制下，多数逻辑位的最佳设计原理。
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.
