Accuracy threshold for postselected quantum computation

dc.creatorAliferis, Panos
dc.creatorGottesman, Daniel
dc.creatorPreskill, John
dc.date2007-03-28
dc.date2007-09-17
dc.date.accessioned2026-07-07T09:23:26Z
dc.date.available2026-07-07T09:23:26Z
dc.descriptionWe 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.
dc.description54 pages, 26 figures, uses qic.sty. (v2): minor revisions
dc.identifierhttps://arxiv.org/abs/quant-ph/0703264
dc.identifierhttp://arxiv.org/abs/quant-ph/0703264
dc.identifierQuant. Inf. Comput. 8 (2008) 181-244
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155731
dc.subjectQuantum Physics
dc.titleAccuracy threshold for postselected quantum computation
dc.typetext

Files

Collections