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:0902.4506 · Quantum Information Processing

Optimal correction of concatenated fault-tolerant quantum codes

Zachary W. E. Evans, Ashley M. Stephens

Published Sep 26, 2011• 14 citations
arXivHTMLPDF
DOI
10.1007/s11128-011-0312-4

Related papers

Optimal decoding in fault-tolerant concatenated quantum error correction

Zachary W. E. Evans, Ashley M. Stephens

•Feb 26, 2009•2 citations

Using Concatenated Quantum Codes for Universal Fault-Tolerant Quantum Gates

Tomas Jochym-O’Connor, Raymond Laflamme

We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. The concatenation scheme exploits the transversal properties of two different codes, combining them to provide a means to protect against low-weight arbitrary errors. We give the required properties of the error correcting codes to ensure universal fault tolerance and discuss a particular example using the 7-qubit Steane and 15-qubit Reed-Muller codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria, our scheme requires no special ancillary state preparation to achieve universality, as opposed to schemes such as magic state distillation. We believe that optimizing the codes used in such a scheme could provide a useful alternative to state distillation schemes that exhibit high overhead costs.

arXiv:1309.3310•Physical Review Letters•Jan 10, 2014•99 citations

Tolerance for Inaccurate Information in Quantum Computing

Kuldeep Singh Kaswan, Jagjit Singh Dhatterwal, Anupam Baliyan +1 more

This chapter describes an approach to quantum processing that is both error correcting and fault tolerant. Quantum computing in the traditional equivalent circuit and other paradigms of communication both include other ways to achieve resilient quantum computation. The chapter explains how to make the Steane seven-qubit code robust with correction approaches to demonstrate fault-tolerant quantum error correction. Fault-tolerant approaches include safeguards to prevent a single fault from spreading to numerous qubits, as Steane's algorithm cannot rectify multiple errors. Code that repeatedly replaces circuits with bigger and more resilient ones is concatenation. The chapter analyzes concatenation levels to illustrate the increasing potential for exponential precision growth when more resources (qubits and gates) are made available. Concatenation may be used to create an arbitrarily low probability of failure by concatenating bigger and more resilient circuits. Concatenated coding has the advantage of using just polynomial resources to achieve rapid results with a low failure probability.

Wiley eBooks•Jul 14, 2023•0 citations

Progress on fault-tolerant quantum computing with concatenated bosonic-qubit codes

Arne L. Grimsmo, Stefanus Tanuarta, J. W. Soule +2 more

Bulletin of the American Physical Society•Mar 4, 2020•0 citations

Design and analysis of error correcting codes for quantum computation

Pavel Bažant

•Jan 1, 2008•0 citations

Fault Tolerant Quantum Error Mitigation

Alvin Gonzales, Anjala M Babu, Ji Liu +2 more

Typically, fault-tolerant operations and code concatenation are reserved for quantum error correction due to their resource overhead. Here, we show that fault tolerant operations have a large impact on the performance of symmetry based error mitigation techniques. We also demonstrate that similar to results in fault tolerant quantum computing, code concatenation in fault-tolerant quantum error mitigation (FTQEM) can exponentially suppress the errors to arbitrary levels. For a family of circuits, we provide analytical error thresholds for FTQEM with the repetition code. These circuits include a set of quantum circuits that can generate all of reversible classical computing. The post-selection rate in FTQEM can also be increased by correcting some of the outcomes. Our threshold results can also be viewed from the perspective of quantifying the number of gate operations we can delay checking the stabilizers in a concatenated code before errors overwhelm the encoding. The benefits of FTQEM are demonstrated with numerical simulations and hardware demonstrations.

arXiv:2308.05403•Aug 10, 2023•5 citations
We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. The concatenation scheme exploits the transversal properties of two different codes, combining them to provide a means to protect against low-weight arbitrary errors. We give the required properties of the error correcting codes to ensure universal fault tolerance and discuss a particular example using the 7-qubit Steane and 15-qubit Reed-Muller codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria, our scheme requires no special ancillary state preparation to achieve universality, as opposed to schemes such as magic state distillation. We believe that optimizing the codes used in such a scheme could provide a useful alternative to state distillation schemes that exhibit high overhead costs.
This chapter describes an approach to quantum processing that is both error correcting and fault tolerant. Quantum computing in the traditional equivalent circuit and other paradigms of communication both include other ways to achieve resilient quantum computation. The chapter explains how to make the Steane seven-qubit code robust with correction approaches to demonstrate fault-tolerant quantum error correction. Fault-tolerant approaches include safeguards to prevent a single fault from spreading to numerous qubits, as Steane's algorithm cannot rectify multiple errors. Code that repeatedly replaces circuits with bigger and more resilient ones is concatenation. The chapter analyzes concatenation levels to illustrate the increasing potential for exponential precision growth when more resources (qubits and gates) are made available. Concatenation may be used to create an arbitrarily low probability of failure by concatenating bigger and more resilient circuits. Concatenated coding has the advantage of using just polynomial resources to achieve rapid results with a low failure probability.
Typically, fault-tolerant operations and code concatenation are reserved for quantum error correction due to their resource overhead. Here, we show that fault tolerant operations have a large impact on the performance of symmetry based error mitigation techniques. We also demonstrate that similar to results in fault tolerant quantum computing, code concatenation in fault-tolerant quantum error mitigation (FTQEM) can exponentially suppress the errors to arbitrary levels. For a family of circuits, we provide analytical error thresholds for FTQEM with the repetition code. These circuits include a set of quantum circuits that can generate all of reversible classical computing. The post-selection rate in FTQEM can also be increased by correcting some of the outcomes. Our threshold results can also be viewed from the perspective of quantifying the number of gate operations we can delay checking the stabilizers in a concatenated code before errors overwhelm the encoding. The benefits of FTQEM are demonstrated with numerical simulations and hardware demonstrations.