Recognition: unknown
Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
read the original abstract
The schemes for fault-tolerant postselected quantum computation given in [Knill, Fault-Tolerant Postselected Quantum Computation: Schemes, http://arxiv.org/abs/quant-ph/0402171] are analyzed to determine their error-tolerance. The analysis is based on computer-assisted heuristics. It indicates that if classical and quantum communication delays are negligible, then scalable qubit-based quantum computation is possible with errors above 1% per elementary quantum gate.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Simplified circuit-level decoding using Knill error correction
Knill error correction reduces circuit-level decoding for quantum LDPC codes to the simpler code-capacity decoder while remaining fault-tolerant under locally decaying noise.
-
Local distillation from Reed Muller codes unfolding
Local 2D and 3D Reed-Muller distillation factories achieve output infidelities down to 8.256e-9 for CCZ states and 1.1811e-17 for T states from 10^{-3} input infidelity.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.