Hierarchical decoding to reduce hardware requirements for quantum computing

Abstract

Extensive quantum error correction is necessary in order to scale quantum hardware to the regime of practical applications. As a result, a significant amount of decoding hardware is necessary to process the colossal amount of data required to constantly detect and correct errors occurring over the millions of physical qubits driving the computation. The implementation of a recent highly optimized version of Shor's algorithm to factor a 2,048-bits integer would require more 7 TBit/s of bandwidth for the sole purpose of quantum error correction and up to 20,000 decoding units. To reduce the decoding hardware requirements, we propose a fault-tolerant quantum computing architecture based on surface codes with a cheap hard-decision decoder, the lazy decoder, combined with a sophisticated decoding unit that takes care of complex error configurations. Our design drops the decoding hardware requirements by several orders of magnitude assuming that good enough qubits are provided. Given qubits and quantum gates with a physical error rate $p=10^{-4}$, the lazy decoder drops both the bandwidth requirements and the number of decoding units by a factor 50x. Provided very good qubits with error rate $p=10^{-5}$, we obtain a 1,500x reduction in bandwidth and decoding hardware thanks to the lazy decoder. Finally, the lazy decoder can be used as a decoder accelerator. Our simulations show a 10x speed-up of the Union-Find decoder and a 50x speed-up of the Minimum Weight Perfect Matching decoder.

8 pages, 6 figures

Cited by in corpus (11)

• OpenQASM 3: A broader and deeper quantum assembly language
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
• Scalable Neural Decoder for Topological Surface Codes
• Techniques for combining fast local decoders with global decoders under circuit-level noise
• General tensor network decoding of 2D Pauli codes
• A cellular automaton decoder for a noise-bias tailored color code
• ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing
• Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction
• Synchronization for Fault-Tolerant Quantum Computers
• Managing Classical Processing Requirements for Quantum Error Correction