title: Fault tolerant quantum computation with nondeterministic gates.
abstract: In certain approaches to quantum computing the operations between qubits are nondeterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should be assumed to be failure prone. In the ultimate limit of this architecture each component contains only one qubit. Here we derive thresholds for fault-tolerant quantum computation under this extreme paradigm. We find that computation is supported for remarkably high failure rates (exceeding 90%) providing that failures are heralded; meanwhile the rate of unknown errors should not exceed 2 in 10(4) operations.
authors.affiliation: Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore.
authors.forename: Ying
authors.initials: Y
authors.lastname: Li
authors.forename: Sean D
authors.initials: SD
authors.lastname: Barrett
authors.forename: Thomas M
authors.initials: TM
authors.lastname: Stace
authors.forename: Simon C
authors.initials: SC
authors.lastname: Benjamin