Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/36430
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPROESMANS, Karel-
dc.contributor.authorBechhoefer, John-
dc.date.accessioned2022-01-10T15:15:39Z-
dc.date.available2022-01-10T15:15:39Z-
dc.date.issued2021-
dc.date.submitted2021-12-23T12:40:44Z-
dc.identifier.citationEPL, 133 (3) (Art N° 30002)-
dc.identifier.issn0295-5075-
dc.identifier.urihttp://hdl.handle.net/1942/36430-
dc.description.abstractWe 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-
dc.description.sponsorshipWe thank Jannik Ehrich and Massimiliano Esposito for discussions. This research was supported by a Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery Grant and also by grant No. FQXi-IAF19-02 from the Foundational Questions Institute Fund, a donor-advised fund of the Silicon Valley Community Foundation. KP received funding as a postdoctoral fellow of the Research Foundation-Flanders (FWO).-
dc.language.isoen-
dc.publisherIOP Publishing Ltd-
dc.rights2021 EPLA-
dc.titleErasing a majority-logic bit-
dc.typeJournal Contribution-
dc.identifier.issue3-
dc.identifier.volume133-
local.format.pages7-
local.bibliographicCitation.jcatA1-
dc.description.notesProesmans, 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.-
local.publisher.placeTEMPLE CIRCUS, TEMPLE WAY, BRISTOL BS1 6BE, ENGLAND-
local.type.refereedRefereed-
local.type.specifiedArticle-
local.bibliographicCitation.artnr30002-
dc.identifier.doi10.1209/0295-5075/133/30002-
dc.identifier.isi000731464800002-
dc.identifier.eissn1286-4854-
local.provider.typewosris-
local.description.affiliation[Proesmans, Karel] Univ Luxembourg, Dept Phys, Luxembourg, Luxembourg.-
local.description.affiliation[Proesmans, Karel] Hasselt Univ, B-3590 Diepenbeek, Belgium.-
local.description.affiliation[Proesmans, Karel; Bechhoefer, John] Simon Fraser Univ, Dept Phys, Burnaby, BC V5A 1S6, Canada.-
local.uhasselt.internationalyes-
item.fulltextWith Fulltext-
item.contributorPROESMANS, Karel-
item.contributorBechhoefer, John-
item.fullcitationPROESMANS, Karel & Bechhoefer, John (2021) Erasing a majority-logic bit. In: EPL, 133 (3) (Art N° 30002).-
item.accessRightsOpen Access-
item.validationecoom 2022-
crisitem.journal.issn0295-5075-
crisitem.journal.eissn1286-4854-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
ACFrOgDzlf1Bk1T_UDjiWUAhvFDOFAymciea3U_AJ6BiZ4U0VLdw_frId8ZgdhrdGXrSbQ4fToSSl66teV9XBjHbg-GRuOSAJa0TDS152GiwC9uywC_4XV1g6eyKBh4=.pdfPeer-reviewed author version398.72 kBAdobe PDFView/Open
untitled.pdf
  Restricted Access		Published version415.07 kBAdobe PDFView/Open    Request a copy
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.