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

Ibn AL- Haitham Journal For Pure and Applied Science

Quantum Gates to Implement the Reversible Logic Circuits

Ali Hassan Khidhir

Published Apr 27, 2017• 0 citations
OpenAlex

Abstract

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.

Related papers

Behavioral description of quantum V and V+ gates to design quantum logic circuits

Majid Mohammadi, Mohammad Eshghi

Quantum gates which are represented by unitary matrices have potentials to implement reversible logic circuits. V and V+gates are two well known quantum gates which are used to synthesize the reversible logic circuits. In this paper we have used behavioral description of these gates, instead of unitary matrix description, to synthesize reversible logic circuits. By this method, V and V+gates are shown in the truth table form. Results show that bigger circuits with more number of gates can be synthesized using proposed method. Some benchmarks of reversible logic circuits are also optimized and compared to other works.

International Multi-Conference on Systems, Signals & Devices (SSD)•Jul 1, 2008•14 citations

Behavioral model of V and V+ gates to implement the reversible circuits using quantum gates

Majid Mohammadi, Mohammad Eshghi, Abbas Bahrololoom

This paper addresses using quantum gates to implement binary reversible logic circuits. We propose behavioral models for well known V and V+quantum gates. Our proposed representation is used to synthesize reversible logic circuits instead of using the known unitary matrix form of quantum gates. This technique allows V and V+gates to be represented in truth table forms. Results show that our technique can be used to synthesize circuits with bigger sizes and gate counts in compare with unitary matrix form of these gates. Several reversible circuit benchmarks are optimized and compared to related works.

IEEE Region 10 Conference (TENCON)•Nov 1, 2008•7 citations

Reversible Computing and Quantum Computing

Hervé Fanet

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.

Wiley eBooks•Aug 30, 2016•0 citations

Quantum Gates and Circuits

Kolla Bhanu Prakash

Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.

Wiley eBooks•Aug 17, 2026•0 citations

Construction of Quantum Circuits for Classical Logical Gates Using Quantum Gates with Qiskit

Sumathi Pawar, Suchetha N V, Ramasubramanian Murugesan +2 more

The fundamental difference between classical and quantum computation lies in the nature of information representation and logical operations. This paper presents design of quantum circuits to the different classical gates. Quantum gates operate on qubits and are mathematically represented by unitary matrices, ensuring reversibility and preservation of information. In this system, using the Pauli-X gate, Controlled NOT gate, and Toffoli gate, the equivalent classical gates are constructed. The analysis demonstrates that while quantum gates reproduce classical logical outputs for computational basis states, they fundamentally differ in structure, requiring auxiliary qubits to maintain reversibility. Furthermore, quantum gates support superposition and entanglement, which extend computational capabilities beyond classical limitations. This article is result implementation of quantum gates using Qiskit simulation software. The results highlight that quantum logic gates can be viewed as reversible generalizations of classical gates under unitary constraints. This article also analyses the fault-taulorent and cost effectiveness of the designed circuits.

International Conference Computational Vision and Bio Inspired Computing•Aug 1, 2026•0 citations

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
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.
Quantum gates which are represented by unitary matrices have potentials to implement reversible logic circuits. V and V+gates are two well known quantum gates which are used to synthesize the reversible logic circuits. In this paper we have used behavioral description of these gates, instead of unitary matrix description, to synthesize reversible logic circuits. By this method, V and V+gates are shown in the truth table form. Results show that bigger circuits with more number of gates can be synthesized using proposed method. Some benchmarks of reversible logic circuits are also optimized and compared to other works.
This paper addresses using quantum gates to implement binary reversible logic circuits. We propose behavioral models for well known V and V+quantum gates. Our proposed representation is used to synthesize reversible logic circuits instead of using the known unitary matrix form of quantum gates. This technique allows V and V+gates to be represented in truth table forms. Results show that our technique can be used to synthesize circuits with bigger sizes and gate counts in compare with unitary matrix form of these gates. Several reversible circuit benchmarks are optimized and compared to related works.
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.
Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.
The fundamental difference between classical and quantum computation lies in the nature of information representation and logical operations. This paper presents design of quantum circuits to the different classical gates. Quantum gates operate on qubits and are mathematically represented by unitary matrices, ensuring reversibility and preservation of information. In this system, using the Pauli-X gate, Controlled NOT gate, and Toffoli gate, the equivalent classical gates are constructed. The analysis demonstrates that while quantum gates reproduce classical logical outputs for computational basis states, they fundamentally differ in structure, requiring auxiliary qubits to maintain reversibility. Furthermore, quantum gates support superposition and entanglement, which extend computational capabilities beyond classical limitations. This article is result implementation of quantum gates using Qiskit simulation software. The results highlight that quantum logic gates can be viewed as reversible generalizations of classical gates under unitary constraints. This article also analyses the fault-taulorent and cost effectiveness of the designed circuits.
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