REVIEW 1 cited by
Fault-Tolerant Quantum Computation with Local Gates
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
Signed reviews
read the original abstract
I discuss how to perform fault-tolerant quantum computation with concatenated codes using local gates in small numbers of dimensions. I show that a threshold result still exists in three, two, or one dimensions when next-to-nearest-neighbor gates are available, and present explicit constructions. In two or three dimensions, I also show how nearest-neighbor gates can give a threshold result. In all cases, I simply demonstrate that a threshold exists, and do not attempt to optimize the error correction circuit or determine the exact value of the threshold. The additional overhead due to the fault-tolerance in both space and time is polylogarithmic in the error rate per logical gate.
Forward citations
Cited by 1 Pith paper
-
The Utility of Sparse Error Detection in Quantum Simulations
Sparse error detection in small Iceberg codes reduces systematic errors in simulated Schwinger-model observables under depolarizing noise, with diminishing returns after a few detection layers.
Discussion (0). Continue with ORCID to comment.