arXiv:2609.35282
Circuit-level benchmarks of GKP-concatenated qLDPC Codes
Yuan Yao, Ruipeng Xing, Jianshuo Gao, Xiao Yuan
Abstract
Scalable fault-tolerant quantum error correction based on Gottesman-Kitaev-Preskill (GKP) codes requires finite-rate outer codes that can exploit analog GKP information under realistic circuit noise. However, quantum low-density parity-check (qLDPC) outer codes have not been systematically compared as candidates for circuit-level GKP concatenation. Here, we benchmark BB and tricycle codes using a unified simulation framework that progresses from code-capacity noise to repeated noisy syndrome extraction and schedule-resolved displacement propagation. Across all three noise models, analog-informed belief-propagation with ordered-statistics decoding (BP-OSD) yields higher finite-size crossing estimates than hard-decision decoding. In the full circuit model, the analog-informed crossings are \(σ_{\mathrm{th}}\simeq0.212\) for the selected BB sequence and \(0.142\) for the tricycle sequence, corresponding to squeezing requirements of approximately \(10.46\,\mathrm{dB}\) and \(13.94\,\mathrm{dB}\), respectively. These results show that analog GKP information continues to improve decoding under circuit-level noise. Under the common simulation assumptions used here, the selected BB sequence also yields a higher finite-size crossing estimate than the selected tricycle sequence.
AI Summary
The paper asks how outer-code choice and analog GKP reliability information affect GKP-concatenated qLDPC performance once noisy syndrome extraction and displacement propagation are included. It compares three bivariate bicycle (BB) instances, with block lengths 18–144, against three tricycle instances, with block lengths 48–108, using a common CSS-matrix simulation interface and BP–OSD decoder. The simulations progress through independent Gaussian code-capacity noise, variance aggregation with three noisy syndrome rounds, and schedule-resolved circuit noise with six noisy rounds. The last model propagates continuous displacements through scheduled SUM gates and includes ancilla, gate, measurement, data, and idle noise. Hard-decision and analog-informed decoding use the same sampled realizations; performance is measured by word logical failure and finite-size curve crossings. Analog-informed crossing estimates are $\sigma\simeq(0.556,0.369,0.212)$ for BB and $(0.500,0.349,0.142)$ for tricycle across the three models. Under circuit noise, hard-decision crossings are 0.198 and 0.130, respectively. The analog circuit crossings correspond to equivalent squeezing levels of 10.46 dB and 13.94 dB. Thus, analog information improves crossings in every tested setting, while the selected BB sequence has higher analog crossings throughout. These are finite-length, finite-duration benchmarks, not asymptotic thresholds: the sequences differ in length, rate, and distance, and round counts do not scale with distance. Inner GKP correction is idealized; decoding uses local marginal priors calibrated on BB circuits and transferred unchanged to tricycle circuits. Schedule optimization, correlation-aware decoding, and hardware-specific resource accounting remain outside the study.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.