Abstract

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.

Keywords

ComputationQuantumComputer scienceQuantum computerAlgorithmPhysicsQuantum mechanics

Related Publications

Concatenated Quantum Codes

Emanuel Knill , Raymond Laflamme

One of the main problems for the future of practical quantum computing is to stabilize the computation against unwanted interactions with the environment and imperfections in th...

1996 arXiv (Cornell University) 62 citations

Fault-tolerant quantum computation

John Preskill

The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors...

1997 arXiv (Cornell University) 124 citations

Publication Info

Year
1996
Type
preprint
Citations
107
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

107
OpenAlex

Cite This

Emanuel Knill, Raymond Laflamme, Wojciech H. Zurek (1996). Threshold Accuracy for Quantum Computation. arXiv (Cornell University) . https://doi.org/10.48550/arxiv.quant-ph/9610011

Identifiers

DOI
10.48550/arxiv.quant-ph/9610011

Data Quality

Data completeness: 77%