  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.
