|
| related topics |
| {error, code, errors} |
| {qubit, qubits, gate} |
|
Accuracy threshold for postselected quantum computation
Panos Aliferis, Daniel Gottesman, John Preskill
abstract: We prove an accuracy threshold theorem for fault-tolerant quantum computation
based on error detection and postselection. Our proof provides a rigorous
foundation for the scheme suggested by Knill, in which preparation circuits for
ancilla states are protected by a concatenated error-detecting code and the
preparation is aborted if an error is detected. The proof applies to
independent stochastic noise but (in contrast to proofs of the quantum accuracy
threshold theorem based on concatenated error-correcting codes) not to
strongly-correlated adversarial noise. Our rigorously established lower bound
on the accuracy threshold, 1.04 \times 10^{-3}, is well below Knill's numerical
estimates.
- oai_identifier:
- oai:arXiv.org:quant-ph/0703264
- categories:
- quant-ph
- comments:
- 54 pages, 26 figures, uses qic.sty. (v2): minor revisions
- arxiv_id:
- quant-ph/0703264
- journal_ref:
- Quant. Inf. Comput. 8 (2008) 181-244
- report_no:
- CALT-68-2616
- created:
- 2007-03-28
- updated:
- 2007-09-17
Full article ▸
|
|
| related documents |
| 0701037v2 |
| 0701065v2 |
| 0701007v2 |
| 0702059v3 |
| 0702212v1 |
| 0703099v5 |
| 0611225v2 |
| 0701079v1 |
| 0612033v1 |
| 0703193v2 |
| 0701198v1 |
| 0612123v2 |
| 0701054v1 |
| 0702143v1 |
| 0702270v1 |
| 0702140v1 |
| 0703220v1 |
| 0612052v2 |
| 0703124v2 |
| 0702033v1 |
| 0701018v2 |
| 0703019v1 |
| 0703061v1 |
| 0701200v3 |
| 0702165v2 |
|