REVIEW 3 cited by
Multivariate Bicycle Codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Quantum error correction suppresses noise in quantum systems to allow for high-precision computations. In this work, we introduce Multivariate Bicycle (MB) Quantum Low-Density Parity-Check (QLDPC) codes, via an extension of the framework developed by Bravyi et al. [Nature, 627, 778-782 (2024)] 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 bi-planar structure and often posses 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 $4$ 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.
Forward citations
Cited by 3 Pith papers
-
Logical Spectroscopy: Lifted-Product Codes with Addressable Bases
Logical spectroscopy decomposes Abelian lifted-product codes into Frobenius packets, builds a complete addressable conjugate logical basis by finite-field algebra plus idempotent lifts, and supplies design diagnostics...
-
Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search
A polynomial-gcd reformulation of bicycle quantum LDPC codes enables an exact-distance search that finds [[66,20,7]] with kd^2/n=14.85 and proves an n=48 exclusion result.
-
Distributed fault-tolerant quantum memories over a 2xL array of qubit modules
BB codes can be measured with constant-depth syndrome extraction in a 2 by L module array with a cyclic shift, and the 144-qubit BB code reaches simulated logical error rates below 2e-6 at physical error rate 1e-3.
Discussion (0). Continue with ORCID to comment.