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:2109.13223

Quantum-gate decomposer

Ken M. Nakanishi, Takahiko Satoh, Synge Todo

Published Sep 27, 2021• 3 citations
arXivHTMLPDF

Abstract

Efficient decompositions of multi-qubit gates are essential in NISQ applications, where the number of gates or the circuit depth is limited. This paper presents efficient decompositions of CCZ and CCCZ gates, typical multi-qubit gates, under several qubit connectivities. We can construct the CCZ gate with only four CZ-depth when the qubit is square-shaped, including one auxiliary qubit. In T-shaped qubit connectivity, which has no closed loop, we can decompose the CCCZ gate with 17 CZ gates. While previous studies have shown a CCCZ gate decomposition with 14 CZ gates for the fully connected case, we found only four connections are sufficient for 14 CZ gates' implementation. The search for constraint-sufficient decompositions is aided by an optimization method we devised to bring the parameterized quantum circuit closer to the target quantum gate. We can apply this scheme to decompose any quantum gates, not only CCZ and CCCZ. Such decompositions of multi-qubit gates, together with the newly found CCZ and CCCZ decompositions, shorten the execution time of quantum circuits and improve the accuracy of complex quantum algorithms on near future QPUs.

DOI
10.48550/arxiv.2109.13223

Related papers

Decompositions of multiple controlled- Z gates on various qubit-coupling graphs

Ken M. Nakanishi, Takahiko Satoh, Synge Todo

Efficient decomposition of multiqubit operators is critical in the execution of quantum algorithms. In this paper, we introduce decompositions of the multiple controlled-$Z$ (ccz and cccz) gates tailored to various qubit-coupling graphs. Specifically, we demonstrate that the ccz gate is realized with cz-depth 4 on a square-shaped qubit-coupling graph utilizing one auxiliary qubit. As for the cccz gate, previous research indicated that the decomposition requires 14 cz gates in a fully connected topology. However, our findings reveal that only four specific qubit couplings are needed to achieve a decomposition using the same number of cz gates, 14. Our research employs an optimization method to improve the alignment of parametrized quantum circuits with their intended quantum gates, which facilitates these efficient decompositions. This methodology is versatile and can be applied to decompose any quantum gates, not just the ccz and cccz gates. These advancements in decomposing multiqubit gates, coupled with our ccz and cccz decompositions, are poised to reduce quantum circuit execution times and enhance the efficiency of complex quantum algorithms in imminent quantum computing applications.

Physical Review A•Jul 1, 2024•5 citations

Systematic construction of multi-controlled Pauli gate decompositions with optimal $T$-count

Ken M. Nakanishi, Synge Todo

Multi-controlled Pauli gates are typical high-level qubit operations that appear in the quantum circuits of various quantum algorithms. We find multi-controlled Pauli gate decompositions with smaller CNOT-count or $T$-depth while keeping the currently known minimum $T$-count. For example, for the CCCZ gate, we find decompositions with CNOT-count 7 or $T$-depth 2 while keeping the $T$-count at the currently known minimum of 6. The discovery of these efficient decompositions improves the computational efficiency of many quantum algorithms. What led to this discovery is the systematic procedure for constructing multi-controlled Pauli gate decompositions. This procedure not only deepens our theoretical understanding of quantum gate decomposition but also leads to more efficient decompositions that have yet to be discovered.

arXiv:2410.00910•Oct 1, 2024•1 citation

Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates

P. V. Sriluckshmy, Vicente Pina-Canelles, Mario Ponce-Martinez +3 more

Abstract We show how to efficiently decompose a parameterized multi-qubit Pauli (PMQP) gate into native parameterized two-qubit Pauli (P2QP) gates minimizing both the circuit depth and the number of P2QP gates. Given a realistic quantum computational model, we argue that the technique is optimal in terms of the number of hardware native gates and the overall depth of the decomposition. Starting from PMQP gate decompositions for the path and star hardware graph, we generalize the procedure to any generic hardware graph and provide exact expressions for the depth and number of P2QP gates of the decomposition. Furthermore, we show how to efficiently combine the decomposition of multiple PMQP gates to further reduce the depth as well as the number of P2QP gates for a combinatorial optimization problem using the Lechner–Hauke–Zoller mapping.

arXiv:2303.04498•Quantum Science and Technology•Sep 25, 2023•11 citations

Applications of the CCZS gate in quantum circuit synthesis

Fudong Liu, Tailyu Fan, Guo-Qiang Shu +6 more

Abstract Limited by the decoherence of qubits as well as the errors of quantum gates, near-term superconducting quantum computers can only run low-depth quantum circuits to achieve acceptable fidelity. One possible way to overcome these limitations is to construct quantum circuits with additional high-fidelity expressive multi-qubit gates. Recently, a new three-qubit gate, denoted as Controlled-CPHASE-SWAP (CCZS), has been implemented through simultaneous Controlled-Z (CZ) gates. The CCZS gate takes less time than a single CZ gate and can be implemented at the coherence limit. However, how to use the CCZS gate in quantum circuit synthesis remains unexplored. In this paper, we construct the quantum fan-out/parity gates, the controlled-phase gate and the locally fully connected CZ gates with the CCZS gate, respectively. Furthermore, applications of the CCZS gate in quantum error correction, quantum Fourier transform and quantum approximate optimization algorithm are also proposed. We evaluate the performance of the CCZS gate in quantum circuit synthesis through simulation and explore its potential advantages over CZ gates.

Quantum Science and Technology•Jul 3, 2025•2 citations

Efficient compilation of quantum circuits using multi-qubit gates

Jonathan Nemirovsky, Maya Chuchem, Yotam Shapira

Abstract As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence of these available gates is not unique. Thus, the fidelity of an algorithm’s implementation can be increased by choosing an optimized decomposition. This is true both for noisy intermediate-scale quantum platforms as well as for implementation of quantum error correction schemes. Here we present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit (MQ) entangling gates, that are separated by layers of single qubit rotations. We use trapped ions as an example in which MQ gates naturally arise, yet any system that has connectivity beyond nearest-neighbors may gain from our approach. We evaluate our methods using the quantum volume (QV) test over N qubits. In this context, our method replaces 3 N 2 / 2 two-qubit gates with 2 N + 1 MQ gates. Furthermore, our method minimizes the magnitude of the entanglement phases, which typically enables an improved implementation fidelity, by using weaker driving fields or faster realizations. We numerically test our compilation and show that, compared to conventional realizations with sequential two-qubit gates, our compilations improves the logarithm of QV by 20% to 25%.

arXiv:2501.17246•Quantum Science and Technology•Jan 12, 2026•7 citations

Beyond Quantum Shannon: Circuit Construction for General n-Qubit Gates Based on Block ZXZ-Decomposition

Anna M. Krol, Zaid Al-Ars

This paper proposes a new optimized quantum block-ZXZ decomposition method [7,8,10] that results in more optimal quantum circuits than the quantum Shannon decomposition (QSD)[27], which was introduced in 2006 by Shende et al. The decomposition is applied recursively to generic quantum gates, and can take advantage of existing and future small-circuit optimizations. Because our method uses only one-qubit gates and uniformly controlled rotation-Z gates, it can easily be adapted to use other types of multi-qubit gates. With the proposed decomposition, a general 3-qubit gate can be decomposed using 19 CNOT gates (rather than 20). For general $n$-qubit gates, the proposed decomposition generates circuits that have $\frac{22}{48}4^n - \frac{3}{2}2^n +\frac{5}{3}$ CNOT gates, which is less that the best known exact decomposition algorithm by $(4^{n-2} -1)/3$ CNOT gates.

arXiv:2403.13692•Mar 20, 2024•1 citation
Efficient decompositions of multi-qubit gates are essential in NISQ applications, where the number of gates or the circuit depth is limited. This paper presents efficient decompositions of CCZ and CCCZ gates, typical multi-qubit gates, under several qubit connectivities. We can construct the CCZ gate with only four CZ-depth when the qubit is square-shaped, including one auxiliary qubit. In T-shaped qubit connectivity, which has no closed loop, we can decompose the CCCZ gate with 17 CZ gates. While previous studies have shown a CCCZ gate decomposition with 14 CZ gates for the fully connected case, we found only four connections are sufficient for 14 CZ gates' implementation. The search for constraint-sufficient decompositions is aided by an optimization method we devised to bring the parameterized quantum circuit closer to the target quantum gate. We can apply this scheme to decompose any quantum gates, not only CCZ and CCCZ. Such decompositions of multi-qubit gates, together with the newly found CCZ and CCCZ decompositions, shorten the execution time of quantum circuits and improve the accuracy of complex quantum algorithms on near future QPUs.
Efficient decomposition of multiqubit operators is critical in the execution of quantum algorithms. In this paper, we introduce decompositions of the multiple controlled-ZZZ (ccz and cccz) gates tailored to various qubit-coupling graphs. Specifically, we demonstrate that the ccz gate is realized with cz-depth 4 on a square-shaped qubit-coupling graph utilizing one auxiliary qubit. As for the cccz gate, previous research indicated that the decomposition requires 14 cz gates in a fully connected topology. However, our findings reveal that only four specific qubit couplings are needed to achieve a decomposition using the same number of cz gates, 14. Our research employs an optimization method to improve the alignment of parametrized quantum circuits with their intended quantum gates, which facilitates these efficient decompositions. This methodology is versatile and can be applied to decompose any quantum gates, not just the ccz and cccz gates. These advancements in decomposing multiqubit gates, coupled with our ccz and cccz decompositions, are poised to reduce quantum circuit execution times and enhance the efficiency of complex quantum algorithms in imminent quantum computing applications.
Systematic construction of multi-controlled Pauli gate decompositions with optimal TTT-count
Multi-controlled Pauli gates are typical high-level qubit operations that appear in the quantum circuits of various quantum algorithms. We find multi-controlled Pauli gate decompositions with smaller CNOT-count or TTT-depth while keeping the currently known minimum TTT-count. For example, for the CCCZ gate, we find decompositions with CNOT-count 7 or TTT-depth 2 while keeping the TTT-count at the currently known minimum of 6. The discovery of these efficient decompositions improves the computational efficiency of many quantum algorithms. What led to this discovery is the systematic procedure for constructing multi-controlled Pauli gate decompositions. This procedure not only deepens our theoretical understanding of quantum gate decomposition but also leads to more efficient decompositions that have yet to be discovered.
Abstract We show how to efficiently decompose a parameterized multi-qubit Pauli (PMQP) gate into native parameterized two-qubit Pauli (P2QP) gates minimizing both the circuit depth and the number of P2QP gates. Given a realistic quantum computational model, we argue that the technique is optimal in terms of the number of hardware native gates and the overall depth of the decomposition. Starting from PMQP gate decompositions for the path and star hardware graph, we generalize the procedure to any generic hardware graph and provide exact expressions for the depth and number of P2QP gates of the decomposition. Furthermore, we show how to efficiently combine the decomposition of multiple PMQP gates to further reduce the depth as well as the number of P2QP gates for a combinatorial optimization problem using the Lechner–Hauke–Zoller mapping.
Abstract Limited by the decoherence of qubits as well as the errors of quantum gates, near-term superconducting quantum computers can only run low-depth quantum circuits to achieve acceptable fidelity. One possible way to overcome these limitations is to construct quantum circuits with additional high-fidelity expressive multi-qubit gates. Recently, a new three-qubit gate, denoted as Controlled-CPHASE-SWAP (CCZS), has been implemented through simultaneous Controlled-Z (CZ) gates. The CCZS gate takes less time than a single CZ gate and can be implemented at the coherence limit. However, how to use the CCZS gate in quantum circuit synthesis remains unexplored. In this paper, we construct the quantum fan-out/parity gates, the controlled-phase gate and the locally fully connected CZ gates with the CCZS gate, respectively. Furthermore, applications of the CCZS gate in quantum error correction, quantum Fourier transform and quantum approximate optimization algorithm are also proposed. We evaluate the performance of the CCZS gate in quantum circuit synthesis through simulation and explore its potential advantages over CZ gates.
Abstract As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence of these available gates is not unique. Thus, the fidelity of an algorithm’s implementation can be increased by choosing an optimized decomposition. This is true both for noisy intermediate-scale quantum platforms as well as for implementation of quantum error correction schemes. Here we present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit (MQ) entangling gates, that are separated by layers of single qubit rotations. We use trapped ions as an example in which MQ gates naturally arise, yet any system that has connectivity beyond nearest-neighbors may gain from our approach. We evaluate our methods using the quantum volume (QV) test over N qubits. In this context, our method replaces 3 N 2 / 2 two-qubit gates with 2 N + 1 MQ gates. Furthermore, our method minimizes the magnitude of the entanglement phases, which typically enables an improved implementation fidelity, by using weaker driving fields or faster realizations. We numerically test our compilation and show that, compared to conventional realizations with sequential two-qubit gates, our compilations improves the logarithm of QV by 20% to 25%.
This paper proposes a new optimized quantum block-ZXZ decomposition method [7,8,10] that results in more optimal quantum circuits than the quantum Shannon decomposition (QSD)[27], which was introduced in 2006 by Shende et al. The decomposition is applied recursively to generic quantum gates, and can take advantage of existing and future small-circuit optimizations. Because our method uses only one-qubit gates and uniformly controlled rotation-Z gates, it can easily be adapted to use other types of multi-qubit gates. With the proposed decomposition, a general 3-qubit gate can be decomposed using 19 CNOT gates (rather than 20). For general nnn-qubit gates, the proposed decomposition generates circuits that have 22484n−322n+53\frac{22}{48}4^n - \frac{3}{2}2^n +\frac{5}{3}4822​4n−23​2n+35​ CNOT gates, which is less that the best known exact decomposition algorithm by (4n−2−1)/3(4^{n-2} -1)/3(4n−2−1)/3 CNOT gates.