Fault tolerant quantum computation with nondeterministic gates

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....

Full description

Saved in:
Bibliographic Details
Published in:Physical review letters 2010-12, Vol.105 (25), p.250502-250502, Article 250502
Main Authors: Li, Ying, Barrett, Sean D, Stace, Thomas M, Benjamin, Simon C
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0031-9007
1079-7114
DOI:10.1103/PhysRevLett.105.250502