REVIEW 7 cited by
Almost-linear time decoding algorithm for topological codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and erasure. Our algorithm has a worst case complexity of $O(n \alpha(n))$, where $n$ is the number of physical qubits and $\alpha$ is the inverse of Ackermann's function, which is very slowly growing. For all practical purposes, $\alpha(n) \leq 3$. We prove that our algorithm performs optimally for errors of weight up to $(d-1)/2$ and for loss of up to $d-1$ qubits, where $d$ is the minimum distance of the code. Numerically, we obtain a threshold of $9.9\%$ for the 2d-toric code with perfect syndrome measurements and $2.6\%$ with faulty measurements.
Forward citations
Cited by 7 Pith papers
-
The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop
In windowed quantum decoding, a wrong speculative boundary guess stays inside one window, and the predict-verify-recover loop removes the serial stall with negligible penalty.
-
Improved belief propagation is sufficient for real-time decoding of quantum memory
Relay-BP, a message-passing decoder using disordered memory strengths and relay ensembling, matches or beats benchmark decoders for bivariate-bicycle and surface codes within a real-time iteration budget.
-
Q3DE: A fault-tolerant quantum computer architecture for multi-bit burst errors by cosmic rays
Q3DE detects cosmic-ray-induced multi-bit burst errors from syndrome statistics alone and mitigates them through dynamic code-distance expansion and decoder rollback, cutting the exposed error period by about 1000 times.
-
A conditional no-go for resource-free magic-axis measurement on a static surface code
Under three stated assumptions, a resource-free static surface-code patch cannot sharply measure the magic axis at polynomial acceptance; it must pay with a resource, leave the dilute regime, or accept exponentially rarely.
-
Lottery BP: Unlocking Quantum Error Decoding at Scale
Lottery BP adds randomness to belief propagation decoding and uses syndrome voting to achieve far higher accuracy on topological quantum codes while reducing reliance on expensive global decoders.
-
Hardware-in-the-Loop Syndrome-to-Decoder Validation for Repetition, Surface, CSS-LDPC, and Digitized-GKP Codes
A four-branch syndrome-to-decoder validation shows repetition and Steane CSS codes preserve intended syndromes on IBM hardware, while a distance-five surface-code Z-check layer is overwhelmed by routing noise and a Pe...
-
Decoder Dependence in Surface-Code Threshold Estimation under Digitized Hybrid Continuous-Variable and Discrete Noise
Under a matched LiDMaS+ protocol, matching-style decoding yields higher Pauli-reference thresholds than Union-Find, while hybrid CV-discrete crossings remain grid- and estimator-sensitive and require fallback diagnostics.
Discussion (0). Continue with ORCID to comment.