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

A beginning in the reversible logic synthesis of sequential circuits

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

Published Sep 7, 2005• 91 citations
OpenAlex

Abstract

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

Related papers

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

Introduction to Reversible Logic Gates and its Operations

Vivek Singh, K. B. Ramesh

Abstract: Reversible logic is one of the most important issues at the moment and has a wide range of applications, such as low power CMOS, quantum computing, nanotechnol- ogy, cryptography, optical computing, DNA computing, and -digital signal processing (DSP), quantum Dot automata for mobile, communication, computer graphics. It is not possible to detect quantum computing without the implementation of a postponed brain operation. The main objectives of design are logical thinking to reduce quantum costs, circuit depths and the amount of waste disposal. This paper provides basic logical retrospective gates, which in the construction of a highly sophisticated system with retractable circuits as part of the old and unable to perform the most complex operations using quantum computers. Reversible circuits form the basic building block of quantum computers as all quantum functions are reversed. This paper presents data related to older retractable gates found in books and assists research in the design of complex computer circuits using retractable gates. Keywords: Defendable Logic, Portable Gate, Dismissal, Trash, Quantum Cost, Quantum-dot Cellular Automata, Reversible Computing, Reversible ALU, Flip Flop using Reversible Gates, Reversible Adder

International Journal for Research in Applied Science and Engineering Technology•Feb 26, 2022•10 citations

Implementation of Combinational and Sequential Logic Circuits using Quantum Computing

Neha M Harapanhalli, M Kavipriya, Ishwari Jigajinni +1 more

Quantum computing is an area of computer science that uses the principles of quantum theory. Quantum computing is a booming field and could lead significant advances in various fields, from chemistry to material science to nuclear physics and machine learning. Quantum computing uses quantum bits as a fundamental building block of computations. The power of quantum bits is their ability to scale exponentially, which makes complex computations faster and efficient. The objective of this paper is to design Flip Flops and combinational logic circuits using quantum computing. Flip Flops and combinational circuits assist in complex computations with reduced delay, and high efficiency when designed using quantum computing. The flip flops and adders can henceforth be used in several applications.

International Journal of Scientific Research in Computer Science Engineering and Information Technology•Jun 1, 2023•0 citations

On design of multiple-valued sequential reversible circuits for nanotechnology based systems

Majid Mohammadi, Mohammad Eshghi, Majid Haghparast

Multiple-valued reversible logic is an emerging area in reversible and quantum logic circuit synthesis. Multiple-valued reversible logic circuits can potentially reduce the width of the reversible or quantum circuit which is a limitation in current quantum technology. In this paper we propose a method to synthesize the multiple-valued reversible sequential circuits. Implementations for ternary D and T flip flops and edge triggered D flip flop are proposed. Synthesis of generalized fanout circuit and generalized r-valued T flip flop are also presented.

IEEE Region 10 Conference (TENCON)•Nov 1, 2008•18 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

In-depth Comparative Analysis of Reversible Gates for Designing Logic Circuits

Hari Mohan Gaur, Ashutosh Kumar Singh, Umesh Ghanekar

Reversible logic is expanding grounds with its applicability to various upcoming technologies and quantum computation. Numerous reversible gates has also been proposed for designing logic circuits apart of basic quantum controlled Toffoli and Fredkin gates. A comparative study and analysis of a range of reversible gates from the literature is presented in this paper to obtain an optimal solution for designing these circuits. The gates are synthesized and implemented to obtain equivalent quantum circuits and operating cost in terms of number of inputs, gate cost, quantum cost, garbage output and ancilla input. The comparison is done at two subsequent levels i.e. gates structural level and circuit design level, providing a better solution for designing logic circuits. It is calculated that, basic gates are 50% efficient at gate level and 33% at design level analysis in terms of gate cost, as compared to the most efficient gates proposed in the literature.

Procedia Computer Science•Jan 1, 2018•38 citations
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
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.
Abstract: Reversible logic is one of the most important issues at the moment and has a wide range of applications, such as low power CMOS, quantum computing, nanotechnol- ogy, cryptography, optical computing, DNA computing, and -digital signal processing (DSP), quantum Dot automata for mobile, communication, computer graphics. It is not possible to detect quantum computing without the implementation of a postponed brain operation. The main objectives of design are logical thinking to reduce quantum costs, circuit depths and the amount of waste disposal. This paper provides basic logical retrospective gates, which in the construction of a highly sophisticated system with retractable circuits as part of the old and unable to perform the most complex operations using quantum computers. Reversible circuits form the basic building block of quantum computers as all quantum functions are reversed. This paper presents data related to older retractable gates found in books and assists research in the design of complex computer circuits using retractable gates. Keywords: Defendable Logic, Portable Gate, Dismissal, Trash, Quantum Cost, Quantum-dot Cellular Automata, Reversible Computing, Reversible ALU, Flip Flop using Reversible Gates, Reversible Adder
Quantum computing is an area of computer science that uses the principles of quantum theory. Quantum computing is a booming field and could lead significant advances in various fields, from chemistry to material science to nuclear physics and machine learning. Quantum computing uses quantum bits as a fundamental building block of computations. The power of quantum bits is their ability to scale exponentially, which makes complex computations faster and efficient. The objective of this paper is to design Flip Flops and combinational logic circuits using quantum computing. Flip Flops and combinational circuits assist in complex computations with reduced delay, and high efficiency when designed using quantum computing. The flip flops and adders can henceforth be used in several applications.
Multiple-valued reversible logic is an emerging area in reversible and quantum logic circuit synthesis. Multiple-valued reversible logic circuits can potentially reduce the width of the reversible or quantum circuit which is a limitation in current quantum technology. In this paper we propose a method to synthesize the multiple-valued reversible sequential circuits. Implementations for ternary D and T flip flops and edge triggered D flip flop are proposed. Synthesis of generalized fanout circuit and generalized r-valued T flip flop are also presented.
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.
Reversible logic is expanding grounds with its applicability to various upcoming technologies and quantum computation. Numerous reversible gates has also been proposed for designing logic circuits apart of basic quantum controlled Toffoli and Fredkin gates. A comparative study and analysis of a range of reversible gates from the literature is presented in this paper to obtain an optimal solution for designing these circuits. The gates are synthesized and implemented to obtain equivalent quantum circuits and operating cost in terms of number of inputs, gate cost, quantum cost, garbage output and ancilla input. The comparison is done at two subsequent levels i.e. gates structural level and circuit design level, providing a better solution for designing logic circuits. It is calculated that, basic gates are 50% efficient at gate level and 33% at design level analysis in terms of gate cost, as compared to the most efficient gates proposed in the literature.