{
  "abstract": "We benchmark the Iterative Redecode Scheme (IRS) on fast transversal Clifford circuits, achieving high-accuracy correlated decoding using local memory-style detectors and decoders. On a deep random Clifford benchmark, IRS yields approximately $4\\times$ lower logical failure rates than the ghost protocol at $d=11$ with matched buffers, and $15\\times$ lower rates than logical observable matching (LOM). In three-block GHZ preparation, IRS achieves $2\\times$ lower logical error rates than reliable logical Pauli-product decoding with matched initialisation, improving to $25\\times$ at $d=19$ with $\\lceil d/2\\rceil$ full initialisation rounds. We place IRS, which builds on Wan et al.'s scheme, within a broader propagation-assisted local (PAL) framework, where local decoders exchange messages rather than decoding a global hypergraph. IRS alternates local minimum-weight perfect matching (MWPM) on memory-equivalent detector error models (DEMs) with Pauli-frame propagation and detector updates across transversal CNOT layers, seeking local error estimates consistent with the global detector record. Prior-informed DEMs account for probabilities of propagated errors missing from the memory-equivalent model, improving initial decoding and reducing logical error rates. Zero-weight physical Pauli mechanisms enable inference and propagation of initially indeterminate stabilizer outcomes. Error rates saturate after a few iterations even for deep, adversarial alternating-tCNOT circuits, allowing iteration caps with negligible loss of accuracy. We find syndrome-extraction buffers of order $\\lfloor d/4\\rfloor$ sufficient for distance-dependent error suppression in the demanding regimes studied. The approach extends to other local decoders and CSS codes; for repeated logical $S$ gates, IRS achieves approximately $4$ to $10\\times$ lower logical error rates than LOM, depending on initialisation.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.26784",
  "author_total": 5,
  "authors": [
    {
      "name": "Mark Webber"
    },
    {
      "name": "Simanraj Sadana"
    },
    {
      "name": "Matthew A. Lane"
    },
    {
      "name": "Lucy Jade Robson"
    },
    {
      "name": "Anthony O'Rourke"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/cb3fc02cp857x.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.26784",
  "fulltext_url": null,
  "id": "cb3fc02cp857x",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.26784",
  "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": "W7222996088",
  "pdf_url": "https://arxiv.org/pdf/2610.26784",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-19",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/cb3fc02cp857x.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:30:52Z",
      "native_id": "2610.26784",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.26784"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "High-Accuracy Propagation-Assisted Local Decoding for Fast Transversal Clifford Circuits",
  "title_text": "High-Accuracy Propagation-Assisted Local Decoding for Fast Transversal Clifford Circuits",
  "type": "preprint",
  "updated_at": "2026-10-30T12:33:41Z",
  "url": "https://research.draconitic.com/paper/cb3fc02cp857x",
  "venue": "arXiv",
  "versions": []
}