Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
Quantum Physics
2007-05-23 v1
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.
Cite
@article{arxiv.quant-ph/0404104,
title = {Fault-Tolerant Postselected Quantum Computation: Threshold Analysis},
author = {E. Knill},
journal= {arXiv preprint arXiv:quant-ph/0404104},
year = {2007}
}
Comments
21 pages