Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction

Abstract

We investigate a family of fault-tolerant quantum error correction schemes based on the concatenation of small error detection or error correction codes with the three-dimensional cluster state. We propose fault-tolerant state preparation and decoding schemes that effectively convert every circuit-level error into an erasure error, leveraging the cluster state's high threshold against such errors. We find a set of codes for which such a conversion is possible, and study their performance against the standard circuit-level depolarizing model. Our best performing scheme, which is based on a concatenation with a classical code, improves the threshold by $16.5\%$ and decreases the spacetime overhead by $32\%$ compared to the scheme without concatenation, with each scheme subject to a physical error rate of $10^{-3}$ and achieving a logical error rate of $10^{-6}$.

arXiv comment11+3 pages, 9+12 figures

References in corpus (50)

• Fault-tolerant quantum computation by anyons
• Quantum Simulation
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Chemistry in the Age of Quantum Computing
• Quantum Computing with Very Noisy Devices
• Measurement-based quantum computation
• A Theory of Fault-Tolerant Quantum Computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological fault-tolerance in cluster state quantum computation
• A fault-tolerant one-way quantum computer
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• Almost-linear time decoding algorithm for topological codes
• Quantum error correction with only two extra qubits
• Magic State Distillation: Not as Costly as You Think
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
• Long-range quantum entanglement in noisy cluster states
• Efficient fault-tolerant quantum computing
• Fault-tolerant bosonic quantum error correction with the surface-GKP code
• High-threshold fault-tolerant quantum computation with analog quantum error correction
• Assessing the progress of trapped-ion processors towards fault-tolerant quantum computation
• Fault tolerant quantum computation with very high threshold for loss errors
• Quantum advantage with noisy shallow circuits in 3D
• Quantum Error Correction with the Toric-GKP Code
• Foliated Quantum Codes
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• Low overhead fault-tolerant quantum error correction with the surface-GKP code
• Fault-Tolerant Postselected Quantum Computation: Schemes
• Fault-tolerant quantum error correction for Steane's seven-qubit color code with few or no extra qubits
• Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
• Implementing Fault-tolerant Entangling Gates on the Five-qubit Code and the Color Code
• Scalable Neural Network Decoders for Higher Dimensional Quantum Codes
• Thresholds for universal concatenated quantum codes
• Topological code Autotune
• Universal fault-tolerant measurement-based quantum computation
• Fault-Tolerant Logical Gate Networks for CSS Codes
• High-threshold topological quantum error correction against biased noise
• A local pre-decoder to reduce the bandwidth and latency of quantum error correction
• Techniques for combining fast local decoders with global decoders under circuit-level noise
• Logical Error Rate Scaling of the Toric Code
• Generating Fault-Tolerant Cluster States from Crystal Structures
• Hierarchical decoding to reduce hardware requirements for quantum computing
• Quantum Error Correction with the GKP Code and Concatenation with Stabilizer Codes
• Polylog-overhead highly fault-tolerant measurement-based quantum computation: all-Gaussian implementation with Gottesman-Kitaev-Preskill code
• Measurement based fault tolerance beyond foliation
• Postselection threshold against biased noise
• Optimal Bacon-Shor codes

Cited by in corpus (4)

• Mitigating errors in logical qubits
• Classical product code constructions for quantum Calderbank-Shor-Steane codes
• Minimizing readout-induced noise for early fault-tolerant quantum computers
• Fault-tolerant Quantum Error Correction Using a Linear Array of Emitters