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:1209.0794 · Quantum Information and Computation

Optimal Bacon-Shor codes

John C. Napp, John P. Preskill

Published May 1, 2013• 41 citations
arXivHTMLPDF

Abstract

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.

DOI
10.26421/qic13.5-6-9

Related papers

Fault-tolerant quantum computation with asymmetric Bacon-Shor codes

Peter Brooks, John P. Preskill

We develop a scheme for fault-tolerant quantum computation based on asymmetric Bacon-Shor codes, which works effectively against highly biased noise dominated by dephasing. We find the optimal Bacon-Shor block size as a function of the noise strength and the noise bias, and estimate the logical error rate and overhead cost achieved by this optimal code. Our fault-tolerant gadgets, based on gate teleportation, are well suited for hardware platforms with geometrically local gates in two dimensions.

arXiv:1211.1400•Physical Review A•Mar 7, 2013•55 citations

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

Short Shor-style syndrome sequences

Nicolas Delfosse, Ben W. Reichardt

We optimize fault-tolerant quantum error correction to reduce the number of syndrome bit measurements. Speeding up error correction will also speed up an encoded quantum computation, and should reduce its effective error rate. We give both code-specific and general methods, using a variety of techniques and in a variety of settings. We design new quantum error-correcting codes specifically for efficient error correction, e.g., allowing single-shot error correction. For codes with multiple logical qubits, we give methods for combining error correction with partial logical measurements. There are tradeoffs in choosing a code and error-correction technique. While to date most work has concentrated on optimizing the syndrome-extraction procedure, we show that there are also substantial benefits to optimizing how the measured syndromes are chosen and used. As an example, we design single-shot measurement sequences for fault-tolerant quantum error correction with the 16-qubit extended Hamming code. Our scheme uses 10 syndrome bit measurements, compared to 40 measurements with the Shor scheme. We design single-shot logical measurements as well: any logical Z measurement can be made together with fault-tolerant error correction using only 11 measurements. For comparison, using the Shor scheme a basic implementation of such a non-destructive logical measurement uses 63 measurements. We also offer ten open problems, the solutions of which could lead to substantial improvements of fault-tolerant error correction.

arXiv:2008.05051•Aug 12, 2020•37 citations

Message passing in fault-tolerant quantum error correction

Zachary W. E. Evans, Ashley M. Stephens

Inspired by Knill's scheme for message passing error detection, here we develop a scheme for message passing error correction for the nine-qubit Bacon-Shor code. We show that for two levels of concatenated error correction, where classical information obtained at the first level is used to help interpret the syndrome at the second level, our scheme will correct all cases with four physical errors. This results in a reduction of the logical failure rate relative to conventional error correction by a factor proportional to the reciprocal of the physical error rate.

arXiv:0806.2188•Physical Review A•Dec 8, 2008•9 citations

Subsystem Fault Tolerance with the Bacon-Shor Code

Panos Aliferis, Andrew W. Cross

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.

arXiv:quant-ph/0610063•Physical Review Letters•May 31, 2007•211 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
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.
We develop a scheme for fault-tolerant quantum computation based on asymmetric Bacon-Shor codes, which works effectively against highly biased noise dominated by dephasing. We find the optimal Bacon-Shor block size as a function of the noise strength and the noise bias, and estimate the logical error rate and overhead cost achieved by this optimal code. Our fault-tolerant gadgets, based on gate teleportation, are well suited for hardware platforms with geometrically local gates in two dimensions.
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.
We optimize fault-tolerant quantum error correction to reduce the number of syndrome bit measurements. Speeding up error correction will also speed up an encoded quantum computation, and should reduce its effective error rate. We give both code-specific and general methods, using a variety of techniques and in a variety of settings. We design new quantum error-correcting codes specifically for efficient error correction, e.g., allowing single-shot error correction. For codes with multiple logical qubits, we give methods for combining error correction with partial logical measurements. There are tradeoffs in choosing a code and error-correction technique. While to date most work has concentrated on optimizing the syndrome-extraction procedure, we show that there are also substantial benefits to optimizing how the measured syndromes are chosen and used. As an example, we design single-shot measurement sequences for fault-tolerant quantum error correction with the 16-qubit extended Hamming code. Our scheme uses 10 syndrome bit measurements, compared to 40 measurements with the Shor scheme. We design single-shot logical measurements as well: any logical Z measurement can be made together with fault-tolerant error correction using only 11 measurements. For comparison, using the Shor scheme a basic implementation of such a non-destructive logical measurement uses 63 measurements. We also offer ten open problems, the solutions of which could lead to substantial improvements of fault-tolerant error correction.
Inspired by Knill's scheme for message passing error detection, here we develop a scheme for message passing error correction for the nine-qubit Bacon-Shor code. We show that for two levels of concatenated error correction, where classical information obtained at the first level is used to help interpret the syndrome at the second level, our scheme will correct all cases with four physical errors. This results in a reduction of the logical failure rate relative to conventional error correction by a factor proportional to the reciprocal of the physical error rate.
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.
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.