Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Wiley eBooks

Reversible Computing and Quantum Computing

Hervé Fanet

Published Aug 30, 2016• 0 citations
Publisher

Abstract

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.

DOI
10.1002/9781119006541.ch6

Related papers

A beginning in the reversible logic synthesis of sequential circuits

Himanshu Thapliyal, M.B. Srinivas, Mark Zwoliński

This paper provides the initial threshold to building of more complex system having reversible sequential circuits as a primitive component and which can execute more complicated operations using quantum computers. The reversible circuits form the basic building block of quantum computers as all quantum operations are reversible. The important reversible gates used for reversible logic synthesis are Feynman Gate, New Gate and Fredkin gate. The novelty of the paper is the reversible designs of Flip Flops. The Flip Flops that are synthesized using reversible logic are RS Flip Flop, JK Flip Flop, D Flip Flop, T Flip Flop and Master Slave Flip Flop

•Sep 7, 2005•91 citations

On synthesis of 3 × 3 reversible logic functions

Ming Gu, Guowu Yang, Xiaoyu Song +1 more

Reversible logic plays an important role in quantum computing. This article presents some novel results on synthesis of 3 × 3 reversible Boolean gates. We derive the relationship between reversible 3 × 3 gates and corresponding symmetric groups. By introducing a set of universal libraries, we show how to use group theory to synthesize any 3 × 3 reversible gate.

International Journal of Computer Mathematics•Feb 22, 2005•0 citations

Realization and synthesis of reversible functions throng double-coset

Fu Chen, Guowu Yang, Xiaoyu Li

Reversible circuits play an important role in quantum computation. The realization of reversible quantum circuits is required for any quantum computer to be universal. This paper1studies the realization and synthesis problem of reversible circuits. Using group theory, we present two sets of new 3-bit reversible logic gates, which included g1g2g3and nine complex gates, respectively. It is shown that any 3-bit reversible logic circuit is realizable by cascading NOT and Feynman gates, and at most one instance of our proposed gates. Given any n-bit reversible function, there are N distinct input patterns different from their corresponding outputs, where N ≤ 2n, and the other (2n- N) input patterns will be the same as their outputs. According to a synthesis example, it demonstrates that the main results are constructive and practical than others.

International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)•Dec 1, 2010•0 citations

Reversible Logic Synthesis

Hafiz Md. Hasan Babu

The main purposes of designing reversible logic circuits are to decrease quantum cost, depth of the circuits, and the number of garbage outputs. This chapter explains the basic reversible logic gates for more complex system, which may have reversible circuits as a primitive component and can execute complicated operations using quantum computers. It presents the information related to the primitive reversible gates and helps researchers in designing higher complex computing circuits using reversible gates. Reversible logic has unique mapping between input and output bit pattern. Constant inputs are the inputs of a reversible gate (or circuit) that are either set to 0 or 1. The quantum cost of a circuit is the total number of quantum primitives that are used to realize corresponding quantum circuit. The chapter presents some important design constraints for reversible logic circuits and discusses quantum analysis of different reversible logic gates.

Wiley eBooks•Aug 28, 2020•79 citations

Reversible computing: from mathematical group theory to electronical circuit experiment

Alexis De Vos, Yvan Van Rentergem

Reversible logic gates of a certain logic width w form a group (isomorphic to the symmetric group of order (2 w )!). Study of the subgroups of this group both teaches us a lot about properties of reversible gates and guides us to synthesize particular circuits. After design, circuits are implemented in prototype silicon chips.

ACM International Conference on Computing Frontiers (CF)•May 4, 2005•29 citations

Quantum Gates to Implement the Reversible Logic Circuits

Ali Hassan Khidhir

Quantum gates which are represented by unitary matrices have potentials to implement the reversible logic circuits. M and M+ gates are two well-known quantum gates which are used to synthesize the reversible logic circuits. In this work, we have used behavioral description of these gates, instead of unitary matrix description, to synthesize reversible logic circuits. By this method, M and M+ gates are shown in the truth table form.

Ibn AL- Haitham Journal For Pure and Applied Science•Apr 27, 2017•0 citations
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.
This paper provides the initial threshold to building of more complex system having reversible sequential circuits as a primitive component and which can execute more complicated operations using quantum computers. The reversible circuits form the basic building block of quantum computers as all quantum operations are reversible. The important reversible gates used for reversible logic synthesis are Feynman Gate, New Gate and Fredkin gate. The novelty of the paper is the reversible designs of Flip Flops. The Flip Flops that are synthesized using reversible logic are RS Flip Flop, JK Flip Flop, D Flip Flop, T Flip Flop and Master Slave Flip Flop
Reversible circuits play an important role in quantum computation. The realization of reversible quantum circuits is required for any quantum computer to be universal. This paper1studies the realization and synthesis problem of reversible circuits. Using group theory, we present two sets of new 3-bit reversible logic gates, which included g1g2g3and nine complex gates, respectively. It is shown that any 3-bit reversible logic circuit is realizable by cascading NOT and Feynman gates, and at most one instance of our proposed gates. Given any n-bit reversible function, there are N distinct input patterns different from their corresponding outputs, where N ≤ 2n, and the other (2n- N) input patterns will be the same as their outputs. According to a synthesis example, it demonstrates that the main results are constructive and practical than others.
The main purposes of designing reversible logic circuits are to decrease quantum cost, depth of the circuits, and the number of garbage outputs. This chapter explains the basic reversible logic gates for more complex system, which may have reversible circuits as a primitive component and can execute complicated operations using quantum computers. It presents the information related to the primitive reversible gates and helps researchers in designing higher complex computing circuits using reversible gates. Reversible logic has unique mapping between input and output bit pattern. Constant inputs are the inputs of a reversible gate (or circuit) that are either set to 0 or 1. The quantum cost of a circuit is the total number of quantum primitives that are used to realize corresponding quantum circuit. The chapter presents some important design constraints for reversible logic circuits and discusses quantum analysis of different reversible logic gates.