Distributed Realization of Color Codes for Quantum Error Correction

Abstract

Color codes are a leading class of topological quantum error-correcting codes with modest error thresholds and structural compatibility with two-dimensional architectures, which make them well-suited for fault-tolerant quantum computing (FTQC). Here, we propose and analyze a distributed architecture for realizing the (6.6.6) color code. The architecture involves interconnecting patches of the color code housed in different quantum processing units (QPUs) via entangled pairs. To account for noisy interconnects, we model the qubits in the color code as being subject to a bit-flip noise channel, where the qubits on the boundary (seam) between patches experience elevated noise compared to those in the bulk. We investigate the error threshold of the distributed color code under such asymmetric noise conditions by employing two decoders: a tensor-network-based decoder and a recently introduced concatenated Minimum Weight Perfect Matching (MWPM) algorithm. Our simulations demonstrate that elevated noise on seam qubits leads to a slight reduction in threshold for the tensor-network decoder, whereas the concatenated MWPM decoder shows no significant change in the error threshold, underscoring its effectiveness under asymmetric noise conditions. Our findings thus highlight the robustness of color codes in distributed architectures and provide valuable insights into the practical realization of FTQC involving noisy interconnects between QPUs.

References in corpus (23)

• Quantum Error Correction for Quantum Memories
• Suppressing quantum errors by scaling a surface code logical qubit
• Quantum algorithms: an overview
• Topological Quantum Distillation
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Tailoring surface codes for highly biased noise
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Decoding color codes by projection onto surface codes
• Tensor Networks and Quantum Error Correction
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Decoding algorithms for surface codes
• Ultrafast Fault-Tolerant Long-Distance Quantum Communication with Static Linear Optics
• Thresholds for the distributed surface code in the presence of memory decoherence
• Tensor Network Decoding Beyond 2D
• Color code decoder with improved scaling for correcting circuit-level noise
• Local tensor-network codes
• Improving threshold for fault-tolerant color code quantum computing by flagged weight optimization
• Low-overhead quantum computing with the color code
• Network Operations Scheduling for Distributed Quantum Computing
• Distributed quantum error correction based on hyperbolic Floquet codes