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

Fast Gates Allow Large-Scale Quantum Simulation with Trapped Ions

Richard Taylor, C. D. Bentley, Julen Simon Pedernales, Lucas Lamata, E. Solano, Andre R. R. Carvalho, J. J. Hope

Published Jan 4, 2016• 2 citations
OpenAlex

Abstract

Ion traps are a promising platform for the implementation of various quantum technologies, particularly quantum simulation. Unfortunately, the entangling gates required for digital quantum simulations rely on the virtual excitation of the motional modes of the trap, making the necessary operations too slow with respect to the system coherence times. In this work, we propose a method of implementing a crucial multiqubit gate, through a scheme of fast two-qubit gates, able to perform in shorter time and with more precision than existing alternatives. Its implementation would enable digital quantum simulations to outperform classical computers without error correction.

Related papers

A Study on Fast Gates for Large-Scale Quantum Simulation with Trapped Ions

Richard L. Taylor, C. D. Bentley, Julen Simon Pedernales +4 more

Abstract Large-scale digital quantum simulations require thousands of fundamental entangling gates to construct the simulated dynamics. Despite success in a variety of small-scale simulations, quantum information processing platforms have hitherto failed to demonstrate the combination of precise control and scalability required to systematically outmatch classical simulators. We analyse how fast gates could enable trapped-ion quantum processors to achieve the requisite scalability to outperform classical computers without error correction. We analyze the performance of a large-scale digital simulator, and find that fidelity of around 70% is realizable for π -pulse infidelities below 10 −5 in traps subject to realistic rates of heating and dephasing. This scalability relies on fast gates: entangling gates faster than the trap period.

arXiv:1601.00359•Scientific Reports•Apr 12, 2017•19 citations

Scalable Quantum Computing with Two-Dimensional Arrays of Trapped Ions Enabled by Fast Gates

Zain Mehdi

Realising large-scale quantum computation in the near future will require increasing the number of low-error two-qubit gates that can be implemented on a quantum computer before decoherence. One of the biggest challenges facing current trapped ion quantum computers is implementing high-speed two-qubit operations, whilst increasing the number of qubits. One of the most promising proposals for overcoming current limitations is the use of ultra-fast pulses to implement fast two-qubit gates between nearest-neighbour pairs of ions. In this thesis, I investigate these ‘fast gates’ in two-dimensional arrays of microtraps, each containing a single ion. I argue that two-dimensional architectures allow for a significant reduction in the number of two-qubit gates required for a particular computation, as compared to one-dimensional ion chains. I demonstrate this reduction for a quantum simulation of a 40-mode Fermi-Hubbard Hamiltonian. I develop an efficient scheme that allows fast gates to be numerically optimised for two-dimensional geometries. I find that this optimisation scheme is capable of designing gates that are faster, higher fidelity, and require lower laser repetition rates. Using this scheme, I find that high-speed two-qubit gates can be optimised for two-dimensional architectures, with fidelities well above thresholds required for fault tolerant error correction, around 99.99%. Furthermore, I find that fast gates in these architectures are robust to the presence of large numbers of surrounding ions. Following previous studies [1, 2] which have identified pulse imperfections as a dominant source of error in fast gates, I perform a worst-case error analysis. I find the fast gates presented in this thesis to require very small errors in single-qubit rotations, and I present recommendations for achieving those requirements. I also investigate other experimental considerations, and make recommendations for overcoming other technical challenges in realising fast gates.

•Jan 1, 2019•0 citations

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

Scalable quantum computation with fast gates in two-dimensional microtrap arrays of trapped ions

Zain Mehdi, Alexander K. Ratcliffe, J. J. Hope

We theoretically investigate the use of fast pulsed two-qubit gates for trapped ion quantum computing in a two-dimensional microtrap architecture. In one dimension, such fast gates are optimal when employed between nearest neighbors, and we examine the generalization to a two-dimensional geometry. We demonstrate that fast pulsed gates are capable of implementing high-fidelity entangling operations between ions in neighboring traps faster than the trapping period, with experimentally demonstrated laser repetition rates. Notably, we find that without increasing the gate duration high-fidelity gates are achievable even in large arrays with hundreds of ions. To demonstrate the usefulness of this proposal, we investigate the application of these gates to the digital simulation of a 40-mode Fermi-Hubbard model. This also demonstrates why shorter chains of gates required to connect arbitrary pairs of ions make this geometry well suited for large-scale computation.

arXiv:2005.00367•Physical Review A•Jul 21, 2020•8 citations

Fast gates and steady states: entangling trapped ions

C. D. Bentley

This thesis describes schemes for both a fast two-qubit gate operation and the steady-state preparation of a Bell state with trapped ions. A critical figure of merit for quantum computing with trapped ions is the gate duration relative to the decoherence timescale. We propose a fast gate scheme that off ers improvements in time, fidelity and simplicity of implementation over existing fast gate proposals. Our scheme can operate on both neighbouring and non-neighbouring ions in a long ion crystal. This provides a simpler and faster mechanism than traditional gates for complex quantum computing operations on large numbers of ions. The scheme achieves fidelities well above quantum error correction thresholds around 0.0001, and operates arbitrarily fast given arbitrary laser repetition rates. The production of these ultra-fast pulses is an experimental challenge, and fast gates have not yet been implemented; we present an implementation scheme using pulse splitting to provide a higher repetition rate and the pulse timing freedoms required for the gate scheme. We also analyse the effects of errors in the pulses on the gate operation. We analyse another strategy to generate entanglement using a driven dissipative process. Typically, environmental couplings cause decoherence. However, by combining dissipative dynamics with suitably chosen Hamiltonian evolution, the system can be steered to the desired steady states. Our steady-state scheme prepares a maximally-entangled Bell state with fidelity above 0.99, much higher than for schemes implemented with trapped ions. The driven dissipation continuously pumps the system towards the antisymmetric Bell steady-state, which is dark to the system dynamics and robust to parameter variations. The dominant loss mechanism is anomalous heating of the motional modes, reducing our fidelity by less than 0.01 for current experimental rates. Our scheme jointly addresses the ions and does not use sympathetic cooling. We enhance our scheme by combining the dissipative state preparation with the detection of photons, and obtain a significant fidelity enhancement.

•Jan 1, 2015•0 citations

Fast Design and Scaling of Multiqubit 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 toward scaling up quantum computers based on ion-crystals with hundreds of qubits.

PRX Quantum•Jun 4, 2026•1 citation
Ion traps are a promising platform for the implementation of various quantum technologies, particularly quantum simulation. Unfortunately, the entangling gates required for digital quantum simulations rely on the virtual excitation of the motional modes of the trap, making the necessary operations too slow with respect to the system coherence times. In this work, we propose a method of implementing a crucial multiqubit gate, through a scheme of fast two-qubit gates, able to perform in shorter time and with more precision than existing alternatives. Its implementation would enable digital quantum simulations to outperform classical computers without error correction.
Abstract Large-scale digital quantum simulations require thousands of fundamental entangling gates to construct the simulated dynamics. Despite success in a variety of small-scale simulations, quantum information processing platforms have hitherto failed to demonstrate the combination of precise control and scalability required to systematically outmatch classical simulators. We analyse how fast gates could enable trapped-ion quantum processors to achieve the requisite scalability to outperform classical computers without error correction. We analyze the performance of a large-scale digital simulator, and find that fidelity of around 70% is realizable for π -pulse infidelities below 10 −5 in traps subject to realistic rates of heating and dephasing. This scalability relies on fast gates: entangling gates faster than the trap period.
Realising large-scale quantum computation in the near future will require increasing the number of low-error two-qubit gates that can be implemented on a quantum computer before decoherence. One of the biggest challenges facing current trapped ion quantum computers is implementing high-speed two-qubit operations, whilst increasing the number of qubits. One of the most promising proposals for overcoming current limitations is the use of ultra-fast pulses to implement fast two-qubit gates between nearest-neighbour pairs of ions. In this thesis, I investigate these ‘fast gates’ in two-dimensional arrays of microtraps, each containing a single ion. I argue that two-dimensional architectures allow for a significant reduction in the number of two-qubit gates required for a particular computation, as compared to one-dimensional ion chains. I demonstrate this reduction for a quantum simulation of a 40-mode Fermi-Hubbard Hamiltonian. I develop an efficient scheme that allows fast gates to be numerically optimised for two-dimensional geometries. I find that this optimisation scheme is capable of designing gates that are faster, higher fidelity, and require lower laser repetition rates. Using this scheme, I find that high-speed two-qubit gates can be optimised for two-dimensional architectures, with fidelities well above thresholds required for fault tolerant error correction, around 99.99%. Furthermore, I find that fast gates in these architectures are robust to the presence of large numbers of surrounding ions. Following previous studies [1, 2] which have identified pulse imperfections as a dominant source of error in fast gates, I perform a worst-case error analysis. I find the fast gates presented in this thesis to require very small errors in single-qubit rotations, and I present recommendations for achieving those requirements. I also investigate other experimental considerations, and make recommendations for overcoming other technical challenges in realising fast gates.
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.
We theoretically investigate the use of fast pulsed two-qubit gates for trapped ion quantum computing in a two-dimensional microtrap architecture. In one dimension, such fast gates are optimal when employed between nearest neighbors, and we examine the generalization to a two-dimensional geometry. We demonstrate that fast pulsed gates are capable of implementing high-fidelity entangling operations between ions in neighboring traps faster than the trapping period, with experimentally demonstrated laser repetition rates. Notably, we find that without increasing the gate duration high-fidelity gates are achievable even in large arrays with hundreds of ions. To demonstrate the usefulness of this proposal, we investigate the application of these gates to the digital simulation of a 40-mode Fermi-Hubbard model. This also demonstrates why shorter chains of gates required to connect arbitrary pairs of ions make this geometry well suited for large-scale computation.
This thesis describes schemes for both a fast two-qubit gate operation and the steady-state preparation of a Bell state with trapped ions. A critical figure of merit for quantum computing with trapped ions is the gate duration relative to the decoherence timescale. We propose a fast gate scheme that off ers improvements in time, fidelity and simplicity of implementation over existing fast gate proposals. Our scheme can operate on both neighbouring and non-neighbouring ions in a long ion crystal. This provides a simpler and faster mechanism than traditional gates for complex quantum computing operations on large numbers of ions. The scheme achieves fidelities well above quantum error correction thresholds around 0.0001, and operates arbitrarily fast given arbitrary laser repetition rates. The production of these ultra-fast pulses is an experimental challenge, and fast gates have not yet been implemented; we present an implementation scheme using pulse splitting to provide a higher repetition rate and the pulse timing freedoms required for the gate scheme. We also analyse the effects of errors in the pulses on the gate operation. We analyse another strategy to generate entanglement using a driven dissipative process. Typically, environmental couplings cause decoherence. However, by combining dissipative dynamics with suitably chosen Hamiltonian evolution, the system can be steered to the desired steady states. Our steady-state scheme prepares a maximally-entangled Bell state with fidelity above 0.99, much higher than for schemes implemented with trapped ions. The driven dissipation continuously pumps the system towards the antisymmetric Bell steady-state, which is dark to the system dynamics and robust to parameter variations. The dominant loss mechanism is anomalous heating of the motional modes, reducing our fidelity by less than 0.01 for current experimental rates. Our scheme jointly addresses the ions and does not use sympathetic cooling. We enhance our scheme by combining the dissipative state preparation with the detection of photons, and obtain a significant fidelity enhancement.
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.