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

International Conference on Multimedia, Signal Processing and Communication Technologies (IMPACT)

Optimal Quantum Circuit Decomposition of Reversible Gates on IBM quantum computer

Hilal Ahmad Bhat, Farooq Ahmad Khanday, Khurshed Ahmad Shah

Published Nov 26, 2022• 3 citations
Publisher

Abstract

Currently, computing paradigm is ruled by the laws of classical physics and will continue till the dimensions of transistors reaches the size of atomic particles. Quantum computing (QC) is a new technology that employs laws of quantum mechanics to address issues such as irreversibility and power dissipation that are outside the scope of conventional computing models. QC offers a powerful stage for solving complex and compound problems like searching and number factoring. A critical task in utilizing quantum physics in many application fields is circuit design using reversible quantum gates. Unitary decomposition is a popular scheme for mapping quantum algorithms to any set of elementary quantum operations. Using decomposition techniques enables transformation of unitary matrices into fundamental quantum gates, which is critical for running algorithms on prevailing quantum computers. Any 3x3 reversible quantum gate can be decomposed into single-qubit rotation gates and two qubit CNOT gates. This paper is the first to present quantum implementations of FRSG1 and JTF1 gates into CNOT gates and single qubit U3 gates with different optimization levels on a platform provided by IBM. These gates are important in a variety of practical applications like Stochastic computing and parity generation circuits. In FRSG1 the implementation count of single qubit gates decreases by 56% and the count of two qubit gates by 15% after optimization, whereas in JTF1 gate the single qubit gate count reduces by 71% and the number of two qubit gates reduces by 41%.

DOI
10.1109/impact55510.2022.10029250

Related papers

Optimal Circuit Decomposition of Reversible Quantum Gates on IBM Quantum Computers

Hilal Ahmad Bhat, Farooq Ahmad Khanday, Khurshed Ahmad Shah

A critical task in utilizing quantum physics in many application fields is circuit design using reversible quantum gates. Using decomposition techniques enables transformation of unitary matrices into fundamental quantum gates. Any 3x3 reversible quantum gate can be decomposed into single-qubit rotation gates and two qubit CNOT gates. In this chapter, quantum implementations of FRSG1, URG, JTF1 and R gates into CNOT gates and single qubit U3 gates with different optimization levels on a platform provided by IBM have been discussed. FRSG1 and JTF1 gates are important in applications like Stochastic computing, fingerprint authentication system, and parity generation circuits. URG gate is better in terms of number of complex functions and can be utilized to design quantum comparator circuits. R gate plays an important role in inverting and duplicating a signal. In FRSG1, URG, JTF1 and R gates, the implementation count of single qubit gates decreases by 56%, 11%, 71%, and 62%, respectively and the count of two qubit gates reduces by 15%, 26%, 41%, and 5% respectively after optimization.

Advances in systems analysis, software engineering, and high performance computing book series•Mar 3, 2023•2 citations

Optimization of Circuits for IBM's Five-Qubit Quantum Computers

Gerhard W. Dueck, Anirban Pathak, Md. Mazder Rahman +2 more

IBM has made several quantum computers available to researchers around the world via cloud services. Two architectures with five qubits, one with 16, and one with 20 qubits are available to run experiments. The IBM architectures implement gates from the Clifford+T gate library. However, each architecture only implements a subset of the possible CNOT gates. In this paper, we show how Clifford+T circuits can efficiently be mapped into the two IBM quantum computers with 5 qubits. We further present an algorithm and a set of circuit identities that may be used to optimize the Clifford+T circuits in terms of gate count and number of levels. It is further shown that the optimized circuits can considerably reduce the gate count and number of levels and thus produce results with better fidelity.

arXiv:1810.00129•Euromicro Conference on Digital System Design (DSD)•Aug 1, 2018•35 citations

Quantum-state preparation with universal gate decompositions

Martin Plesch, Časlav Brukner

In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of $2$. It also reduces the total number of cnot gates from ${2}^{n}$ to $\frac{23}{24}{2}^{n}$ in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from $11$ cnot gates to $9$ and the depth from $11$ to $5$ steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

arXiv:1003.5760•Physical Review A•Mar 3, 2011•387 citations

QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis

Xin-Chuan Wu, Davis, Marc Grau, Frederic T. Chong +1 more

The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum circuit synthesis is a process of decomposing an arbitrary unitary into a sequence of quantum gates, and can be used as an optimization tool to produce shorter circuits to improve overall circuit fidelity. However, the time-to-solution of synthesis grows exponentially with the number of qubits. As a result, synthesis is intractable for circuits on a large qubit scale. In this paper, we propose a hierarchical, block-by-block optimization framework, QGo, for quantum circuit optimization. Our approach allows an exponential cost optimization to scale to large circuits. QGo uses a combination of partitioning and synthesis: 1) partition the circuit into a sequence of independent circuit blocks; 2) re-generate and optimize each block using quantum synthesis; and 3) re-compose the final circuit by stitching all the blocks together. We perform our analysis and show the fidelity improvements in three different regimes: small-size circuits on real devices, medium-size circuits on noise simulations, and large-size circuits on analytical models. Using a set of NISQ benchmarks, we show that QGo can reduce the number of CNOT gates by 29.9% on average and up to 50% when compared with industrial compilers such as t|ket>. When executed on the IBM Athens system, shorter depth leads to higher circuit fidelity. We also demonstrate the scalability of our QGo technique to optimize circuits of 60+ qubits. Our technique is the first demonstration of successfully employing and scaling synthesis in the compilation toolchain for large circuits. Overall, our approach is robust for direct incorporation in production compiler toolchains.

arXiv:2012.09835•Dec 17, 2020•52 citations

Optimal Boolean Logic Quantum Circuit Decomposition for Spin-Torque-Based $\boldsymbol{n}$ -Qubit Architecture

Anant Aravind Kulkarni, Sanjay Prajapati, Shivam Verma +1 more

The semiconductor industry is facing a twofold challenge at sub-nanometer level; first, the high power dissipation in irreversible computing architectures due to information loss and second, inability to handle large data due to sequential information processing. These issues create obstacles in producing the presumed low-power complex computing outcomes. The heat dissipation can be reduced by utilizing the complementary metal-oxide-semiconductor-based reversible computing architectures. However, these architectures fail to enhance the performance owing to inability to process large data. Quantum computing (QC) can circumvent these problems due to its fundamental ineffaceable characteristics of quantum mechanics-based reversible computing and parallelism. Spin-torque-based physical realization is the most suitable platform for reversible computing due to the electron spin analogous to the qubit. However, optimal quantum circuits are required to physically realize the complex Boolean logic due to spin-qubit decoherence and reduce the number of transistor switching activities for the spin generation and injection required for the spin-qubit rotation. Therefore, in this paper, optimal quantum circuit decompositions are presented with the help of developed elementary quantum library {Ry(θ), Rz(θ), √SWAP for the spin-torque-based QC architecture. The reversible Boolean logic performance is analyzed and compared for the conventional, reduced, and optimal decompositions on the first- and second-order transmission coefficient matrix-based spin-torque QC architecture. The results encourage to set a path toward QC-based reconfigurable complex computing systems in near future.

IEEE Transactions on Magnetics•Sep 3, 2018•5 citations

Efficient Decomposition of Unitary Matrices in Quantum Circuit Compilers

Anna M. Krol, Aritra Sarkar, Imran Ashraf +2 more

Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for the translation of bigger unitary gates into elementary quantum operations, which is key to executing these algorithms on existing quantum computers. The decomposition can be used as an aggressive optimization method for the whole circuit, as well as to test part of an algorithm on a quantum accelerator. For the selection and implementation of the decomposition algorithm, perfect qubits are assumed. We base our decomposition technique on Quantum Shannon Decomposition, which generates O(344n) controlled-not gates for an n-qubit input gate. In addition, we implement optimizations to take advantage of the potential underlying structure in the input or intermediate matrices, as well as to minimize the execution time of the decomposition. Comparing our implementation to Qubiter and the UniversalQCompiler (UQC), we show that our implementation generates circuits that are much shorter than those of Qubiter and not much longer than the UQC. At the same time, it is also up to 10 times as fast as Qubiter and about 500 times as fast as the UQC.

arXiv:2101.02993•Applied Sciences•Jan 12, 2022•69 citations
Currently, computing paradigm is ruled by the laws of classical physics and will continue till the dimensions of transistors reaches the size of atomic particles. Quantum computing (QC) is a new technology that employs laws of quantum mechanics to address issues such as irreversibility and power dissipation that are outside the scope of conventional computing models. QC offers a powerful stage for solving complex and compound problems like searching and number factoring. A critical task in utilizing quantum physics in many application fields is circuit design using reversible quantum gates. Unitary decomposition is a popular scheme for mapping quantum algorithms to any set of elementary quantum operations. Using decomposition techniques enables transformation of unitary matrices into fundamental quantum gates, which is critical for running algorithms on prevailing quantum computers. Any 3x3 reversible quantum gate can be decomposed into single-qubit rotation gates and two qubit CNOT gates. This paper is the first to present quantum implementations of FRSG1 and JTF1 gates into CNOT gates and single qubit U3 gates with different optimization levels on a platform provided by IBM. These gates are important in a variety of practical applications like Stochastic computing and parity generation circuits. In FRSG1 the implementation count of single qubit gates decreases by 56% and the count of two qubit gates by 15% after optimization, whereas in JTF1 gate the single qubit gate count reduces by 71% and the number of two qubit gates reduces by 41%.
A critical task in utilizing quantum physics in many application fields is circuit design using reversible quantum gates. Using decomposition techniques enables transformation of unitary matrices into fundamental quantum gates. Any 3x3 reversible quantum gate can be decomposed into single-qubit rotation gates and two qubit CNOT gates. In this chapter, quantum implementations of FRSG1, URG, JTF1 and R gates into CNOT gates and single qubit U3 gates with different optimization levels on a platform provided by IBM have been discussed. FRSG1 and JTF1 gates are important in applications like Stochastic computing, fingerprint authentication system, and parity generation circuits. URG gate is better in terms of number of complex functions and can be utilized to design quantum comparator circuits. R gate plays an important role in inverting and duplicating a signal. In FRSG1, URG, JTF1 and R gates, the implementation count of single qubit gates decreases by 56%, 11%, 71%, and 62%, respectively and the count of two qubit gates reduces by 15%, 26%, 41%, and 5% respectively after optimization.
IBM has made several quantum computers available to researchers around the world via cloud services. Two architectures with five qubits, one with 16, and one with 20 qubits are available to run experiments. The IBM architectures implement gates from the Clifford+T gate library. However, each architecture only implements a subset of the possible CNOT gates. In this paper, we show how Clifford+T circuits can efficiently be mapped into the two IBM quantum computers with 5 qubits. We further present an algorithm and a set of circuit identities that may be used to optimize the Clifford+T circuits in terms of gate count and number of levels. It is further shown that the optimized circuits can considerably reduce the gate count and number of levels and thus produce results with better fidelity.
In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 222. It also reduces the total number of cnot gates from 2n{2}^{n}2n to 23242n\frac{23}{24}{2}^{n}2423​2n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 111111 cnot gates to 999 and the depth from 111111 to 555 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.
The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum circuit synthesis is a process of decomposing an arbitrary unitary into a sequence of quantum gates, and can be used as an optimization tool to produce shorter circuits to improve overall circuit fidelity. However, the time-to-solution of synthesis grows exponentially with the number of qubits. As a result, synthesis is intractable for circuits on a large qubit scale. In this paper, we propose a hierarchical, block-by-block optimization framework, QGo, for quantum circuit optimization. Our approach allows an exponential cost optimization to scale to large circuits. QGo uses a combination of partitioning and synthesis: 1) partition the circuit into a sequence of independent circuit blocks; 2) re-generate and optimize each block using quantum synthesis; and 3) re-compose the final circuit by stitching all the blocks together. We perform our analysis and show the fidelity improvements in three different regimes: small-size circuits on real devices, medium-size circuits on noise simulations, and large-size circuits on analytical models. Using a set of NISQ benchmarks, we show that QGo can reduce the number of CNOT gates by 29.9% on average and up to 50% when compared with industrial compilers such as t|ket>. When executed on the IBM Athens system, shorter depth leads to higher circuit fidelity. We also demonstrate the scalability of our QGo technique to optimize circuits of 60+ qubits. Our technique is the first demonstration of successfully employing and scaling synthesis in the compilation toolchain for large circuits. Overall, our approach is robust for direct incorporation in production compiler toolchains.
Optimal Boolean Logic Quantum Circuit Decomposition for Spin-Torque-Based n\boldsymbol{n}n -Qubit Architecture
The semiconductor industry is facing a twofold challenge at sub-nanometer level; first, the high power dissipation in irreversible computing architectures due to information loss and second, inability to handle large data due to sequential information processing. These issues create obstacles in producing the presumed low-power complex computing outcomes. The heat dissipation can be reduced by utilizing the complementary metal-oxide-semiconductor-based reversible computing architectures. However, these architectures fail to enhance the performance owing to inability to process large data. Quantum computing (QC) can circumvent these problems due to its fundamental ineffaceable characteristics of quantum mechanics-based reversible computing and parallelism. Spin-torque-based physical realization is the most suitable platform for reversible computing due to the electron spin analogous to the qubit. However, optimal quantum circuits are required to physically realize the complex Boolean logic due to spin-qubit decoherence and reduce the number of transistor switching activities for the spin generation and injection required for the spin-qubit rotation. Therefore, in this paper, optimal quantum circuit decompositions are presented with the help of developed elementary quantum library {Ry(θ), Rz(θ), √SWAP for the spin-torque-based QC architecture. The reversible Boolean logic performance is analyzed and compared for the conventional, reduced, and optimal decompositions on the first- and second-order transmission coefficient matrix-based spin-torque QC architecture. The results encourage to set a path toward QC-based reconfigurable complex computing systems in near future.
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for the translation of bigger unitary gates into elementary quantum operations, which is key to executing these algorithms on existing quantum computers. The decomposition can be used as an aggressive optimization method for the whole circuit, as well as to test part of an algorithm on a quantum accelerator. For the selection and implementation of the decomposition algorithm, perfect qubits are assumed. We base our decomposition technique on Quantum Shannon Decomposition, which generates O(344n) controlled-not gates for an n-qubit input gate. In addition, we implement optimizations to take advantage of the potential underlying structure in the input or intermediate matrices, as well as to minimize the execution time of the decomposition. Comparing our implementation to Qubiter and the UniversalQCompiler (UQC), we show that our implementation generates circuits that are much shorter than those of Qubiter and not much longer than the UQC. At the same time, it is also up to 10 times as fast as Qubiter and about 500 times as fast as the UQC.