{
  "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.35282",
  "author_total": 4,
  "authors": [
    {
      "name": "Yuan Yao"
    },
    {
      "name": "Ruipeng Xing"
    },
    {
      "name": "Jianshuo Gao"
    },
    {
      "name": "Xiao Yuan"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/1v2n8rtmvkd4s.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.35282",
  "fulltext_url": null,
  "id": "1v2n8rtmvkd4s",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.35282",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7214739200",
  "pdf_url": "https://arxiv.org/pdf/2609.35282",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-28",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/1v2n8rtmvkd4s.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:12Z",
      "native_id": "2609.35282",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.35282"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Circuit-level benchmarks of GKP-concatenated qLDPC Codes",
  "title_text": "Circuit-level benchmarks of GKP-concatenated qLDPC Codes",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:12Z",
  "url": "https://research.draconitic.com/paper/1v2n8rtmvkd4s",
  "venue": "arXiv",
  "versions": []
}