Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture
Nitish Kumar Chandra, Eneet Kaur, Reza Nejabati, Kaushik P. Seshadreesan

TL;DR
This paper explores implementing bivariate bicycle quantum error correction codes in a modular quantum computing architecture interconnected via shared entanglement, analyzing their performance under realistic noise conditions.
Contribution
It demonstrates how to realize distributed BB codes across multiple processors with shared entanglement, providing architectural insights and performance analysis.
Findings
Distributed BB codes can be partitioned across multiple processors.
Logical error rates depend on the number of processors and nonlocal noise.
Monte Carlo simulations show feasible fault tolerance in modular architectures.
Abstract
Quantum low density parity check (qLDPC) codes, particularly bivariate bicycle (BB) codes, achieve competitive fault tolerance thresholds while offering substantially higher encoding rates than planar surface codes. However, their intrinsically long-range stabilizer structure makes them difficult to implement on monolithic devices with nearest neighbor connectivity and limited qubit capacity. In this work, we study the realization of a BB code in a modular multiprocessor architecture, where quantum processors are interconnected through shared Bell pairs. We consider processors with all to all internal connectivity, which is feasible on trapped ion and neutral atom platforms, enabling flexible local gate execution while inter-processor (nonlocal) gates are mediated by shared entanglement. We describe a star network architecture that can realize this distributed setting. We partition 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.
