LeetArxiv

LeetArxiv

Share this post

LeetArxiv
LeetArxiv
Logical Reversibility of Computation

Logical Reversibility of Computation

[Coding Guide] Programmer's Introduction to Reversible Computing for Quantum, Thermodynamic and Catalytic Computers

May 27, 2025
∙ Paid

Share this post

LeetArxiv
LeetArxiv
Logical Reversibility of Computation
1
Share
Quick intro
LeetArxiv is Leetcode for implementing Arxiv and other research papers.

Stop reading papers. Start coding them. Subscribe for weekly paper implementations, one semicolon at a time.

1.0 Introduction

Frontmatter for the 1973 paper “Logical Reversibility of Computation” by C.H Bennett

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 :

  1. Quantum computing, Thermodynamic computing and Catalytic computing are different computational paradigms stemming from the idea of reversible computers.

  2. 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.

Already a paid subscriber? Sign in
© 2025 Murage Kibicho
Privacy ∙ Terms ∙ Collection notice
Start writingGet the app
Substack is the home for great culture

Share