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:quant-ph/0401185 · Physical Review Letters

Scaling Ion Trap Quantum Computation through Fast Quantum Gates

L-M Duan

Published Sep 3, 2004• 110 citations
arXivHTMLPDF

Abstract

We propose a method to achieve scalable quantum computation based on fast quantum gates on an array of trapped ions, without the requirement of ion shuttling. Conditional quantum gates are obtained for any neighboring ions through spin-dependent acceleration of the ions from periodic photon kicks. The gates are shown to be robust to influence all the other ions in the array and insensitive to the ions' temperature.

DOI
10.1103/physrevlett.93.100502

Related papers

Scaling Trapped Ion Quantum Computers Using Fast Gates and Microtraps

Alexander K. Ratcliffe, Richard L. Taylor, J. J. Hope +1 more

Most attempts to produce a scalable quantum information processing platform based on ion traps have focused on the shuttling of ions in segmented traps. We show that an architecture based on an array of microtraps with fast gates will outperform architectures based on ion shuttling. This system requires higher power lasers but does not require the manipulation of potentials or shuttling of ions. This improves optical access, reduces the complexity of the trap, and reduces the number of conductive surfaces close to the ions. The use of fast gates also removes limitations on the gate time. Error rates of 10^{-5} are shown to be possible with 250 mW laser power and a trap separation of 100 μm. The performance of the gates is shown to be robust to the limitations in the laser repetition rate and the presence of many ions in the trap array.

arXiv:1711.05875•Physical Review Letters•May 29, 2018•32 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

A Two-Dimensional Architecture for Fast Large-Scale Trapped-Ion Quantum Computing

Y.-K. Wu, L.-M. Duan

Building blocks of quantum computers have been demonstrated in small to intermediate-scale systems. As one of the leading platforms, the trapped ion system has attracted wide attention. A significant challenge in this system is to combine fast high-fidelity gates with scalability and convenience in ion trap fabrication. Here we propose an architecture for large-scale quantum computing with a two-dimensional array of atomic ions trapped at such large distance which is convenient for ion-trap fabrication but usually believed to be unsuitable for quantum computing as the conventional gates would be too slow. Using gate operations far outside of the Lamb–Dicke region, we show that fast and robust entangling gates can be realized in any large ion arrays. The gate operations are intrinsically parallel and robust to thermal noise, which, together with their high speed and scalability of the proposed architecture, makes this approach an attractive one for large-scale quantum computing.

arXiv:2004.11608•Chinese Physics Letters•Jun 1, 2020•10 citations

Scalable trapped ion quantum computation with a probabilistic ion-photon mapping

Luming Duan, B. B. Blinov, David L. Moehring +1 more

We propose a method for scaling trapped ions for large-scale quantum computation and communication based on a probabilistic ion-photon mapping. Deterministic quantum gates between remotely located trapped ions can be achieved through detection of spontaneously-emitted photons, accompanied by the local Coulomb interaction between neighboring ions. We discuss gate speeds and tolerance to experimental noise for different probabilistic entanglement schemes.

Quantum Information and Computation•May 1, 2004•63 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

Scalable trapped ion quantum computation with a probabilistic ion-photon mapping

Luming Duan, B. B. Blinov, David L. Moehring +1 more

We propose a method for scaling trapped ions for large-scale quantum computation and communication based on a probabilistic ion-photon mapping. Deterministic quantum gates between remotely located trapped ions can be achieved through detection of spontaneously-emitted photons, accompanied by the local Coulomb interaction between neighboring ions. We discuss gate speeds and tolerance to experimental noise for different probabilistic entanglement schemes.

Quantum Information and Computation•May 1, 2004•85 citations
We propose a method to achieve scalable quantum computation based on fast quantum gates on an array of trapped ions, without the requirement of ion shuttling. Conditional quantum gates are obtained for any neighboring ions through spin-dependent acceleration of the ions from periodic photon kicks. The gates are shown to be robust to influence all the other ions in the array and insensitive to the ions' temperature.
Most attempts to produce a scalable quantum information processing platform based on ion traps have focused on the shuttling of ions in segmented traps. We show that an architecture based on an array of microtraps with fast gates will outperform architectures based on ion shuttling. This system requires higher power lasers but does not require the manipulation of potentials or shuttling of ions. This improves optical access, reduces the complexity of the trap, and reduces the number of conductive surfaces close to the ions. The use of fast gates also removes limitations on the gate time. Error rates of 10^{-5} are shown to be possible with 250 mW laser power and a trap separation of 100 μm. The performance of the gates is shown to be robust to the limitations in the laser repetition rate and the presence of many ions in the trap array.
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.
Building blocks of quantum computers have been demonstrated in small to intermediate-scale systems. As one of the leading platforms, the trapped ion system has attracted wide attention. A significant challenge in this system is to combine fast high-fidelity gates with scalability and convenience in ion trap fabrication. Here we propose an architecture for large-scale quantum computing with a two-dimensional array of atomic ions trapped at such large distance which is convenient for ion-trap fabrication but usually believed to be unsuitable for quantum computing as the conventional gates would be too slow. Using gate operations far outside of the Lamb–Dicke region, we show that fast and robust entangling gates can be realized in any large ion arrays. The gate operations are intrinsically parallel and robust to thermal noise, which, together with their high speed and scalability of the proposed architecture, makes this approach an attractive one for large-scale quantum computing.
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.