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

CRC Press eBooks

A comparative study of reversible circuits using QDCA and formulation of new universal reversible gate

S. P. Ghosal, K. Chakraborty, Barnik Mandal

Published Dec 10, 2016• 0 citations
Publisher
DOI
10.1201/9781315375021-6

Related papers

A Single Universal n-bit Gate for Reversible Circuit Synthesis

Ahmed Younes

Many universal reversible libraries that contain more than one gate type have been proposed in the literature. Practical implementation of reversible circuits is much easier if a single gate type is used in the circuit construction. This paper proposes a reversible n-bit gate that is universal for reversible circuits synthesis. The proposed gate is extendable according to the size of the circuit. The paper shows that the size of the synthesized circuits using the proposed gate is comparable with the size of the synthesized circuits using the hybrid reversible libraries for 3-in/out reversible circuits.

arXiv:1306.1254•Jun 5, 2013•2 citations

Reliable Design of Reversible Universal Gate Based on QCA

Nuriddin Safoev, Jun‐Cheol Jeon

Advanced Science Letters•Oct 1, 2017•6 citations

Analysis of Reversible Logic Gates

Priyanka Priyanka, K M Rajesh

•Dec 8, 2017•1 citation

On the Universality of n-bit Reversible Gate Libraries

Ahmed Younes

Many universal reversible libraries of gates that contain more than one gate type have been proposed in the literature. Synthesis of reversible circuits is much simpler and more practical if a single gate type is used in the circuit construct ion. This paper proposes a novel reversible n-bit gate that is universal for reversible circuits synthes is. The proposed gate is extendable according to the number of bits in the circuit. The paper shows that the size of the synthesized circuits using the proposed gate is comparable with the size of the synthesized circuits using the known reversible libraries of gates.

Applied Mathematics & Information Sciences•Jan 1, 2015•9 citations

Designing Parity Preserving Reversible Circuits

Goutam Paul, Anupam Chattopadhyay, Chander Chandak

arXiv:1308.0840•Lecture notes in computer science•Jan 1, 2017•6 citations

An analysis of reversible multiplier circuits

Anindita Banerjee, Anirban Pathak

Multiplier circuits play an important role in reversible computation, which is helpful in diverse areas such as low power CMOS design, optical computing, DNA computing and bioinformatics. Here we propose a new reversible multiplier circuit with optimized hardware complexity. The optimized multiplier circuit is compared with the earlier proposals. We have shown that the quantum cost of earlier proposals can be further reduced with the help of existing local optimization algorithms (e.g. template matching, moving rule and deletion rule). A systematic protocol for reduction of quantum cost has been proposed. It has also been shown that the advantage in gate count obtained in some of the earlier proposals by introduction of new reversible gates is an artifact and if it is allowed then every circuit block can be reduced to a single gate. Further, it is shown that the 4x4 reversible gates proposed for designing of a component of multiplier circuit (full adder) is neither unique nor special and many such 4x4 gates may be proposed. As example three such new gates have been presented here and it is shown that the proposed gates are universal. It is also shown that the total cost of our design is minimum.

arXiv:0907.3357•Jul 20, 2009•16 citations
Many universal reversible libraries that contain more than one gate type have been proposed in the literature. Practical implementation of reversible circuits is much easier if a single gate type is used in the circuit construction. This paper proposes a reversible n-bit gate that is universal for reversible circuits synthesis. The proposed gate is extendable according to the size of the circuit. The paper shows that the size of the synthesized circuits using the proposed gate is comparable with the size of the synthesized circuits using the hybrid reversible libraries for 3-in/out reversible circuits.
Many universal reversible libraries of gates that contain more than one gate type have been proposed in the literature. Synthesis of reversible circuits is much simpler and more practical if a single gate type is used in the circuit construct ion. This paper proposes a novel reversible n-bit gate that is universal for reversible circuits synthes is. The proposed gate is extendable according to the number of bits in the circuit. The paper shows that the size of the synthesized circuits using the proposed gate is comparable with the size of the synthesized circuits using the known reversible libraries of gates.
Multiplier circuits play an important role in reversible computation, which is helpful in diverse areas such as low power CMOS design, optical computing, DNA computing and bioinformatics. Here we propose a new reversible multiplier circuit with optimized hardware complexity. The optimized multiplier circuit is compared with the earlier proposals. We have shown that the quantum cost of earlier proposals can be further reduced with the help of existing local optimization algorithms (e.g. template matching, moving rule and deletion rule). A systematic protocol for reduction of quantum cost has been proposed. It has also been shown that the advantage in gate count obtained in some of the earlier proposals by introduction of new reversible gates is an artifact and if it is allowed then every circuit block can be reduced to a single gate. Further, it is shown that the 4x4 reversible gates proposed for designing of a component of multiplier circuit (full adder) is neither unique nor special and many such 4x4 gates may be proposed. As example three such new gates have been presented here and it is shown that the proposed gates are universal. It is also shown that the total cost of our design is minimum.