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:1804.06995 · Quantum Science and Technology

Fault-tolerant quantum error correction for Steane’s seven-qubit color code with few or no extra qubits

Ben W Reichardt

Published Nov 24, 2020• 70 citations
arXivHTMLPDF

Abstract

Abstract Steane’s seven-qubit quantum code is a natural choice for fault-tolerance experiments because it is small and just two extra qubits are enough to correct errors. However, the two-qubit error-correction technique, known as ‘flagged’ syndrome extraction, works slowly, measuring only one syndrome at a time. This is a disadvantage in experiments with high qubit rest error rates. We extend the technique to extract multiple syndromes at once, without needing more qubits. Qubits for different syndromes can flag errors in each other. This gives equally fast and more qubit-efficient alternatives to Steane’s error-correction method, and also conforms to planar geometry constraints. We further show that Steane’s code and some others can be error-corrected with no extra qubits, provided there are at least two code blocks. The rough idea is that two seven-qubit codewords can be temporarily joined into a twelve-qubit code, freeing two qubits for flagged syndrome measurement.

DOI
10.1088/2058-9565/abc6f4

Related papers

Efficient Fault-Tolerant Syndrome Measurement of Quantum Error-Correcting Codes Based on "Flag"

QiFei Wei, Dongxiao Quan, Jing Liu +1 more

Fault-tolerant syndrome measurement plays an important role in the process of quantum error correction, and considerable effort had been taken for reducing the physical overhead of syndrome measurement which including the ancilla qubits, the CNOT gates and the time-slots. The two extra qubits syndrome measurement technique, known as "flag"-style syndrome measurement, cuts down the number of extra qubits to the utmost. However, it works slowly because it measures only one syndrome at a time. We extend the technique to extract all syndromes of the distance-3 quantum error-correcting code at once. We propose a new method that increases the parallelism of the syndrome measurement circuit and reduces the time overhead by allocating and adjusting the order of CNOT gates for measuring data block reasonably, which we call dynamic time-slot allocation scheme, and which is applicable to both Hamming codes and color codes. For a CSS quantum error-correcting code with the number of stabilizers m and the maximum weight w, we only need 2m extra qubits and 2 × (w+2) time-slots for one-shot measurement of all syndromes.

International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)•Dec 1, 2019•0 citations

Low-Depth Flag-Style Syndrome Extraction for Small Quantum Error-Correction Codes

Dhruv Bhatnagar, Matthew Steinberg, David Elkouss +2 more

Flag-style fault-tolerance has become a linchpin in the realization of small fault-tolerant quantum-error correction experiments. The flag protocol's utility hinges on low qubit over-head, which is typically much smaller than in other approaches. However, as in most fault-tolerance protocols, the advantages of flag-style error correction come with a tradeoff: fault tolerance can be guaranteed, but such protocols involve high-depth circuits, due to the need for repeated stabilizer measurements. Here, we demonstrate that a dynamic choice of stabilizer measurements, based on past syndromes, and the utilization of elements from the full stabilizer group, leads to flag protocols with lower-depth syndrome-extraction circuits for the [[5], [1], [3]] code, as well as for the Steane code when compared to the standard methods in flag fault tolerance. We methodically prove that our new protocols yield fault-tolerant lookup tables, and demonstrate them with a pseudothreshold simulation, showcasing large improvements for all protocols when compared to previously-established methods. This work opens the dialogue on exploiting the properties of the full stabilizer group for reducing circuit overhead in fault-tolerant quantum-error correction.

arXiv:2305.00784•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•6 citations

Parallel syndrome extraction with shared flag qubits for Calderbank-Shor-Steane codes of distance three

Pei-Hao Liou, Ching–Yi Lai

To perform achieve fault-tolerant quantum computation, one can use flagged syndrome extraction with fewer ancilla qubits. However, it suffers from long circuit depth if one stabilizer is measured at a time. Previously, Reichardt showed that it is possible to measure multiple stabilizers with at most one shared flag qubit for certain small quantum codes. In this paper, we propose a procedure for general Calderbank-Shor-Steane codes of distance three so that multiple $Z$ stabilizers ($X$ stabilizers) can be fault tolerantly measured in parallel with one shared flag qubit. We simulate the memory and computation pseudothresholds for various code schemes. In particular, our parallel scheme based on Shor's nine-qubit code performs better than known seven- and nine-qubit schemes in the literature.

arXiv:2208.00581•Physical Review A•Feb 17, 2023•8 citations

Quantum Error Correction with Only Two Extra Qubits

Rui Chao, Ben W. Reichardt

Noise rates in quantum computing experiments have dropped dramatically, but reliable qubits remain precious. Fault-tolerance schemes with minimal qubit overhead are therefore essential. We introduce fault-tolerant error-correction procedures that use only two extra qubits. The procedures are based on adding "flags" to catch the faults that can lead to correlated errors on the data. They work for various distance-three codes. In particular, our scheme allows one to test the ⟦5,1,3⟧ code, the smallest error-correcting code, using only seven qubits total. Our techniques also apply to the ⟦7,1,3⟧ and ⟦15,7,3⟧ Hamming codes, thus allowing us to protect seven encoded qubits on a device with only 17 physical qubits.

arXiv:1705.02329•Physical Review Letters•Aug 1, 2018•221 citations

Ultra Low Overhead Syndrome Extraction for the Steane code

Boldizsár Poór, Benjamin Rodatz, Aleks Kissinger

We establish a new performance benchmark for the fault-tolerant syndrome extraction of the [[7, 1, 3]] Steane code with a dynamic protocol. Our method is built on two highly optimized circuits derived using fault-equivalent ZX-rewrites: a primary fault-tolerant circuit with 14 CNOTs and an efficient non-fault-tolerant recovery circuit with 11 CNOTs. The protocol uses an adaptive response to internal faults, discarding flagged measurements and falling back to the recovery circuit to correct potentially detrimental errors. Monte Carlo simulations confirm the efficiency of our protocol, reducing the logical error rate per cycle by an average of ~14.3% relative to the optimized Steane method [arXiv:2506.17181] and ~17.3% compared to Reichardt's three-qubit method [arXiv:1804.06995], the leading prior techniques.

quant-pharXiv:2511.13700•Quantum Science and Technology•Nov 18, 2025•0 citations

Fault-tolerant syndrome extraction and cat state preparation with fewer qubits

Prithviraj Prabhu, Ben W. Reichardt

We reduce the extra qubits needed for two fault-tolerant quantum computing protocols: error correction, specifically syndrome bit measurement, and cat state preparation. For distance-three fault-tolerant syndrome extraction, we show an exponential reduction in qubit overhead over the previous best protocol. For a weight- w stabilizer, we demonstrate that stabilizer measurement tolerating one fault needs at most ⌈log2⁡w⌉+1 ancilla qubits. If qubits reset quickly, four ancillas suffice. We also study the preparation of entangled cat states, and prove that the overhead for distance-three fault tolerance is logarithmic in the cat state size. These results apply both to near-term experiments with a few qubits, and to the general study of the asymptotic resource requirements of syndrome measurement and state preparation.With a flag qubits, previous methods use O(a) flag patterns to identify faults. In order to use the same flag qubits more efficiently, we show how to use nearly all 2a possible flag patterns, by constructing maximal-length paths through the a -dimensional hypercube.

arXiv:2108.02184•Quantum•Oct 24, 2023•7 citations
Abstract Steane’s seven-qubit quantum code is a natural choice for fault-tolerance experiments because it is small and just two extra qubits are enough to correct errors. However, the two-qubit error-correction technique, known as ‘flagged’ syndrome extraction, works slowly, measuring only one syndrome at a time. This is a disadvantage in experiments with high qubit rest error rates. We extend the technique to extract multiple syndromes at once, without needing more qubits. Qubits for different syndromes can flag errors in each other. This gives equally fast and more qubit-efficient alternatives to Steane’s error-correction method, and also conforms to planar geometry constraints. We further show that Steane’s code and some others can be error-corrected with no extra qubits, provided there are at least two code blocks. The rough idea is that two seven-qubit codewords can be temporarily joined into a twelve-qubit code, freeing two qubits for flagged syndrome measurement.
Fault-tolerant syndrome measurement plays an important role in the process of quantum error correction, and considerable effort had been taken for reducing the physical overhead of syndrome measurement which including the ancilla qubits, the CNOT gates and the time-slots. The two extra qubits syndrome measurement technique, known as "flag"-style syndrome measurement, cuts down the number of extra qubits to the utmost. However, it works slowly because it measures only one syndrome at a time. We extend the technique to extract all syndromes of the distance-3 quantum error-correcting code at once. We propose a new method that increases the parallelism of the syndrome measurement circuit and reduces the time overhead by allocating and adjusting the order of CNOT gates for measuring data block reasonably, which we call dynamic time-slot allocation scheme, and which is applicable to both Hamming codes and color codes. For a CSS quantum error-correcting code with the number of stabilizers m and the maximum weight w, we only need 2m extra qubits and 2 × (w+2) time-slots for one-shot measurement of all syndromes.
Flag-style fault-tolerance has become a linchpin in the realization of small fault-tolerant quantum-error correction experiments. The flag protocol's utility hinges on low qubit over-head, which is typically much smaller than in other approaches. However, as in most fault-tolerance protocols, the advantages of flag-style error correction come with a tradeoff: fault tolerance can be guaranteed, but such protocols involve high-depth circuits, due to the need for repeated stabilizer measurements. Here, we demonstrate that a dynamic choice of stabilizer measurements, based on past syndromes, and the utilization of elements from the full stabilizer group, leads to flag protocols with lower-depth syndrome-extraction circuits for the [[5], [1], [3]] code, as well as for the Steane code when compared to the standard methods in flag fault tolerance. We methodically prove that our new protocols yield fault-tolerant lookup tables, and demonstrate them with a pseudothreshold simulation, showcasing large improvements for all protocols when compared to previously-established methods. This work opens the dialogue on exploiting the properties of the full stabilizer group for reducing circuit overhead in fault-tolerant quantum-error correction.
To perform achieve fault-tolerant quantum computation, one can use flagged syndrome extraction with fewer ancilla qubits. However, it suffers from long circuit depth if one stabilizer is measured at a time. Previously, Reichardt showed that it is possible to measure multiple stabilizers with at most one shared flag qubit for certain small quantum codes. In this paper, we propose a procedure for general Calderbank-Shor-Steane codes of distance three so that multiple ZZZ stabilizers (XXX stabilizers) can be fault tolerantly measured in parallel with one shared flag qubit. We simulate the memory and computation pseudothresholds for various code schemes. In particular, our parallel scheme based on Shor's nine-qubit code performs better than known seven- and nine-qubit schemes in the literature.
Noise rates in quantum computing experiments have dropped dramatically, but reliable qubits remain precious. Fault-tolerance schemes with minimal qubit overhead are therefore essential. We introduce fault-tolerant error-correction procedures that use only two extra qubits. The procedures are based on adding "flags" to catch the faults that can lead to correlated errors on the data. They work for various distance-three codes. In particular, our scheme allows one to test the ⟦5,1,3⟧ code, the smallest error-correcting code, using only seven qubits total. Our techniques also apply to the ⟦7,1,3⟧ and ⟦15,7,3⟧ Hamming codes, thus allowing us to protect seven encoded qubits on a device with only 17 physical qubits.
We establish a new performance benchmark for the fault-tolerant syndrome extraction of the [[7, 1, 3]] Steane code with a dynamic protocol. Our method is built on two highly optimized circuits derived using fault-equivalent ZX-rewrites: a primary fault-tolerant circuit with 14 CNOTs and an efficient non-fault-tolerant recovery circuit with 11 CNOTs. The protocol uses an adaptive response to internal faults, discarding flagged measurements and falling back to the recovery circuit to correct potentially detrimental errors. Monte Carlo simulations confirm the efficiency of our protocol, reducing the logical error rate per cycle by an average of ~14.3% relative to the optimized Steane method [arXiv:2506.17181] and ~17.3% compared to Reichardt's three-qubit method [arXiv:1804.06995], the leading prior techniques.
We reduce the extra qubits needed for two fault-tolerant quantum computing protocols: error correction, specifically syndrome bit measurement, and cat state preparation. For distance-three fault-tolerant syndrome extraction, we show an exponential reduction in qubit overhead over the previous best protocol. For a weight- w stabilizer, we demonstrate that stabilizer measurement tolerating one fault needs at most ⌈log2⁡w⌉+1 ancilla qubits. If qubits reset quickly, four ancillas suffice. We also study the preparation of entangled cat states, and prove that the overhead for distance-three fault tolerance is logarithmic in the cat state size. These results apply both to near-term experiments with a few qubits, and to the general study of the asymptotic resource requirements of syndrome measurement and state preparation.With a flag qubits, previous methods use O(a) flag patterns to identify faults. In order to use the same flag qubits more efficiently, we show how to use nearly all 2a possible flag patterns, by constructing maximal-length paths through the a -dimensional hypercube.