Fault-Tolerant Thresholds for Encoded Ancillae with Homogeneous Errors

Abstract

I describe a procedure for calculating thresholds for quantum computation as a function of error model given the availability of ancillae prepared in logical states with independent, identically distributed errors. The thresholds are determined via a simple counting argument performed on a single qubit of an infinitely large CSS code. I give concrete examples of thresholds thus achievable for both Steane and Knill style fault-tolerant implementations and investigate their relation to threshold estimates in the literature.

14 pages, 5 figures, 3 tables; v2 minor edits, v3 completely revised, submitted to PRA

References in corpus (3)

• Local Fault-tolerant Quantum Computation
• Improved ancilla preparation scheme increases fault-tolerant threshold
• New Limits on Fault-Tolerant Quantum Computation

Cited by in corpus (4)

• Entanglement Purification with Double Selection
• Topological One-Way Quantum Computation on Verified Logical Cluster States
• Cluster-based architecture for fault-tolerant quantum computation
• Error Channels and the Threshold for Fault-tolerant Quantum Computation