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

Journal of Modern Optics

Steane code single qubit Clifford gates

Yaakov S. Weinstein, Sidney Buchbinder

Published Oct 25, 2013• 1 citation
Publisher

Abstract

We apply single ‘logical’ qubit Clifford gates to states encoded in the [7,1,3] quantum error correction code in a nonequiprobable Pauli matrix error environment. The gates we analyze are the NOT, Phase, and Hadamard gates. We calculate accuracy measures of the applied gates by determining output state and logical gate fidelities. The latter is determined from the logical gate -matrix. In addition, we apply perfect and noisy quantum error correction to the output state of the Clifford gate. Perfect error correction allows the determination of whether errors that occurred during the gate are ‘correctable’. Noisy error correction gives an idea of what can be expected in a realistic quantum computation.

DOI
10.1080/09500340.2013.837203

Related papers

Fidelity of an encoded [7,1,3] logical zero

Yaakov S. Weinstein

I calculate the fidelity of a $[7,1,3]$ Calderbank-Shor-Steane quantum error correction code logical zero state constructed in a nonequiprobable Pauli operator error environment for two methods of encoding. The first method is to apply fault-tolerant error correction to an arbitrary state of seven qubits utilizing Shor states for syndrome measurement. The Shor states are themselves constructed in the nonequiprobable Pauli operator error environment, and their fidelity depends on the number of verifications done to ensure multiple errors will not propagate into the encoded quantum information. Surprisingly, performing these verifications may lower the fidelity of the constructed Shor states. The second encoding method is to simply implement the $[7,1,3]$ encoding gate sequence also in the nonequiprobable Pauli operator error environment. Perfect error correction is applied after both methods to determine the correctability of the implemented errors. I find that which method attains higher fidelity depends on which of the Pauli operators errors is dominant. Nevertheless, perfect error correction applied after the encoding suppresses errors to at least first order for both methods.

arXiv:1101.1950•Physical Review A•Jul 19, 2011•13 citations

Realization of Real-Time Fault-Tolerant Quantum Error Correction

Ciarán Ryan-Anderson, Justin Bohnet, K. Lee +14 more

Correcting errors in real time is essential for reliable large-scale quantum computations. Realizing this high-level function requires a system capable of several low-level primitives, including single-qubit and two-qubit operations, mid-circuit measurements of subsets of qubits, real-time processing of measurement outcomes, and the ability to condition subsequent gate operations on those measurements. In this work, we use a ten qubit QCCD trapped-ion quantum computer to encode a single logical qubit using the $[[7,1,3]]$ color code, first proposed by Steane~\cite{steane1996error}. The logical qubit is initialized into the eigenstates of three mutually unbiased bases using an encoding circuit, and we measure an average logical SPAM error of $1.7(6) \times 10^{-3}$, compared to the average physical SPAM error $2.4(8) \times 10^{-3}$ of our qubits. We then perform multiple syndrome measurements on the encoded qubit, using a real-time decoder to determine any necessary corrections that are done either as software updates to the Pauli frame or as physically applied gates. Moreover, these procedures are done repeatedly while maintaining coherence, demonstrating a dynamically protected logical qubit memory. Additionally, we demonstrate non-Clifford qubit operations by encoding a logical magic state with an error rate below the threshold required for magic state distillation. Finally, we present system-level simulations that allow us to identify key hardware upgrades that may enable the system to reach the pseudo-threshold.

arXiv:2107.07505•Physical Review X•Dec 23, 2021•375 citations

Error Aware Clifford Circuit Compilation

Alan Martin Robertson

We demonstrate that small quantum memories, realised via quantum error correction in multi-qubit devices and implemented using noisy Clifford circuits, can benefit significantly from tailoring the choice of code to the error model of the Cliffords gates and environment. We present a simulation of these errors and the results of searching across random quantum error correcting codes and implementing the associated Clifford encoding circuits. This modeling incorporates a better representation of the experimental complexity involved in implementing these codes and demonstrates that tailored codes can outperform the Steane code with more realistic experimental noise. Depending on the error model, they are required to surpass the fault tolerant threshold. These Pauli error models correspond to individual Clifford generators and environmental noise on the wires. We present error models which incorporate independent identically distributed (IID) errors and biased Pauli errors in the construction and optimisation of Clifford circuits associated with maintaining a quantum memory.

•Jan 1, 2019•0 citations

A Comprehensive Overview of the Steane Code [[7,1,3]] CSS Quantum Error Correction Scheme

Neeraj Kumar, Arpit Anand, Aijaz Mehdi Zaidi +2 more

Since quantum states are limited in their ease of manipulation, quantum computing has great advantages when used for computation. These interactions, even if infinitesimal, are the very reason why errors arise, be it bit-flip, phase-flip, or composite, thus diminishing the accuracy in computation. Quantum error correction (QEC) intervenes systematically to guard against the loss of coherence from quantum information. Amongst the various QEC protocols developed so far, Steane code [ [7], [1], [3]] is a very famous CSS stabilizer code that was derived from a classical Hamming code. It will encode a single logical qubit into seven physical qubits, which corrects all single-qubit errors by separating X and Z syndrome measurements. The Steane code enables the implementation of transversal Clifford gates, making it an ideal playground to study fault-tolerant quantum computation. Although surface codes remain the codes of choice for scaling implementations, the Steane code will forever remain one of the cornerstone codes due to its clear structure of error correction and ease in teaching.

International Conference on Intelligent Processing, Hardware, Electronics, and Radio Systems (CIPHER)•Feb 13, 2026•0 citations

Experimental exploration of five-qubit quantum error-correcting code with superconducting qubits

Ming Gong, Xiao Yuan, Shiyu Wang +19 more

Quantum error correction is an essential ingredient for universal quantum computing. Despite tremendous experimental efforts in the study of quantum error correction, to date, there has been no demonstration in the realisation of universal quantum error-correcting code, with the subsequent verification of all key features including the identification of an arbitrary physical error, the capability for transversal manipulation of the logical state and state decoding. To address this challenge, we experimentally realise the [5, 1, 3] code, the so-called smallest perfect code that permits corrections of generic single-qubit errors. In the experiment, having optimised the encoding circuit, we employ an array of superconducting qubits to realise the [5, 1, 3] code for several typical logical states including the magic state, an indispensable resource for realising non-Clifford gates. The encoded states are prepared with an average fidelity of [Formula: see text] while with a high fidelity of [Formula: see text] in the code space. Then, the arbitrary single-qubit errors introduced manually are identified by measuring the stabilisers. We further implement logical Pauli operations with a fidelity of [Formula: see text] within the code space. Finally, we realise the decoding circuit and recover the input state with an overall fidelity of [Formula: see text], in total with 92 gates. Our work demonstrates each key aspect of the [5, 1, 3] code and verifies the viability of experimental realisation of quantum error-correcting codes with superconducting qubits.

arXiv:1907.04507•National Science Review•Jan 15, 2021•79 citations

Quantum error correction during 50 gates

Yaakov S. Weinstein

Fault-tolerant protocol assumes the application of error correction after every quantum gate. However, correcting errors is costly in terms of time and number of qubits. Here we demonstrate that quantum error correction (QEC) can be applied significantly less often with only a minimal loss of fidelity. This is done by simulating the implementation of 50 encoded, single-qubit, quantum gates within the [[7,1,3]] QEC code in a noisy, nonequiprobable Pauli error environment with QEC being applied at different intervals. We find that applying QEC after every gate is rarely optimal and even applying QEC only once after all 50 gates sacrifices only a slight amount of fidelity with the benefit of 50-fold saving of resources. In addition, we find that in cases where bit-flip errors are dominant, it is best not to apply QEC at all.

arXiv:1312.1245•Physical Review A•Feb 5, 2014•11 citations
We apply single ‘logical’ qubit Clifford gates to states encoded in the [7,1,3] quantum error correction code in a nonequiprobable Pauli matrix error environment. The gates we analyze are the NOT, Phase, and Hadamard gates. We calculate accuracy measures of the applied gates by determining output state and logical gate fidelities. The latter is determined from the logical gate -matrix. In addition, we apply perfect and noisy quantum error correction to the output state of the Clifford gate. Perfect error correction allows the determination of whether errors that occurred during the gate are ‘correctable’. Noisy error correction gives an idea of what can be expected in a realistic quantum computation.
I calculate the fidelity of a [7,1,3][7,1,3][7,1,3] Calderbank-Shor-Steane quantum error correction code logical zero state constructed in a nonequiprobable Pauli operator error environment for two methods of encoding. The first method is to apply fault-tolerant error correction to an arbitrary state of seven qubits utilizing Shor states for syndrome measurement. The Shor states are themselves constructed in the nonequiprobable Pauli operator error environment, and their fidelity depends on the number of verifications done to ensure multiple errors will not propagate into the encoded quantum information. Surprisingly, performing these verifications may lower the fidelity of the constructed Shor states. The second encoding method is to simply implement the [7,1,3][7,1,3][7,1,3] encoding gate sequence also in the nonequiprobable Pauli operator error environment. Perfect error correction is applied after both methods to determine the correctability of the implemented errors. I find that which method attains higher fidelity depends on which of the Pauli operators errors is dominant. Nevertheless, perfect error correction applied after the encoding suppresses errors to at least first order for both methods.
Correcting errors in real time is essential for reliable large-scale quantum computations. Realizing this high-level function requires a system capable of several low-level primitives, including single-qubit and two-qubit operations, mid-circuit measurements of subsets of qubits, real-time processing of measurement outcomes, and the ability to condition subsequent gate operations on those measurements. In this work, we use a ten qubit QCCD trapped-ion quantum computer to encode a single logical qubit using the [[7,1,3]][[7,1,3]][[7,1,3]] color code, first proposed by Steane~\cite{steane1996error}. The logical qubit is initialized into the eigenstates of three mutually unbiased bases using an encoding circuit, and we measure an average logical SPAM error of 1.7(6)×10−31.7(6) \times 10^{-3}1.7(6)×10−3, compared to the average physical SPAM error 2.4(8)×10−32.4(8) \times 10^{-3}2.4(8)×10−3 of our qubits. We then perform multiple syndrome measurements on the encoded qubit, using a real-time decoder to determine any necessary corrections that are done either as software updates to the Pauli frame or as physically applied gates. Moreover, these procedures are done repeatedly while maintaining coherence, demonstrating a dynamically protected logical qubit memory. Additionally, we demonstrate non-Clifford qubit operations by encoding a logical magic state with an error rate below the threshold required for magic state distillation. Finally, we present system-level simulations that allow us to identify key hardware upgrades that may enable the system to reach the pseudo-threshold.
We demonstrate that small quantum memories, realised via quantum error correction in multi-qubit devices and implemented using noisy Clifford circuits, can benefit significantly from tailoring the choice of code to the error model of the Cliffords gates and environment. We present a simulation of these errors and the results of searching across random quantum error correcting codes and implementing the associated Clifford encoding circuits. This modeling incorporates a better representation of the experimental complexity involved in implementing these codes and demonstrates that tailored codes can outperform the Steane code with more realistic experimental noise. Depending on the error model, they are required to surpass the fault tolerant threshold. These Pauli error models correspond to individual Clifford generators and environmental noise on the wires. We present error models which incorporate independent identically distributed (IID) errors and biased Pauli errors in the construction and optimisation of Clifford circuits associated with maintaining a quantum memory.
Since quantum states are limited in their ease of manipulation, quantum computing has great advantages when used for computation. These interactions, even if infinitesimal, are the very reason why errors arise, be it bit-flip, phase-flip, or composite, thus diminishing the accuracy in computation. Quantum error correction (QEC) intervenes systematically to guard against the loss of coherence from quantum information. Amongst the various QEC protocols developed so far, Steane code [ [7], [1], [3]] is a very famous CSS stabilizer code that was derived from a classical Hamming code. It will encode a single logical qubit into seven physical qubits, which corrects all single-qubit errors by separating X and Z syndrome measurements. The Steane code enables the implementation of transversal Clifford gates, making it an ideal playground to study fault-tolerant quantum computation. Although surface codes remain the codes of choice for scaling implementations, the Steane code will forever remain one of the cornerstone codes due to its clear structure of error correction and ease in teaching.
Quantum error correction is an essential ingredient for universal quantum computing. Despite tremendous experimental efforts in the study of quantum error correction, to date, there has been no demonstration in the realisation of universal quantum error-correcting code, with the subsequent verification of all key features including the identification of an arbitrary physical error, the capability for transversal manipulation of the logical state and state decoding. To address this challenge, we experimentally realise the [5, 1, 3] code, the so-called smallest perfect code that permits corrections of generic single-qubit errors. In the experiment, having optimised the encoding circuit, we employ an array of superconducting qubits to realise the [5, 1, 3] code for several typical logical states including the magic state, an indispensable resource for realising non-Clifford gates. The encoded states are prepared with an average fidelity of [Formula: see text] while with a high fidelity of [Formula: see text] in the code space. Then, the arbitrary single-qubit errors introduced manually are identified by measuring the stabilisers. We further implement logical Pauli operations with a fidelity of [Formula: see text] within the code space. Finally, we realise the decoding circuit and recover the input state with an overall fidelity of [Formula: see text], in total with 92 gates. Our work demonstrates each key aspect of the [5, 1, 3] code and verifies the viability of experimental realisation of quantum error-correcting codes with superconducting qubits.
Fault-tolerant protocol assumes the application of error correction after every quantum gate. However, correcting errors is costly in terms of time and number of qubits. Here we demonstrate that quantum error correction (QEC) can be applied significantly less often with only a minimal loss of fidelity. This is done by simulating the implementation of 50 encoded, single-qubit, quantum gates within the [[7,1,3]] QEC code in a noisy, nonequiprobable Pauli error environment with QEC being applied at different intervals. We find that applying QEC after every gate is rarely optimal and even applying QEC only once after all 50 gates sacrifices only a slight amount of fidelity with the benefit of 50-fold saving of resources. In addition, we find that in cases where bit-flip errors are dominant, it is best not to apply QEC at all.