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/0610063 · Physical Review Letters

Subsystem Fault Tolerance with the Bacon-Shor Code

Panos Aliferis, Andrew W. Cross

Published May 31, 2007• 211 citations
arXivHTMLPDF

Abstract

We discuss how the presence of gauge subsystems in the Bacon-Shor code [D. Bacon, Phys. Rev. A 73, 012340 (2006)10.1103/PhysRevA.73.012340 (2006)] leads to remarkably simple and efficient methods for fault-tolerant error correction (FTEC). Most notably, FTEC does not require entangled ancillary states, and it can be implemented with nearest-neighbor two-qubit measurements. By using these methods, we prove a lower bound on the quantum accuracy threshold, 1.94 x 10(-4) for adversarial stochastic noise, that improves previous lower bounds by nearly an order of magnitude.

DOI
10.1103/physrevlett.98.220502

Related papers

Towards Demonstrating Fault Tolerance in Small Circuits Using Bacon-Shor Codes

Ariel Shlosberg, Anthony Polloreno, Graeme Smith

Quantum error correction is necessary to perform large-scale quantum computations in the presence of noise and decoherence. As a result, several aspects of quantum error correction have already been explored. These have been primarily studies of quantum memory[1, 2], an important first step towards quantum computation, where the objective is to increase the lifetime of the encoded quantum information. Additionally, several works have explored the implementation of logical gates[3-5]. In this work we study a next step - fault-tolerantly implementing quantum circuits. We choose the $[[4, 1, 2]]$ Bacon-Shor subsystem code, which has a particularly simple error-detection circuit. Through both numerics and site-counting arguments, we compute pseudo-thresholds for the Pauli error rate $p$ in a depolarizing noise model, below which the encoded circuits outperform the unencoded circuits. These pseudo-threshold values are shown to be as high as $p=3\%$ for short circuits, and $p=0.6\%$ for circuits of moderate depth. Additionally, we see that multiple rounds of stabilizer measurements give an improvement over performing a single round at the end. This provides a concrete suggestion for a small-scale fault-tolerant demonstration of a quantum algorithm that could be accessible with existing hardware.

arXiv:2108.02079•Aug 4, 2021•3 citations

Threshold Estimate for Fault Tolerant Quantum Computation

Christof Zalka

I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor (quant-ph/9505011) for fault tolerant error correction (FTEC) and the fault tolerant implementation of elementary operations on states encoded by the 7-qubit code. A simple computer simulation suggests a threshold for gate errors of the order ε\approx 10^{-3} or better. I also give a simple argument that the threshold for memory errors is about 10 times smaller, thus ε\approx 10^{-4}.

arXiv:quant-ph/9612028•Dec 8, 1996•90 citations

Optimal Bacon-Shor codes

John C. Napp, John P. Preskill

We study the performance of Bacon-Shor codes, quantum subsystem codes which are well suited for applications to fault-tolerant quantum memory because the error syndrome can be extracted by performing two-qubit measurements. Assuming independent noise, we find the optimal block size in terms of the bit-flip error probability $p_X$ and the phase error probability $p_Z$, and determine how the probability of a logical error depends on $p_X$ and $p_Z$. We show that a single Bacon-Shor code block, used by itself without concatenation, can provide very effective protection against logical errors if the noise is highly biased ($p_Z/p_X\gg 1)$ and the physical error rate $p_Z$ is a few percent or below. We also derive an upper bound on the logical error rate for the case where the syndrome data is noisy.

arXiv:1209.0794•Quantum Information and Computation•May 1, 2013•41 citations

Fault tolerance against amplitude-damping noise using Bacon-Shor codes

Long D. H. My, Akshaya Jayashankar, Prabha Mandayam +1 more

Designing efficient fault-tolerance schemes is crucial for building useful quantum computers. Most standard schemes assume no knowledge of the underlying device noise and rely on general-purpose quantum error-correcting (QEC) codes capable of handling arbitrary errors. Biased-noise alternatives focus on only correcting a subset of some generic error basis (e.g., Pauli error basis) and lower resource needs by channeling the redundancy to dealing only with that subset. Yet, the most resource-efficient codes are expected to be those that directly target the specific noise process that afflicts the quantum device, rather than using a generic error-basis description. However, the question of whether such noise-adapted QEC protocols are amenable to fault-tolerant implementations remains largely unexplored. Here, we design a fault-tolerance scheme based on the Bacon-Shor codes that can protect against amplitude-damping noise in the device. We construct a universal set of logical gadgets tolerant to multiple damping errors and estimate the fault-tolerance threshold of our scheme. Our work thus establishes the possibility of achieving fault tolerance against amplitude-damping noise using noise-adapted quantum codes, while highlighting some of the unique challenges that arise in this context.

arXiv:2503.22108•Physical Review Research•Aug 20, 2025•2 citations

Direct measurement of Bacon-Shor code stabilizers

Muyuan Li, Daniel Miller, Kenneth R. Brown

A Bacon-Shor code is a subsystem quantum error-correcting code on an $L\ifmmode\times\else\texttimes\fi{}L$ lattice where the $2(L\ensuremath{-}1)$ weight-$2L$ stabilizers are usually inferred from the measurements of $2L(L\ensuremath{-}1)$ weight-2 gauge operators. Here, we show that the stabilizers can be measured directly and fault tolerantly with bare ancillary qubits by constructing circuits that follow the pattern of gauge operators. We then examine the implications of this method for small quantum error-correcting codes by comparing distance-3 versions of the rotated surface code and the Bacon-Shor code with the standard depolarizing model and in the context of a trapped-ion quantum computer. We find that for a simple circuit of prepare, error correct, and measure, the Bacon-Shor code outperforms the surface code by requiring fewer qubits, taking less time, and having a lower error rate.

arXiv:1804.01127•Physical Review A•Nov 6, 2018•27 citations

Fault Tolerance with Noisy and Slow Measurements and Preparation

Gerardo A. Paz-Silva, Gavin K. Brennen, Jason Twamley

It is not so well known that measurement-free quantum error correction protocols can be designed to achieve fault-tolerant quantum computing. Despite their potential advantages in terms of the relaxation of accuracy, speed, and addressing requirements, they have usually been overlooked since they are expected to yield a very bad threshold. We show that this is not the case. We design fault-tolerant circuits for the 9-qubit Bacon-Shor code and find an error threshold for unitary gates and preparation of p((p,g)thresh)=3.76×10(-5) (30% of the best known result for the same code using measurement) while admitting up to 1/3 error rates for measurements and allocating no constraints on measurement speed. We further show that demanding gate error rates sufficiently below the threshold pushes the preparation threshold up to p((p)thresh)=1/3.

arXiv:1002.1536•Physical Review Letters•Aug 30, 2010•38 citations
We discuss how the presence of gauge subsystems in the Bacon-Shor code [D. Bacon, Phys. Rev. A 73, 012340 (2006)10.1103/PhysRevA.73.012340 (2006)] leads to remarkably simple and efficient methods for fault-tolerant error correction (FTEC). Most notably, FTEC does not require entangled ancillary states, and it can be implemented with nearest-neighbor two-qubit measurements. By using these methods, we prove a lower bound on the quantum accuracy threshold, 1.94 x 10(-4) for adversarial stochastic noise, that improves previous lower bounds by nearly an order of magnitude.
Quantum error correction is necessary to perform large-scale quantum computations in the presence of noise and decoherence. As a result, several aspects of quantum error correction have already been explored. These have been primarily studies of quantum memory[1, 2], an important first step towards quantum computation, where the objective is to increase the lifetime of the encoded quantum information. Additionally, several works have explored the implementation of logical gates[3-5]. In this work we study a next step - fault-tolerantly implementing quantum circuits. We choose the [[4,1,2]][[4, 1, 2]][[4,1,2]] Bacon-Shor subsystem code, which has a particularly simple error-detection circuit. Through both numerics and site-counting arguments, we compute pseudo-thresholds for the Pauli error rate ppp in a depolarizing noise model, below which the encoded circuits outperform the unencoded circuits. These pseudo-threshold values are shown to be as high as p=3%p=3\%p=3% for short circuits, and p=0.6%p=0.6\%p=0.6% for circuits of moderate depth. Additionally, we see that multiple rounds of stabilizer measurements give an improvement over performing a single round at the end. This provides a concrete suggestion for a small-scale fault-tolerant demonstration of a quantum algorithm that could be accessible with existing hardware.
I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor (quant-ph/9505011) for fault tolerant error correction (FTEC) and the fault tolerant implementation of elementary operations on states encoded by the 7-qubit code. A simple computer simulation suggests a threshold for gate errors of the order ε\approx 10^{-3} or better. I also give a simple argument that the threshold for memory errors is about 10 times smaller, thus ε\approx 10^{-4}.
We study the performance of Bacon-Shor codes, quantum subsystem codes which are well suited for applications to fault-tolerant quantum memory because the error syndrome can be extracted by performing two-qubit measurements. Assuming independent noise, we find the optimal block size in terms of the bit-flip error probability pXp_XpX​ and the phase error probability pZp_ZpZ​, and determine how the probability of a logical error depends on pXp_XpX​ and pZp_ZpZ​. We show that a single Bacon-Shor code block, used by itself without concatenation, can provide very effective protection against logical errors if the noise is highly biased (pZ/pX≫1)p_Z/p_X\gg 1)pZ​/pX​≫1) and the physical error rate pZp_ZpZ​ is a few percent or below. We also derive an upper bound on the logical error rate for the case where the syndrome data is noisy.
Designing efficient fault-tolerance schemes is crucial for building useful quantum computers. Most standard schemes assume no knowledge of the underlying device noise and rely on general-purpose quantum error-correcting (QEC) codes capable of handling arbitrary errors. Biased-noise alternatives focus on only correcting a subset of some generic error basis (e.g., Pauli error basis) and lower resource needs by channeling the redundancy to dealing only with that subset. Yet, the most resource-efficient codes are expected to be those that directly target the specific noise process that afflicts the quantum device, rather than using a generic error-basis description. However, the question of whether such noise-adapted QEC protocols are amenable to fault-tolerant implementations remains largely unexplored. Here, we design a fault-tolerance scheme based on the Bacon-Shor codes that can protect against amplitude-damping noise in the device. We construct a universal set of logical gadgets tolerant to multiple damping errors and estimate the fault-tolerance threshold of our scheme. Our work thus establishes the possibility of achieving fault tolerance against amplitude-damping noise using noise-adapted quantum codes, while highlighting some of the unique challenges that arise in this context.
A Bacon-Shor code is a subsystem quantum error-correcting code on an $L\ifmmode\times\else\texttimes\fi{}L$ lattice where the $2(L\ensuremath{-}1)$ weight-2L2L2L stabilizers are usually inferred from the measurements of $2L(L\ensuremath{-}1)$ weight-2 gauge operators. Here, we show that the stabilizers can be measured directly and fault tolerantly with bare ancillary qubits by constructing circuits that follow the pattern of gauge operators. We then examine the implications of this method for small quantum error-correcting codes by comparing distance-3 versions of the rotated surface code and the Bacon-Shor code with the standard depolarizing model and in the context of a trapped-ion quantum computer. We find that for a simple circuit of prepare, error correct, and measure, the Bacon-Shor code outperforms the surface code by requiring fewer qubits, taking less time, and having a lower error rate.
It is not so well known that measurement-free quantum error correction protocols can be designed to achieve fault-tolerant quantum computing. Despite their potential advantages in terms of the relaxation of accuracy, speed, and addressing requirements, they have usually been overlooked since they are expected to yield a very bad threshold. We show that this is not the case. We design fault-tolerant circuits for the 9-qubit Bacon-Shor code and find an error threshold for unitary gates and preparation of p((p,g)thresh)=3.76×10(-5) (30% of the best known result for the same code using measurement) while admitting up to 1/3 error rates for measurements and allocating no constraints on measurement speed. We further show that demanding gate error rates sufficiently below the threshold pushes the preparation threshold up to p((p)thresh)=1/3.