Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

UniMind: Calibration-Aware Scheduling and Placement for Quantum-Accelerated AI Middlewars

Yong Xun Tan

Published Sep 2, 2026• 0 citations
Publisher

Abstract

UniMind is a user-space middleware for quantum-accelerated AI workloads that scores, places, executes, and refreshes calibration data in a closed loop. This record contains the v7 manuscript in two editions (12-page full and 6-page compact), each as compiled PDF and LaTeX source. The paper is a measurement study of how a quantum runtime should maintain scheduling decisions when hardware calibration changes over time. We instrument a 156-qubit superconducting device (ibm_marrakesh) across three primary daily snapshots (D0-D2, 2026-08-29 to 08-31) plus 34 hourly calibration snapshots (2026-09-01 to 09-02, three backends: marrakesh, kingston, fez). Four findings: (1) calibration validity is temporally bounded and small (day-over-day rank correlation 0.579, top-10 Jaccard 0.25, stale top-3 pins 1.94-2.1x worse across 24-34 h; hourly top-3 margins ~1e-3 vs median |dC| = 0.0127); we formalize the Calibration Validity Horizon T_valid as a lower-bound design primitive. (2) Adaptive refresh (top-10 Jaccard < 0.5 or dC > 0.005, ~0.04 ms per scoring pass) dominates static and periodic policies at near-zero cost; a 144-threshold sweep places the default at the Pareto knee. (3) Refresh, not placement selection, dominates end-to-end reliability at the measured scale (+33/37 pp with fresh pins; pinned vs free is a bounded null, 70.0% vs 76.7%, Fisher p = 0.77, MDE ~ 32 pp). (4) Proxy-trained layout models do not transfer: re-fitting the 7-dim utility J(G) on real device labels collapses its size out-of-sample Spearman from 0.818 to 0.13; feature ablation and a connectivity-vs-quality variance crossover at k ~ 100 isolate the mechanism. All experiments are open-source and reproducible from the companion repository; QPU job IDs and calibration snapshots are recorded in its data directory. Every claim traces to a recorded job or snapshot; a failed exploratory result (rank correlation 1.000 -> 0.771) is reported as unreplicated. The LLM-orchestration layer is a separable controlled-parameter reliability model, not a hardware claim.

DOI
10.5281/zenodo.22242710

Related papers

UniMind: A Middleware Framework for Bridging Classical AI Workloads and Quantum Computing Backends

Yong Xun Tan

As quantum computing transitions from theoretical research to practical deployment, a compatibility gap emerges between classical AI software stacks and probabilistic quantum hardware. Existing quantum machine learning frameworks operate at the application level and lack system-level abstractions for hardware adaptation, workload routing, and dynamic code generation. This paper presents UniMind, a middleware framework designed to reduce the abstraction gap between classical AI workloads and heterogeneous quantum-classical computing backends. UniMind introduces two components: (1) an LLM-driven orchestration layer that interprets high-level task specifications and generates topology-aware execution plans through constrained sampling, operating exclusively in user space with sandboxed validation and rule-based fallback; and (2) Unibit, a classical preprocessing representation based on sliding-window frequency estimation and sinc-based smoothing that produces parameters for standard quantum angle encoding. We implement a multi-backend mapping engine and validate the framework with reproducible experiments.

•Aug 22, 2026•0 citations

HPC-vQPU: A Service-Export Architecture for Virtual QPUs on Batch-Scheduled HPC Systems

Shusen Liu, Pascal Jahan Elahi, Ugo Varetto

Device-aware quantum simulation increasingly requires HPC-scale accelerators, yet secure supercomputers expose batch-scheduled execution environments rather than the interactive, backend-oriented interfaces expected by quantum software. The key obstacle is not only remote job submission: an HPC-hosted virtual QPU must preserve topology, native-gate, and calibration semantics across queue delay, scheduler allocation, compute-node isolation, and partial execution-side failures, without opening inbound paths into the cluster. We present HPC-vQPU, a service-export architecture for virtual QPUs on batch-scheduled HPC systems. HPC-vQPU separates a cloud-facing control plane, which owns device identity, task lifecycle, snapshot binding, and event projection, from an HPC-resident execution plane, which claims work and realises it through scheduler-backed GPU jobs. Coordination is exclusively outbound and agent initiated. The central abstraction is a topology- and calibration-aware device snapshot bound atomically at claim time and carried into execution as an immutable contract, making each scheduled job hermetic while preserving fresh device semantics. We implement HPC-vQPU at the Pawsey Supercomputing Research Centre using Setonix GPUs, Qiskit-Aer/cuQuantum, and IBM Fez calibration data. Production experiments show that service overhead is bounded and additive, while workload scaling remains confined to the simulator; calibration-bearing snapshots produce measurable output shifts; claim-time binding prevents stale execution after pre-claim device mutation; concurrent agents complete 50/50 tasks exactly once; and explicit recovery restores stale running tasks after agent failure. These results show that secure, scheduler-mediated HPC infrastructure can export device-faithful quantum simulation as an interactive virtual-QPU service.

cs.DCCross-listedarXiv:2605.28845•May 15, 2026•0 citations

When does calibration-aware compilation transfer to quantum hardware? A three-processor QAOA study of ranking, drift, and refresh

Aishwarya Vishwakarma

Abstract Calibration summaries are used both to select physical qubits and to parameterize noisy emulators, creating a risk that agreement within a calibration-derived model is mistaken for validation on hardware. We test whether calibration-aware compiler rankings transfer to hardware using weighted-MaxCut instances implemented with the quantum approximate optimization algorithm. The evidence comprises four stages: 3240 historical calibration-derived simulations; a complete 54-pair hardware grid on three IBM Heron r2 processors; exact-circuit repeats 9.3–12.1 d later; and a contemporaneous five-arm refresh experiment. Full-calibration selection improves the median hardware approximation ratio by 0.74 percentage points (pp), with 29 resolved gains and 11 resolved losses. This is a mean-objective effect: its translation to exact-solution probability is instance- and size-dependent, and we do not extrapolate it beyond the tested n ⩽ 10 regime. A Qiskit Aer model constructed from the calibration state available before execution reproduced the direction of the measured full-calibration-versus-topology advantage in 35/54 comparisons, but systematically overestimated its size: the simulated advantage exceeded the subsequently measured hardware advantage by a median 1.35 pp. Regressing the measured hardware advantage on the simulated advantage gave a slope of 0.28 (workload-depth case-cluster 95% interval 0.06–0.52), rather than the unit slope of a calibrated predictor. The emulator identified the exact best of six backend-compiler configurations in only 5/18 cases (95% Wilson interval [0.125, 0.509]). By contrast, identical circuits preserved the compiler-effect sign in 16/18 later repeats ( r = 0.92 ). Refreshing the full-calibration mapping yielded a median +0.72 pp gain, whereas the calibration-score difference agreed in sign with the measured refresh benefit in only 9/18 cases. Calibration data are therefore useful for candidate discovery and timely refresh, but their scalar scores are not calibrated predictors of hardware performance or configuration ranking.

Quantum Science and Technology•Oct 23, 2026•0 citations

Calibration-Aware Scheduling for Hybrid Quantum-Classical Systems: An OS Primitive at the Edge of Fault Tolerance

Alagappan Shanmugam

It's a position paper / extended abstract submitted to the QAISys 2026, supported by NSF Award #2435033 Conference: QAISys 2026: NSF Workshop on Systems Research at the Quantum-AI Frontier - OS, Fault Tolerance, and Edge Integration Conference dates: April 3, 2026 Conference place: Washington, DC

•Mar 17, 2026•0 citations

The Frozen Token Reaches Quantum: a complete, pre-registered map of a deterministic single-token encoder's monitoring laws on a real quantum processor — fingerprint, privacy, integrity, qubit health, drift, and a molecular-state twin

Randolph James Ferlic, Kimberly Kate Ferlic

The Frozen Token Reaches Quantum: a complete, pre-registered map of a deterministic single-token encoder's monitoring laws on a real quantum processor — fingerprint, privacy, integrity, qubit health, drift, and a molecular-state twin Randolph James Ferlic, M.D. and Kimberly Kate Ferlic — Fieldstone Analytics, LLC, Austin, TX, USA Preprint · Zenodo DOI: 10.5281/zenodo.23670079 · CC-BY 4.0 · Community: spiral-domain-encoder-campaign · This record characterizes previously filed and published methods applied to a new signal source (a quantum processor's measurement outputs) and discloses no new patentable subject matter; the one candidate new application (client-side quantum-job attestation) was deliberately not pursued as intellectual property — see the notice below. Abstract A frozen, deterministic single-token encoder reduces a window of inputs, by a fixed computation, to one 8-bit token and a bounded ≤256-cell lookup, with the nearest-centroid distance serving as a label-free novelty score. A prior program established, across many classical sensing modalities, a predictive theory of this encoder — a competence-zone separability law, a per-entity self-twin law, a compose-versus-recommission law, a cost-not-accuracy law, a deployment-sizing law, a privacy-inversion bound, a safety-interlock characterization, and a geometry-gated drift-adaptation capability. This record asks whether those laws extend to a new kind of entity: a real cloud quantum processor, probed only through the data a present-day gate-model machine returns — measurement counts (single-shot in-phase/quadrature readout is no longer exposed). Established by a pre-registration with frozen falsifiable bands and a simulate-then-validate-on-hardware discipline, the answer is that the monitoring laws reach a quantum processor essentially in full, from counts alone, with no new algorithm. A frozen 1-byte token fingerprints which of three IBM Heron-r2 156-qubit backends ran a job (balanced accuracy 1.00; chance 0.333), proves the signature stable rather than shot-noise (same-device test-retest 0.65 ≪ 1.00), exposes a privacy-inversion (device re-identification 1.00 under an abstracted backend), acts as a result-integrity dead-switch (wrong-device 1.00; gross tamper ≥1σ 0.98–1.00, including a real circuit-level tamper at 1.00 with the novelty spiking ~95× and no cheap null-space evasion; honest subtle-tamper blind spot 0.51), recovers a device's qubit-level calibration ranking from a four-second probe (Spearman 0.88; eight of ten worst qubits; generalizing to a second device at 0.86), and builds a molecular-state twin (H₂ on real hardware: bond-distortion Spearman 1.00; energy ordering 0.771; distortion-twin robust across a finer 12-geometry ladder and two Heron devices, 0.96–0.99). The keystone laws transfer: the separability screen forecasts reach when matched to the monitor's geometry (matched 1.00; generic 0.69, a characterized blind spot); cost-not-accuracy holds (byte = 200-tree forest, Δ0.00); sizing holds (≈4 commissioning sub-batches for fingerprinting, ≈8 for integrity); compose-versus-recommission holds exactly and closes a clean division of labor with the drift law. A hybrid classical→quantum→LLM pipeline monitor localizes which stage faulted at 100% for three bytes. Temporal drift (QF-2) is positive and tracks the device's calibration state rather than the clock — over seven snapshots across nine days the token's label-free novelty tracks IBM's own reported readout error at Spearman +0.89, more tightly than elapsed time (+0.68), because the device recalibrates ~daily so calibration drift is recal-cyclic (the novelty climbs and then falls back as the device is recalibrated, and the token follows it up and back down) and it tracks readout-layer drift specifically, not gate drift (+0.64), C10 reaching the quantum service-life axis, honestly scoped as a bounded n=7 result. Honest negatives are reported with equal weight (no untrained quantum-feature-map advantage, no label-derivative "synergy," no cheap two-qubit-gate-error readout). The transferable lesson: the cheapest possible deterministic monitor — one frozen byte — reaches the most advanced computing hardware we have, as a fingerprint, a privacy probe, an integrity dead-switch, and a health and drift gauge, from the measurement counts the machine already returns, without a new algorithm or a gradient. Highlights · The monitoring laws reach a real quantum processor from measurement counts alone — no new algorithm. A frozen 1-byte token fingerprints which of three IBM Heron-r2 backends ran a job (1.00; chance 0.333) and the test-retest control (same device 0.65 ≪ cross-device 1.00) proves it is a stable device signature, not shot noise. · A privacy inversion on cloud quantum. An "anonymized" backend is re-identifiable from job counts (QF-4, re-identification 1.00) — extending the program's confidentiality-is-not-anonymity bound to a quantum processor; dual-use (user-side audit / provider side-channel). · A result-integrity dead-switch with a declared blind spot. From counts, label-free: trips on a wrong/substituted device (1.00) and on gross result tampering (≥1σ, 0.98–1.00, clean dose-response) — including a real circuit-level tamper (an X-flip of half the register before measurement) at 1.00 with the novelty spiking ~95×, with no cheap null-space evasion (an adaptive quiet-direction override is caught immediately, 1.00) and no false trip on a genuine same-device re-run (0.50) — and honestly fails on subtle device-consistent (on-manifold) tampering (0.51) — defense-in-depth, not a cryptographic verifier. · Qubit-level health from a four-second probe. The token recovers the vendor's own readout-error calibration ranking (Spearman 0.88, 156 qubits) and flags eight of its ten worst qubits — a cheap, fresh, label-free health map that generalizes to a second Heron device (Spearman 0.86 at matched shots). · A molecular-state digital twin on real hardware. Commissioned on H₂'s equilibrium geometry, the token's label-free novelty tracks bond distortion (Spearman 1.00) and preserves the dissociation-energy ordering (0.771), on the device's noisy prepared state — the filed self-twin on a quantum-chemistry target; the distortion-twin is robust across a finer 12-geometry ladder and two Heron devices (0.96–0.99), its finer energy recovery shot-limited rather than device-limited. · The keystone laws transfer. The separability screen forecasts monitor reach iff matched to the monitor's geometry (matched 1.00; a generic two-class screen 0.69, blind to additive tamper); cost-not-accuracy holds (byte equals a 200-tree forest, Δ0.00); sizing holds (≈4/≈8 commissioning sub-batches); and compose-versus-recommission holds exactly — a device-A monitor flags a healthy device B at 100% and must be recommissioned, closing a clean division of labor with the drift law (small within-device drift is the drift law's regime; large cross-device shift is recommission's). · A three-byte hybrid-pipeline monitor. An array of 1-byte self-twins localizes which stage of a classical→quantum→LLM pipeline faulted at 100%, provided each stage is probed with the matched geometry (workload self-twin for covariate faults; a fixed reference probe for the quantum stage). · Honest negatives, and no new intellectual property. An untrained quantum feature-map carries no classical-data advantage, stacking label-derivative codebooks yields no super-additive "synergy," and a cheap echo probe cannot rank small two-qubit gate errors from counts. Every result is the filed, published self-twin applied to a new signal source; the one candidate new application (client-side quantum-job attestation) was weighed as intellectual property and deliberately not pursued, the chosen protection being this publication. · Trust in a cloud the user cannot see, at near-zero cost. The self-twin triad answers the practical cloud-quantum questions — did my job run on the device I was allocated (QF-1), is the abstracted backend unlinkable (QF-4; no), was my result substituted or grossly corrupted (QF-5), which qubits were healthy at run time (QF-6) — from the measurement histogram the user already receives, with no provider cooperation, trusted server, or extra circuits. The provider-side alternatives (randomized benchmarking, tomography, cryptographic verification) spend many designed circuits, privileged access, or interaction; this is the "read the receipt you already have" layer, and it is defense-in-depth beneath verification, not a replacement for it. · One primitive, more than twenty orders of magnitude. The identical mechanism now monitors a vibrating bearing, an electrocardiogram, a radio emitter, an industrial audio machine, and the measurement readout of a 156-qubit superconducting processor — a single cheap, deterministic, auditable primitive reaching the exotic end of the computing-substrate spectrum, the strongest evidence yet for the program's cost-not-accuracy premise (see the breadth figure). · Temporal drift (QF-2) is positive and vendor-corroborated — the token tracks the device's calibration *state*, not the clock. Over seven snapshots across nine days and six recalibration cycles, the token's label-free novelty tracks IBM's own historical reported readout error at Spearman +0.89 — more tightly than elapsed time (+0.68) — and the two-qubit gate error at only +0.64. Because the device recalibrates ~daily, calibration drift is recal-cyclic (the novelty rises, then is recalibrated back toward baseline), and the token follows the calibration state up and back down: the two late snapshots have low novelty and low reported readout error even though their gate error is the worst of the series. C10 on the quantum service-life axis, honestly bounded at n=7. The transferable lesson A single, auditable, sub-milliwatt monitoring primitive — one frozen deterministic byte — now d

•Oct 26, 2026•0 citations

Data-efficient characterization & calibration framework for quantum processors (要旨)

ポーラメート パトゥムスート, Poramet Pathumsoot

•Jan 1, 2026•0 citations
UniMind is a user-space middleware for quantum-accelerated AI workloads that scores, places, executes, and refreshes calibration data in a closed loop. This record contains the v7 manuscript in two editions (12-page full and 6-page compact), each as compiled PDF and LaTeX source. The paper is a measurement study of how a quantum runtime should maintain scheduling decisions when hardware calibration changes over time. We instrument a 156-qubit superconducting device (ibm_marrakesh) across three primary daily snapshots (D0-D2, 2026-08-29 to 08-31) plus 34 hourly calibration snapshots (2026-09-01 to 09-02, three backends: marrakesh, kingston, fez). Four findings: (1) calibration validity is temporally bounded and small (day-over-day rank correlation 0.579, top-10 Jaccard 0.25, stale top-3 pins 1.94-2.1x worse across 24-34 h; hourly top-3 margins ~1e-3 vs median |dC| = 0.0127); we formalize the Calibration Validity Horizon T_valid as a lower-bound design primitive. (2) Adaptive refresh (top-10 Jaccard < 0.5 or dC > 0.005, ~0.04 ms per scoring pass) dominates static and periodic policies at near-zero cost; a 144-threshold sweep places the default at the Pareto knee. (3) Refresh, not placement selection, dominates end-to-end reliability at the measured scale (+33/37 pp with fresh pins; pinned vs free is a bounded null, 70.0% vs 76.7%, Fisher p = 0.77, MDE ~ 32 pp). (4) Proxy-trained layout models do not transfer: re-fitting the 7-dim utility J(G) on real device labels collapses its size out-of-sample Spearman from 0.818 to 0.13; feature ablation and a connectivity-vs-quality variance crossover at k ~ 100 isolate the mechanism. All experiments are open-source and reproducible from the companion repository; QPU job IDs and calibration snapshots are recorded in its data directory. Every claim traces to a recorded job or snapshot; a failed exploratory result (rank correlation 1.000 -> 0.771) is reported as unreplicated. The LLM-orchestration layer is a separable controlled-parameter reliability model, not a hardware claim.
As quantum computing transitions from theoretical research to practical deployment, a compatibility gap emerges between classical AI software stacks and probabilistic quantum hardware. Existing quantum machine learning frameworks operate at the application level and lack system-level abstractions for hardware adaptation, workload routing, and dynamic code generation. This paper presents UniMind, a middleware framework designed to reduce the abstraction gap between classical AI workloads and heterogeneous quantum-classical computing backends. UniMind introduces two components: (1) an LLM-driven orchestration layer that interprets high-level task specifications and generates topology-aware execution plans through constrained sampling, operating exclusively in user space with sandboxed validation and rule-based fallback; and (2) Unibit, a classical preprocessing representation based on sliding-window frequency estimation and sinc-based smoothing that produces parameters for standard quantum angle encoding. We implement a multi-backend mapping engine and validate the framework with reproducible experiments.
Device-aware quantum simulation increasingly requires HPC-scale accelerators, yet secure supercomputers expose batch-scheduled execution environments rather than the interactive, backend-oriented interfaces expected by quantum software. The key obstacle is not only remote job submission: an HPC-hosted virtual QPU must preserve topology, native-gate, and calibration semantics across queue delay, scheduler allocation, compute-node isolation, and partial execution-side failures, without opening inbound paths into the cluster. We present HPC-vQPU, a service-export architecture for virtual QPUs on batch-scheduled HPC systems. HPC-vQPU separates a cloud-facing control plane, which owns device identity, task lifecycle, snapshot binding, and event projection, from an HPC-resident execution plane, which claims work and realises it through scheduler-backed GPU jobs. Coordination is exclusively outbound and agent initiated. The central abstraction is a topology- and calibration-aware device snapshot bound atomically at claim time and carried into execution as an immutable contract, making each scheduled job hermetic while preserving fresh device semantics. We implement HPC-vQPU at the Pawsey Supercomputing Research Centre using Setonix GPUs, Qiskit-Aer/cuQuantum, and IBM Fez calibration data. Production experiments show that service overhead is bounded and additive, while workload scaling remains confined to the simulator; calibration-bearing snapshots produce measurable output shifts; claim-time binding prevents stale execution after pre-claim device mutation; concurrent agents complete 50/50 tasks exactly once; and explicit recovery restores stale running tasks after agent failure. These results show that secure, scheduler-mediated HPC infrastructure can export device-faithful quantum simulation as an interactive virtual-QPU service.
Abstract Calibration summaries are used both to select physical qubits and to parameterize noisy emulators, creating a risk that agreement within a calibration-derived model is mistaken for validation on hardware. We test whether calibration-aware compiler rankings transfer to hardware using weighted-MaxCut instances implemented with the quantum approximate optimization algorithm. The evidence comprises four stages: 3240 historical calibration-derived simulations; a complete 54-pair hardware grid on three IBM Heron r2 processors; exact-circuit repeats 9.3–12.1 d later; and a contemporaneous five-arm refresh experiment. Full-calibration selection improves the median hardware approximation ratio by 0.74 percentage points (pp), with 29 resolved gains and 11 resolved losses. This is a mean-objective effect: its translation to exact-solution probability is instance- and size-dependent, and we do not extrapolate it beyond the tested n ⩽ 10 regime. A Qiskit Aer model constructed from the calibration state available before execution reproduced the direction of the measured full-calibration-versus-topology advantage in 35/54 comparisons, but systematically overestimated its size: the simulated advantage exceeded the subsequently measured hardware advantage by a median 1.35 pp. Regressing the measured hardware advantage on the simulated advantage gave a slope of 0.28 (workload-depth case-cluster 95% interval 0.06–0.52), rather than the unit slope of a calibrated predictor. The emulator identified the exact best of six backend-compiler configurations in only 5/18 cases (95% Wilson interval [0.125, 0.509]). By contrast, identical circuits preserved the compiler-effect sign in 16/18 later repeats ( r = 0.92 ). Refreshing the full-calibration mapping yielded a median +0.72 pp gain, whereas the calibration-score difference agreed in sign with the measured refresh benefit in only 9/18 cases. Calibration data are therefore useful for candidate discovery and timely refresh, but their scalar scores are not calibrated predictors of hardware performance or configuration ranking.
The Frozen Token Reaches Quantum: a complete, pre-registered map of a deterministic single-token encoder's monitoring laws on a real quantum processor — fingerprint, privacy, integrity, qubit health, drift, and a molecular-state twin Randolph James Ferlic, M.D. and Kimberly Kate Ferlic — Fieldstone Analytics, LLC, Austin, TX, USA Preprint · Zenodo DOI: 10.5281/zenodo.23670079 · CC-BY 4.0 · Community: spiral-domain-encoder-campaign · This record characterizes previously filed and published methods applied to a new signal source (a quantum processor's measurement outputs) and discloses no new patentable subject matter; the one candidate new application (client-side quantum-job attestation) was deliberately not pursued as intellectual property — see the notice below. Abstract A frozen, deterministic single-token encoder reduces a window of inputs, by a fixed computation, to one 8-bit token and a bounded ≤256-cell lookup, with the nearest-centroid distance serving as a label-free novelty score. A prior program established, across many classical sensing modalities, a predictive theory of this encoder — a competence-zone separability law, a per-entity self-twin law, a compose-versus-recommission law, a cost-not-accuracy law, a deployment-sizing law, a privacy-inversion bound, a safety-interlock characterization, and a geometry-gated drift-adaptation capability. This record asks whether those laws extend to a new kind of entity: a real cloud quantum processor, probed only through the data a present-day gate-model machine returns — measurement counts (single-shot in-phase/quadrature readout is no longer exposed). Established by a pre-registration with frozen falsifiable bands and a simulate-then-validate-on-hardware discipline, the answer is that the monitoring laws reach a quantum processor essentially in full, from counts alone, with no new algorithm. A frozen 1-byte token fingerprints which of three IBM Heron-r2 156-qubit backends ran a job (balanced accuracy 1.00; chance 0.333), proves the signature stable rather than shot-noise (same-device test-retest 0.65 ≪ 1.00), exposes a privacy-inversion (device re-identification 1.00 under an abstracted backend), acts as a result-integrity dead-switch (wrong-device 1.00; gross tamper ≥1σ 0.98–1.00, including a real circuit-level tamper at 1.00 with the novelty spiking ~95× and no cheap null-space evasion; honest subtle-tamper blind spot 0.51), recovers a device's qubit-level calibration ranking from a four-second probe (Spearman 0.88; eight of ten worst qubits; generalizing to a second device at 0.86), and builds a molecular-state twin (H₂ on real hardware: bond-distortion Spearman 1.00; energy ordering 0.771; distortion-twin robust across a finer 12-geometry ladder and two Heron devices, 0.96–0.99). The keystone laws transfer: the separability screen forecasts reach when matched to the monitor's geometry (matched 1.00; generic 0.69, a characterized blind spot); cost-not-accuracy holds (byte = 200-tree forest, Δ0.00); sizing holds (≈4 commissioning sub-batches for fingerprinting, ≈8 for integrity); compose-versus-recommission holds exactly and closes a clean division of labor with the drift law. A hybrid classical→quantum→LLM pipeline monitor localizes which stage faulted at 100% for three bytes. Temporal drift (QF-2) is positive and tracks the device's calibration state rather than the clock — over seven snapshots across nine days the token's label-free novelty tracks IBM's own reported readout error at Spearman +0.89, more tightly than elapsed time (+0.68), because the device recalibrates ~daily so calibration drift is recal-cyclic (the novelty climbs and then falls back as the device is recalibrated, and the token follows it up and back down) and it tracks readout-layer drift specifically, not gate drift (+0.64), C10 reaching the quantum service-life axis, honestly scoped as a bounded n=7 result. Honest negatives are reported with equal weight (no untrained quantum-feature-map advantage, no label-derivative "synergy," no cheap two-qubit-gate-error readout). The transferable lesson: the cheapest possible deterministic monitor — one frozen byte — reaches the most advanced computing hardware we have, as a fingerprint, a privacy probe, an integrity dead-switch, and a health and drift gauge, from the measurement counts the machine already returns, without a new algorithm or a gradient. Highlights · The monitoring laws reach a real quantum processor from measurement counts alone — no new algorithm. A frozen 1-byte token fingerprints which of three IBM Heron-r2 backends ran a job (1.00; chance 0.333) and the test-retest control (same device 0.65 ≪ cross-device 1.00) proves it is a stable device signature, not shot noise. · A privacy inversion on cloud quantum. An "anonymized" backend is re-identifiable from job counts (QF-4, re-identification 1.00) — extending the program's confidentiality-is-not-anonymity bound to a quantum processor; dual-use (user-side audit / provider side-channel). · A result-integrity dead-switch with a declared blind spot. From counts, label-free: trips on a wrong/substituted device (1.00) and on gross result tampering (≥1σ, 0.98–1.00, clean dose-response) — including a real circuit-level tamper (an X-flip of half the register before measurement) at 1.00 with the novelty spiking ~95×, with no cheap null-space evasion (an adaptive quiet-direction override is caught immediately, 1.00) and no false trip on a genuine same-device re-run (0.50) — and honestly fails on subtle device-consistent (on-manifold) tampering (0.51) — defense-in-depth, not a cryptographic verifier. · Qubit-level health from a four-second probe. The token recovers the vendor's own readout-error calibration ranking (Spearman 0.88, 156 qubits) and flags eight of its ten worst qubits — a cheap, fresh, label-free health map that generalizes to a second Heron device (Spearman 0.86 at matched shots). · A molecular-state digital twin on real hardware. Commissioned on H₂'s equilibrium geometry, the token's label-free novelty tracks bond distortion (Spearman 1.00) and preserves the dissociation-energy ordering (0.771), on the device's noisy prepared state — the filed self-twin on a quantum-chemistry target; the distortion-twin is robust across a finer 12-geometry ladder and two Heron devices (0.96–0.99), its finer energy recovery shot-limited rather than device-limited. · The keystone laws transfer. The separability screen forecasts monitor reach iff matched to the monitor's geometry (matched 1.00; a generic two-class screen 0.69, blind to additive tamper); cost-not-accuracy holds (byte equals a 200-tree forest, Δ0.00); sizing holds (≈4/≈8 commissioning sub-batches); and compose-versus-recommission holds exactly — a device-A monitor flags a healthy device B at 100% and must be recommissioned, closing a clean division of labor with the drift law (small within-device drift is the drift law's regime; large cross-device shift is recommission's). · A three-byte hybrid-pipeline monitor. An array of 1-byte self-twins localizes which stage of a classical→quantum→LLM pipeline faulted at 100%, provided each stage is probed with the matched geometry (workload self-twin for covariate faults; a fixed reference probe for the quantum stage). · Honest negatives, and no new intellectual property. An untrained quantum feature-map carries no classical-data advantage, stacking label-derivative codebooks yields no super-additive "synergy," and a cheap echo probe cannot rank small two-qubit gate errors from counts. Every result is the filed, published self-twin applied to a new signal source; the one candidate new application (client-side quantum-job attestation) was weighed as intellectual property and deliberately not pursued, the chosen protection being this publication. · Trust in a cloud the user cannot see, at near-zero cost. The self-twin triad answers the practical cloud-quantum questions — did my job run on the device I was allocated (QF-1), is the abstracted backend unlinkable (QF-4; no), was my result substituted or grossly corrupted (QF-5), which qubits were healthy at run time (QF-6) — from the measurement histogram the user already receives, with no provider cooperation, trusted server, or extra circuits. The provider-side alternatives (randomized benchmarking, tomography, cryptographic verification) spend many designed circuits, privileged access, or interaction; this is the "read the receipt you already have" layer, and it is defense-in-depth beneath verification, not a replacement for it. · One primitive, more than twenty orders of magnitude. The identical mechanism now monitors a vibrating bearing, an electrocardiogram, a radio emitter, an industrial audio machine, and the measurement readout of a 156-qubit superconducting processor — a single cheap, deterministic, auditable primitive reaching the exotic end of the computing-substrate spectrum, the strongest evidence yet for the program's cost-not-accuracy premise (see the breadth figure). · Temporal drift (QF-2) is positive and vendor-corroborated — the token tracks the device's calibration *state*, not the clock. Over seven snapshots across nine days and six recalibration cycles, the token's label-free novelty tracks IBM's own historical reported readout error at Spearman +0.89 — more tightly than elapsed time (+0.68) — and the two-qubit gate error at only +0.64. Because the device recalibrates ~daily, calibration drift is recal-cyclic (the novelty rises, then is recalibrated back toward baseline), and the token follows the calibration state up and back down: the two late snapshots have low novelty and low reported readout error even though their gate error is the worst of the series. C10 on the quantum service-life axis, honestly bounded at n=7. The transferable lesson A single, auditable, sub-milliwatt monitoring primitive — one frozen deterministic byte — now d