Fault-Tolerant Postselected Quantum Computation: Threshold Analysis

Simple item page
dc.creatorKnill, E.
dc.date2004-04-19
dc.date.accessioned2026-07-07T06:09:35Z
dc.date.available2026-07-07T06:09:35Z
dc.descriptionThe 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.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0404104
dc.identifierhttp://arxiv.org/abs/quant-ph/0404104
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92010
dc.subjectQuantum Physics
dc.titleFault-Tolerant Postselected Quantum Computation: Threshold Analysis
dc.typetext

Files

Collections

arXiv