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

Quantum 2.0 Conference and Exhibition

3-Qubit Gates in a Microwave-controlled Trapped Ion Quantum Computer Using an Always-On Interaction

Patrick Huber, Patrick Barthel, Sougato Bose, Juan José García‐Ripoll, Johann Haber, Yasser Omar, Sagar Silva Pratapsi, E. Torrontegui, Christof Wunderlich

Published Jan 1, 2023• 0 citations
Publisher

Abstract

Direct implementation of N-qubit gates (N ≥ 3) circumvents decomposition of a quantum algorithm into 2-qubit operations, effectively reducing the required depth of quantum circuits. Using all-to-all coupling in a trapped ion quantum computer, we experimentally realize classical Toffoli and quantum perceptron gates.
DOI
10.1364/quantum.2023.qm3a.6

Related papers

Realization of the Quantum Toffoli Gate with Trapped Ions

Thomas Monz, Kihwan Kim, W. Hänsel +6 more

Gates acting on more than two qubits are appealing as they can substitute complex sequences of two-qubit gates, thus promising faster execution and higher fidelity. One important multiqubit operation is the quantum Toffoli gate that performs a controlled NOT operation on a target qubit depending on the state of two control qubits. Here we present the first experimental realization of the quantum Toffoli gate in an ion trap quantum computer, achieving a mean gate fidelity of 71(3)%. Our implementation is particularly efficient as the relevant logic information is directly encoded in the motion of the ion string.

arXiv:0804.0082•Physical Review Letters•Jan 28, 2009•345 citations

Generalized Toffoli Gate Decomposition Using Ququints: Towards Realizing Grover’s Algorithm with Qudits

Anastasiia S. Nikolaeva, Evgeniy O. Kiktenko, Aleksey K. Fedorov

Qubits, which are the quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g., (artificial) atoms or ions, admit encoding of more complex multilevel states—qudits. Recently, significant attention has been paid to the idea of using qudit encoding as a way for further scaling quantum processors. In this work, we present an efficient decomposition of the generalized Toffoli gate on five-level quantum systems—so-called ququints—that use ququints’ space as the space of two qubits with a joint ancillary state. The basic two-qubit operation we use is a version of the controlled-phase gate. The proposed N-qubit Toffoli gate decomposition has O(N) asymptotic depth and does not use ancillary qubits. We then apply our results for Grover’s algorithm, where we indicate on the sizable advantage of using the qudit-based approach with the proposed decomposition in comparison to the standard qubit case. We expect that our results are applicable for quantum processors based on various physical platforms, such as trapped ions, neutral atoms, protonic systems, superconducting circuits, and others.

arXiv:2212.12505•Entropy•Feb 20, 2023•16 citations

Realization of a quantum perceptron gate with trapped ions

Patrick H. Huber, Johann Haber, Barthel, P. +3 more

We report the implementation of a perceptron quantum gate in an ion-trap quantum computer. In this scheme, a perceptron's target qubit changes its state depending on the interactions with several qubits. The target qubit displays a tunable sigmoid switching behaviour becoming a universal approximator when nested with other percetrons. The procedure consists on the adiabatic ramp-down of a dressing-field applied to the target qubit. We also use two successive perceptron quantum gates to implement a XNOR-gate, where the perceptron qubit changes its state only when the parity of two input qubits is even. The applicability can be generalized to higher-dimensional gates as well as the reconstruction of arbitrary bounded continuous functions of the perceptron observables.

arXiv:2111.08977•Nov 17, 2021•5 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

Efficient Toffoli gates using qudits

Timothy C. Ralph, Kevin J. Resch, Alexei Gilchrist

The simplest decomposition of a Toffoli gate acting on 3 qubits requires five 2-qubit gates. If we restrict ourselves to controlled-sign (or controlled-NOT) gates this number climbs to 6. We show that the number of controlled-sign gates required to implement a Toffoli gate can be reduced to just 3 if one of the three quantum systems has a third state that is accessible during the computation---i.e., is actually a qutrit. Such a requirement is not unreasonable or even atypical since we often artificially enforce a qubit structure on multilevel quantums systems (e.g., atoms, photonic polarization plus spatial modes). We explore the implementation of these techniques in optical quantum processing and show that linear optical circuits could operate with much higher probabilities of success.

arXiv:0806.0654•Physical Review A•Feb 16, 2007•293 citations

Realizing two-qubit gates through mode engineering on a trapped-ion quantum computer

Ming Li, Nhung H. Nguyen, Alaina Green +3 more

Two-qubit gates are a fundamental constituent of a quantum computer and typically its most challenging operation. In a trapped-ion quantum computer, this is typically implemented with laser beams which are modulated in amplitude, frequency, phase, or a combination of these. The required modulation becomes increasingly more complex as the quantum computer becomes larger, complicating the control hardware design. Here we develop a simple method to essentially remove the pulse-modulation complexity by engineering the normal modes of the ion chain. We experimentally test the feasibility of the method in a three-ion chain. This opens up the possibility to trade off complexity between the design of the trapping fields and the optical control system, which will help scale the ion-trap quantum computing platform.

arXiv:2208.01584•Physical Review A•Feb 20, 2025•3 citations
Gates acting on more than two qubits are appealing as they can substitute complex sequences of two-qubit gates, thus promising faster execution and higher fidelity. One important multiqubit operation is the quantum Toffoli gate that performs a controlled NOT operation on a target qubit depending on the state of two control qubits. Here we present the first experimental realization of the quantum Toffoli gate in an ion trap quantum computer, achieving a mean gate fidelity of 71(3)%. Our implementation is particularly efficient as the relevant logic information is directly encoded in the motion of the ion string.
Qubits, which are the quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g., (artificial) atoms or ions, admit encoding of more complex multilevel states—qudits. Recently, significant attention has been paid to the idea of using qudit encoding as a way for further scaling quantum processors. In this work, we present an efficient decomposition of the generalized Toffoli gate on five-level quantum systems—so-called ququints—that use ququints’ space as the space of two qubits with a joint ancillary state. The basic two-qubit operation we use is a version of the controlled-phase gate. The proposed N-qubit Toffoli gate decomposition has O(N) asymptotic depth and does not use ancillary qubits. We then apply our results for Grover’s algorithm, where we indicate on the sizable advantage of using the qudit-based approach with the proposed decomposition in comparison to the standard qubit case. We expect that our results are applicable for quantum processors based on various physical platforms, such as trapped ions, neutral atoms, protonic systems, superconducting circuits, and others.
We report the implementation of a perceptron quantum gate in an ion-trap quantum computer. In this scheme, a perceptron's target qubit changes its state depending on the interactions with several qubits. The target qubit displays a tunable sigmoid switching behaviour becoming a universal approximator when nested with other percetrons. The procedure consists on the adiabatic ramp-down of a dressing-field applied to the target qubit. We also use two successive perceptron quantum gates to implement a XNOR-gate, where the perceptron qubit changes its state only when the parity of two input qubits is even. The applicability can be generalized to higher-dimensional gates as well as the reconstruction of arbitrary bounded continuous functions of the perceptron observables.
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.
The simplest decomposition of a Toffoli gate acting on 3 qubits requires five 2-qubit gates. If we restrict ourselves to controlled-sign (or controlled-NOT) gates this number climbs to 6. We show that the number of controlled-sign gates required to implement a Toffoli gate can be reduced to just 3 if one of the three quantum systems has a third state that is accessible during the computation---i.e., is actually a qutrit. Such a requirement is not unreasonable or even atypical since we often artificially enforce a qubit structure on multilevel quantums systems (e.g., atoms, photonic polarization plus spatial modes). We explore the implementation of these techniques in optical quantum processing and show that linear optical circuits could operate with much higher probabilities of success.
Two-qubit gates are a fundamental constituent of a quantum computer and typically its most challenging operation. In a trapped-ion quantum computer, this is typically implemented with laser beams which are modulated in amplitude, frequency, phase, or a combination of these. The required modulation becomes increasingly more complex as the quantum computer becomes larger, complicating the control hardware design. Here we develop a simple method to essentially remove the pulse-modulation complexity by engineering the normal modes of the ion chain. We experimentally test the feasibility of the method in a three-ion chain. This opens up the possibility to trade off complexity between the design of the trapping fields and the optical control system, which will help scale the ion-trap quantum computing platform.