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

arXiv:2410.19229

EQB: Synthesizing Permutative Quantum Gates and Circuits Using Rotation-Based Group Decomposition

Ishani Agarwal, Miroslav Saraivanov, Ali Al-Bayaty, Marek A. Perkowski

Published Oct 25, 2024• 0 citations
arXivHTMLPDF

Abstract

The decomposition from the group theory-based methods of Sasao and Saraivanov is extended to design binary quantum cascades, using the quantum rotational gates by the X-axis (CNOT and RX), Y-axis (RY), and Z-axis (controlled-Z) of the Bloch sphere. A class of local transformations is also presented to simplify the final canonical cascade circuits. Our proposed methodology is well suited for quantum layouts, as each single-qubit gate has one target qubit and each double-qubit gate has one control qubit and one target qubit, thereby never creating a graph of triangular connectivity.

DOI
10.48550/arxiv.2410.19229

Related papers

Multi-valued Quantum Cascade Realization with Group Decomposition

Miroslav Saraivanov, Marek A. Perkowski

This paper introduces a method for realizing binary controlled inputs to p-valued single output functions (where p is prime, multi-valued logic state, in particular p=2, 3, or 5) by using a canonical (reversible, quantum) cascade of quantum logic blocks derived from decomposed group functions and the Walsh spectrum. The first part of our method is based on a publication by T. Sasao in [4] and is then extended to classical reversible logic and quantum cascades optimized for ion trap and quantum dot technologies.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2018•0 citations

Decomposition of Basic Controlled Gates in Quantum Circuits

Pedro Juan Roig, Salvador Alcaraz, Katja Gilly +2 more

Quantum gates typically represent either rotations of controlled gates. Rotation gates usually involve one qubit, although Ising coupling gates involve two qubits. On the other hand, controlled gates can have any number of control qubits with at least a target qubit. In this paper, the decomposition of controlled gates in terms of rotation gates around a given axis has been carried out. The focus herein has been set on the$\mathbf{X}$axis, such that AND-CmX gates and OR-CmX gates have been decomposed and proved for$\mathbf{m}=\{\mathbf{1, 2, 3, 4}\}$and different polarities.

International Conference on Electrical, Communication, and Computer Engineering (ICECCE)•Aug 27, 2025•0 citations

Block- ZXZ synthesis of an arbitrary quantum circuit

Alexis De Vos, Stijn De Baerdemacker

Given an arbitrary ${2}^{w}\ifmmode\times\else\texttimes\fi{}{2}^{w}$ unitary matrix $U$, a powerful matrix decomposition can be applied, leading to four different syntheses of a $w$-qubit quantum circuit performing the unitary transformation. The demonstration is based on a recent theorem by H. F\"uhr and Z. Rzeszotnik [Linear Algebra Its Appl. 484, 86 (2015)] generalizing the scaling of single-bit unitary gates ($w=1$) to gates with arbitrary value of $w$. The synthesized circuit consists of controlled one-qubit gates, such as negator gates and phasor gates. Interestingly, the approach reduces to a known synthesis method for classical logic circuits consisting of controlled not gates in the case that $U$ is a permutation matrix.

arXiv:1512.07240•Physical Review A•Nov 14, 2016•28 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•1 citation

Exact synthesis of three-qubit quantum circuits from non-binary quantum gates

Guowu Yang, William N. N. Hung, Xiaoyu Song B +1 more

Because of recent nano-technological advances, nano-structured systems have become highly ordered, making it quantum computing schemas possible. We propose an approach to optimally synthesise quantum circuits from non-permutative quantum gates such as controlled-square-root-of-not (i.e., controlled-V). Our approach reduces the synthesis problem to multiple-valued optimisation and uses group theory. We devise a novel technique that transforms the quantum logic synthesis problem from a multi-valued constrained optimisation problem to a permutable representation. The transformation enables us to use group theory to exploit the symmetric properties of the synthesis problem. Assuming a cost of one for each two-qubit gate, we found all reversible circuits with quantum costs of 4, 5, 6, etc., and give another algorithm to realise these reversible circuits with quantum gates. The approach can be used for both binary permutative deterministic circuits and probabilistic circuits such as controlled random-number generators and hidden Markov models.

International Journal of Electronics•Apr 1, 2010•4 citations

Exact Synthesis of 3-Qubit Quantum Circuits from Non-Binary Quantum Gates Using Multiple-Valued Logic and Group Theory

Guowu Yang, William N. N. Hung, Xiaoyu Song B +1 more

We propose an approach to optimally synthesize quantum circuits from non-permutative quantum gates such as controlled-square-root-of-not (i.e., controlled-V). Our approach reduces the synthesis problem to multiple-valued optimization and uses group theory. We devise a novel technique that transforms the quantum logic synthesis problem from a multi-valued constrained optimization problem to a group permutation problem. The transformation enables us to utilize group theory to exploit the properties of the synthesis problem. Assuming a cost of one for each two-qubit gate, we find all reversible circuits with quantum costs of 4, 5, 6, etc, and give another algorithm to realize these reversible circuits with quantum gates.

arXiv:0710.4694•Design, Automation, and Test in Europe•Apr 1, 2005•11 citations
The decomposition from the group theory-based methods of Sasao and Saraivanov is extended to design binary quantum cascades, using the quantum rotational gates by the X-axis (CNOT and RX), Y-axis (RY), and Z-axis (controlled-Z) of the Bloch sphere. A class of local transformations is also presented to simplify the final canonical cascade circuits. Our proposed methodology is well suited for quantum layouts, as each single-qubit gate has one target qubit and each double-qubit gate has one control qubit and one target qubit, thereby never creating a graph of triangular connectivity.
This paper introduces a method for realizing binary controlled inputs to p-valued single output functions (where p is prime, multi-valued logic state, in particular p=2, 3, or 5) by using a canonical (reversible, quantum) cascade of quantum logic blocks derived from decomposed group functions and the Walsh spectrum. The first part of our method is based on a publication by T. Sasao in [4] and is then extended to classical reversible logic and quantum cascades optimized for ion trap and quantum dot technologies.
Quantum gates typically represent either rotations of controlled gates. Rotation gates usually involve one qubit, although Ising coupling gates involve two qubits. On the other hand, controlled gates can have any number of control qubits with at least a target qubit. In this paper, the decomposition of controlled gates in terms of rotation gates around a given axis has been carried out. The focus herein has been set on theX\mathbf{X}Xaxis, such that AND-CmX gates and OR-CmX gates have been decomposed and proved form={1,2,3,4}\mathbf{m}=\{\mathbf{1, 2, 3, 4}\}m={1,2,3,4}and different polarities.
Given an arbitrary ${2}^{w}\ifmmode\times\else\texttimes\fi{}{2}^{w}$ unitary matrix UUU, a powerful matrix decomposition can be applied, leading to four different syntheses of a www-qubit quantum circuit performing the unitary transformation. The demonstration is based on a recent theorem by H. F\"uhr and Z. Rzeszotnik [Linear Algebra Its Appl. 484, 86 (2015)] generalizing the scaling of single-bit unitary gates (w=1w=1w=1) to gates with arbitrary value of www. The synthesized circuit consists of controlled one-qubit gates, such as negator gates and phasor gates. Interestingly, the approach reduces to a known synthesis method for classical logic circuits consisting of controlled not gates in the case that UUU is a permutation matrix.
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.
Because of recent nano-technological advances, nano-structured systems have become highly ordered, making it quantum computing schemas possible. We propose an approach to optimally synthesise quantum circuits from non-permutative quantum gates such as controlled-square-root-of-not (i.e., controlled-V). Our approach reduces the synthesis problem to multiple-valued optimisation and uses group theory. We devise a novel technique that transforms the quantum logic synthesis problem from a multi-valued constrained optimisation problem to a permutable representation. The transformation enables us to use group theory to exploit the symmetric properties of the synthesis problem. Assuming a cost of one for each two-qubit gate, we found all reversible circuits with quantum costs of 4, 5, 6, etc., and give another algorithm to realise these reversible circuits with quantum gates. The approach can be used for both binary permutative deterministic circuits and probabilistic circuits such as controlled random-number generators and hidden Markov models.
We propose an approach to optimally synthesize quantum circuits from non-permutative quantum gates such as controlled-square-root-of-not (i.e., controlled-V). Our approach reduces the synthesis problem to multiple-valued optimization and uses group theory. We devise a novel technique that transforms the quantum logic synthesis problem from a multi-valued constrained optimization problem to a group permutation problem. The transformation enables us to utilize group theory to exploit the properties of the synthesis problem. Assuming a cost of one for each two-qubit gate, we find all reversible circuits with quantum costs of 4, 5, 6, etc, and give another algorithm to realize these reversible circuits with quantum gates.