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:2605.04654 · Quantum Science and Technology

Efficient Multi-Controlled Gate Implementation in Trapped-Ion Systems

Minhyeok Kang, Taejin Kim, Jungsoo Hong, Joonsuk Huh

quant-phSubmitted May 6, 2026• Announced May 7, 2026• 0 citations
arXivHTMLPDF

Abstract

Multi-controlled gates are essential primitives in quantum algorithms, yet implementing them via standard gate-level decompositions remains resource-intensive. We develop efficient pulse-level implementations of multi-controlled gates in trapped-ion systems using the Cirac-Zoller scheme. We first show that the Cirac-Zoller construction admits a freedom in the sign choice of red-sideband (RSB) pulses, which leaves the logical operation invariant up to a local Pauli-$Z$ correction. By exploiting this freedom, we construct equivalent realizations of multi-controlled gates and develop pulse cancellation for more efficient implementations of successive gates. We perform numerical simulations and show that pulse cancellation reduces the gate time and improves the state fidelity. Furthermore, we propose ancilla-free circuits for general $N$-controlled gates that use a single-controlled gate primitive and $\mathcal{O}(N)$ RSB pulses. As a key application, we apply our pulse cancellation to the linear combination of unitaries (LCU) method for block encoding. We show that the RSB-pulse cost of the select operator over $L$ unitaries can be reduced from $\mathcal{O}(L\log L)$ to $\mathcal{O}(L)$, which improves the efficiency and scalability of LCU-based quantum circuits.

Comments
17 pages, 12 figures, 2 tables

Related papers

Realization of Scalable Cirac-Zoller Multi-Qubit Gates

Fang, Chao, Ye Wang, Ke Sun +1 more

The universality theorem in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. However, the process of such decomposition is generally inefficient, often leading to exponentially many gates to realize an arbitrary computational task. Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits to implement the desired circuit. In 1995, Cirac and Zoller proposed a method to realize native multi-qubit controlled-$Z$ gates in trapped ion systems, which has a stringent requirement on ground-state cooling of the motional modes utilized by the gate. An alternative approach, the Mølmer-Sørensen gate, is robust against residual motional excitation and has been a foundation for many high-fidelity gate demonstrations. This gate does not scale well beyond two qubits, incurring additional overhead when used to construct many target algorithms. Here, we take advantage of novel performance benefits of long ion chains to realize fully programmable and scalable high-fidelity Cirac-Zoller gates.

arXiv:2301.07564•Jan 18, 2023•20 citations

Fast Native Three-Qubit Gates and Fault-Tolerant Quantum Error Correction with Trapped Rydberg Ions

Katrin Bolsmann, Thiago L. M. Guedes, Weibin Li +3 more

Trapped ions as one of the most promising quantum-information-processing platforms, yet conventional entangling gates mediated by collective motion remain slow and difficult to scale. Exciting trapped ions to high-lying electronic Rydberg states provides a promising route to overcome these limitations by enabling strong, long-range dipole-dipole interactions that support much faster multi-qubit operations. Here, we introduce the first scheme for implementing a native controlled-controlled-Z gate with microwave-dressed Rydberg ions by optimizing a single-pulse protocol that accounts for the finite Rydberg-state lifetime. The resulting gate outperforms standard decompositions into one- and two-qubit gates by achieving fidelities above 97% under realistic conditions, with execution times of about 2 microseconds at cryogenic temperatures. To explore the potential of trapped Rydberg ions for fault-tolerant quantum error correction, and to illustrate the utility of three-qubit Rydberg-ion gates in this context, we develop and analyze a proposal for fault-tolerant, measurement-free quantum error correction using the nine-qubit Bacon-Shor code. Our simulations confirm that quantum error correction can be performed in a fully fault-tolerant manner on a linear Rydberg-ion chain despite its limited qubit connectivity. These results establish native multiqubit Rydberg-ion gates as a valuable resource for fast, high-fidelity quantum computing and highlight their potential for fault-tolerant quantum error correction.

quant-pharXiv:2512.16641•Quantum Science and Technology•Dec 19, 2025•3 citations

Simplified quantum logic with trapped ions

Christopher R. Monroe, Dietrich G. Leibfried, B. E. King +3 more

We describe a simplified scheme for quantum logic with a collection of laser-cooled trapped atomic ions. Building on the scheme of Cirac and Zoller, we show how the fundamental controlled-NOT gate between a collective mode of ion motion and the internal states of a single ion can be reduced to a single laser pulse, and the need for a third auxiliary internal electronic state can be eliminated.

arXiv:quant-ph/9612042•Physical Review A•Apr 1, 1997•118 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

Transition-Aware Decomposition of Single-Qudit Gates

Denis A. Drozhzhin, Evgeniy O. Kiktenko, Aleksey K. Fedorov +1 more

Quantum computation with d-level quantum systems, also known as qudits, benefits from the possibility to use a richer computational space compared to qubits. However, for an arbitrary qudit-based hardware platform, the issue is that a generic qudit operation has to be decomposed into the sequence of native operations—pulses that are adjusted to the transitions between two levels in a qudit. Typically, not all levels in a qudit are simply connected to each other due to specific selection rules. Moreover, the number of pulses plays a significant role, since each pulse takes a certain execution time and may introduce error. In this paper, we propose a resource-efficient algorithm to decompose single-qudit operations into the sequence of pulses that are allowed by qudit selection rules. Using the developed algorithm, the number of pulses is at most d(d−1)/2 for an arbitrary single-qudit operation. For specific operations, the algorithm could produce even fewer pulses. We provide a comparison of qudit decompositions for several types of trapped ions, specifically Yb+171, Ba+137 and Ca+40 with different selection rules, and also decomposition for superconducting qudits. Although our approach deals with single-qudit operations, the proposed approach is important for realizing two-qudit operations since they can be implemented as a standard two-qubit gate that is surrounded by efficiently implemented single-qudit gates.

arXiv:2510.25561•Entropy•Dec 31, 2025•3 citations

Fast Native Three-Qubit Gates and Fault-Tolerant Quantum Error Correction with Trapped Rydberg Ions

Katrin Bolsmann, Thiago Lucena Macedo Guedes, Weibin Li +3 more

Trapped ions as one of the most promising quantum-information-processing platforms, yet conventional entangling gates mediated by collective motion remain slow and difficult to scale. Exciting trapped ions to high-lying electronic Rydberg states provides a promising route to overcome these limitations by enabling strong, long-range dipole-dipole interactions that support much faster multi-qubit operations. Here, we introduce the first scheme for implementing a native controlled-controlled-Z gate with microwave-dressed Rydberg ions by optimizing a single-pulse protocol that accounts for the finite Rydberg-state lifetime. The resulting gate outperforms standard decompositions into one- and two-qubit gates by achieving fidelities above 97% under realistic conditions, with execution times of about 2 microseconds at cryogenic temperatures. To explore the potential of trapped Rydberg ions for fault-tolerant quantum error correction, and to illustrate the utility of three-qubit Rydberg-ion gates in this context, we develop and analyze a proposal for fault-tolerant, measurement-free quantum error correction using the nine-qubit Bacon-Shor code. Our simulations confirm that quantum error correction can be performed in a fully fault-tolerant manner on a linear Rydberg-ion chain despite its limited qubit connectivity. These results establish native multiqubit Rydberg-ion gates as a valuable resource for fast, high-fidelity quantum computing and highlight their potential for fault-tolerant quantum error correction.

•Jan 1, 2025•0 citations
Multi-controlled gates are essential primitives in quantum algorithms, yet implementing them via standard gate-level decompositions remains resource-intensive. We develop efficient pulse-level implementations of multi-controlled gates in trapped-ion systems using the Cirac-Zoller scheme. We first show that the Cirac-Zoller construction admits a freedom in the sign choice of red-sideband (RSB) pulses, which leaves the logical operation invariant up to a local Pauli-ZZZ correction. By exploiting this freedom, we construct equivalent realizations of multi-controlled gates and develop pulse cancellation for more efficient implementations of successive gates. We perform numerical simulations and show that pulse cancellation reduces the gate time and improves the state fidelity. Furthermore, we propose ancilla-free circuits for general NNN-controlled gates that use a single-controlled gate primitive and O(N)\mathcal{O}(N)O(N) RSB pulses. As a key application, we apply our pulse cancellation to the linear combination of unitaries (LCU) method for block encoding. We show that the RSB-pulse cost of the select operator over LLL unitaries can be reduced from O(Llog⁡L)\mathcal{O}(L\log L)O(LlogL) to O(L)\mathcal{O}(L)O(L), which improves the efficiency and scalability of LCU-based quantum circuits.
The universality theorem in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. However, the process of such decomposition is generally inefficient, often leading to exponentially many gates to realize an arbitrary computational task. Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits to implement the desired circuit. In 1995, Cirac and Zoller proposed a method to realize native multi-qubit controlled-ZZZ gates in trapped ion systems, which has a stringent requirement on ground-state cooling of the motional modes utilized by the gate. An alternative approach, the Mølmer-Sørensen gate, is robust against residual motional excitation and has been a foundation for many high-fidelity gate demonstrations. This gate does not scale well beyond two qubits, incurring additional overhead when used to construct many target algorithms. Here, we take advantage of novel performance benefits of long ion chains to realize fully programmable and scalable high-fidelity Cirac-Zoller gates.
Trapped ions as one of the most promising quantum-information-processing platforms, yet conventional entangling gates mediated by collective motion remain slow and difficult to scale. Exciting trapped ions to high-lying electronic Rydberg states provides a promising route to overcome these limitations by enabling strong, long-range dipole-dipole interactions that support much faster multi-qubit operations. Here, we introduce the first scheme for implementing a native controlled-controlled-Z gate with microwave-dressed Rydberg ions by optimizing a single-pulse protocol that accounts for the finite Rydberg-state lifetime. The resulting gate outperforms standard decompositions into one- and two-qubit gates by achieving fidelities above 97% under realistic conditions, with execution times of about 2 microseconds at cryogenic temperatures. To explore the potential of trapped Rydberg ions for fault-tolerant quantum error correction, and to illustrate the utility of three-qubit Rydberg-ion gates in this context, we develop and analyze a proposal for fault-tolerant, measurement-free quantum error correction using the nine-qubit Bacon-Shor code. Our simulations confirm that quantum error correction can be performed in a fully fault-tolerant manner on a linear Rydberg-ion chain despite its limited qubit connectivity. These results establish native multiqubit Rydberg-ion gates as a valuable resource for fast, high-fidelity quantum computing and highlight their potential for fault-tolerant quantum error correction.
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 computation with d-level quantum systems, also known as qudits, benefits from the possibility to use a richer computational space compared to qubits. However, for an arbitrary qudit-based hardware platform, the issue is that a generic qudit operation has to be decomposed into the sequence of native operations—pulses that are adjusted to the transitions between two levels in a qudit. Typically, not all levels in a qudit are simply connected to each other due to specific selection rules. Moreover, the number of pulses plays a significant role, since each pulse takes a certain execution time and may introduce error. In this paper, we propose a resource-efficient algorithm to decompose single-qudit operations into the sequence of pulses that are allowed by qudit selection rules. Using the developed algorithm, the number of pulses is at most d(d−1)/2 for an arbitrary single-qudit operation. For specific operations, the algorithm could produce even fewer pulses. We provide a comparison of qudit decompositions for several types of trapped ions, specifically Yb+171, Ba+137 and Ca+40 with different selection rules, and also decomposition for superconducting qudits. Although our approach deals with single-qudit operations, the proposed approach is important for realizing two-qudit operations since they can be implemented as a standard two-qubit gate that is surrounded by efficiently implemented single-qudit gates.
Trapped ions as one of the most promising quantum-information-processing platforms, yet conventional entangling gates mediated by collective motion remain slow and difficult to scale. Exciting trapped ions to high-lying electronic Rydberg states provides a promising route to overcome these limitations by enabling strong, long-range dipole-dipole interactions that support much faster multi-qubit operations. Here, we introduce the first scheme for implementing a native controlled-controlled-Z gate with microwave-dressed Rydberg ions by optimizing a single-pulse protocol that accounts for the finite Rydberg-state lifetime. The resulting gate outperforms standard decompositions into one- and two-qubit gates by achieving fidelities above 97% under realistic conditions, with execution times of about 2 microseconds at cryogenic temperatures. To explore the potential of trapped Rydberg ions for fault-tolerant quantum error correction, and to illustrate the utility of three-qubit Rydberg-ion gates in this context, we develop and analyze a proposal for fault-tolerant, measurement-free quantum error correction using the nine-qubit Bacon-Shor code. Our simulations confirm that quantum error correction can be performed in a fully fault-tolerant manner on a linear Rydberg-ion chain despite its limited qubit connectivity. These results establish native multiqubit Rydberg-ion gates as a valuable resource for fast, high-fidelity quantum computing and highlight their potential for fault-tolerant quantum error correction.