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

Parallel entangling operations on a universal ion-trap quantum computer

Caroline Figgatt, Aaron Ostrander, Norbert M. Linke, K. A. Landsman, Daiwei Zhu, D. Maslov, Christopher R. Monroe

Published Jan 1, 2019• 53 citations
OpenAlex

Abstract

Abstract The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations1. The ability to execute parallel entangling quantum gates offers efficiency gains in numerous quantum circuits2–4, as well as for entire algorithms—such as Shor’s factoring algorithm5—and quantum simulations6, 7. In circuits such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time through the divide-and-conquer technique8. More importantly, quantum gate parallelism is essential for fault-tolerant error correction of qubits that suffer from idle errors9, 10. However, the implementation of parallel quantum gates is complicated by potential crosstalk, especially between qubits that are fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions11, 12 or cavity-coupled superconducting transmons13. Here we present experimental results for parallel two-qubit entangling gates in an array of fully connected trapped 171Yb+ ion qubits. We perform a one-bit full-addition operation on a quantum computer using a depth-four quantum circuit4, 14, 15, where circuit depth denotes the number of runtime steps required. Our method exploits the power of highly connected qubit systems using classical control techniques and will help to speed up quantum circuits and achieve fault tolerance in trapped-ion quantum computers.

Related papers

Building and Programming a Universal Ion Trap Quantum Computer

Caroline Figgatt

Quantum computing represents an exciting frontier in the realm of information processing; it is a promising technology that may provide future advances in a wide range of fields, from quantum chemistry to optimization problems. This thesis discusses experimental results for several quantum algorithms performed on a programmable quantum computer consisting of a linear chain of five or seven trapped 171Yb+ atomic clock ions with long coherence times and high gate fidelities. We execute modular one- and two-qubit computation gates through Raman transitions driven by a beat note between counter-propagating beams from a pulsed laser. The system's individual addressing capability provides arbitrary single-qubit rotations as well as all possible two-qubit entangling gates, which are implemented using a pulse-segmentation scheme. The quantum computer can be programmed from a high-level interface to execute arbitrary quantum circuits, and comes with a toolbox of many important composite gates and quantum subroutines. We present experimental results for a complete three-qubit Grover quantum search algorithm, a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database, and report better-than-classical performance. The algorithm is performed for all 8 possible single-result oracles and all 28 possible two-result oracles. All quantum solutions are shown to outperform their classical counterparts. Performing parallel operations will be a powerful capability as deeper circuits on larger, more complex quantum computers present new challenges. Here, we perform a pair of 2-qubit gates simultaneously in a single chain of trapped ions. We employ a pre-calculated pulse shaping scheme that modulates the phase and amplitude of the Raman transitions to drive programmable high-fidelity 2-qubit entangling gates in parallel by coupling to the collective modes of motion of the ion chain. Ensuring the operation yields only spin-spin interactions between the desired pairs, with neither residual spin-motion entanglement nor crosstalk spin-spin entanglement, is a nonlinear constraint problem, and pulse solutions are found using optimization techniques. As an application, we demonstrate the quantum full adder using a depth-4 circuit requiring the use of parallel 2-qubit operations.

•Jan 1, 2018•1 citation

Pairwise-parallel entangling gates on orthogonal modes in a trapped-ion chain

Yingyue Zhu, Alaina Green, Nhung Nguyen +3 more

Parallel operations are important for both near-term quantum computers and larger-scale fault-tolerant machines because they reduce execution time and qubit idling. We propose and implement a pairwise-parallel gate scheme on a trapped-ion quantum computer. The gates are driven simultaneously on different sets of orthogonal motional modes of a trapped-ion chain. We demonstrate the utility of this scheme by creating a GHZ state in one step using parallel gates with one overlapping qubit. We also show its advantage for circuits by implementing a digital quantum simulation of the dynamics of an interacting spin system, the transverse-field Ising model. This method effectively extends the available gate depth by up to two times with no overhead apart from additional initial cooling when no overlapping qubit is involved. This is because using a set of extra modes as additional quantum degrees of freedom is nearly equivalent to halving the trap heating rate, doubling the laser and qubit coherence time, and extending the controller memory depth by up to a factor of two. This scheme can be easily applied to different trapped-ion qubits and gate schemes, broadly enhancing the capabilities of trapped-ion quantum computers.

arXiv:2302.09145•Feb 17, 2023•0 citations

Strategies for a practical advantage of fault-tolerant circuit design in noisy trapped-ion quantum computers

Sascha Heußen, Lukas Postler, Manuel Rispler +5 more

Fault-tolerant quantum error correction provides a strategy to protect information processed by a quantum computer against noise which would otherwise corrupt the data. A fault-tolerant universal quantum computer must implement a universal gate set on the logical level in order to perform arbitrary calculations to in principle unlimited precision. In this paper we characterize the recent demonstration of a fault-tolerant universal gate set in a trapped-ion quantum computer [Postler et al., Nature (London) 605, 7911 (2022)] and identify aspects to improve the design of experimental setups to reach an advantage of logical over physical qubit operation. We show that various criteria to assess the break-even point for fault-tolerant quantum operations are within reach for the ion trap quantum computing architecture under consideration. Furthermore, we analyze the influence of crosstalk in entangling gates for logical state preparation circuits. These circuits can be designed to respect fault tolerance for specific microscopic noise models. We find that an experimentally informed depolarizing noise model captures the essential noise dynamics of the fault-tolerant experiment that we consider, and crosstalk is negligible in the currently accessible regime of physical error rates. For deterministic Pauli state preparation, we provide a fault-tolerant unitary logical qubit initialization circuit, which can be realized without in-sequence measurement and feed-forward of classical information. Additionally, we show that nondeterministic state preparation schemes, i.e., repeat until success, for logical Pauli and magic states perform with higher logical fidelity over their deterministic counterparts for the current and anticipated future regime of physical error rates. Our results offer guidance on improvements of physical qubit operations and validate the experimentally informed noise model as a tool to predict logical failure rates in quantum computing architectures based on trapped ions.

arXiv:2301.10017•Physical Review A•Apr 17, 2023•27 citations

Performance analysis for crosstalk errors between parallel entangling gates in trapped-ion quantum error correction

Fangxuan Liu, Gaoxiang Tang, L.-M. Duan +1 more

The ability to execute a large number of quantum gates in parallel is a fundamental requirement for quantum error correction, allowing an error threshold to exist under the finite coherence time of physical qubits. Recently, two-dimensional ion crystals have been demonstrated as a plausible approach to scale up the qubit number in a trapped ion quantum computer. However, although the long-range Coulomb interaction between the ions enables their strong connectivity, it also complicates the design of parallel gates and leads to intrinsic crosstalk errors. Here we examine the effects of crosstalk errors on a rotated surface code. We show that, instead of the distance-3 code considered in previous works, a distance-5 code is necessary to correct the two-qubit crosstalk error. We numerically calculate the logical error rates and coherence times under various crosstalk errors, gate infidelities, and coherence times of the physical qubits, and we optimize the parallelism level according to the competition between different error sources. We show that a break-even point can be reached under realistic parameters. We further analyze the spatial dependence of the crosstalk, and discuss the scaling of the logical error rate versus the code distance for the long-term goal of a logical error rate below 10 − 10 .

arXiv:2501.09554•Physical Review Applied•Jun 27, 2025•2 citations

Crosstalk suppression of parallel gates for fault-tolerant quantum computation with trapped ions via optical tweezers

Lin Cheng, Sheng-Chen Liu, Liang-You Peng +1 more

The ability to perform entangling operations in parallel with a low error is essential for a large-scale fault-tolerant quantum computer. However, for trapped-ion systems, it is a challenging task due to the crosstalk resulting from the collective motional modes. Here, we develop a highly paralleled quantum circuit demonstrating a logical qubit based on the Steane code and study the impact of the crosstalk error on the performance of the fault-tolerant protocol. We show that the crosstalk indeed greatly destroys the fault-tolerant property of the quantum error correction. To achieve the break-even point with encoded qubits, we identify the suppression requirement of the crosstalk error to be less than ${10}^{\ensuremath{-}6}$ for the Steane code. Furthermore, to mitigate the crosstalk below the fault-tolerant threshold, we propose a highly efficient optimization scheme by utilizing the programmable optical tweezer array. Overall, we make an elegant combination of the pulse-control optimization of parallel gate operations with the fault-tolerant protocol on the error-protected universal quantum computer.

Physical Review Applied•Sep 10, 2024•6 citations

Pairwise‐Parallel Entangling Gates on Orthogonal Modes in a Trapped‐Ion Chain

Yingyue Zhu, Alaina Green, Nhung H. Nguyen +3 more

Abstract Parallel operations are important for both near‐term quantum computers and larger‐scale fault‐tolerant machines because they reduce execution time and qubit idling. This study proposes and implements a pairwise‐parallel gate scheme on a trapped‐ion quantum computer. The gates are driven simultaneously on different sets of orthogonal motional modes of a trapped‐ion chain. This work demonstrates the utility of this scheme by creating a Greenberger‐Horne‐Zeilinger (GHZ) state in one step using parallel gates with one overlapping qubit. It also shows its advantage for circuits by implementing a digital quantum simulation of the dynamics of an interacting spin system, the transverse‐field Ising model. This method effectively extends the available gate depth by up to two times with no overhead when no overlapping qubit is involved, apart from additional initial cooling. This scheme can be easily applied to different trapped‐ion qubits and gate schemes, broadly enhancing the capabilities of trapped‐ion quantum computers.

Advanced Quantum Technologies•Sep 19, 2023•10 citations
Abstract The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations1. The ability to execute parallel entangling quantum gates offers efficiency gains in numerous quantum circuits2–4, as well as for entire algorithms—such as Shor’s factoring algorithm5—and quantum simulations6, 7. In circuits such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time through the divide-and-conquer technique8. More importantly, quantum gate parallelism is essential for fault-tolerant error correction of qubits that suffer from idle errors9, 10. However, the implementation of parallel quantum gates is complicated by potential crosstalk, especially between qubits that are fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions11, 12 or cavity-coupled superconducting transmons13. Here we present experimental results for parallel two-qubit entangling gates in an array of fully connected trapped 171Yb+ ion qubits. We perform a one-bit full-addition operation on a quantum computer using a depth-four quantum circuit4, 14, 15, where circuit depth denotes the number of runtime steps required. Our method exploits the power of highly connected qubit systems using classical control techniques and will help to speed up quantum circuits and achieve fault tolerance in trapped-ion quantum computers.
Quantum computing represents an exciting frontier in the realm of information processing; it is a promising technology that may provide future advances in a wide range of fields, from quantum chemistry to optimization problems. This thesis discusses experimental results for several quantum algorithms performed on a programmable quantum computer consisting of a linear chain of five or seven trapped 171Yb+ atomic clock ions with long coherence times and high gate fidelities. We execute modular one- and two-qubit computation gates through Raman transitions driven by a beat note between counter-propagating beams from a pulsed laser. The system's individual addressing capability provides arbitrary single-qubit rotations as well as all possible two-qubit entangling gates, which are implemented using a pulse-segmentation scheme. The quantum computer can be programmed from a high-level interface to execute arbitrary quantum circuits, and comes with a toolbox of many important composite gates and quantum subroutines. We present experimental results for a complete three-qubit Grover quantum search algorithm, a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database, and report better-than-classical performance. The algorithm is performed for all 8 possible single-result oracles and all 28 possible two-result oracles. All quantum solutions are shown to outperform their classical counterparts. Performing parallel operations will be a powerful capability as deeper circuits on larger, more complex quantum computers present new challenges. Here, we perform a pair of 2-qubit gates simultaneously in a single chain of trapped ions. We employ a pre-calculated pulse shaping scheme that modulates the phase and amplitude of the Raman transitions to drive programmable high-fidelity 2-qubit entangling gates in parallel by coupling to the collective modes of motion of the ion chain. Ensuring the operation yields only spin-spin interactions between the desired pairs, with neither residual spin-motion entanglement nor crosstalk spin-spin entanglement, is a nonlinear constraint problem, and pulse solutions are found using optimization techniques. As an application, we demonstrate the quantum full adder using a depth-4 circuit requiring the use of parallel 2-qubit operations.
Parallel operations are important for both near-term quantum computers and larger-scale fault-tolerant machines because they reduce execution time and qubit idling. We propose and implement a pairwise-parallel gate scheme on a trapped-ion quantum computer. The gates are driven simultaneously on different sets of orthogonal motional modes of a trapped-ion chain. We demonstrate the utility of this scheme by creating a GHZ state in one step using parallel gates with one overlapping qubit. We also show its advantage for circuits by implementing a digital quantum simulation of the dynamics of an interacting spin system, the transverse-field Ising model. This method effectively extends the available gate depth by up to two times with no overhead apart from additional initial cooling when no overlapping qubit is involved. This is because using a set of extra modes as additional quantum degrees of freedom is nearly equivalent to halving the trap heating rate, doubling the laser and qubit coherence time, and extending the controller memory depth by up to a factor of two. This scheme can be easily applied to different trapped-ion qubits and gate schemes, broadly enhancing the capabilities of trapped-ion quantum computers.
Fault-tolerant quantum error correction provides a strategy to protect information processed by a quantum computer against noise which would otherwise corrupt the data. A fault-tolerant universal quantum computer must implement a universal gate set on the logical level in order to perform arbitrary calculations to in principle unlimited precision. In this paper we characterize the recent demonstration of a fault-tolerant universal gate set in a trapped-ion quantum computer [Postler et al., Nature (London) 605, 7911 (2022)] and identify aspects to improve the design of experimental setups to reach an advantage of logical over physical qubit operation. We show that various criteria to assess the break-even point for fault-tolerant quantum operations are within reach for the ion trap quantum computing architecture under consideration. Furthermore, we analyze the influence of crosstalk in entangling gates for logical state preparation circuits. These circuits can be designed to respect fault tolerance for specific microscopic noise models. We find that an experimentally informed depolarizing noise model captures the essential noise dynamics of the fault-tolerant experiment that we consider, and crosstalk is negligible in the currently accessible regime of physical error rates. For deterministic Pauli state preparation, we provide a fault-tolerant unitary logical qubit initialization circuit, which can be realized without in-sequence measurement and feed-forward of classical information. Additionally, we show that nondeterministic state preparation schemes, i.e., repeat until success, for logical Pauli and magic states perform with higher logical fidelity over their deterministic counterparts for the current and anticipated future regime of physical error rates. Our results offer guidance on improvements of physical qubit operations and validate the experimentally informed noise model as a tool to predict logical failure rates in quantum computing architectures based on trapped ions.
The ability to execute a large number of quantum gates in parallel is a fundamental requirement for quantum error correction, allowing an error threshold to exist under the finite coherence time of physical qubits. Recently, two-dimensional ion crystals have been demonstrated as a plausible approach to scale up the qubit number in a trapped ion quantum computer. However, although the long-range Coulomb interaction between the ions enables their strong connectivity, it also complicates the design of parallel gates and leads to intrinsic crosstalk errors. Here we examine the effects of crosstalk errors on a rotated surface code. We show that, instead of the distance-3 code considered in previous works, a distance-5 code is necessary to correct the two-qubit crosstalk error. We numerically calculate the logical error rates and coherence times under various crosstalk errors, gate infidelities, and coherence times of the physical qubits, and we optimize the parallelism level according to the competition between different error sources. We show that a break-even point can be reached under realistic parameters. We further analyze the spatial dependence of the crosstalk, and discuss the scaling of the logical error rate versus the code distance for the long-term goal of a logical error rate below 10 − 10 .
The ability to perform entangling operations in parallel with a low error is essential for a large-scale fault-tolerant quantum computer. However, for trapped-ion systems, it is a challenging task due to the crosstalk resulting from the collective motional modes. Here, we develop a highly paralleled quantum circuit demonstrating a logical qubit based on the Steane code and study the impact of the crosstalk error on the performance of the fault-tolerant protocol. We show that the crosstalk indeed greatly destroys the fault-tolerant property of the quantum error correction. To achieve the break-even point with encoded qubits, we identify the suppression requirement of the crosstalk error to be less than ${10}^{\ensuremath{-}6}$ for the Steane code. Furthermore, to mitigate the crosstalk below the fault-tolerant threshold, we propose a highly efficient optimization scheme by utilizing the programmable optical tweezer array. Overall, we make an elegant combination of the pulse-control optimization of parallel gate operations with the fault-tolerant protocol on the error-protected universal quantum computer.
Abstract Parallel operations are important for both near‐term quantum computers and larger‐scale fault‐tolerant machines because they reduce execution time and qubit idling. This study proposes and implements a pairwise‐parallel gate scheme on a trapped‐ion quantum computer. The gates are driven simultaneously on different sets of orthogonal motional modes of a trapped‐ion chain. This work demonstrates the utility of this scheme by creating a Greenberger‐Horne‐Zeilinger (GHZ) state in one step using parallel gates with one overlapping qubit. It also shows its advantage for circuits by implementing a digital quantum simulation of the dynamics of an interacting spin system, the transverse‐field Ising model. This method effectively extends the available gate depth by up to two times with no overhead when no overlapping qubit is involved, apart from additional initial cooling. This scheme can be easily applied to different trapped‐ion qubits and gate schemes, broadly enhancing the capabilities of trapped‐ion quantum computers.