Sub-kBT micro-electromechanical irreversible logic gate
M. López-Suárez (),
I. Neri () and
L. Gammaitoni
Additional contact information
M. López-Suárez: NiPS Laboratory, Università degli Studi di Perugia—via Pascoli
I. Neri: NiPS Laboratory, Università degli Studi di Perugia—via Pascoli
L. Gammaitoni: NiPS Laboratory, Università degli Studi di Perugia—via Pascoli
Nature Communications, 2016, vol. 7, issue 1, 1-6
Abstract:
Abstract In modern computers, computation is performed by assembling together sets of logic gates. Popular gates like AND, OR and XOR, processing two logic inputs and yielding one logic output, are often addressed as irreversible logic gates, where the sole knowledge of the output logic value is not sufficient to infer the logic value of the two inputs. Such gates are usually believed to be bounded to dissipate a finite minimum amount of energy determined by the input–output information difference. Here we show that this is not necessarily the case, by presenting an experiment where a OR logic gate, realized with a micro-electromechanical cantilever, is operated with energy well below the expected limit, provided the operation is slow enough and frictional phenomena are properly addressed.
Date: 2016
References: Add references at CitEc
Citations:
Downloads: (external link)
https://www.nature.com/articles/ncomms12068 Abstract (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:nat:natcom:v:7:y:2016:i:1:d:10.1038_ncomms12068
Ordering information: This journal article can be ordered from
https://www.nature.com/ncomms/
DOI: 10.1038/ncomms12068
Access Statistics for this article
Nature Communications is currently edited by Nathalie Le Bot, Enda Bergin and Fiona Gillespie
More articles in Nature Communications from Nature
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().