{
  "abstract": "Syndrome-measurement timing is usually treated as a fixed clock cycle of a quantum error-correcting code. For quantum memories, however, the inter-round interval is itself an optimizable control parameter: measuring too rarely allows idling errors to accumulate, whereas measuring too often introduces measurement-induced faults. We propose a phenomenological logical-noise model for this trade-off and analytically show that the optimal syndrome-measurement interval is inversely proportional to the code distance and that this produces an exponential reduction of logical-error rates in the distance relative to constant-interval schedules. Furthermore, for time-dependent idling noise, we develop an adaptive timing strategy based on the measured syndrome activity that outperforms every fixed-interval protocol, with largest gains for short but strong noise bursts. Simulations of rotated surface-code memories with matching decoding validate the phenomenological model, the distance-dependent optimum, and the adaptive-strategy improvement. Moreover, with the experimental noise parameters reported by Google in Nature 638 (2025), our model predicts reductions in logical-error rates per unit time of up to $40\\%$.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2608.06242",
  "author_total": 3,
  "authors": [
    {
      "name": "Tobias Haug"
    },
    {
      "name": "Kishor Bharti"
    },
    {
      "name": "Leandro Aolita"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/9vtb1r859a72k.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2608.06242",
  "fulltext_url": null,
  "id": "9vtb1r859a72k",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2608.06242",
  "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": "W7201845412",
  "pdf_url": "https://arxiv.org/pdf/2608.06242",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/9vtb1r859a72k.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:48Z",
      "native_id": "2608.06242",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2608.06242"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Exponential logical-error reduction in quantum memories via optimal syndrome-measurement timing",
  "title_text": "Exponential logical-error reduction in quantum memories via optimal syndrome-measurement timing",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:48Z",
  "url": "https://research.draconitic.com/paper/9vtb1r859a72k",
  "venue": "arXiv",
  "versions": []
}