{
  "abstract": "Despite significant progress on quantum low-density parity-check (qLDPC) codes, building qLDPC processors that are high-rate, high-throughput, hardware-friendly, and fast-to-decode remains a challenge. We introduce mitten codes, a family of qLDPC processor codes of encoding rate $20\\%$ and check weight $9$, based on non-abelian groups. Their non-abelian structure evades distance bounds constraining abelian counterparts, allowing mitten codes to reach distance $18$ and beyond with just a few hundred data qubits. The logical operators of a mitten code are related by the group action, yielding a modular, low-overhead logical toolkit: full Clifford operations follow from bridging two reusable seed surgery gadgets or from a single fixed extractor. Furthermore, qLDPC processors based on mitten codes support high-rate surgery that executes many logical measurements in parallel, and parallel magic-state injection into all logical qubits at once. Under circuit-level noise, with our fast decoder, the $[\\![300,60,14]\\!]$ mitten code achieves, without extrapolation, a block logical error rate of ${\\sim}10^{-11}$ per round at $0.1\\%$ physical error rate (PER), while the $[\\![ 975,195,\\leq 24 ]\\!]$ code reaches ${\\sim}10^{-8}$ at $0.4\\%$ PER. Decoding $15$ billion surgery experiments on the $[\\![540,108,18]\\!]$ code at $0.1\\%$ PER, we observe only two logical failures, demonstrating a qLDPC processor capable of running ${\\sim}10^{10}$ logical operations. Our decoder is compatible with sub-millisecond average latency per logical cycle, sufficient for real-time decoding on neutral atom hardware. Discovered by an end-to-end design pipeline built on sQetch, a distance estimator orders of magnitude faster than existing tools, and mapping efficiently onto near-term neutral atom and superconducting hardware, mitten codes open a practical path toward fault-tolerant quantum computation.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2607.28795",
  "author_total": 9,
  "authors": [
    {
      "name": "Aditya Bhardwaj"
    },
    {
      "name": "Muzhou Ma"
    },
    {
      "name": "Nadine Meister"
    },
    {
      "name": "Robbie King"
    },
    {
      "name": "Dolev Bluvstein"
    },
    {
      "name": "John Preskill"
    },
    {
      "name": "Madelyn Cain"
    },
    {
      "name": "Qian Xu"
    },
    {
      "name": "Hsin-Yuan Huang"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/16pd3narsr60g.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2607.28795",
  "fulltext_url": null,
  "id": "16pd3narsr60g",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2607.28795",
  "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",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7172289534",
  "pdf_url": "https://arxiv.org/pdf/2607.28795",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-02",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/16pd3narsr60g.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:26:45Z",
      "native_id": "2607.28795",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2607.28795"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "High-rate qLDPC processors",
  "title_text": "High-rate qLDPC processors",
  "type": "preprint",
  "updated_at": "2026-10-30T12:26:45Z",
  "url": "https://research.draconitic.com/paper/16pd3narsr60g",
  "venue": "arXiv",
  "versions": []
}