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

IEEE International Symposium on Multiple-Valued Logic (ISMVL)

Efficient Implementation of Controlled Operations for Multivalued Quantum Logic

David J. Rosenbaum, Marek A. Perkowski

Published Jan 1, 2009• 8 citations
Publisher

Abstract

This paper presents a new quantum array that can be used to control a single-qudit Hermitian operator for an odd radix r > 2 by n controls using Theta(nlog2r+2) single-qudit controlled gates with one control and no ancilla qudits. This quantum array is more practical than existing quantum arrays of the same complexity because it does not require the use of small roots of the operation that is being implemented. Another quantum array is also presented that implements a single-qudit operator with n controls for any radix r > 2 using lceillogr-1nrceil ancilla qudits and Theta(nlogr-12+1) single-qudit gates with one control.

DOI
10.1109/ismvl.2009.27

Related papers

Optimal Synthesis of Multi-Controlled Qudit Gates

Wei Zi, Qian Li, Xiaoming Sun

We propose a linear-size synthesis of the multi-controlled Toffoli gate on qudits with at most one borrowed ancilla. This one ancilla can even be saved when the qudit dimension is odd. Our synthesis leads to improvements in various quantum algorithms implemented on qudits. In particular, we obtain (i) a linear-size and one-clean-ancilla synthesis of multi-controlled qudit gates; (ii) an optimal-size and one-clean-ancilla synthesis of unitaries on qudits; (iii) a near-optimal-size and ancilla-free/one-borrowed-ancilla implementation of classical reversible functions as qudit gates.

arXiv:2303.12979•ACM/IEEE Design Automation Conference (DAC)•Jul 9, 2023•12 citations

Efficient circuits for exact-universal computation with qudits

Gavin K. Brennen, Stephen S. Bullock, Dianne Prost O’Leary

This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, $\CINC$, is exact-universal. A recent paper [S.Bullock, D.O'Leary, and G.K. Brennen, Phys. Rev. Lett. 94, 230502 (2005)] describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state-synthesis circuit in much greater detail and prove that it is correct. Also, the (n-2)/(d-2) ancillas required in the original algorithm may be removed without changing the asymptotics. Further, we present a new algorithm for unitary synthesis, inspired by the QR matrix decomposition, which is also asymptotically optimal.

arXiv:quant-ph/0509161•Quantum Information and Computation•Jul 1, 2006•39 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

Robust control and entanglement of qudits in neutral atom arrays

Amir Burshtein, Shachar Fraenkel, Moshe Goldstein +1 more

Quantum devices comprised of elementary components with more than two stable levels—so-called qudits—enrich the accessible Hilbert space, enabling applications ranging from fault-tolerant quantum computing to simulating complex many-body models. While several quantum platforms are built from local elements that are equipped with a rich spectrum of stable energy levels, schemes for the efficient control and entanglement of qudits are scarce. Importantly, no experimental demonstration of multiqudit control has been achieved to date in neutral atom arrays. Here, we propose a general scheme for controlling and entangling qudits and perform a full analysis for the case of qutrits, encoded in ground and metastable states of alkaline earth atoms. We find an efficient implementation of single-qudit gates via the simultaneous driving of multiple transition frequencies. For entangling operations, we provide a concrete and intuitive recipe for the controlled- Z ( C Z ) gate for any local dimension d , realized through alternating single qudit and entangling pulses that simultaneously drive up to two Rydberg transitions. We further prove that two simultaneous Rydberg tones are, in general, the minimum necessary for implementing the C Z gate with a global drive. The pulses we use are optimally controlled, smooth, and robust to realistic experimental imperfections, as we demonstrate using extensive noise simulations. This amounts to a minimal, resource-efficient, and practical protocol for realizing a universal set of gates. Our scheme for the native control of qudits in a neutral atom array provides a high-fidelity route toward qudit-based quantum computation, ready for implementation on near-term devices.

arXiv:2508.16294•Physical Review Research•Dec 9, 2025•6 citations

Qudit-based high-dimensional controlled-not gate

Fang‐Fang Du, Xue-Mei Ren, Ming Ma +1 more

High-dimensional quantum systems expand quantum channel capacity and information storage space. By implementing high-dimensional quantum logic gates, the speed of quantum computing can be practically enhanced. We propose a deterministic 4 × 4-dimensional controlled-not (CNOT) gate for a hybrid system without ancillary qudits required, where the spatial and polarization states of a single photon serve as a control qudit of four dimensions, whereas two electron-spin states in nitrogen-vacancy (NV) centers act as a four-dimensional target qudit. As the control qudits are easily operated employing simple optical elements and the target qudits are available for storage, the CNOT gate works in a deterministic way, and it can be flexibly extended to n × n-dimensional (n > 4) quantum gates for other hybrid systems or different photonic degrees of freedoms. The efficiency and fidelity of the CNOT gate are analyzed aligning with current technological capabilities, finding that they have satisfactory performances.

Optics Letters•Feb 7, 2024•65 citations

Synthesis of multivalued quantum logic circuits by elementary gates

Yao-Min Di, Hai‐Rui Wei

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.

arXiv:1302.0056•Physical Review A•Jan 22, 2013•78 citations
This paper presents a new quantum array that can be used to control a single-qudit Hermitian operator for an odd radix r > 2 by n controls using Theta(nlog2r+2) single-qudit controlled gates with one control and no ancilla qudits. This quantum array is more practical than existing quantum arrays of the same complexity because it does not require the use of small roots of the operation that is being implemented. Another quantum array is also presented that implements a single-qudit operator with n controls for any radix r > 2 using lceillogr-1nrceil ancilla qudits and Theta(nlogr-12+1) single-qudit gates with one control.
We propose a linear-size synthesis of the multi-controlled Toffoli gate on qudits with at most one borrowed ancilla. This one ancilla can even be saved when the qudit dimension is odd. Our synthesis leads to improvements in various quantum algorithms implemented on qudits. In particular, we obtain (i) a linear-size and one-clean-ancilla synthesis of multi-controlled qudit gates; (ii) an optimal-size and one-clean-ancilla synthesis of unitaries on qudits; (iii) a near-optimal-size and ancilla-free/one-borrowed-ancilla implementation of classical reversible functions as qudit gates.
This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, $\CINC$, is exact-universal. A recent paper [S.Bullock, D.O'Leary, and G.K. Brennen, Phys. Rev. Lett. 94, 230502 (2005)] describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state-synthesis circuit in much greater detail and prove that it is correct. Also, the (n-2)/(d-2) ancillas required in the original algorithm may be removed without changing the asymptotics. Further, we present a new algorithm for unitary synthesis, inspired by the QR matrix decomposition, which is also asymptotically optimal.
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.
Quantum devices comprised of elementary components with more than two stable levels—so-called qudits—enrich the accessible Hilbert space, enabling applications ranging from fault-tolerant quantum computing to simulating complex many-body models. While several quantum platforms are built from local elements that are equipped with a rich spectrum of stable energy levels, schemes for the efficient control and entanglement of qudits are scarce. Importantly, no experimental demonstration of multiqudit control has been achieved to date in neutral atom arrays. Here, we propose a general scheme for controlling and entangling qudits and perform a full analysis for the case of qutrits, encoded in ground and metastable states of alkaline earth atoms. We find an efficient implementation of single-qudit gates via the simultaneous driving of multiple transition frequencies. For entangling operations, we provide a concrete and intuitive recipe for the controlled- Z ( C Z ) gate for any local dimension d , realized through alternating single qudit and entangling pulses that simultaneously drive up to two Rydberg transitions. We further prove that two simultaneous Rydberg tones are, in general, the minimum necessary for implementing the C Z gate with a global drive. The pulses we use are optimally controlled, smooth, and robust to realistic experimental imperfections, as we demonstrate using extensive noise simulations. This amounts to a minimal, resource-efficient, and practical protocol for realizing a universal set of gates. Our scheme for the native control of qudits in a neutral atom array provides a high-fidelity route toward qudit-based quantum computation, ready for implementation on near-term devices.
High-dimensional quantum systems expand quantum channel capacity and information storage space. By implementing high-dimensional quantum logic gates, the speed of quantum computing can be practically enhanced. We propose a deterministic 4 × 4-dimensional controlled-not (CNOT) gate for a hybrid system without ancillary qudits required, where the spatial and polarization states of a single photon serve as a control qudit of four dimensions, whereas two electron-spin states in nitrogen-vacancy (NV) centers act as a four-dimensional target qudit. As the control qudits are easily operated employing simple optical elements and the target qudits are available for storage, the CNOT gate works in a deterministic way, and it can be flexibly extended to n × n-dimensional (n > 4) quantum gates for other hybrid systems or different photonic degrees of freedoms. The efficiency and fidelity of the CNOT gate are analyzed aligning with current technological capabilities, finding that they have satisfactory performances.
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.