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

Bulletin of the American Physical Society

Topological quantum error correction in fractal dimensions II: decoding and threshold estimation

Arpit Dua, Guanyu Zhu, Tomas Jochym-O’Connor

Published Mar 15, 2021• 0 citations
OpenAlex

Related papers

Topological quantum error correction in fractal dimensions I: code construction and logical gates

Guanyu Zhu, Arpit Dua, Tomas Jochym-O’Connor

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

Quantum error correction with fractal topological codes

Arpit Dua, Tomas Jochym-O’Connor, Guanyu Zhu

Recently, a class of fractal surface codes (FSCs), has been constructed on fractal lattices with Hausdorff dimension 2+ϵ , which admits a fault-tolerant non-Clifford CCZ gate \cite{zhu2021topological}. We investigate the performance of such FSCs as fault-tolerant quantum memories. We prove that there exist decoding strategies with non-zero thresholds for bit-flip and phase-flip errors in the FSCs with Hausdorff dimension 2+ϵ . For the bit-flip errors, we adapt the sweep decoder, developed for string-like syndromes in the regular 3D surface code, to the FSCs by designing suitable modifications on the boundaries of the holes in the fractal lattice. Our adaptation of the sweep decoder for the FSCs maintains its self-correcting and single-shot nature. For the phase-flip errors, we employ the minimum-weight-perfect-matching (MWPM) decoder for the point-like syndromes. We report a sustainable fault-tolerant threshold ( ∼1.7% ) under phenomenological noise for the sweep decoder and the code capacity threshold (lower bounded by 2.95% ) for the MWPM decoder for a particular FSC with Hausdorff dimension DH≈2.966 . The latter can be mapped to a lower bound of the critical point of a confinement-Higgs transition on the fractal lattice, which is tunable via the Hausdorff dimension.

arXiv:2201.03568•Quantum•Sep 26, 2023•14 citations

Error-threshold for topological subsystem quantum error-correcting codes

Ruben S. Andrist, Héctor Bombín, Miguel Angel Martin-Delgado +1 more

Bulletin of the American Physical Society•Feb 27, 2012•0 citations

Fast decoders for qudit topological codes

Hussain Anwar, Benjamin J. Brown, Earl T. Campbell +1 more

Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyze their error correction thresholds and efficiency. The first decoder is a generalization of a "hard-decisions" decoder due to Bravyi and Haah [arXiv:1112.3252]. We modify this decoder to overcome a percolation effect which limits its threshold performance for high dimensions. The second decoder is a generalization of a "soft-decisions" decoder due to Poulin and Duclos-Cianci [Phys. Rev. Lett. 104, 050504 (2010)], with a small cell size to optimize the efficiency of implementation in the high dimensional case. In each case, we estimate thresholds for the uncorrelated bit-flip error model and provide a comparative analysis of the performance of both these approaches to error correction of qudit toric codes.

arXiv:1311.4895•New Journal of Physics•Jun 17, 2014•92 citations

High-threshold decoding of non-Pauli codes for 2D universality

Julio C. Magdalena de la Fuente, Noa Feldman, Jens Eisert +1 more

Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited connectivity. In this work, we explore a non-Pauli stabilizer code that can be used to complete a universal gate set on topological toric and surface codes in strictly two dimensions. Fault-tolerant syndrome extraction for the non-Pauli code requires mid-circuit $X$ corrections, a key difference to conventional Pauli codes. We construct and benchmark a just-in-time (JIT) matching decoder to reliably decide these corrections. Under a phenomenological error model with equally likely physical and measurement errors, we find a high threshold of $\approx 2.5\,\%$, close to the $\approx 2.9\,\%$ of a decoder with access to the full syndrome history. We also perform a finite-size scaling analysis to estimate how the logical error rate scales below threshold and verify an exponential suppression in both physical error rate and in the system size. A second global decoding step for $Z$ errors is required and the non-Clifford gates in the circuit reduce the threshold from $\approx 2.9\,\%$ to $\approx 1.8\,\%$ with a naive decoder. We show how $Z$ decoding can be improved using knowledge of the $X$ corrections, pushing the threshold to $\approx 2.2\,\%$. Our results suggest non-Clifford logic in 2D codes could perform comparably to 2D quantum memory. Our formalism for efficient benchmarking and decoding directly generalizes to a broader family of CSS codes whose $X$ stabilizers are twisted by diagonal Clifford operators, and spacetime versions thereof, defined by CSS-like circuits enriched by $CCZ$, $CS$, and $T$ gates.

quant-pharXiv:2604.02033•Apr 3, 2026•21 citations

Accurate optimal quantum error correction thresholds from coherent information

Luis Colmenárez, Ze-Min Huang, Sebastian Diehl +1 more

Quantum error correcting (QEC) codes protect quantum information from decoherence as long as error rates fall below critical error thresholds. In general, obtaining thresholds implies simulating the QEC procedure using, in general, suboptimal decoding strategies. In a few cases and for sufficiently simple noise models, optimal decoding of QEC codes can be framed as a phase transition in disordered classical spin models. In both situations, accurate estimation of thresholds demands intensive computational resources. Here we use the coherent information of the mixed state of noisy QEC codes to accurately estimate the associated optimal QEC thresholds already from small-distance codes at moderate computational cost. We show the effectiveness and versatility of our method by applying it first to the topological surface and color code under bit-flip and depolarizing noise. We then extend the coherent information based methodology to phenomenological and quantum circuit level noise settings. For all examples considered, we obtain highly accurate estimates of optimal error thresholds from small, low-distance instances of the codes, in close agreement with threshold values reported in the literature. Our findings establish the coherent information as a reliable competitive tool for the calculation of optimal thresholds of state-of-the-art QEC codes under realistic noise models. Published by the American Physical Society 2024

arXiv:2312.06664•Physical Review Research•Oct 15, 2024•25 citations
Recently, a class of fractal surface codes (FSCs), has been constructed on fractal lattices with Hausdorff dimension 2+ϵ , which admits a fault-tolerant non-Clifford CCZ gate \cite{zhu2021topological}. We investigate the performance of such FSCs as fault-tolerant quantum memories. We prove that there exist decoding strategies with non-zero thresholds for bit-flip and phase-flip errors in the FSCs with Hausdorff dimension 2+ϵ . For the bit-flip errors, we adapt the sweep decoder, developed for string-like syndromes in the regular 3D surface code, to the FSCs by designing suitable modifications on the boundaries of the holes in the fractal lattice. Our adaptation of the sweep decoder for the FSCs maintains its self-correcting and single-shot nature. For the phase-flip errors, we employ the minimum-weight-perfect-matching (MWPM) decoder for the point-like syndromes. We report a sustainable fault-tolerant threshold ( ∼1.7% ) under phenomenological noise for the sweep decoder and the code capacity threshold (lower bounded by 2.95% ) for the MWPM decoder for a particular FSC with Hausdorff dimension DH≈2.966 . The latter can be mapped to a lower bound of the critical point of a confinement-Higgs transition on the fractal lattice, which is tunable via the Hausdorff dimension.
Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyze their error correction thresholds and efficiency. The first decoder is a generalization of a "hard-decisions" decoder due to Bravyi and Haah [arXiv:1112.3252]. We modify this decoder to overcome a percolation effect which limits its threshold performance for high dimensions. The second decoder is a generalization of a "soft-decisions" decoder due to Poulin and Duclos-Cianci [Phys. Rev. Lett. 104, 050504 (2010)], with a small cell size to optimize the efficiency of implementation in the high dimensional case. In each case, we estimate thresholds for the uncorrelated bit-flip error model and provide a comparative analysis of the performance of both these approaches to error correction of qudit toric codes.
Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited connectivity. In this work, we explore a non-Pauli stabilizer code that can be used to complete a universal gate set on topological toric and surface codes in strictly two dimensions. Fault-tolerant syndrome extraction for the non-Pauli code requires mid-circuit XXX corrections, a key difference to conventional Pauli codes. We construct and benchmark a just-in-time (JIT) matching decoder to reliably decide these corrections. Under a phenomenological error model with equally likely physical and measurement errors, we find a high threshold of ≈2.5 %\approx 2.5\,\%≈2.5%, close to the ≈2.9 %\approx 2.9\,\%≈2.9% of a decoder with access to the full syndrome history. We also perform a finite-size scaling analysis to estimate how the logical error rate scales below threshold and verify an exponential suppression in both physical error rate and in the system size. A second global decoding step for ZZZ errors is required and the non-Clifford gates in the circuit reduce the threshold from ≈2.9 %\approx 2.9\,\%≈2.9% to ≈1.8 %\approx 1.8\,\%≈1.8% with a naive decoder. We show how ZZZ decoding can be improved using knowledge of the XXX corrections, pushing the threshold to ≈2.2 %\approx 2.2\,\%≈2.2%. Our results suggest non-Clifford logic in 2D codes could perform comparably to 2D quantum memory. Our formalism for efficient benchmarking and decoding directly generalizes to a broader family of CSS codes whose XXX stabilizers are twisted by diagonal Clifford operators, and spacetime versions thereof, defined by CSS-like circuits enriched by CCZCCZCCZ, CSCSCS, and TTT gates.
Quantum error correcting (QEC) codes protect quantum information from decoherence as long as error rates fall below critical error thresholds. In general, obtaining thresholds implies simulating the QEC procedure using, in general, suboptimal decoding strategies. In a few cases and for sufficiently simple noise models, optimal decoding of QEC codes can be framed as a phase transition in disordered classical spin models. In both situations, accurate estimation of thresholds demands intensive computational resources. Here we use the coherent information of the mixed state of noisy QEC codes to accurately estimate the associated optimal QEC thresholds already from small-distance codes at moderate computational cost. We show the effectiveness and versatility of our method by applying it first to the topological surface and color code under bit-flip and depolarizing noise. We then extend the coherent information based methodology to phenomenological and quantum circuit level noise settings. For all examples considered, we obtain highly accurate estimates of optimal error thresholds from small, low-distance instances of the codes, in close agreement with threshold values reported in the literature. Our findings establish the coherent information as a reliable competitive tool for the calculation of optimal thresholds of state-of-the-art QEC codes under realistic noise models. Published by the American Physical Society 2024