Distributed Realization of Color Codes for Quantum Error Correction
Nitish Kumar Chandra, David Tipper, Reza Nejabati, Eneet Kaur, Kaushik P. Seshadreesan

TL;DR
This paper proposes a distributed architecture for implementing the (6.6.6) color code in quantum computing, analyzing its error thresholds under noisy interconnects using two decoding methods.
Contribution
It introduces a distributed realization of color codes with analysis of error thresholds under asymmetric noise, demonstrating robustness with two decoding strategies.
Findings
Elevated seam qubit noise slightly reduces tensor-network decoder threshold.
Concatenated MWPM decoder maintains stable error threshold under asymmetric noise.
Distributed color code architecture is robust against noisy interconnects.
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…
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.
