Networked Realization of Quantum LDPC Codes
Swayangprabha Shaw, Narayanan Rengaswamy

TL;DR
This paper explores the networked implementation of quantum LDPC codes, especially bivariate bicycle codes, to address practical challenges in fault-tolerant quantum computing.
Contribution
It introduces a networked approach for implementing better QLDPC codes, extending previous work on topological codes and analyzing their circuit-level noise performance.
Findings
Networked surface codes recreated in Stim with insights into noise performance.
Extension to bipartitions of bicycle codes using min-cut partitioning.
Comparison of networked and monolithic code performance through simulations.
Abstract
Quantum low-density parity-check (QLDPC) codes with good parameters are promising candidates for low-overhead fault-tolerant quantum computing, but their non-local stabilizers require long-range connectivity and frequent qubit movement, introducing practical challenges. Prior work has studied the networked implementation of topological codes, where each node only holds one or a few qubits of the entire code, and demonstrated competitive performance under practical constraints such as the quality of network-provided entanglement. However, since these codes are already geometrically local, such a networked setting might not be essential. In this work, we propose and study the networked implementation of better QLDPC codes, specifically bivariate bicycle codes due to their similarity to surface codes and the controlled amount of long-range connections in their stabilizers. We begin by…
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.
