Multivariate bicycle codes

Quantum error correction suppresses noise in quantum systems to allow for high-precision computations. In this Letter, we introduce multivariate bicycle quantum low-density parity-check (QLDPC) codes, via an extension of the framework developed by Bravyi [S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, ], and particularly focus on trivariate bicycle (TB) codes. Unlike the weight-6 codes proposed in their study, we offer concrete examples of weight-5 TB-QLDPC codes which promise to be more amenable to near-term experimental setups. We show that TB-QLDPC codes up to weight 6 have a biplanar structure and often possess a two-dimensional toric layout. Under circuit level noise, we find substantially better encoding rates than comparable surface codes while offering similar error suppression capabilities. For example, we can encode four logical qubits with distance 5 into 60 physical qubits using weight-5 check measurements of circuit depth 7, while a surface code with these parameters requires 200 physical qubits. The high encoding rate and compact layout make our codes highly suitable candidates for near-term hardware implementations, paving the way for a realizable quantum error correction protocol.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-06-06
DOI
https://doi.org/10.1103/ll5p-z88p
Citations
5
Primary Topic
Advanced Statistical Process Monitoring
Type
article
Field-Weighted Citation Impact
6.99
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multivariate bicycle codes

Tobias Haug, Kishor Bharti, Sim Jian Xian, Karl J. Friston
5 citations
Physical review. A/Physical review, A
Advanced Statistical Process Monitoring
6.99
article

Multivariate bicycle codes

Tobias Haug, Kishor Bharti, Sim Jian Xian, Karl J. Friston
article en
5 citations

Abstract

Quantum error correction suppresses noise in quantum systems to allow for high-precision computations. In this Letter, we introduce multivariate bicycle quantum low-density parity-check (QLDPC) codes, via an extension of the framework developed by Bravyi [S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, ], and particularly focus on trivariate bicycle (TB) codes. Unlike the weight-6 codes proposed in their study, we offer concrete examples of weight-5 TB-QLDPC codes which promise to be more amenable to near-term experimental setups. We show that TB-QLDPC codes up to weight 6 have a biplanar structure and often possess a two-dimensional toric layout. Under circuit level noise, we find substantially better encoding rates than comparable surface codes while offering similar error suppression capabilities. For example, we can encode four logical qubits with distance 5 into 60 physical qubits using weight-5 check measurements of circuit depth 7, while a surface code with these parameters requires 200 physical qubits. The high encoding rate and compact layout make our codes highly suitable candidates for near-term hardware implementations, paving the way for a realizable quantum error correction protocol.

Physical review. A/Physical review, AVol. 111(6)
Agency for Science, Technology and Research (SG), Centre for Quantum Technologies (SG), Singapore University of Technology and Design (SG), National University of Singapore (SG), Universität Ulm (DE), Institute of High Performance Computing (SG), Yale-NUS College (SG), Technology Innovation Institute (AE), Université Bourgogne Franche-Comté (FR)
Openalex Percentile: Top 3%
Advanced Statistical Process Monitoring
6.99
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.