Fully fault tolerant quantum computation with non-deterministic gates

Understand

In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail.

• For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should assumed to be failure prone.
• In the logical limit of this architecture each component contains only one qubit.
• Here we derive thresholds for fault tolerant quantum computation under such extreme paradigms.