Fault-Tolerant Postselected Quantum Computation: Threshold Analysis

TL;DR

This paper analyzes fault-tolerant postselected quantum computation schemes to determine their error thresholds, suggesting scalability is possible with errors above 1% per gate if communication delays are negligible.

Contribution

It provides a threshold analysis of existing fault-tolerant postselected quantum computation schemes using computer-assisted heuristics.

Findings

Scalable quantum computation possible with >1% error rate per gate

Negligible communication delays are critical for scalability

Heuristic analysis supports fault-tolerance thresholds

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.