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:1302.0056 · Physical Review A

Synthesis of multivalued quantum logic circuits by elementary gates

Yao-Min Di, Hai‐Rui Wei

Published Jan 22, 2013• 78 citations
arXivHTMLPDF

Abstract

We propose the generalized controlled $X$ (gcx) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and show that it is feasible with current technology. With these elementary gates many important qudit quantum gates can be synthesized conveniently. We provide efficient methods for the synthesis of various kinds of controlled qudit gates and greatly simplify the synthesis of existing generic multi-valued quantum circuits. Moreover, we generalize the quantum Shannon decomposition (QSD), the most powerful technique for the synthesis of generic qubit circuits, to the qudit case. A comparison of ququart ($d=4$) circuits and qubit circuits reveals that using ququart circuits may have an advantage over the qubit circuits in the synthesis of quantum circuits.

DOI
10.1103/physreva.87.012325

Related papers

Optimal synthesis of multivalued quantum circuits

Yao-Min Di, Hai‐Rui Wei

Although much work has been devoted to multivalued quantum logic synthesis, the question of whether multivalued quantum circuits are more efficient than conventional binary quantum circuits is still open. This article is devoted to the optimization of generic multivalued quantum circuits. Multivalued quantum Shannon decompositions are improved so that the circuits obtained are asymptotically optimal for all dimensionality $d$. The syntheses of uniformly multifold controlled ${R}_{y}$ rotations are also optimized to make the circuits further simplified. Moreover, the theoretical lower bound of complexity for multivalued quantum circuits is investigated, and a quantity known as the efficiency index is proposed to evaluate the efficiency of the synthesis of various quantum circuits. The algorithm for qudit circuits given here is an efficient synthesis routine which produces improved results for all dimensionality $d$, whether the number of qudits $n$ is small or large. The two facts, the leading factor of the lower bound of complexity for qudit circuits is small by a factor of $d\ensuremath{-}1$ in comparison to that for qubit circuits and the asymptotic efficiency index is increased with an increase of dimensionality $d$, reveal the potential advantage of qudit circuits over generic qubit circuits. Generic $n$-qudit circuits with $d\ensuremath{\ge}5$ and generic two-ququart circuits synthesized by the algorithm given here are practical circuits which are more efficient than the most efficient qubit circuits.

arXiv:1506.04394•Physical Review A•Dec 9, 2015•25 citations

Efficient High-Dimensional Quantum Circuit Synthesis: From Multi-Controlled Gates to Isometries and Quantum Channels

Gui-Long Jiang

Circuit synthesis of multi-controlled gates is crucial for qudit ($d$-level) quantum computing. This paper presents efficient synthesis schemes that reduce the elementary gate count for multi-controlled single-qudit gates. For synthesizing general $(n-1)$-controlled unitaries on $n$ qudits, we reduce the controlled-increment (CINC) and generalized controlled-$X$ (GCX) gate counts to $O(n^2)$, improving upon existing $O(n^{2+\log_2 d})$ CINC and $O(n^3)$ GCX bounds. For $(n-1)$-controlled special unitaries, this complexity is further reduced to $O(n)$. Furthermore, we present a method for approximately synthesizing multi-controlled unitary gates with a linear complexity in the number of control qudits. By utilizing the proposed circuit, we present qudit-based circuit constructions for isometries and quantum channels from $n$ to $m$ qudits. Moreover, for the first time, we present a circuit synthesis scheme for single-controlled gates using SUM gates and single-qudit gates when $d$ is prime. This enables all CINC-based circuits for various quantum operations to be converted into SUM-gate circuits while preserving the same asymptotic complexity. Finally, we establish a theoretical lower bound on the number of SUM and CINC gates required to synthesize general $n$-qudit unitaries.

quant-pharXiv:2607.08200•Jul 10, 2026•0 citations

Elementary gates for ternary quantum logic circuit

Yao-Min Di, Hai‐Rui Wei

In this article the elementary gates for ternary quantum logic circuit are studied. We propose the ternary controlled X (TCX) gate or ternary controlled Z (TCZ) gate as two-qutrit elementary gate, which is universal when assisted by arbitrary one-qutrit gates. It is primitive, efficient and easy to implement. Based on Cartan decomposition, we also give the one-qutrit elementary gates. Then the synthesis of some important ternary gates is investigated and the scheme of physical implementation for these ternary gates is discussed. Finally we extend these elementary gates to more general qudit case, so it provides a unified description for the synthesis of the binary and multi-valued quantum circuits.

arXiv:1105.5485•May 27, 2011•61 citations

Synthesis of quantum circuits by multiplex rotation gates

Jiang Hu, Wang Pengjun, Zhang Qiaowen

As a model for quantum computation, quantum circuits have found their wide applications in communications, cryptography and information processing. In order to synthesize arbitrary quantum circuits, we present a new type of gate called quantum multiplex rotation gate, which is implemented by simply elementary gates. A method based on QR decomposition and two optimization rules are proposed to decompose general quantum circuit acting on n-qubits into quantum multiplex rotation gates. In comparison with other synthesis algorithms by QR decomposition, our methods achieve better performance in terms of elementary gate counts, 1.2 × 4n approximately.

IEICE Electronics Express•Jan 1, 2016•1 citation

Quantum Circuits for General Multiqubit Gates

Mikko Möttönen, Juha J. Vartiainen, Ville Bergholm +1 more

We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits-a unitary transformation with 4(n) degrees of freedom. For synthesizing the gate sequence, a method based on the so-called cosine-sine matrix decomposition is presented. The result is optimal in the number of elementary one-qubit gates, 4(n), and scales more favorably than the previously reported decompositions requiring 4(n)-2(n+1) controlled NOT gates.

arXiv:quant-ph/0404089•Physical Review Letters•Sep 20, 2004•431 citations

Optimal Quantum Circuits for General Multi‐Qutrit Quantum Computation

Gui‐Long Jiang, Wen‐Qiang Liu, Hai‐Rui Wei

Abstract Quantum circuits of a general quantum gate acting on multiple ‐level quantum systems play a prominent role in multi‐valued quantum computation. A recursive Cartan decomposition of semi‐simple unitary Lie group (arbitrary ‐qutrit gate) is first proposed with a rigorous proof, which completely decomposes an ‐qutrit gate into local and non‐local operations. On this basis, an explicit quantum circuit is designed for implementing arbitrary two‐qutrit gates, and the cost of the construction is 21 generalized controlled (GCX) and controlled increment (CINC) gates less than the earlier best result of 26 GGXs. Furthermore, the program is extended to the ‐qutrit system, and the quantum circuit of generic ‐qutrit gates contained GGXs and CINCs is presented. Such asymptotically optimal structure is the best known result so far and its strength becomes more remarkable as increases, for example, when , the program saves 7146 GCXs compared to the previous best result. In addition, concrete recursive decomposition expressions is given for each non‐local operation instead of only quantum circuit diagrams.

arXiv:2310.11996•Advanced Quantum Technologies•Apr 19, 2024•21 citations
We propose the generalized controlled XXX (gcx) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and show that it is feasible with current technology. With these elementary gates many important qudit quantum gates can be synthesized conveniently. We provide efficient methods for the synthesis of various kinds of controlled qudit gates and greatly simplify the synthesis of existing generic multi-valued quantum circuits. Moreover, we generalize the quantum Shannon decomposition (QSD), the most powerful technique for the synthesis of generic qubit circuits, to the qudit case. A comparison of ququart (d=4d=4d=4) circuits and qubit circuits reveals that using ququart circuits may have an advantage over the qubit circuits in the synthesis of quantum circuits.
Although much work has been devoted to multivalued quantum logic synthesis, the question of whether multivalued quantum circuits are more efficient than conventional binary quantum circuits is still open. This article is devoted to the optimization of generic multivalued quantum circuits. Multivalued quantum Shannon decompositions are improved so that the circuits obtained are asymptotically optimal for all dimensionality ddd. The syntheses of uniformly multifold controlled Ry{R}_{y}Ry​ rotations are also optimized to make the circuits further simplified. Moreover, the theoretical lower bound of complexity for multivalued quantum circuits is investigated, and a quantity known as the efficiency index is proposed to evaluate the efficiency of the synthesis of various quantum circuits. The algorithm for qudit circuits given here is an efficient synthesis routine which produces improved results for all dimensionality ddd, whether the number of qudits nnn is small or large. The two facts, the leading factor of the lower bound of complexity for qudit circuits is small by a factor of $d\ensuremath{-}1$ in comparison to that for qubit circuits and the asymptotic efficiency index is increased with an increase of dimensionality ddd, reveal the potential advantage of qudit circuits over generic qubit circuits. Generic nnn-qudit circuits with $d\ensuremath{\ge}5$ and generic two-ququart circuits synthesized by the algorithm given here are practical circuits which are more efficient than the most efficient qubit circuits.
Circuit synthesis of multi-controlled gates is crucial for qudit (ddd-level) quantum computing. This paper presents efficient synthesis schemes that reduce the elementary gate count for multi-controlled single-qudit gates. For synthesizing general (n−1)(n-1)(n−1)-controlled unitaries on nnn qudits, we reduce the controlled-increment (CINC) and generalized controlled-XXX (GCX) gate counts to O(n2)O(n^2)O(n2), improving upon existing O(n2+log⁡2d)O(n^{2+\log_2 d})O(n2+log2​d) CINC and O(n3)O(n^3)O(n3) GCX bounds. For (n−1)(n-1)(n−1)-controlled special unitaries, this complexity is further reduced to O(n)O(n)O(n). Furthermore, we present a method for approximately synthesizing multi-controlled unitary gates with a linear complexity in the number of control qudits. By utilizing the proposed circuit, we present qudit-based circuit constructions for isometries and quantum channels from nnn to mmm qudits. Moreover, for the first time, we present a circuit synthesis scheme for single-controlled gates using SUM gates and single-qudit gates when ddd is prime. This enables all CINC-based circuits for various quantum operations to be converted into SUM-gate circuits while preserving the same asymptotic complexity. Finally, we establish a theoretical lower bound on the number of SUM and CINC gates required to synthesize general nnn-qudit unitaries.
In this article the elementary gates for ternary quantum logic circuit are studied. We propose the ternary controlled X (TCX) gate or ternary controlled Z (TCZ) gate as two-qutrit elementary gate, which is universal when assisted by arbitrary one-qutrit gates. It is primitive, efficient and easy to implement. Based on Cartan decomposition, we also give the one-qutrit elementary gates. Then the synthesis of some important ternary gates is investigated and the scheme of physical implementation for these ternary gates is discussed. Finally we extend these elementary gates to more general qudit case, so it provides a unified description for the synthesis of the binary and multi-valued quantum circuits.
As a model for quantum computation, quantum circuits have found their wide applications in communications, cryptography and information processing. In order to synthesize arbitrary quantum circuits, we present a new type of gate called quantum multiplex rotation gate, which is implemented by simply elementary gates. A method based on QR decomposition and two optimization rules are proposed to decompose general quantum circuit acting on n-qubits into quantum multiplex rotation gates. In comparison with other synthesis algorithms by QR decomposition, our methods achieve better performance in terms of elementary gate counts, 1.2 × 4n approximately.
Abstract Quantum circuits of a general quantum gate acting on multiple ‐level quantum systems play a prominent role in multi‐valued quantum computation. A recursive Cartan decomposition of semi‐simple unitary Lie group (arbitrary ‐qutrit gate) is first proposed with a rigorous proof, which completely decomposes an ‐qutrit gate into local and non‐local operations. On this basis, an explicit quantum circuit is designed for implementing arbitrary two‐qutrit gates, and the cost of the construction is 21 generalized controlled (GCX) and controlled increment (CINC) gates less than the earlier best result of 26 GGXs. Furthermore, the program is extended to the ‐qutrit system, and the quantum circuit of generic ‐qutrit gates contained GGXs and CINCs is presented. Such asymptotically optimal structure is the best known result so far and its strength becomes more remarkable as increases, for example, when , the program saves 7146 GCXs compared to the previous best result. In addition, concrete recursive decomposition expressions is given for each non‐local operation instead of only quantum circuit diagrams.