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:1810.11948 · Nature

Parallel entangling operations on a universal ion-trap quantum computer

C. Figgatt, A. Ostrander, N. M. Linke, K. A. Landsman, D. Zhu, D. Maslov, C. Monroe

Published Jul 24, 2019• 182 citations
arXivHTMLPDF
DOI
10.1038/s41586-019-1427-5

Related papers

Parallel 2-Qubit Operations on a Programmable Ion Trap Quantum Computer

Caroline Figgatt, Aaron Ostrander, Norbert M. Linke +4 more

Bulletin of the American Physical Society•May 30, 2018•0 citations

Parallel entangling operations on a universal ion-trap quantum computer

Caroline Figgatt, Aaron Ostrander, Norbert M. Linke +4 more

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.

•Jan 1, 2019•53 citations

Progress towards quantum computation with an ion trap

Mark S. Gulley, Richard Hughes, J.J. Gómez +11 more

APS•Apr 1, 1998•0 citations

Scalable and Parallel Tweezer Gates for Quantum Computing with Long Ion Strings

Tobias Olsacher, Lukas Postler, Philipp Schindler +3 more

Trapped-ion quantum computers have demonstrated high-performance gate operations in registers of about ten qubits.However, scaling up and parallelizing quantum computations with long one-dimensional (1D) ion strings is an outstanding challenge due to the global nature of the motional modes of the ions, which mediate qubit-qubit couplings.Here, we devise methods to implement scalable and parallel entangling gates by using engineered localized phonon modes.We propose to tailor such localized modes by tuning the local potential of individual ions with programmable optical tweezers.Localized modes of small subsets of qubits form the basis to perform entangling gates on these subsets in parallel.We demonstrate the inherent scalability of this approach by presenting analytical and numerical results for long 1D ion chains and even for infinite chains of uniformly spaced ions.Furthermore, we show that combining our methods with optimal coherent control techniques allows realization of maximally dense universal parallelized quantum circuits.

arXiv:2008.11389•PRX Quantum•Dec 2, 2020•57 citations

Efficient quantum programming using EASE gates on a trapped-ion quantum computer

Nikodem Grzesiak, Andrii Maksymov, Pradeep Niroula +1 more

Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show an n -qubit Clifford circuit can be implemented using 6log( n ) EASE gates, an n -qubit multiply-controlled NOT gate can be implemented using 3 n /2 EASE gates, and an n -qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general.

arXiv:2107.07591•Quantum•Jan 27, 2022•13 citations

Quantum Computation with Ion Traps

R. Blatt, Wolfgang Lange

WORLD SCIENTIFIC eBooks•Jan 1, 2001•0 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.
Trapped-ion quantum computers have demonstrated high-performance gate operations in registers of about ten qubits.However, scaling up and parallelizing quantum computations with long one-dimensional (1D) ion strings is an outstanding challenge due to the global nature of the motional modes of the ions, which mediate qubit-qubit couplings.Here, we devise methods to implement scalable and parallel entangling gates by using engineered localized phonon modes.We propose to tailor such localized modes by tuning the local potential of individual ions with programmable optical tweezers.Localized modes of small subsets of qubits form the basis to perform entangling gates on these subsets in parallel.We demonstrate the inherent scalability of this approach by presenting analytical and numerical results for long 1D ion chains and even for infinite chains of uniformly spaced ions.Furthermore, we show that combining our methods with optimal coherent control techniques allows realization of maximally dense universal parallelized quantum circuits.
Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show an n -qubit Clifford circuit can be implemented using 6log( n ) EASE gates, an n -qubit multiply-controlled NOT gate can be implemented using 3 n /2 EASE gates, and an n -qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general.