REVIEW 2 cited by
Threshold Estimate for Fault Tolerant 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
read the original abstract
I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor (quant-ph/9505011) for fault tolerant error correction (FTEC) and the fault tolerant implementation of elementary operations on states encoded by the 7-qubit code. A simple computer simulation suggests a threshold for gate errors of the order \epsilon \approx 10^{-3} or better. I also give a simple argument that the threshold for memory errors is about 10 times smaller, thus \epsilon \approx 10^{-4}.
Forward citations
Cited by 2 Pith papers
-
Duality constrains optimal thresholds in quantum error correction
Zero-rate em-symmetric CSS codes are self-dual under generalized Kramers-Wannier duality, pinning their optimal code-capacity threshold (at leading order in a replica limit) to the zero-rate hashing bound p≈0.110.
-
Fire and ice: Partially fault-tolerant quantum computing with selective state filtering
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.
Discussion (0). Continue with ORCID to comment.