REVIEW 3 cited by
Accuracy threshold for postselected quantum computation
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
Accuracy threshold for postselected quantum computation
read the original abstract
We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla states are protected by a concatenated error-detecting code and the preparation is aborted if an error is detected. The proof applies to independent stochastic noise but (in contrast to proofs of the quantum accuracy threshold theorem based on concatenated error-correcting codes) not to strongly-correlated adversarial noise. Our rigorously established lower bound on the accuracy threshold, 1.04 \times 10^{-3}, is well below Knill's numerical estimates.
Forward citations
Cited by 3 Pith papers
-
Syndrome aware mitigation of logical errors
Conditioning logical error mitigation on the measured error-correcting syndromes cuts sampling overhead exponentially and can make error correction useful above its standard pseudo-threshold.
-
Machine-learned syndrome post-selection for reliable quantum error correction
Syndrome-only supervised learning can post-select quantum error correction runs, matching syndrome-weight filtering on simulations and outperforming it on experimental magic-state distillation data.
-
Neural network decoder confidence as a learned proxy for the logical gap
GNN decoder logit outperforms MWPM logical gap for post-selection, yielding lower logical error rates on surface code syndromes under circuit-level noise.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.