Concatenated Quantum Codes
Emanuel Knill, Raymond Laflamme

TL;DR
This paper introduces a method using concatenated quantum codes with hierarchical recovery to improve quantum memory and communication reliability, requiring only gates with errors proportional to the desired accuracy, independent of storage duration or transmission distance.
Contribution
It proposes a novel concatenated quantum coding scheme with hierarchical recovery that reduces error requirements for quantum storage and transmission.
Findings
Error requirement scales linearly with desired accuracy
Overhead is polynomial in storage time and transmission distance
Provides bounds for the constant c in error scaling
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 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
