Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/36430
Title: | Erasing a majority-logic bit | Authors: | PROESMANS, Karel Bechhoefer, John |
Issue Date: | 2021 | Publisher: | IOP Publishing Ltd | Source: | EPL, 133 (3) (Art N° 30002) | 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. 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. Copyright (C) 2021 EPLA | Notes: | Proesmans, K (corresponding author), Univ Luxembourg, Dept Phys, Luxembourg, Luxembourg.; Proesmans, K (corresponding author), Hasselt Univ, B-3590 Diepenbeek, Belgium.; Proesmans, K (corresponding author), Simon Fraser Univ, Dept Phys, Burnaby, BC V5A 1S6, Canada. | Document URI: | http://hdl.handle.net/1942/36430 | ISSN: | 0295-5075 | e-ISSN: | 1286-4854 | DOI: | 10.1209/0295-5075/133/30002 | ISI #: | 000731464800002 | Rights: | 2021 EPLA | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2022 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ACFrOgDzlf1Bk1T_UDjiWUAhvFDOFAymciea3U_AJ6BiZ4U0VLdw_frId8ZgdhrdGXrSbQ4fToSSl66teV9XBjHbg-GRuOSAJa0TDS152GiwC9uywC_4XV1g6eyKBh4=.pdf | Peer-reviewed author version | 398.72 kB | Adobe PDF | View/Open |
untitled.pdf Restricted Access | Published version | 415.07 kB | Adobe PDF | View/Open Request a copy |
WEB OF SCIENCETM
Citations
2
checked on Sep 27, 2024
Page view(s)
36
checked on Sep 7, 2022
Download(s)
10
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.