Coprime Bivariate Bicycle Codes and Their Layouts on Cold Atoms
Ming Wang, Frank Mueller

TL;DR
This paper introduces a new subclass of bivariate bicycle quantum error correction codes using coprimes, enabling pre-determined code rates and efficient layouts on cold atom arrays, leading to improved error correction performance.
Contribution
The work presents a novel coprime-based subclass of BB codes with predictable rates and optimized cold atom layouts, advancing quantum error correction methods.
Findings
Identified short to medium-length codes previously unknown.
Proposed layouts reduce atom move times and moves for syndrome extraction.
Simulations show significant error correction improvements with the new layout.
Abstract
Quantum computing is deemed to require error correction at scale to mitigate physical noise by reducing it to lower noise levels while operating on encoded logical qubits. Popular quantum error correction schemes include CSS code, of which surface codes provide regular mappings onto 2D planes suitable for contemporary quantum devices together with known transversal logical gates. Recently, qLDPC codes have been proposed as a means to provide denser encoding with the class of bivariate bicycle (BB) codes promising feasible design for devices. This work contributes a novel subclass of BB codes suitable for quantum error correction. This subclass employs {\em coprimes} and the product of the two generating variables and to construct polynomials, rather than using and separately as in vanilla BB codes. In contrast to vanilla BB codes, where parameters remain unknown…
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.
