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:1704.05857 · Physical Review Letters

Reliable Channel-Adapted Error Correction: Bacon-Shor Code Recovery from Amplitude Damping

Álvaro Piedrafita, Joseph M. Renes

Published Dec 21, 2017• 6 citations
arXivHTMLPDF

Abstract

We construct two simple error correction schemes adapted to amplitude damping noise for Bacon-Shor codes and investigate their prospects for fault-tolerant implementation. Both consist solely of Clifford gates and require far fewer qubits, relative to the standard method, to achieve exact correction to a desired order in the damping rate. The first, employing one-bit teleportation and single-qubit measurements, needs only one-fourth as many physical qubits, while the second, using just stabilizer measurements and Pauli corrections, needs only half. The improvements stem from the fact that damping events need only be detected, not corrected, and that effective phase errors arising due to undamped qubits occur at a lower rate than damping errors. For error correction that is itself subject to damping noise, we show that existing fault-tolerance methods can be employed for the latter scheme, while the former can be made to avoid potential catastrophic errors and can easily cope with damping faults in ancilla qubits.

DOI
10.1103/physrevlett.119.250501

Related papers

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

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

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

Smallest quantum codes for amplitude-damping noise

Sourav Dutta, Aditya Jain, Prabha Mandayam

We describe the smallest quantum error correcting (QEC) code to correct for amplitude-damping (AD) noise, namely, a three-qubit code that corrects all the single-qubit damping errors. We generalize this construction to a family of codes that correct AD noise up to any fixed order of the damping strength. We underpin the fundamental connection between the structure of our codes and the noise structure, via a relaxed form of the Knill-Laflamme conditions, different from existing formulations of approximate QEC conditions. Although the recovery procedure for this code is nondeterministic, our codes are optimal with respect to overheads and outperform existing codes to tackle AD noise in terms of entanglement fidelity. This formulation of probabilistic QEC further leads us to a family of quantum codes tailored to AD noise and also gives rise to a noise-adapted quantum Hamming bound for AD noise. Finally, we construct a set of universal logical gates for the three-qubit code, thus providing a potential pathway to fault tolerance via this class of codes.

arXiv:2410.00155•Physical Review Research•Jun 10, 2026•12 citations

Noise-adapted qudit codes for amplitude-damping noise

Sourav Dutta, Debjyoti Biswas, Prabha Mandayam

Quantum error correction (QEC) plays a critical role in preventing information loss in quantum systems and provides a framework for reliable quantum computation. Identifying quantum codes with nice code parameters for physically motivated noise models remains an interesting challenge. While past work has primarily focused on qubit codes, here we identify a [4,1] qudit error correcting code tailored to protect against amplitude-damping noise. We show that this four-qudit code satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors up to the leading order in the damping parameter $\ensuremath{\gamma}$. We devise a protocol to extract syndromes that unambiguously identify this set of errors, leading to a noise-adapted recovery scheme that achieves a fidelity loss of $O({\ensuremath{\gamma}}^{2})$. For the $d=2$ case, our QEC scheme is identical to the known example of the four-qubit code and the associated syndrome-based recovery. We also assess the performance of this code using the Petz recovery map and note some interesting deviations from the qubit case. Finally, we generalize this construction to a family of $[2M+2,M]$ qudit codes that can approximately correct all the single-qudit and a few two-qudit amplitude-damping errors.

arXiv:2406.02444•Physical Review A•Mar 31, 2025•13 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
We construct two simple error correction schemes adapted to amplitude damping noise for Bacon-Shor codes and investigate their prospects for fault-tolerant implementation. Both consist solely of Clifford gates and require far fewer qubits, relative to the standard method, to achieve exact correction to a desired order in the damping rate. The first, employing one-bit teleportation and single-qubit measurements, needs only one-fourth as many physical qubits, while the second, using just stabilizer measurements and Pauli corrections, needs only half. The improvements stem from the fact that damping events need only be detected, not corrected, and that effective phase errors arising due to undamped qubits occur at a lower rate than damping errors. For error correction that is itself subject to damping noise, we show that existing fault-tolerance methods can be employed for the latter scheme, while the former can be made to avoid potential catastrophic errors and can easily cope with damping faults in ancilla qubits.
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.
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.
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.
We describe the smallest quantum error correcting (QEC) code to correct for amplitude-damping (AD) noise, namely, a three-qubit code that corrects all the single-qubit damping errors. We generalize this construction to a family of codes that correct AD noise up to any fixed order of the damping strength. We underpin the fundamental connection between the structure of our codes and the noise structure, via a relaxed form of the Knill-Laflamme conditions, different from existing formulations of approximate QEC conditions. Although the recovery procedure for this code is nondeterministic, our codes are optimal with respect to overheads and outperform existing codes to tackle AD noise in terms of entanglement fidelity. This formulation of probabilistic QEC further leads us to a family of quantum codes tailored to AD noise and also gives rise to a noise-adapted quantum Hamming bound for AD noise. Finally, we construct a set of universal logical gates for the three-qubit code, thus providing a potential pathway to fault tolerance via this class of codes.
Quantum error correction (QEC) plays a critical role in preventing information loss in quantum systems and provides a framework for reliable quantum computation. Identifying quantum codes with nice code parameters for physically motivated noise models remains an interesting challenge. While past work has primarily focused on qubit codes, here we identify a [4,1] qudit error correcting code tailored to protect against amplitude-damping noise. We show that this four-qudit code satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors up to the leading order in the damping parameter $\ensuremath{\gamma}$. We devise a protocol to extract syndromes that unambiguously identify this set of errors, leading to a noise-adapted recovery scheme that achieves a fidelity loss of $O({\ensuremath{\gamma}}^{2})$. For the d=2d=2d=2 case, our QEC scheme is identical to the known example of the four-qubit code and the associated syndrome-based recovery. We also assess the performance of this code using the Petz recovery map and note some interesting deviations from the qubit case. Finally, we generalize this construction to a family of [2M+2,M][2M+2,M][2M+2,M] qudit codes that can approximately correct all the single-qudit and a few two-qudit amplitude-damping errors.
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.