Resilient Quantum Computation

Emanuel Knill; Raymond Laflamme; Wojciech H. Zurek

doi:10.1126/science.279.5349.342

Abstract

Practical realization of quantum computers will require overcoming decoherence and operational errors, which lead to problems that are more severe than in classical computation. It is shown that arbitrarily accurate quantum computation is possible provided that the error per operation is below a threshold value.

Keywords

ComputationRealization (probability)Quantum computerQuantum decoherenceQuantum error correctionComputer scienceQuantumValue (mathematics)AlgorithmTheoretical computer scienceStatistical physicsPhysicsQuantum mechanicsMathematicsStatistics

Affiliated Institutions

Los Alamos National Laboratory US

Related Publications

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

Threshold Estimate for Fault Tolerant Quantum Computation

Christof Zalka

I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channe...

1996 arXiv (Cornell University) 40 citations

Threshold Accuracy for Quantum Computation

Emanuel Knill , Raymond Laflamme , Wojciech H. Zurek

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

1996 arXiv (Cornell University) 107 citations

Multiparticle entanglement purification for two-colorable graph states

Hans Aschauer , Wolfgang Dür , Hans J. Briegel

We investigate multiparticle entanglement purification schemes which allow\none to purify all two colorable graph states, a class of states which includes\ne.g. cluster states, ...

2005 Physical Review A 131 citations

Quantum Computers, Factoring, and Decoherence

Isaac L. Chuang , Raymond Laflamme , Peter W. Shor +1 more

It is known that quantum computers can dramatically speed up the task of finding factors of large numbers, a problem of practical significance for cryptographic applications. Fa...

1995 Science 281 citations

Publication Info

Year: 1998
Type: article
Volume: 279
Issue: 5349
Pages: 342-345
Citations: 620
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

Resilient Quantum Computation

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

620

OpenAlex

Cite This

APA Style

                            
                                    Emanuel Knill, 
                                
                                    Raymond Laflamme, 
                                
                                    Wojciech H. Zurek
                                
                            (1998). 
                            Resilient Quantum Computation. 
                            Science
                            , 279
                            (5349)
                            , 342-345.
                            https://doi.org/10.1126/science.279.5349.342

Identifiers

DOI: 10.1126/science.279.5349.342