arXiv:2610.10427
Design-Time Conformance Checking for Pulse-Level Quantum Control
Rylan Malarchick
Abstract
A pulse-level quantum control program is written against a device whose limits are recorded, if at all, in vendor documentation and source code. A program that exceeds them can be refused at compile time. It can also be accepted and silently altered, or compile and then fail at the board. In the last two cases the experiment runs, and the data does not correspond to the program that was written. We present qconform, a checker that decides whether a pulse program is realizable on a device, given a versioned capability descriptor for that device. Every constraint in a descriptor cites the toolchain observation that established it. The checker is design-time, offline, and deterministic, and it uses no floating point. It reports a verdict, the rules it applied, and a coverage manifest that names what it did not check. We evaluate qconform by differential testing against the QICK and Qblox toolchains, on three QICK board configurations and one Qblox cluster. Over 1263 program runs of 969 distinct programs, the checker accepted no program that a toolchain refuses. On both vendors, a descriptor pinned to one toolchain release accepts programs that older releases refuse. The evaluation also found ten defects in the checker and its descriptors, all fixed.
AI Summary
Pulse-level control compilers can silently quantize, alias, or otherwise modify requested operations. This paper asks whether an offline checker can identify device-incompatible programs and predict such modifications before compilation or execution. It introduces **qconform**, a dependency-free C99 checker operating on JSON programs and version-pinned device capability descriptors. Constraints cite supporting toolchain probes; arithmetic uses exact rationals rather than floating point. Reports distinguish pass, failure, and pass with repairs, and include a coverage manifest identifying unchecked constraints. Descriptors cover timing grids, frequency and amplitude limits, memory budgets, and operation-spacing rules. Differential testing against hardware-free QICK and Qblox compilation covers three QICK configurations and one Qblox cluster: **1,263 runs of 969 distinct programs**. Boundary tests and randomized compositions produce no checker acceptance that the pinned toolchain rejects, and no missed or over-predicted observable repairs after fixes. Testing and fault injection found ten checker or descriptor defects, subsequently fixed. Repeating tests with older releases produces false acceptances, demonstrating that compatibility depends on the version pin. The stated claim concerns compilation acceptance, not faithful hardware execution, and finite testing does not prove soundness. Programs have no branches or loops. Additional limitations include an incomplete accumulated-time bound for muxed QICK generators, unsupported or untestable cases, and descriptor-only enforcement of some hardware limits. Forty evaluation rows are excluded as harness limitations. Other vendors and hardware execution are not evaluated; a QICK exporter is the only existing input-language integration.
AI-assisted tools (Claude, Anthropic) were used for code development, running the differential evaluation, and manuscript preparation.
Central claim may not hold: The abstract describes device realizability, whereas the supported result is scoped conformance to a pinned compiler plus selected hardware constraints, with run-time behavior excluded. Of the reported 1263 runs, 40 are excluded as harness cases, leaving 1223 runs contributing to the soundness comparison. The unqualified statement that a pass implies compilation requires the Section V exception for accumulated timing on muxed QICK generators, whose toolchain constraint the implemented per-pulse check does not establish.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 6 pages, 1 figure, 3 tables. Code: https://github.com/rylanmalarchick/qconform (release v0.1.0)