On maximum-likelihood decoding with circuit-level errors

Abstract

Error probability distribution associated with a given Clifford measurement circuit is described exactly in terms of the circuit error-equivalence group, or the circuit subsystem code previously introduced by Bacon, Flammia, Harrow, and Shi. This gives a prescription for maximum-likelihood decoding with a given measurement circuit. Marginal distributions for subsets of circuit errors are also analyzed; these generate a family of related asymmetric LDPC codes of varying degeneracy. More generally, such a family is associated with any quantum code. Implications for decoding highly-degenerate quantum codes are discussed.

15 pages, 4 figures. In v2, added analysis of marginal distributions and discussion of decoding. In v3, some typos corrected and references added. In v4, only license has been updated

References in corpus (9)

• Surface codes: Towards practical large-scale quantum computation
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Degenerate Quantum LDPC Codes With Good Finite Length Performance
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Topological and subsystem codes on low-degree graphs with flag qubits
• Quantum accuracy threshold for concatenated distance-3 codes
• Triangular color codes on trivalent graphs with flag qubits
• Modified belief propagation decoders for quantum low-density parity-check codes
• High Performance Monte Carlo Simulation of Ising Model on TPU Clusters

Cited by in corpus (9)

• Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
• Beyond single-shot fault-tolerant quantum error correction
• Avoiding coherent errors with rotated concatenated stabilizer codes
• Learning logical Pauli noise in quantum error correction
• Data-driven decoding of quantum error correcting codes using graph neural networks
• Fundamental thresholds of realistic quantum error correction circuits from classical spin models
• Extracting Error Thresholds through the Framework of Approximate Quantum Error Correction Condition
• Vulnerability of fault-tolerant topological quantum error correction to quantum deviations in code space
• Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory