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:1511.08797

Full quantum theory of control-not gate in ion-trap quantum computation

Biyao Yang, Yang Li

Published Nov 26, 2015• 0 citations
arXivHTMLPDF

Abstract

We investigate the exact effect on ion trap quantum computation after field quantization. First an exact expression of failure probability from field quantization after many CNOT operations in Cirac-Zoller scheme is given. It is proportional to operation number and the amplitude of $|1\rangle_x |0\rangle_y$ or $|1\rangle_x |1\rangle_y$ in initial state, and inverse proportional to mean number of photons and amplitude of $|0\rangle_x |0\rangle_y$ or $|0\rangle_x |1\rangle_y$ in initial state. Then we calculate the failure probability when the limitation to mean number of photons in sideband transition is considered. When the initial state is $|1\rangle_x |0\rangle_y$ or $|1\rangle_x |1\rangle_y$, after about $10^2$ times of CNOT operations, failure probability is no less than $10^{-2}$, while $10^{-2}$ is the known maximum threshold in fault-tolerant quantum computation. Then when the initial state is $|1\rangle_x |0\rangle_y$ or $|1\rangle_x |1\rangle_y$, the number of CNOT gates on the same pair of physical qubits should be no more than $10^2$ in one error-correction period, or else the computation cannot be implemented reliably. This conclusion can help to determine the number of CNOT operations between coding and decoding in one error-correction period in fault-tolerant quantum computation.

DOI
10.48550/arxiv.1511.08797

Related papers

Resource Optimal Realization of Fault-Tolerant Quantum Circuit

Abhoy Kole, Indranil Sengupta

Encoding of quantum information and carrying out computation on encoded state is an essential requirement for improving the reliability of a quantum computer. Resource limitation in today's noisy intermediate scale quantum (NISQ) processors further restricts carrying out fault-tolerant quantum gate operations on such systems. Recent experiments conducted on physical qubits of superconducting transmon type and trapped atomic ions using the fault-tolerant scheme based on [[4, 2, 2]] code have shown a systematic improvement in the fidelity of all logical quantum gate operations except the logical controlled-NOT (CNOT) operation that requires 3 physical SWAP operations for fault-tolerant realization. In this present work we propose an optimal realization of logical CNOT operations on a single or two separate [[4, 2, 2]] code-words using 4 physical CNOT operations and an additional qubit. We further introduce logical two-qubit positive and negative controlled-phase operations with varying rotation angle, and also propose the fault-tolerant realization of logical 2-controlled-phase (C2Z) and 2-controlled-NOT (C2NOT) operations that are required for universal computation using [[4, 2, 2]] encoding. The implementation requires less number of encoded operations and one additional qubit. Through experiments conducted on the 15-qubit IBM Quantum Experience processor and QASM simulator the fidelity and validity of all these proposed gate operations have been verified.

IEEE International Test Conference India (ITC India)•Jul 1, 2020•2 citations

Full Quantum Treatment of Rabi Oscillation Driven by a Pulse Train and Its Application in Ion-Trap Quantum Computation

Li Yang, Biyao Yang, Yufu Chen

Rabi oscillation of a two-level system driven by a pulse train is a basic process involved in quantum computation. We present a full quantum treatment of this process and show that the population inversion of this process collapses exponentially, has no revival phenomenon, and has a dual-pulse structure in every period. As an application, we investigate the properties of this process in ion-trap quantum computation. We find that in the Cirac-Zoller computation scheme, when the wavelength of the driving field is of the order 10-6m , the lower bound of failure probability is of the order 10-2after about 102controlled-NOT gates. This value is approximately equal to the generally-accepted threshold in fault-tolerant quantum computation.

arXiv:1010.5986•IEEE Journal of Quantum Electronics•Apr 12, 2013•6 citations

An Upper Bound to the Number of Gates on Single Qubit within One Error-Correction Period of Quantum Computation

Li Yang, Yufu Chen

Based on the amplitude behavior of quantum Rabi oscillation driven by a coherent field we show that there exists an upper bound to the number of logical operation performed on any single qubit within one error-correction period of a quantum computation. We introduce a parameter to depict the maximum of this number and estimate its decoherence limit. The analysis shows that a generally accepted error-rate threshold of quantum logic gates limits the parameter to so small a number that even a double of fault-tolerant Toffoli gates can hardly be implemented reliably within one error-correction period. This result suggests that the design of feasible fault-tolerant quantum circuits is still an arduous task.

arXiv:0712.3197•Dec 19, 2007•1 citation

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

Ion Trap Quantum Computers Part 2: The Universal 2-Qubit-CNOT Gate

Bernd Baumann

The Cirac-Zoller mechanism is generally used for the implementation of CNOT gates in ion trap quantum computers. We present here a highly detailed quantum physical description of this approach. To keep the presentation simple, the qubits are modeled as rigid rotors and the radiation field of each of the lasers is treated as a classical field. In combination with the corresponding first part (Ion Trap Quantum Computer Part 1: 1-Qubit Gates), this results in the complete quantum theory of a universal set of quantum gates. This presentation is intended for readers with basic knowledge of quantum physics and assumes familiarity with Part 1.

Scientific Insights•Dec 26, 2025•0 citations

Models of fault-tolerant quantum computation

Christopher M. Dawson

This thesis is concerned with certain theoretical problems that arise naturally in the context of fault-tolerant quantum computation. Fault-tolerance can be defined as the art of building reliable devices from unreliable components, and is of particular importance for quantum computers that aim to precisely control the dynamics of extremely sensitive quantum systems. A model of quantum computation is a specification of the basic building blocks by which a quantum computation is implemented. The best known model is the quantum circuit model, where computations are implemented by means of unitary quantum gates that are applied to two-level quantum systems known as qubits. In a physical implementation of a quantum circuit, the gates and qubits will inevitably be affected by noise. Fault-tolerant quantum circuits are designed to be resilient against the effects of this noise, provided that it is not too strong. Fault-tolerance in the quantum circuit model is well developed thanks to the theory of quantum error-correcting codes. These codes allow for the correction of small numbers of errors introduced by a variety of noise processes. In a fault-tolerant quantum circuit, qubits are replaced with encoded qubits, and quantum gates with encoded gates that are immediately followed by special quantum circuits for error correction. Provided the rate at which errors occur is below a constant threshold value, the accumulation of errors can be checked so that the correct output of the computation correctly determined. The threshold acts as both a measure of how good the design of a quantum circuit is, and also as a target for experimenters aiming to implement quantum circuits. Much current research in quantum computation is aimed at designing quantum circuits that increase the noise threshold, hopefully to the point where it becomes within the reach of experimenters. A fault-tolerant encoded quantum gate must limit the propagation of errors so that the code’s corrective capabilities are not overwhelmed. It is not so easy to design encoded gates that satisfy this property, and to date only a finite handful of such gates are known. In a faulttolerant quantum circuit, all quantum gates must be decomposed or compiled in terms of those that may be implemented fault-tolerantly. In the first part of this thesis, we present two results that may be applied to this problem of gate compilation. The first is a generic method based on the Solovay-Kitaev theorem that may be applied to all quantum gates, but is most effective for those that act on single qubits. We present the Solovay-Kitaev theorem in its simples known form as an algorithm, together with novel constructions that can be used to implement it. Following this we give a two specialized methods for two-qubit gate decomposition, based on the Cartan decomposition of the Lie group SU(4). The cluster-state model of computation is an alternative to the quantum circuit model, and makes use of quantum measurements and highly entangled cluster-states to implement a quantum computation. The fault-tolerant techniques developed for quantum circuits are not immediately applicable in this model, so in order for it to be a realistic candidate for performing computations we prove that such techniques are possible. In the second part of the thesis we prove that constant fault-tolerance thresholds may be achieved in the cluster-state model, and in particular in an adaption to an optical implementation. Following this we design a complete error correction scheme for optical cluster-state computation, and numerically determine the threshold of this model in the face of the dominant noise models likely to affect such an implementation.

•Jan 1, 2006•0 citations
We investigate the exact effect on ion trap quantum computation after field quantization. First an exact expression of failure probability from field quantization after many CNOT operations in Cirac-Zoller scheme is given. It is proportional to operation number and the amplitude of ∣1⟩x∣0⟩y|1\rangle_x |0\rangle_y∣1⟩x​∣0⟩y​ or ∣1⟩x∣1⟩y|1\rangle_x |1\rangle_y∣1⟩x​∣1⟩y​ in initial state, and inverse proportional to mean number of photons and amplitude of ∣0⟩x∣0⟩y|0\rangle_x |0\rangle_y∣0⟩x​∣0⟩y​ or ∣0⟩x∣1⟩y|0\rangle_x |1\rangle_y∣0⟩x​∣1⟩y​ in initial state. Then we calculate the failure probability when the limitation to mean number of photons in sideband transition is considered. When the initial state is ∣1⟩x∣0⟩y|1\rangle_x |0\rangle_y∣1⟩x​∣0⟩y​ or ∣1⟩x∣1⟩y|1\rangle_x |1\rangle_y∣1⟩x​∣1⟩y​, after about 10210^2102 times of CNOT operations, failure probability is no less than 10−210^{-2}10−2, while 10−210^{-2}10−2 is the known maximum threshold in fault-tolerant quantum computation. Then when the initial state is ∣1⟩x∣0⟩y|1\rangle_x |0\rangle_y∣1⟩x​∣0⟩y​ or ∣1⟩x∣1⟩y|1\rangle_x |1\rangle_y∣1⟩x​∣1⟩y​, the number of CNOT gates on the same pair of physical qubits should be no more than 10210^2102 in one error-correction period, or else the computation cannot be implemented reliably. This conclusion can help to determine the number of CNOT operations between coding and decoding in one error-correction period in fault-tolerant quantum computation.
Encoding of quantum information and carrying out computation on encoded state is an essential requirement for improving the reliability of a quantum computer. Resource limitation in today's noisy intermediate scale quantum (NISQ) processors further restricts carrying out fault-tolerant quantum gate operations on such systems. Recent experiments conducted on physical qubits of superconducting transmon type and trapped atomic ions using the fault-tolerant scheme based on [[4, 2, 2]] code have shown a systematic improvement in the fidelity of all logical quantum gate operations except the logical controlled-NOT (CNOT) operation that requires 3 physical SWAP operations for fault-tolerant realization. In this present work we propose an optimal realization of logical CNOT operations on a single or two separate [[4, 2, 2]] code-words using 4 physical CNOT operations and an additional qubit. We further introduce logical two-qubit positive and negative controlled-phase operations with varying rotation angle, and also propose the fault-tolerant realization of logical 2-controlled-phase (C2Z) and 2-controlled-NOT (C2NOT) operations that are required for universal computation using [[4, 2, 2]] encoding. The implementation requires less number of encoded operations and one additional qubit. Through experiments conducted on the 15-qubit IBM Quantum Experience processor and QASM simulator the fidelity and validity of all these proposed gate operations have been verified.
Rabi oscillation of a two-level system driven by a pulse train is a basic process involved in quantum computation. We present a full quantum treatment of this process and show that the population inversion of this process collapses exponentially, has no revival phenomenon, and has a dual-pulse structure in every period. As an application, we investigate the properties of this process in ion-trap quantum computation. We find that in the Cirac-Zoller computation scheme, when the wavelength of the driving field is of the order 10-6m , the lower bound of failure probability is of the order 10-2after about 102controlled-NOT gates. This value is approximately equal to the generally-accepted threshold in fault-tolerant quantum computation.
Based on the amplitude behavior of quantum Rabi oscillation driven by a coherent field we show that there exists an upper bound to the number of logical operation performed on any single qubit within one error-correction period of a quantum computation. We introduce a parameter to depict the maximum of this number and estimate its decoherence limit. The analysis shows that a generally accepted error-rate threshold of quantum logic gates limits the parameter to so small a number that even a double of fault-tolerant Toffoli gates can hardly be implemented reliably within one error-correction period. This result suggests that the design of feasible fault-tolerant quantum circuits is still an arduous task.
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 Cirac-Zoller mechanism is generally used for the implementation of CNOT gates in ion trap quantum computers. We present here a highly detailed quantum physical description of this approach. To keep the presentation simple, the qubits are modeled as rigid rotors and the radiation field of each of the lasers is treated as a classical field. In combination with the corresponding first part (Ion Trap Quantum Computer Part 1: 1-Qubit Gates), this results in the complete quantum theory of a universal set of quantum gates. This presentation is intended for readers with basic knowledge of quantum physics and assumes familiarity with Part 1.
This thesis is concerned with certain theoretical problems that arise naturally in the context of fault-tolerant quantum computation. Fault-tolerance can be defined as the art of building reliable devices from unreliable components, and is of particular importance for quantum computers that aim to precisely control the dynamics of extremely sensitive quantum systems. A model of quantum computation is a specification of the basic building blocks by which a quantum computation is implemented. The best known model is the quantum circuit model, where computations are implemented by means of unitary quantum gates that are applied to two-level quantum systems known as qubits. In a physical implementation of a quantum circuit, the gates and qubits will inevitably be affected by noise. Fault-tolerant quantum circuits are designed to be resilient against the effects of this noise, provided that it is not too strong. Fault-tolerance in the quantum circuit model is well developed thanks to the theory of quantum error-correcting codes. These codes allow for the correction of small numbers of errors introduced by a variety of noise processes. In a fault-tolerant quantum circuit, qubits are replaced with encoded qubits, and quantum gates with encoded gates that are immediately followed by special quantum circuits for error correction. Provided the rate at which errors occur is below a constant threshold value, the accumulation of errors can be checked so that the correct output of the computation correctly determined. The threshold acts as both a measure of how good the design of a quantum circuit is, and also as a target for experimenters aiming to implement quantum circuits. Much current research in quantum computation is aimed at designing quantum circuits that increase the noise threshold, hopefully to the point where it becomes within the reach of experimenters. A fault-tolerant encoded quantum gate must limit the propagation of errors so that the code’s corrective capabilities are not overwhelmed. It is not so easy to design encoded gates that satisfy this property, and to date only a finite handful of such gates are known. In a faulttolerant quantum circuit, all quantum gates must be decomposed or compiled in terms of those that may be implemented fault-tolerantly. In the first part of this thesis, we present two results that may be applied to this problem of gate compilation. The first is a generic method based on the Solovay-Kitaev theorem that may be applied to all quantum gates, but is most effective for those that act on single qubits. We present the Solovay-Kitaev theorem in its simples known form as an algorithm, together with novel constructions that can be used to implement it. Following this we give a two specialized methods for two-qubit gate decomposition, based on the Cartan decomposition of the Lie group SU(4). The cluster-state model of computation is an alternative to the quantum circuit model, and makes use of quantum measurements and highly entangled cluster-states to implement a quantum computation. The fault-tolerant techniques developed for quantum circuits are not immediately applicable in this model, so in order for it to be a realistic candidate for performing computations we prove that such techniques are possible. In the second part of the thesis we prove that constant fault-tolerance thresholds may be achieved in the cluster-state model, and in particular in an adaption to an optical implementation. Following this we design a complete error correction scheme for optical cluster-state computation, and numerically determine the threshold of this model in the face of the dominant noise models likely to affect such an implementation.