{
  "abstract": "High-rate quantum low-density parity-check (qLDPC) codes are a leading candidate for fault-tolerant quantum computing. They feature higher encoding rates than planar alternatives such as the surface code, but their implementation often entails significant hardware hurdles like the need for long-range couplers. We leverage the flexibility of a trapped-ion quantum computer to demonstrate nine quantum error-correcting codes with starkly different qubit connectivity requirements on a single device without any hardware reconfiguration. These experiments span three families of quantum error-correcting codes: qLDPC codes, topological codes, and concatenated codes. With a qLDPC code encoding 4 logical qubits into 18 physical qubits, we achieve a logical error rate up to $9\\times$ better than a previous demonstration of a similar code on superconducting solid-state qubits. Moreover, our implementation exhibits breakeven performance, with some instances achieving qubit lifetimes comparable to or slightly exceeding that of our trapped-ion qubits. We use a novel implementation of the optical-metastable-ground (OMG) architecture for addressable mid-circuit measurement and reset, which enables us to perform these experiments without any ion transport or dedicated coolant ions, requirements that typically consume a large fraction of the runtime or ion count of trapped-ion quantum computers.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2606.06455",
  "author_total": 11,
  "authors": [
    {
      "name": "Edwin Tham"
    },
    {
      "name": "Michael L. Goldman"
    },
    {
      "name": "Shantanu Debnath"
    },
    {
      "name": "Ashay N. Patel"
    },
    {
      "name": "Jyothi Saraladevi"
    },
    {
      "name": "Jason Nguyen"
    },
    {
      "name": "Erik Nielsen"
    },
    {
      "name": "Neal Pisenti"
    },
    {
      "name": "Kenneth Wright"
    },
    {
      "name": "John Gamble"
    },
    {
      "name": "Nicolas Delfosse"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/cb1zcfmzmaybf.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2606.06455",
  "fulltext_url": null,
  "id": "cb1zcfmzmaybf",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2606.06455",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7163637811",
  "pdf_url": "https://arxiv.org/pdf/2606.06455",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-14",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/cb1zcfmzmaybf.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:21:25Z",
      "native_id": "2606.06455",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2606.06455"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    },
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Breakeven demonstration of quantum low-density parity-check codes",
  "title_text": "Breakeven demonstration of quantum low-density parity-check codes",
  "type": "preprint",
  "updated_at": "2026-10-30T12:21:29Z",
  "url": "https://research.draconitic.com/paper/cb1zcfmzmaybf",
  "venue": "arXiv",
  "versions": []
}