Please use this identifier to cite or link to this item:
|Title:||Fault tolerant quantum computation with nondeterministic gates|
|Source:||Li, Y., Barrett, S.D., Stace, T.M., Benjamin, S.C. (2010-12-14). Fault tolerant quantum computation with nondeterministic gates. Physical Review Letters 105 (25) : -. ScholarBank@NUS Repository. https://doi.org/10.1103/PhysRevLett.105.250502|
|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 104 operations. © 2010 The American Physical Society.|
|Source Title:||Physical Review Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 22, 2018
WEB OF SCIENCETM
checked on Jan 22, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.