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/0405012 · Physical Review A

Effect of ancilla’s structure on quantum error correction using the seven-qubit Calderbank-Shor-Steane code

Pedro J. Salas, Angel L. Sanz

Published May 17, 2004• 7 citations
arXivHTMLPDF

Abstract

In this work we discuss the ability of different types of ancillas to control the decoherence of a qubit interacting with an environment. The error is introduced into the numerical simulation via a depolarizing isotropic channel. The ranges of values considered are ${10}^{\ensuremath{-}4}\ensuremath{\leqslant}\ensuremath{\epsilon}\ensuremath{\leqslant}{10}^{\ensuremath{-}2}$ for memory errors and $3\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}5}\ensuremath{\leqslant}\ensuremath{\gamma}∕7\ensuremath{\leqslant}{10}^{\ensuremath{-}2}$ for gate errors. After the correction we calculate the fidelity as a quality criterion for the qubit recovered. We observe that a recovery method with a three-qubit ancilla provides reasonably good results bearing in mind its economy. If we want to go further, we have to use fault tolerant ancillas with a high degree of parallelism, even if this condition implies introducing additional ancilla verification qubits.

DOI
10.1103/physreva.69.052322

Related papers

Numerical simulation of information recovery in quantum computers

Pedro J. Salas, Angel L. Sanz

Decoherence is the main problem to be solved before quantum computers can be built. To control decoherence, it is possible to use error correction methods, but these methods are themselves noisy quantum computation processes. In this work, we study the ability of Steane's and Shor's fault-tolerant recovering methods, as well as a modification of Steane's ancilla network, to correct errors in qubits. We test a way to measure correctly ancilla's fidelity for these methods, and state the possibility of carrying out an effective error correction through a noisy quantum channel, even using noisy error correction methods.

arXiv:quant-ph/0110106•Physical Review A•Aug 6, 2002•6 citations

Quality of a quantum error correcting scheme and memory error threshold estimation

Pedro J. Salas

The error correcting capabilities of the Calderbank-Shor-Steane [[7,1,3]] quantum code, together with a fault-tolerant syndrome extraction by means of several ancilla states, have been numerically studied. A simple probability expression to characterize the code ability for correcting an encoded qubit has been considered. This probability, as a correction quality criterion, permits the error correction capabilities among different recovery schemes to be compared. The memory error threshold is calculated by means of the best method of those considered.

arXiv:quant-ph/0606111•Quantum Information and Computation•Sep 1, 2006•0 citations

Relative performance of ancilla verification and decoding in the [[7,1,3]] Steane code

Ali Abu-Nada, Ben Fortescue, Mark Byrd

Ancilla postselection is a common means of achieving fault tolerance in quantum error correction. However, it can lead to additional data errors due to movement or wait operations. Alternatives to postselection may achieve lower overall failure rates due to avoiding such errors. We present numerical simulation results comparing the logical error rates for the fault-tolerant [[7,1,3]] Steane code using techniques of ancilla verification vs the newer method of ancilla decoding, as described in Phys. Rev. Lett. 98, 020501 (2007). We simulate QEC procedures in which the possibility of ancilla verification failures requires the creation and storage of additional ancillae and/or additional waiting of the data until a new ancilla can be created. We find that the decoding method, which avoids verification failures, is advantageous in terms of overall error rate in various cases, even when measurement operations are no slower than others. We analyze the effect of different classes of physical error on the relative performance of these two methods.

arXiv:1303.4026•Physical Review A•Jun 3, 2014•11 citations

EFFECT OF ANCILLA LOSSES ON FAULT-TOLERANT QUANTUM ERROR CORRECTION IN THE [[7,1,3]] STEANE CODE

Sameer Nawaf

Fault tolerant quantum error correction is a procedure which satisfies the feature that if one of the gates in the procedure has failed then the failure causes at most one error in the output qubits of the encoded block. Quantum computer is based on the idea of two quantum state systems (Qubits). However, the majority of systems are constructed from higher than two- level subspace. Bad control and environmental interactions in these systems lead to leakage fault. Leakage errors are errors that couple the states inside a code subspace to the states outside a code subspace. One example for leakage fault is loss errors. Since the fault tolerant procedure may be unable to recognize the leakage fault because it was designed to deal with Pauli errors. In that case a single leakage fault might disrupt the fault tolerant technique. In this thesis we investigate the effect of ancilla losses on fault-tolerant quantum error correction in the [[7,1,3]] Steane code. We proved that both Shor and Steane methods are still fault tolerant if loss errors occur.

•Jan 1, 2013•0 citations

Constructions for measuring error syndromes in Calderbank-Shor-Steane codes between Shor and Steane methods

Shilin Huang, Kenneth R. Brown

In another work [S. Huang and K. R. Brown, Phys. Rev. Lett. 127, 090505 (2021)] we introduced syndrome extraction methods for Calderbank-Shor-Steane quantum error-correction codes that interpolate between the well-known Shor and Steane syndrome extraction methods. Here we provide detailed proofs of the main theorems and show that up to gate ordering there is a one-to-one correspondence between extraction gadgets and partitions of the parity check matrix. Operationally, all the circuits in our framework can be obtained by merging ancilla qubits of Shor error correction with certain rules, which enables us to design fault-tolerant syndrome extraction circuits for given specific codes. We then apply our construction to the toric code and provide a detailed analysis of the time overhead of fault tolerance. In particular, we construct a syndrome extraction family whose time overhead smoothly varies from Shor to Steane error correction. To understand the potential advantage, we consider two simplified error models: no errors on the ancilla block and uncorrelated errors on the ancilla block. We study the threshold behavior of the family for both error models and show its potential advantage for quantum architectures with long coherence times.

Physical Review A•Aug 25, 2021•7 citations

Fault-Tolerant Quantum Error Correction: Implementing Hamming-Based Codes with Advanced Syndrome Extraction Techniques

Soham Bhadra, Diyansha Singh, Angana Chowdhury

Building reliable quantum computers requires protecting fragile quantum states from inevitable environmental noise and operational errors. While quantum error correction codes like the Steane $[\![7,1,3]\!]$ code provide elegant theoretical solutions, their practical success hinges critically on how we measure errors - a process called syndrome extraction. The challenge lies in the ancilla qubits used for measurement: when they fail, errors can cascade across the entire quantum system, destroying the very information we're trying to protect. We address this fundamental problem by implementing and comparing three sophisticated syndrome measurement strategies: Shor's cat-state approach, which distributes measurements across multiple entangled ancillas achieving 85-92% preparation success; Steane's encoded-ancilla method using complete error-corrected logical qubits reaching 97.8% syndrome fidelity; and a flexible unified framework that adapts strategies based on hardware capabilities. Through extensive simulations using IBM's Qiskit platform spanning randomized benchmarking and T-heavy circuits, we demonstrate that intelligent ancilla management improves error suppression by up to 2.4$\times$ compared to standard approaches. Our implementations achieve logical error rates as low as $5.1 \times 10^{-5}$ under realistic noise conditions with physical error rates of $10^{-3}$, while maintaining near-unity logical fidelity (0.99997) even for deep circuits. The threshold analysis reveals robust performance across distance-3 to distance-13 codes with characteristic threshold curves showing exponential error suppression below the critical physical error rate. These results provide immediately deployable tools for near-term quantum devices and establish practical design principles for scaling toward fault-tolerant quantum computers.

quant-pharXiv:2601.07860•Jan 13, 2026•0 citations
In this work we discuss the ability of different types of ancillas to control the decoherence of a qubit interacting with an environment. The error is introduced into the numerical simulation via a depolarizing isotropic channel. The ranges of values considered are 10\ensuremath−4\ensuremath⩽\ensuremathϵ\ensuremath⩽10\ensuremath−2{10}^{\ensuremath{-}4}\ensuremath{\leqslant}\ensuremath{\epsilon}\ensuremath{\leqslant}{10}^{\ensuremath{-}2}10\ensuremath−4\ensuremath⩽\ensuremathϵ\ensuremath⩽10\ensuremath−2 for memory errors and 3\ifmmode×\else\texttimes\fi10\ensuremath−5\ensuremath⩽\ensuremathγ∕7\ensuremath⩽10\ensuremath−23\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}5}\ensuremath{\leqslant}\ensuremath{\gamma}∕7\ensuremath{\leqslant}{10}^{\ensuremath{-}2}3\ifmmode×\else\texttimes\fi10\ensuremath−5\ensuremath⩽\ensuremathγ∕7\ensuremath⩽10\ensuremath−2 for gate errors. After the correction we calculate the fidelity as a quality criterion for the qubit recovered. We observe that a recovery method with a three-qubit ancilla provides reasonably good results bearing in mind its economy. If we want to go further, we have to use fault tolerant ancillas with a high degree of parallelism, even if this condition implies introducing additional ancilla verification qubits.
Decoherence is the main problem to be solved before quantum computers can be built. To control decoherence, it is possible to use error correction methods, but these methods are themselves noisy quantum computation processes. In this work, we study the ability of Steane's and Shor's fault-tolerant recovering methods, as well as a modification of Steane's ancilla network, to correct errors in qubits. We test a way to measure correctly ancilla's fidelity for these methods, and state the possibility of carrying out an effective error correction through a noisy quantum channel, even using noisy error correction methods.
The error correcting capabilities of the Calderbank-Shor-Steane [[7,1,3]] quantum code, together with a fault-tolerant syndrome extraction by means of several ancilla states, have been numerically studied. A simple probability expression to characterize the code ability for correcting an encoded qubit has been considered. This probability, as a correction quality criterion, permits the error correction capabilities among different recovery schemes to be compared. The memory error threshold is calculated by means of the best method of those considered.
Ancilla postselection is a common means of achieving fault tolerance in quantum error correction. However, it can lead to additional data errors due to movement or wait operations. Alternatives to postselection may achieve lower overall failure rates due to avoiding such errors. We present numerical simulation results comparing the logical error rates for the fault-tolerant [[7,1,3]] Steane code using techniques of ancilla verification vs the newer method of ancilla decoding, as described in Phys. Rev. Lett. 98, 020501 (2007). We simulate QEC procedures in which the possibility of ancilla verification failures requires the creation and storage of additional ancillae and/or additional waiting of the data until a new ancilla can be created. We find that the decoding method, which avoids verification failures, is advantageous in terms of overall error rate in various cases, even when measurement operations are no slower than others. We analyze the effect of different classes of physical error on the relative performance of these two methods.
Fault tolerant quantum error correction is a procedure which satisfies the feature that if one of the gates in the procedure has failed then the failure causes at most one error in the output qubits of the encoded block. Quantum computer is based on the idea of two quantum state systems (Qubits). However, the majority of systems are constructed from higher than two- level subspace. Bad control and environmental interactions in these systems lead to leakage fault. Leakage errors are errors that couple the states inside a code subspace to the states outside a code subspace. One example for leakage fault is loss errors. Since the fault tolerant procedure may be unable to recognize the leakage fault because it was designed to deal with Pauli errors. In that case a single leakage fault might disrupt the fault tolerant technique. In this thesis we investigate the effect of ancilla losses on fault-tolerant quantum error correction in the [[7,1,3]] Steane code. We proved that both Shor and Steane methods are still fault tolerant if loss errors occur.
In another work [S. Huang and K. R. Brown, Phys. Rev. Lett. 127, 090505 (2021)] we introduced syndrome extraction methods for Calderbank-Shor-Steane quantum error-correction codes that interpolate between the well-known Shor and Steane syndrome extraction methods. Here we provide detailed proofs of the main theorems and show that up to gate ordering there is a one-to-one correspondence between extraction gadgets and partitions of the parity check matrix. Operationally, all the circuits in our framework can be obtained by merging ancilla qubits of Shor error correction with certain rules, which enables us to design fault-tolerant syndrome extraction circuits for given specific codes. We then apply our construction to the toric code and provide a detailed analysis of the time overhead of fault tolerance. In particular, we construct a syndrome extraction family whose time overhead smoothly varies from Shor to Steane error correction. To understand the potential advantage, we consider two simplified error models: no errors on the ancilla block and uncorrelated errors on the ancilla block. We study the threshold behavior of the family for both error models and show its potential advantage for quantum architectures with long coherence times.
Building reliable quantum computers requires protecting fragile quantum states from inevitable environmental noise and operational errors. While quantum error correction codes like the Steane [ ⁣[7,1,3] ⁣][\![7,1,3]\!][[7,1,3]] code provide elegant theoretical solutions, their practical success hinges critically on how we measure errors - a process called syndrome extraction. The challenge lies in the ancilla qubits used for measurement: when they fail, errors can cascade across the entire quantum system, destroying the very information we're trying to protect. We address this fundamental problem by implementing and comparing three sophisticated syndrome measurement strategies: Shor's cat-state approach, which distributes measurements across multiple entangled ancillas achieving 85-92% preparation success; Steane's encoded-ancilla method using complete error-corrected logical qubits reaching 97.8% syndrome fidelity; and a flexible unified framework that adapts strategies based on hardware capabilities. Through extensive simulations using IBM's Qiskit platform spanning randomized benchmarking and T-heavy circuits, we demonstrate that intelligent ancilla management improves error suppression by up to 2.4×\times× compared to standard approaches. Our implementations achieve logical error rates as low as 5.1×10−55.1 \times 10^{-5}5.1×10−5 under realistic noise conditions with physical error rates of 10−310^{-3}10−3, while maintaining near-unity logical fidelity (0.99997) even for deep circuits. The threshold analysis reveals robust performance across distance-3 to distance-13 codes with characteristic threshold curves showing exponential error suppression below the critical physical error rate. These results provide immediately deployable tools for near-term quantum devices and establish practical design principles for scaling toward fault-tolerant quantum computers.