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

PRX Quantum

Fast Design and Scaling of Multiqubit Gates in Large-Scale Trapped-Ion Quantum Computers

Lee Peleg, David Schwerdt, Jonathan Nemirovsky, Yotam Shapira, Nitzan Akerman, Ady Stern, Amit Ben Kish, Roee Ozeri

Published Jun 4, 2026• 1 citation
Publisher

Abstract

Quantum computers based on crystals of trapped ions are a prominent technology for quantum computation. A unique feature of trapped ions is their long-range Coulomb interactions, which can be exploited to realize large-scale multiqubit entanglement gates. However, scaling up the number of qubits, N , in these systems, while retaining high-fidelity and high-speed operations, is challenging. Specifically, designing multiqubit entanglement gates in long ion crystals of hundreds of ions involves an NP-hard optimization problem, rendering scale-up not only a technological challenge, but also a conceptual challenge. Here we introduce a method that mitigates this challenge, effectively allowing for a polynomial-time design of fast, robust, and programmable entanglement gates, acting on the entire ion-crystal. We show that while the number of simultaneous entanglement operations scales as N 2 , the gate duration scales as N , leading to a scaling advantage. We use our methods to investigate the drive-power requirements and susceptibility to noise and errors of these multiqubit gates. Our method delineates a path toward scaling up quantum computers based on ion-crystals with hundreds of qubits.

DOI
10.1103/r78y-3q89

Related papers

Fast design and scaling of multi-qubit gates in large-scale trapped-ion quantum computers

Lee Peleg, David Schwerdt, Jonathan Nemirovsky +5 more

Quantum computers based on crystals of trapped ions are a prominent technology for quantum computation. A unique feature of trapped ions is their long-range Coulomb interactions, which can be exploited to realize large-scale multiqubit entanglement gates. However, scaling up the number of qubits, $N$, in these systems, while retaining high-fidelity and high-speed operations, is challenging. Specifically, designing multiqubit entanglement gates in long ion crystals of hundreds of ions involves an NP-hard optimization problem, rendering scale-up not only a technological challenge, but also a conceptual challenge. Here we introduce a method that mitigates this challenge, effectively allowing for a polynomial-time design of fast, robust, and programmable entanglement gates, acting on the entire ion-crystal. We show that while the number of simultaneous entanglement operations scales as $N^2$, the gate duration scales as $N$, leading to a scaling advantage. We use our methods to investigate the drive-power requirements and susceptibility to noise and errors of these multiqubit gates. Our method delineates a path towards scaling up quantum computers based on ion-crystals with hundreds of qubits.

arXiv:2307.09566•Jul 14, 2023•1 citation

Theory of robust multiqubit nonadiabatic gates for trapped ions

Yotam Shapira, Ravid Shaniv, Tom Manovitz +5 more

The prevalent approach to executing quantum algorithms on quantum computers is to break down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate sequences which are exponential in the qubit register size. Furthermore, gate fidelities tend to decrease when acting in larger qubit registers. Thus high-fidelity implementations in large qubit registers are still a prominent challenge. Here we propose and investigate multiqubit entangling gates for trapped ions. Our gates couple many qubits at once, allowing us to decrease the total number of gates used while retaining a high gate fidelity. Our method employs all of the normal modes of motion of the ion chain, which allows us to operate outside of the adiabatic regime and at rates comparable to the secular ion-trapping frequency. Furthermore we extend our method for generating Hamiltonians which are suitable for quantum analog simulations, such as a nearest-neighbor spin Hamiltonian or the Su-Schrieffer-Heeger Hamiltonian.

arXiv:1911.03073•Physical Review A•Mar 20, 2020•52 citations

Scalable Architecture for Trapped-Ion Quantum Computing Using rf Traps and Dynamic Optical Potentials

David Schwerdt, Lee Peleg, Yotam Shapira +9 more

Qubits based on ions trapped in linear radio-frequency traps form a successful platform for quantum computing, due to their high fidelity of operations, all-to-all connectivity, and degree of local control. In principle, there is no fundamental limit to the number of ion-based qubits that can be confined in a single 1D register. However, in practice, there are two main issues associated with long trapped-ion crystals, that stem from the “softening” of their modes of motion, upon scaling up: high heating rates of the ions’ motion and a dense motional spectrum; both impede the performance of high-fidelity qubit operations. Here, we propose a holistic, scalable architecture for quantum computing with large ion crystals that overcomes these issues. Our method relies on dynamically operated optical potentials that instantaneously segment the ion crystal into cells of a manageable size. We show that these cells behave as nearly independent quantum registers, allowing for parallel entangling gates on all cells. The ability to reconfigure the optical potentials guarantees connectivity across the full ion crystal and also enables efficient midcircuit measurements. We study the implementation of large-scale parallel multiqubit entangling gates that operate simultaneously on all cells and present a protocol to compensate for crosstalk errors, enabling full-scale usage of an extensively large register. We illustrate that this architecture is advantageous both for fault-tolerant digital quantum computation and for analog quantum simulations. Published by the American Physical Society 2024

arXiv:2311.01168•Physical Review X•Oct 21, 2024•24 citations

Full programmable quantum computing with trapped-ions using semi-global fields

Yakov Solomons, Yotam Kadish, Lee Peleg +3 more

Abstract Trapped-ion quantum computing can utilize all motional modes of the ion-crystal, to entangle multiple qubits simultaneously, enabling universal computation with multi-qubit gates supplemented by single-qubit rotations. Using multiple tones to drive each ion individually induces Ising-type interactions, forming a multi-qubit gate, where the coupling matrix of all ion pairs is fully controllable. This reduces the total gate count while maintaining high fidelity, as opposed to traditional methods that rely on a single type of two-qubit gate, such as the well-known Mølmer–Sørensen gate. However, scaling to large ion chains, individual addressing can be technically challenging in terms of optical delivery and signal generation. We explore global and semi-global drives combined with single-qubit flips and show that these can reproduce the full set of multi-qubit gates. Although optimizing the combination of single-qubit flips is a computationally hard problem, we propose an efficient scheme to implement any desired couplings in large ion chains, yielding a concatenation scheme that uses at most N / 2 multi-qubit gates, with N being the number of ions. In addition, we show that by using B < N independent semi-global fields, each driving a set of N / B ions, the number of maximal multi-qubit gates is reduced to approximately N 2 B 2 ( N − 1 ) . We show how to design the driving fields that support these schemes and investigate their properties. Our results pave the way for efficient implementations of quantum algorithms in large-scale trapped-ion quantum systems.

arXiv:2509.14331•Quantum Science and Technology•Mar 25, 2026•2 citations

Large-scale multimode entangling-gate synthesis in trapped-ion systems

YingYe Huang, Wentao Chen, Guoyu Zou +3 more

Trapped-ion systems have emerged as a leading platform for scalable quantum information processing owing to their high-fidelity operations and long-range entangling capabilities. As the number of ions in a trap increases, the growing density of collective motional modes makes the synthesis of multimode entangling gates increasingly challenging. Designing large-scale gates requires simultaneously realizing the desired spin-spin interactions, suppressing residual spin-motion entanglement, and limiting experimental control resources, leading to a high-dimensional non-convex optimization problem. Here we develop a numerical framework for multi-tone gate synthesis that directly searches for control fields satisfying these competing requirements. By employing an alternating-minimization strategy, the framework improves numerical stability and remains effective for large systems with many motional modes and target interactions. As representative demonstrations, we synthesize gates implementing all-to-all and nearest-neighbor interaction patterns in ion chains of up to N = 1000, using only global laser control. Across the parameter regimes explored here, the control resources required to maintain high-fidelity interactions do not exhibit rapid growth with system size. We extend the framework to individual addressing using a structured qLDPC target at N = 512 as an example. These results identify multimode gate synthesis as a viable route toward programmable interaction engineering in large-scale trapped-ion quantum processors.

quant-pharXiv:2606.27266•Jun 26, 2026•0 citations

Two-qubit entangling gates within arbitrarily long chains of trapped ions

K. A. Landsman, Yukai Wu, Pak Hong Leung +5 more

Ion trap quantum computers are based on modulating the Coulomb interaction between atomic ion qubits using external forces. However, the spectral crowding of collective motional modes could pose a challenge to the control of such interactions for large numbers of qubits. Here, we show that high-fidelity quantum gate operations are still possible with very large trapped ion crystals by using a small and fixed number of motional modes, simplifying the scaling of ion trap quantum computers. We present analytical work that shows that gate operations need not couple to the motion of distant ions, allowing parallel entangling gates with a crosstalk error that falls off as the inverse cube of the distance between the pairs. We also experimentally demonstrate high-fidelity entangling gates on a fully connected set of seventeen $^{171}\mathrm{Yb}^{+}$ qubits using simple laser pulse shapes that primarily couple to just a few modes.

arXiv:1905.10421•Physical Review A•Aug 26, 2019•91 citations
Quantum computers based on crystals of trapped ions are a prominent technology for quantum computation. A unique feature of trapped ions is their long-range Coulomb interactions, which can be exploited to realize large-scale multiqubit entanglement gates. However, scaling up the number of qubits, N , in these systems, while retaining high-fidelity and high-speed operations, is challenging. Specifically, designing multiqubit entanglement gates in long ion crystals of hundreds of ions involves an NP-hard optimization problem, rendering scale-up not only a technological challenge, but also a conceptual challenge. Here we introduce a method that mitigates this challenge, effectively allowing for a polynomial-time design of fast, robust, and programmable entanglement gates, acting on the entire ion-crystal. We show that while the number of simultaneous entanglement operations scales as N 2 , the gate duration scales as N , leading to a scaling advantage. We use our methods to investigate the drive-power requirements and susceptibility to noise and errors of these multiqubit gates. Our method delineates a path toward scaling up quantum computers based on ion-crystals with hundreds of qubits.
Quantum computers based on crystals of trapped ions are a prominent technology for quantum computation. A unique feature of trapped ions is their long-range Coulomb interactions, which can be exploited to realize large-scale multiqubit entanglement gates. However, scaling up the number of qubits, NNN, in these systems, while retaining high-fidelity and high-speed operations, is challenging. Specifically, designing multiqubit entanglement gates in long ion crystals of hundreds of ions involves an NP-hard optimization problem, rendering scale-up not only a technological challenge, but also a conceptual challenge. Here we introduce a method that mitigates this challenge, effectively allowing for a polynomial-time design of fast, robust, and programmable entanglement gates, acting on the entire ion-crystal. We show that while the number of simultaneous entanglement operations scales as N2N^2N2, the gate duration scales as NNN, leading to a scaling advantage. We use our methods to investigate the drive-power requirements and susceptibility to noise and errors of these multiqubit gates. Our method delineates a path towards scaling up quantum computers based on ion-crystals with hundreds of qubits.
The prevalent approach to executing quantum algorithms on quantum computers is to break down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate sequences which are exponential in the qubit register size. Furthermore, gate fidelities tend to decrease when acting in larger qubit registers. Thus high-fidelity implementations in large qubit registers are still a prominent challenge. Here we propose and investigate multiqubit entangling gates for trapped ions. Our gates couple many qubits at once, allowing us to decrease the total number of gates used while retaining a high gate fidelity. Our method employs all of the normal modes of motion of the ion chain, which allows us to operate outside of the adiabatic regime and at rates comparable to the secular ion-trapping frequency. Furthermore we extend our method for generating Hamiltonians which are suitable for quantum analog simulations, such as a nearest-neighbor spin Hamiltonian or the Su-Schrieffer-Heeger Hamiltonian.
Qubits based on ions trapped in linear radio-frequency traps form a successful platform for quantum computing, due to their high fidelity of operations, all-to-all connectivity, and degree of local control. In principle, there is no fundamental limit to the number of ion-based qubits that can be confined in a single 1D register. However, in practice, there are two main issues associated with long trapped-ion crystals, that stem from the “softening” of their modes of motion, upon scaling up: high heating rates of the ions’ motion and a dense motional spectrum; both impede the performance of high-fidelity qubit operations. Here, we propose a holistic, scalable architecture for quantum computing with large ion crystals that overcomes these issues. Our method relies on dynamically operated optical potentials that instantaneously segment the ion crystal into cells of a manageable size. We show that these cells behave as nearly independent quantum registers, allowing for parallel entangling gates on all cells. The ability to reconfigure the optical potentials guarantees connectivity across the full ion crystal and also enables efficient midcircuit measurements. We study the implementation of large-scale parallel multiqubit entangling gates that operate simultaneously on all cells and present a protocol to compensate for crosstalk errors, enabling full-scale usage of an extensively large register. We illustrate that this architecture is advantageous both for fault-tolerant digital quantum computation and for analog quantum simulations. Published by the American Physical Society 2024
Abstract Trapped-ion quantum computing can utilize all motional modes of the ion-crystal, to entangle multiple qubits simultaneously, enabling universal computation with multi-qubit gates supplemented by single-qubit rotations. Using multiple tones to drive each ion individually induces Ising-type interactions, forming a multi-qubit gate, where the coupling matrix of all ion pairs is fully controllable. This reduces the total gate count while maintaining high fidelity, as opposed to traditional methods that rely on a single type of two-qubit gate, such as the well-known Mølmer–Sørensen gate. However, scaling to large ion chains, individual addressing can be technically challenging in terms of optical delivery and signal generation. We explore global and semi-global drives combined with single-qubit flips and show that these can reproduce the full set of multi-qubit gates. Although optimizing the combination of single-qubit flips is a computationally hard problem, we propose an efficient scheme to implement any desired couplings in large ion chains, yielding a concatenation scheme that uses at most N / 2 multi-qubit gates, with N being the number of ions. In addition, we show that by using B < N independent semi-global fields, each driving a set of N / B ions, the number of maximal multi-qubit gates is reduced to approximately N 2 B 2 ( N − 1 ) . We show how to design the driving fields that support these schemes and investigate their properties. Our results pave the way for efficient implementations of quantum algorithms in large-scale trapped-ion quantum systems.
Trapped-ion systems have emerged as a leading platform for scalable quantum information processing owing to their high-fidelity operations and long-range entangling capabilities. As the number of ions in a trap increases, the growing density of collective motional modes makes the synthesis of multimode entangling gates increasingly challenging. Designing large-scale gates requires simultaneously realizing the desired spin-spin interactions, suppressing residual spin-motion entanglement, and limiting experimental control resources, leading to a high-dimensional non-convex optimization problem. Here we develop a numerical framework for multi-tone gate synthesis that directly searches for control fields satisfying these competing requirements. By employing an alternating-minimization strategy, the framework improves numerical stability and remains effective for large systems with many motional modes and target interactions. As representative demonstrations, we synthesize gates implementing all-to-all and nearest-neighbor interaction patterns in ion chains of up to N = 1000, using only global laser control. Across the parameter regimes explored here, the control resources required to maintain high-fidelity interactions do not exhibit rapid growth with system size. We extend the framework to individual addressing using a structured qLDPC target at N = 512 as an example. These results identify multimode gate synthesis as a viable route toward programmable interaction engineering in large-scale trapped-ion quantum processors.
Ion trap quantum computers are based on modulating the Coulomb interaction between atomic ion qubits using external forces. However, the spectral crowding of collective motional modes could pose a challenge to the control of such interactions for large numbers of qubits. Here, we show that high-fidelity quantum gate operations are still possible with very large trapped ion crystals by using a small and fixed number of motional modes, simplifying the scaling of ion trap quantum computers. We present analytical work that shows that gate operations need not couple to the motion of distant ions, allowing parallel entangling gates with a crosstalk error that falls off as the inverse cube of the distance between the pairs. We also experimentally demonstrate high-fidelity entangling gates on a fully connected set of seventeen 171Yb+^{171}\mathrm{Yb}^{+}171Yb+ qubits using simple laser pulse shapes that primarily couple to just a few modes.