Reversible Computing and Quantum Computing

• Published in: Ultra Low Power Electronics and Adiabatic Solutions pp. 203 - 235
• Main Author: Fanet, Hervé
• Format: Book Chapter
• Language: English
• Published: United States John Wiley & Sons, Incorporated 2016; John Wiley & Sons, Inc
• Subjects: complex matrices; ELECTRONICS & COMMUNICATIONS ENGINEERING; Grover's algorithm; logic architectures; mathematical tools; reversible computing; reversible logic gate
• ISBN: 9781848217386; 1848217382
• DOI: 10.1002/9781119006541.ch6

This chapter provides reversible computing; allowing people to define the different reversible logic gate families, as well as the basic elements for synthesizing reversible logic architectures. The subject may seem complicated, but it will also be new for many peoples, as this approach is neither well known nor taught often. The people will no doubt find the mathematical richness of these concepts introduced, as well as by the contribution that group theory has made to synthesizing reversible logic architectures very useful. Quantum computing has points in common with reversible computing, especially when people think of descriptive mathematical tools and synthesis methods. However, it is fundamentally different because it does not manipulate 0 and 1 matrix elements like reversible computing, but uses more complex matrices. In order to illustrate this property, this is a huge part of quantum computing, let people use the example of Grover's algorithm.