Skip to content

QEC/qLDPC: route one parity-check syndrome round to a verified physical schedule #493

Description

@arniber21

What to build

Lower one qLDPC parity-check syndrome-extraction round from the existing graph/resource model into a verified physical neutral-atom schedule.

Issue #285 intentionally delivered a sizing/workload prototype, and #478 exposes it through quonc; neither routes checks or claims a physical schedule. This issue is the next honest tracer bullet: choose one small checked-in parity-check graph, generate its ancilla interactions and measurements, place/route them on a generic zoned NA target, and emit the same schedule/resource artifacts as the surface/repetition paths.

Design review is required for the ancilla/check scheduling model and for how much parallelism/movement pressure the first slice claims.

Acceptance criteria

  • An ADR defines the first physical qLDPC slice, including data/ancilla mapping, check ordering, measurement/reset policy, and unsupported decoder behavior.
  • A checked-in toy parity-check graph lowers to explicit syndrome interactions, ancilla measurements, and round barriers.
  • The generated workload passes through normal NA placement, movement, scheduling, compaction, canonical quantum.na, and final verification.
  • Resource reports derive check weight, edge count, ancilla/peak atoms, movement, transfers, measurement rounds, idle time, and cycles from the physical schedule rather than only the sizing formula.
  • Graph/workload identities survive serialization so the physical artifact can be traced to its parity checks.
  • Unsupported graphs/capacity constraints fail with actionable diagnostics rather than silently returning only an analytic estimate.
  • Tests cover at least one successful toy round, insufficient zone capacity, malformed check data, and deterministic round-trip output.
  • Documentation states clearly: no decoder, no sampled threshold result, no hardware calibration claim, and no claim of scalable qLDPC routing yet.

Out of scope

  • Full [[144,12,12]] routing if it does not fit the first bounded slice.
  • Decoder implementation, logical-error-rate estimation, or threshold claims.
  • Automatic selection of a qLDPC family for an application.

Blocked by

Related

Metadata

Metadata

Assignees

No one assigned

    Labels

    backendGeneral backend / compilation pipeline (not NA- or IBM-specific)enhancementNew feature or requestneutral-atomNeutral-atom backend target (quon_na, quantum.na, AOD/schedule)ready-for-humanRequires human implementationresearchResearch or design exploration, not a straight implementation ticket

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions