Abstract
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 the applied operations. Existing proposals for quantum memories and quantum channels require gates with asymptotically zero error to store or transmit an input quantum state for arbitrarily long times or distances with fixed error. In this report a method is given which has the property that to store or transmit a qubit with maximum error $ε$ requires gates with error at most $cε$ and storage or channel elements with error at most $ε$, independent of how long we wish to store the state or how far we wish to transmit it. The method relies on using concatenated quantum codes with hierarchically implemented recovery operations. The overhead of the method is polynomial in the time of storage or the distance of the transmission. Rigorous and heuristic lower bounds for the constant $c$ are given.
Keywords
Concatenated error correction codeQuantumComputer sciencePhysicsBlock codeAlgorithmQuantum mechanicsDecoding methods
Related Publications
Concatenated quantum codes
One main problem for the future of practial quantum computing is to stabilize the computation against unwanted interactions with the environment and imperfections in the applied...
Threshold Estimate for Fault Tolerant Quantum Computation
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...
Threshold Accuracy for Quantum Computation
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...
Fault Tolerant Quantum Computation with Constant Error
Recently Shor showed how to perform fault tolerant quantum computation when the error probability is logarithmically small. We improve this bound and describe fault tolerant qua...
A recursive approach to low complexity codes
A method is described for constructing long error-correcting codes from one or more shorter error-correcting codes, referred to as subcodes, and a bipartite graph. A graph is sh...
Publication Info
- Year
- 1996
- Type
- preprint
- Citations
- 62
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
62
OpenAlex
Cite This
Emanuel Knill,
Raymond Laflamme
(1996).
Concatenated Quantum Codes.
arXiv (Cornell University)
.
https://doi.org/10.48550/arxiv.quant-ph/9608012
Identifiers
- DOI
- 10.48550/arxiv.quant-ph/9608012