Threshold Accuracy for Quantum Computation
| dc.creator | Knill, E. | |
| dc.creator | Laflamme, R. | |
| dc.creator | Zurek, W. | |
| dc.date | 1996-10-08 | |
| dc.date | 1996-10-15 | |
| dc.date.accessioned | 2026-07-07T09:05:10Z | |
| dc.date.available | 2026-07-07T09:05:10Z | |
| dc.description | We have previously (quant-ph/9608012) shown that for quantum memories and quantum communication, a state can be transmitted over arbitrary distances with error $ε$ provided each gate has error at most $cε$. We discuss a similar concatenation technique which can be used with fault tolerant networks to achieve any desired accuracy when computing with classical initial states, provided a minimum gate accuracy can be achieved. The technique works under realistic assumptions on operational errors. These assumptions are more general than the stochastic error heuristic used in other work. Methods are proposed to account for leakage errors, a problem not previously recognized. | |
| dc.description | 20 pages. 10/15/96: Added references to threshold results by Aharanov and Ben-Or and by Kitaev | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9610011 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9610011 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/149627 | |
| dc.subject | Quantum Physics | |
| dc.title | Threshold Accuracy for Quantum Computation | |
| dc.type | text |