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

Non-Hermitian quantum gates are more common than Hermitian quantum gates

Anirban Pathak

Published Sep 16, 2013• 3 citations
OpenAlex

Abstract

Most of the frequently used quantum gates (e.g., NOT, Hadamard, CNOT, SWAP, Toffoli, Fredkin and Pauli gates) are self-inverse (Hermitian). However, with a simple minded argument it is established that most of the allowed quantum gates are non-Hermitian (non-self-inverse). It is also shown that the % of non-Hermitian gates increases with the dimension. For example, 58.33% of the 2-qubit gates, 98.10% of the 3-qubit gates and 99.99% of the 4-qubit gates are non-Hermitian. As classical reversible gates are essentially permutation gates so the above statistics is strictly valid for classical reversible gates. Further, since Hermiticity is not of much interest in context of the classical reversible gate, hence the result implies that most of the allowed classical reversible gates are non-self-inverse.

Related papers

Statistical distribution of the reversible gates: what percentage of them are self-inverse?

Anirban Pathak

It is well known that most of the frequently used reversible logic gates (e.g., NOT, CNOT, SWAP, Toffoli, Fredkin) are self-inverse and are represented by square matrices that are unitary and Hermitian. However, with a simple minded argument, it is established that the most of the allowed reversible gates are non-self-inverse (unitary but non-Hermitian) in nature. It is also shown that the % of non-Hermitian gates increases with the dimension. For example, 58.33% of the 2-bit gates, 98.10% of the 3-bit gates and 99.99% of the 4-bit gates are non-Hermitian. As classical reversible gates are essentially permutation gates, above statistics is strictly valid for classical reversible gates, but the argument can be easily extended to include quantum gates and to establish that the majority of the quantum gates are also non-self-inverse. Further, the % of genuinely 2-bit reversible gates (i.e., 2-bit gates that cannot be decomposed as a product of two single bit gates) among all possible gates has been computed as 83.3%, and the applicability of this analysis in the optimization of circuit cost is discussed.

arXiv:1309.4037•Sep 16, 2013•3 citations

General structures of reversible and quantum gates

Kishore Thapliyal, Anirban Pathak

The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two single qubit gates and (b) whether a given single qubit gate is self-inverse? Relevance of the results reported here is discussed in the context of optimization of reversible and quantum circuits, especially for the optimization of quantum cost. A systematic procedure is developed for the identification of the non-decomposable 2-qubit gates. Such a non-decomposable 2-qubit gate along with all possible single qubit gates form a universal quantum gate library. Further, some possible applications of the present work are also discussed.

arXiv:1702.06272•Feb 21, 2017•2 citations

Quantum logic gates and circuits

Vinod Kumar Khanna

A quantum gate is the quantum analog of the classical logic gate of digital computers. It is a basic structural unit of a quantum circuit which operates on a small number of qubits to deliver a predefined output. A quantum circuit is a graphical representation of the sequence of the quantum gates used and the measurements performed in a quantum computation. Various quantum logic gates, namely, the Hadamard, T phase, NOT, Pauli-X, controlled NOT (CNOT), controlled-Z, SWAP and controlled phase gates as well as higher-level Toffoli and Fredkin gates are described. Conventions of reading quantum circuit diagrams are explained. Operation of a quantum full adder consisting of registers and gates is discussed, elaborating the role of the NOT gate, the sum calculation with CNOTgates and the carry C-out calculation with Toffoli gates. A primary tool used for performing arithmetic operations on a quantum computer is the quantum Fourier transform (QFT). The QFT adder and multiplier circuits are presented.

Institute of Physics eBooks•Jan 1, 2025•0 citations

New Two-Qubit Gate Library with Entanglement

Md. Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka +1 more

The NCV (NOT, CNOT and Controlled-V/V) gate set is most commonly used for the realization of classical reversible functions and implementation of quantum circuits. Logic operations in quantum circuits are performed by individual gates or can be expressed as matrix-vector multiplication. Thispaper presents a two-qubit quantum gate library which consists most commonly used elementary quantum gates NOT, CNOT, Controlled-V and Controlled-V. The new library contains all possible two-qubit quantum gates which do not produce entangled states in the final output state. Two approaches have been appliedto generate the new two-qubit quantum gate library because it hasbeen observed that some entangled gates act like non-entangledif those entangled gates are merged with other valid gates in thelibrary. The experimental result shows the difference betweenthe libraries with and without considering entangled gates in theprocess of generating new gates.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2016•1 citation

Implementation of Reversible Logic Gates with Quantum Gates

Swathi Mummadi, Bhawana Rudra

Quantum is an emerging technology in future computers. Reversibility is the main advantage of quantum computers. In conventional computers, the computation is irreversible i.e. the input bits are lost once the logic block generates the output and input bits cannot be restored but it can be done in reversible computation because in reversible computation the inputs and outputs have a one-to-one correspondence. Therefore, a reversible gate input could even be uniquely determined from their output which leads to less power consumption. Hence the complexity of the digital circuits can be reduced by using reversible computing. In quantum computer to perform reversible operations, we need to implement the reversible gates using quantum gates. In this paper, we discussed various reversible logic gates like Feynman, Toffoli, R, Peres and TR gates using basic quantum gates like CNOT, Pauli, Swap gates and their implementation using IBM quantum experience.

IEEE Annual Computing and Communication Workshop and Conference (CCWC)•Jan 27, 2021•61 citations

All You Need is pi: Quantum Computing with Hermitian Gates

Ben Zindorf, Sougato Bose

Universal gate sets for quantum computation, when single and two qubit operations are accessible, include both Hermitian and non-Hermitian gates. Here we utilize the fact that any single-qubit operator may be implemented as two Hermitian gates, and thus a purely Hermitian universal set is possible. This implementation can be used to prepare high fidelity single-qubit states in the presence of amplitude errors, and helps to achieve a high fidelity single-qubit gate decomposition using four Hermitian gates. An implementational convenience can be that non-identity single-qubit Hermitian gates are equivalent to π rotations up to a global phase. We show that a gate set comprised of π rotations about two fixed axes, along with the CNOT gate, is universal for quantum computation. Moreover, we show that two π rotations can transform the axis of any multi-controlled unitary, a special case being a single CNOT sufficing for any controlled π rotation. These gates simplify the process of circuit compilation in view of their Hermitian nature. We exemplify by designing efficient circuits for a variety of controlled gates, and achieving a CNOT count reduction for the four-controlled Toffoli gate in LNN-restricted qubit connectivity.

arXiv:2402.12356•Quantum•Dec 2, 2025•3 citations
Most of the frequently used quantum gates (e.g., NOT, Hadamard, CNOT, SWAP, Toffoli, Fredkin and Pauli gates) are self-inverse (Hermitian). However, with a simple minded argument it is established that most of the allowed quantum gates are non-Hermitian (non-self-inverse). It is also shown that the % of non-Hermitian gates increases with the dimension. For example, 58.33% of the 2-qubit gates, 98.10% of the 3-qubit gates and 99.99% of the 4-qubit gates are non-Hermitian. As classical reversible gates are essentially permutation gates so the above statistics is strictly valid for classical reversible gates. Further, since Hermiticity is not of much interest in context of the classical reversible gate, hence the result implies that most of the allowed classical reversible gates are non-self-inverse.
It is well known that most of the frequently used reversible logic gates (e.g., NOT, CNOT, SWAP, Toffoli, Fredkin) are self-inverse and are represented by square matrices that are unitary and Hermitian. However, with a simple minded argument, it is established that the most of the allowed reversible gates are non-self-inverse (unitary but non-Hermitian) in nature. It is also shown that the % of non-Hermitian gates increases with the dimension. For example, 58.33% of the 2-bit gates, 98.10% of the 3-bit gates and 99.99% of the 4-bit gates are non-Hermitian. As classical reversible gates are essentially permutation gates, above statistics is strictly valid for classical reversible gates, but the argument can be easily extended to include quantum gates and to establish that the majority of the quantum gates are also non-self-inverse. Further, the % of genuinely 2-bit reversible gates (i.e., 2-bit gates that cannot be decomposed as a product of two single bit gates) among all possible gates has been computed as 83.3%, and the applicability of this analysis in the optimization of circuit cost is discussed.
The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two single qubit gates and (b) whether a given single qubit gate is self-inverse? Relevance of the results reported here is discussed in the context of optimization of reversible and quantum circuits, especially for the optimization of quantum cost. A systematic procedure is developed for the identification of the non-decomposable 2-qubit gates. Such a non-decomposable 2-qubit gate along with all possible single qubit gates form a universal quantum gate library. Further, some possible applications of the present work are also discussed.
A quantum gate is the quantum analog of the classical logic gate of digital computers. It is a basic structural unit of a quantum circuit which operates on a small number of qubits to deliver a predefined output. A quantum circuit is a graphical representation of the sequence of the quantum gates used and the measurements performed in a quantum computation. Various quantum logic gates, namely, the Hadamard, T phase, NOT, Pauli-X, controlled NOT (CNOT), controlled-Z, SWAP and controlled phase gates as well as higher-level Toffoli and Fredkin gates are described. Conventions of reading quantum circuit diagrams are explained. Operation of a quantum full adder consisting of registers and gates is discussed, elaborating the role of the NOT gate, the sum calculation with CNOTgates and the carry C-out calculation with Toffoli gates. A primary tool used for performing arithmetic operations on a quantum computer is the quantum Fourier transform (QFT). The QFT adder and multiplier circuits are presented.
The NCV (NOT, CNOT and Controlled-V/V) gate set is most commonly used for the realization of classical reversible functions and implementation of quantum circuits. Logic operations in quantum circuits are performed by individual gates or can be expressed as matrix-vector multiplication. Thispaper presents a two-qubit quantum gate library which consists most commonly used elementary quantum gates NOT, CNOT, Controlled-V and Controlled-V. The new library contains all possible two-qubit quantum gates which do not produce entangled states in the final output state. Two approaches have been appliedto generate the new two-qubit quantum gate library because it hasbeen observed that some entangled gates act like non-entangledif those entangled gates are merged with other valid gates in thelibrary. The experimental result shows the difference betweenthe libraries with and without considering entangled gates in theprocess of generating new gates.
Quantum is an emerging technology in future computers. Reversibility is the main advantage of quantum computers. In conventional computers, the computation is irreversible i.e. the input bits are lost once the logic block generates the output and input bits cannot be restored but it can be done in reversible computation because in reversible computation the inputs and outputs have a one-to-one correspondence. Therefore, a reversible gate input could even be uniquely determined from their output which leads to less power consumption. Hence the complexity of the digital circuits can be reduced by using reversible computing. In quantum computer to perform reversible operations, we need to implement the reversible gates using quantum gates. In this paper, we discussed various reversible logic gates like Feynman, Toffoli, R, Peres and TR gates using basic quantum gates like CNOT, Pauli, Swap gates and their implementation using IBM quantum experience.
Universal gate sets for quantum computation, when single and two qubit operations are accessible, include both Hermitian and non-Hermitian gates. Here we utilize the fact that any single-qubit operator may be implemented as two Hermitian gates, and thus a purely Hermitian universal set is possible. This implementation can be used to prepare high fidelity single-qubit states in the presence of amplitude errors, and helps to achieve a high fidelity single-qubit gate decomposition using four Hermitian gates. An implementational convenience can be that non-identity single-qubit Hermitian gates are equivalent to π rotations up to a global phase. We show that a gate set comprised of π rotations about two fixed axes, along with the CNOT gate, is universal for quantum computation. Moreover, we show that two π rotations can transform the axis of any multi-controlled unitary, a special case being a single CNOT sufficing for any controlled π rotation. These gates simplify the process of circuit compilation in view of their Hermitian nature. We exemplify by designing efficient circuits for a variety of controlled gates, and achieving a CNOT count reduction for the four-controlled Toffoli gate in LNN-restricted qubit connectivity.