Mixed-state topological order and error-correction thresholds in non-Abelian codes: rigorous results

• URL: http://arxiv.org/abs/2607.21706v1
• Date: Thu, 23 Jul 2026 18:00:03 GMT
• Title: Mixed-state topological order and error-correction thresholds in non-Abelian codes: rigorous results
• Abstract summary: We present a versatile and mathematically rigorous technique for bounding recovery thresholds in topological codes subject to noise.<n>Our method captures the effect of applying an arbitrary (possibly non-Pauli) local noise channel to the code state of a broad class of two-dimensional codes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a versatile and mathematically rigorous technique for bounding recovery thresholds in topological codes subject to noise. Our method captures the effect of applying an arbitrary (possibly non-Pauli) local noise channel to the code state of a broad class of two-dimensional codes, including surface codes, non-Abelian quantum doubles, and string-net codes. In each case, we prove that for noise strengths up to some explicit constant value, any initially encoded logical information can be recovered to high precision, and that the noise-corrupted state exhibits key hallmarks of mixed-state topological order: long-range entanglement and emergent higher-form symmetries. We also describe how these methods can be adapted to higher dimensions and correlated noise models.

Related papers

• Estimating the performance boundary of Gottesman-Kitaev-Preskill codes and number-phase codes [0.0]
  Bosonic quantum error-correcting codes encode logical information in a harmonic oscillator.<n>It remains unclear under what physical noise conditions (including photon loss and dephasing) one encoding intrinsically outperforms the other.<n>Here we estimate a quantitative performance boundary between GKP and NP codes under general photon loss-dephasing noise.
  arXiv  Detail & Related papers  (2026-02-27T15:42:34Z)
• Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits [53.773695219320125]
  We take a first step toward a theoretical understanding of second-order optimization under heavy-tailed noise.<n>We introduce a novel algorithm based on gradient and Hessian clipping, and prove high-probability upper bounds that nearly match the fundamental limits.
  arXiv  Detail & Related papers  (2025-10-12T16:36:54Z)
• Decoded Quantum Interferometry Under Noise [4.180458188910334]
  We present a rigorous analysis of Decoded Quantum Interferometry (DQI) under noise.<n>For the maximum linear satisfiability problem, we prove that, in the presence of noise, performance is governed by a noise-weighted sparsity parameter of the instance matrix.<n>We offer guidance on preserving DQI's potential quantum advantage under realistic noise.
  arXiv  Detail & Related papers  (2025-08-14T15:08:09Z)
• Mixed-State Topological Order under Coherent Noises [2.8391355909797644]
  We find remarkable stability of mixed-state topological order under random rotation noise with axes near the $Y$-axis of qubits. The upper bounds for the intrinsic error threshold are determined by these phase boundaries, beyond which quantum error correction becomes impossible.
  arXiv  Detail & Related papers  (2024-11-05T19:00:06Z)
• Overcoming the Zero-Rate Hashing Bound with Holographic Quantum Error Correction [40.671162828621426]
  Finding an optimal quantum code under biased noise is a challenging problem.<n> benchmark for this capacity is given by the hashing bound.<n>We show that zero-rate holographic codes, built from hyperbolic tensor networks, fulfill both conditions.
  arXiv  Detail & Related papers  (2024-08-12T15:35:03Z)
• First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities [91.46841922915418]
  We present a unified approach for the theoretical analysis of first-order variation methods. Our approach covers both non-linear gradient and strongly Monte Carlo problems. We provide bounds that match the oracle strongly in the case of convex method optimization problems.
  arXiv  Detail & Related papers  (2023-05-25T11:11:31Z)
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models [44.99833362998488]
  Topological subsystem codes allow for quantum error correction with no time overhead, even in the presence of measurement noise. We provide a systematic construction of a class of codes in three dimensions built from abelian quantum double models in one fewer dimension. Our construction not only generalizes the recently introduced subsystem toric code, but also provides a new perspective on several aspects of the original model.
  arXiv  Detail & Related papers  (2023-05-10T18:00:01Z)
• Diagnostics of mixed-state topological order and breakdown of quantum memory [0.0]
  Topological quantum memory can protect information against local errors up to finite error thresholds. We provide an intrinsic characterization of the breakdown of topological quantum memory. We employ three information-theoretical quantities that can be regarded as generalizations of the diagnostics of ground-state topological order.
  arXiv  Detail & Related papers  (2023-01-13T18:21:23Z)
• C2N: Practical Generative Noise Modeling for Real-World Denoising [53.96391787869974]
  We introduce a Clean-to-Noisy image generation framework, namely C2N, to imitate complex real-world noise without using paired examples. We construct the noise generator in C2N accordingly with each component of real-world noise characteristics to express a wide range of noise accurately.
  arXiv  Detail & Related papers  (2022-02-19T05:53:46Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.