Logical Reversibility of Computation
[Coding Guide] Programmer's Introduction to Reversible Computing for Quantum, Thermodynamic and Catalytic Computers
Quick intro
LeetArxiv is Leetcode for implementing Arxiv and other research papers.
1.0 Introduction
In this paper, C.H Bennett (1973)1 introduces the concept of designing logical gates that enable reversible computing.
Reversible computing is founded on the observation that information loss in classical Boolean circuits is linked to heat dissipation (Landauer 1961)2. Making computing reversible leads to little heat loss, making computations more energy efficient.
1.1 Paper’s Importance
This paper is canonical in the following ways :
Quantum computing, Thermodynamic computing and Catalytic computing are different computational paradigms stemming from the idea of reversible computers.
This paper motivates the design of Toffoli gates in 19803 and Fredkin gates in 19814.
The paper’s theory builds upon a 3-tape turing machine. Implementing this is not particularly useful and so, we shall spend the rest of the article coding reversible logic gates.
Keep reading with a 7-day free trial
Subscribe to LeetArxiv to keep reading this post and get 7 days of free access to the full post archives.