{
  "abstract": "Dynamic circuits, which augment unitary operations with mid-circuit measurements and classical feedforward, can generate long-range entanglement in constant depth, enabling low-depth primitives ranging from nontrivial state preparation to many-qubit entangling gates. Escaping the light-cone constraints of unitary circuits, however, comes at a cost: these primitives typically require a number of mid-circuit measurements that scales with system size and that, together with feedforward latency, can introduce errors that degrade the long-range entanglement they rely on. Here, we alleviate this tension by showing that many such primitives, when cast into a common framework, admit an error-detection scheme that trades infidelity for postselection overhead with no additional ancillas. Our framework thus unifies and upgrades a broad class of primitives including fan-out gates, multi-qubit Pauli rotations, the preparation of W and higher-weight Dicke states, and certain non-normal matrix product states. We also introduce a reduced-depth, error-detected implementation of the Hadamard test, extending the use cases of dynamic circuits to a key algorithmic primitive. Finally, we establish the practical utility of our scheme through experiments on a superconducting quantum processor. We demonstrate the error-detected preparation of a long-range entangled Bell pair spanning a 100-qubit chain with fidelity $F=0.59\\pm0.02$, surpassing the entanglement-certification threshold $F>0.5$ that the baseline dynamic-circuit implementation fails to reach ($0.39\\pm0.01$). Separately, we demonstrate constant-depth preparation of W states of up to 20 qubits by consuming GHZ states of up to 40 qubits, finding absolute fidelity improvements of $ΔF\\approx 0.2$ across the largest sizes studied. Altogether, these results bring low-depth dynamic-circuit primitives within practical reach on present-day hardware.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.08925",
  "author_total": 4,
  "authors": [
    {
      "name": "Kevin C. Smith"
    },
    {
      "name": "Bibek Pokharel"
    },
    {
      "name": "Satvik Maurya"
    },
    {
      "name": "Maika Takita"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/99jpqr5ha4j2b.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.08925",
  "fulltext_url": null,
  "id": "99jpqr5ha4j2b",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.08925",
  "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": "W7212050656",
  "pdf_url": "https://arxiv.org/pdf/2609.08925",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-08",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/99jpqr5ha4j2b.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:19:52Z",
      "native_id": "2609.08925",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.08925"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Resilience Beyond the Light Cone: Error-Detected Primitives for Practical Dynamic Circuits",
  "title_text": "Resilience Beyond the Light Cone: Error-Detected Primitives for Practical Dynamic Circuits",
  "type": "preprint",
  "updated_at": "2026-10-30T12:19:52Z",
  "url": "https://research.draconitic.com/paper/99jpqr5ha4j2b",
  "venue": "arXiv",
  "versions": []
}