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

arXiv:2605.15233

Measuring Control-Plane Openness in Near-Term Quantum Computing: A Rubric, Its Validation, and an Application to Thirteen Vendor Stacks

Rylan Malarchick

quant-phcs.ETSubmitted May 13, 2026• Announced May 15, 2026• 1 citation• Revised Jul 9, 2026 (v3)
v1 · May 13, 2026v2 · Jun 11, 2026v3 · Jul 9, 2026
arXivHTMLPDF

Abstract

Public access to pulse-level and control-electronics interfaces in commercial quantum computing has bifurcated. This paper proposes a six-axis rubric for measuring control-plane openness, the layer between gate-level circuit specification and physical control electronics, defined operationally so that the same evidence produces the same grade across vendors. The rubric is validated three ways: a blinded re-grading pass that tests whether the cited evidence and the level definitions alone reproduce the recorded grades, a boundary-case methodology that fixes where each level begins and ends, and a published grading protocol that lets others reproduce and contest any cell. A time-point comparison anchored on the February 2025 removal of pulse-level access from IBM hardware establishes that the rubric measures change rather than describing a snapshot. The rubric is applied to thirteen commercial vendors across superconducting, trapped-ion, neutral-atom, and photonic modalities as of May 1, 2026, and one of the three harms it detects is demonstrated through a reproduction-access audit of five pre-2025 IBM Qiskit Pulse experiments, carried through to a structural port to Rigetti Quil-T. The catalog ships as a machine-readable artifact under CC-BY-4.0 with per-cell source URLs (https://doi.org/10.5281/zenodo.20163276). The readings will go stale; the rubric is the contribution that survives them.

Comments
16 pages, 4 tables, 2 figures. Accompanying machine-readable catalog (CC-BY-4.0) at https://doi.org/10.5281/zenodo.20163276

Related papers

EIEZ Lang on Real Quantum Hardware: Compilation, Hybrid Execution, and Decoherence Criticality Analysis on IBM Quantum

Joemerson Lima

This paper presents the experimental validation and execution of the EIEZ Language (Version 3) on real physical quantum hardware. Deployed across IBM Quantum processors (ibm_fez, ibm_marrakesh, and ibm_torino, featuring 133 to 156 physical qubits), the EIEZ v3 framework introduces hybrid compilation targeting OpenQASM 2.0 and OpenQASM 3.0, adaptive classical control flow (while, repeat-until with rich CondExpr logic), and hardware topology validation (EIEZTopologyError). The test series evaluated 2- and 3-qubit entanglement circuits (Bell State, GHZ State), quantum algorithms (Deutsch), and depth-scaling tests ($H \times 1$ to $H \times 10$), executed with up to 4,096 shots per job. Key Results: Full Compilation Compatibility: Seamless execution flow from EIEZ source code to OpenQASM and IBM Quantum hardware. High Entanglement Fidelity: Average fidelity of ~95% across Bell State, GHZ, and Deutsch algorithm executions on physical QPUs. Critical Decoherence Point: Empirical observation of quantum interference breakdown at depth $H \times 3$ (~50% deviation from the ideal EIEZ simulator), providing physical evidence of criticality and confirming the applicability of the EIE/ZIE adaptive control framework (Patent BR 10 2025 024459 4). Transpiler Depth Recovery: Fidelity restoration to ~99.7% at depth $H \times 10$ driven by internal sequence optimization in Qiskit transpilation. Open FAIR Dataset: Release of machine-readable raw measurement counts (JSON/CSV), UTC timestamps, and IBM Job IDs for open verification. Links & Resources: IBM Quantum Cloud Platform: https://quantum.cloud.ibm.com/ Raw Execution Counts (JSON / CSV): https://github.com/joemerson/eiez-lang/blob/main/eiez-lang/Teste_rodados_IBM_/JSON.json Local Simulation Notebooks (Zenodo): https://doi.org/10.5281/zenodo.19078764 EIEZ Compiler Source Code (GitHub): https://github.com/joemerson/eiez-lang Complete EIE/ZIE Theory & Framework (Zenodo): https://doi.org/10.5281/zenodo.19005280 Zenodo DOI: https://doi.org/10.5281/zenodo.19078829

•Nov 4, 2026•0 citations

Measurement as Record-Registration: A Locked-Null Protocol for Testing Record-Level Structure in Quantum Computing Readout

William T Partin

This manuscript presents a methods-forward, operational protocol for evaluating whether any structured dependence remains in quantum-computing measurement records after explicit modeling of standard quantum and device-level mechanisms. Classical definiteness is defined at the record layer, and pre-record states are treated as predictive descriptions rather than as classical outcome facts. Within this operational stance, the protocol converts questions about outcome status and record formation into a falsifiable test program grounded in preregistered analysis rules and standard measurement telemetry. A locked null-model family is specified in advance, incorporating standard quantum dynamics together with documented device-level mechanisms including drift, correlated and non-Markovian noise, crosstalk proxies, and leakage indicators. The framework provides operational definitions, a conservative postulate set, preregistered endpoints, residual-adjudication criteria, negative controls, a fixed windowing discipline, and a bound-first reporting standard designed to yield informative constraints under null results. Any candidate contribution beyond the declared null family must appear as structured, reproducible residual dependence that survives the locked null family and the full residual-filter sequence. Version 4.4 refines the protocol specification, clarifies evidentiary boundaries, and strengthens the integration of the synthetic demonstration. The manuscript includes a fully specified classical simulation that executes the decision pipeline under controlled conditions. The synthetic study illustrates how the protocol classifies a bounded-null case, a measured-artifact case, a partial-artifact/unresolved-covariate case, an injected structured-residual case, and a failed-topology case. This demonstration establishes computational executability of the protocol and clarifies the behavior of the decision tree, but it does not constitute empirical evidence for any physical mechanism. Because the protocol relies only on standard measurement telemetry and preregistered analysis rules, it is directly implementable across contemporary quantum-computing platforms and does not depend on any single dataset, backend, or hardware realization. The manuscript is a specification paper: it defines a reproducible evidentiary framework for record-level claims, while large-scale empirical implementation, hardware benchmarking, and cross-platform replication remain subsequent studies.

•Mar 17, 2026•0 citations

Quantum Computing: Next-Generation Computational Paradigm

Adarsh Tripathi

The maturation of quantum computing from theoretical physics to engineering reality presents a complex landscape for stakeholders navigating the transition from Noisy Intermediate-Scale Quantum (NISQ) devices toward Fault-Tolerant Quantum Computation (FTQC). This report provides a comprehensive, technically rigorous analysis of the current quantum ecosystem, examining the hardware mosaic of leading qubit modalities—superconducting circuits, trapped ions, neutral atoms, and silicon spin qubits—and evaluating them against operational metrics, including coherence times, gate fidelities, and cryogenic infrastructure requirements. We dissect the full software stack, differentiating the near-term utility of error mitigation techniques such as Zero-Noise Extrapolation (ZNE) from the long-term necessity of Quantum Error Correction (QEC) and the milestone of logical qubit break-even. The analysis benchmarks hybrid algorithms (VQE, QAOA) and circuit knitting strategies against current cloud-accessible hardware performance, while also addressing the imminent non-computational impact of PostQuantum Cryptography (PQC) migration. Experimental data synthesised from leading vendor roadmaps and pre-print literature indicate that superconducting platforms currently lead in gate speed (nanosecond regime) but face crosstalk scaling challenges beyond 1,000 qubits. In contrast, trapped-ion and neutral-atom architectures demonstrate superior connectivity and coherence. The report concludes with a grounded, evidence-based five-year projection, identifying high-value vertical use cases in pharmaceuticals and finance, and providing a strategic framework for enterprises to separate quantum hype from tangible commercial opportunity. Future research directions include the realisation of low-overhead Quantum LDPC codes and the development of modular photonic interconnects to scale beyond single-chip architectures.

International Journal for Research in Applied Science and Engineering Technology•Apr 23, 2026•0 citations

Realizing Emptiness: Operational Surrogates for No-Self-Evidence, QRF Opacification, and Bayesian Model Reduction

Daniel Friedman

This project operationalizes the 2026 preprint "There is no self-evidence: A physics of emptiness realisation" as a source-anchored software artifact. Its central claim is that a finite agent can use a boundary for prediction while never obtaining evidence that the boundary is ontologically real, and the software separates three local artifact roles: formal sanity checks for source equations, positive-control-style finite mechanism checks, and discriminating tests that reject stronger readings when a control is perturbed. The formal layer maps the paper's quantum free-energy principle (qFEP) and quantum reference frame (QRF) equations into finite operational surrogates, bridging each paper equation to a specific software artifact. The computed artifacts are a suite of finite quantum-information and contextuality audits — spanning two-qubit separability and entanglement entropy, Bell and contextuality witnesses, thermodynamic and open-system dynamics, seeded quantum-trajectory sampling checked against exact solutions, and frame-covariance checks for the quantum reference frame relabelings — with explicit positive controls, negative controls, or boundary checks recorded where the corresponding artifact contract requires them. The software represents QRF deployments as policies over boundary-channel sectorisations, using the same finite bitstream under self/environment/contextual relabelings so that QRF labels can organize prediction, action selection, and transformation covariance while failing to become evidence for an ontological self/world boundary. Bayesian model reduction is implemented as a sweep over prior precision and metacognitive access, extended with a sensitivity grid over observation noise. The separation prior is pruned only when removing it lowers the model's free energy, and kept when its remaining contribution to accuracy still offsets its complexity cost. The active-inference layer uses the inferactively-pymdp library (Heins et al. 2022) with profile-specific likelihood, transition, preference, and prior arrays for the separation-constrained, opacified, and post-dual quantum reference frame deployments, then records posterior beliefs, policy posteriors, selected actions, expected-free-energy summaries, seeded stochastic ensembles with null controls and replay seeds, and confidence intervals, without treating those simulations as empirical subject data. Practice protocols, compassion-policy scope, criticality-style indicators, quantum-boundary dynamics, empirical adapters, and artifact-release readiness are therefore written as bounded model interfaces, simulated indicators, local private release-readiness records, or blocked evidence classes. A physical realization of the quantum free-energy principle, public independent reproduction, and any human practice efficacy, neural measurement, or clinical outcome remain blocked future evidence classes. All manuscript and code source materials are available at https://github.com/docxology/realizing_emptiness

•Jun 24, 2026•0 citations

The Quantum Control Architecture: From a Fail-Closed Estimator to a Governed Measurement-and-Control Layer for Cryogenic Quantum Systems

Majid Hussain

A companion paper reported a fail-closed estimator — the Quantum Control Kernel (QCK) — that detects the precursor of systematic bias drift in cryogenic quantum control before actuator saturation, validated in simulation and against live, publicly accessible IBM hardware-calibration data. This paper reports what the estimator is for: the Quantum Control Architecture (QCA), a governed measurement-and-control layer in which the demonstrated kernel is the sensing floor of a larger construction. The construction is not free design. It is the quantum instantiation of a result established generically in the Finite Cognition series: a finite observer serving both a committing execution demand and a wide-field vigilance demand is forced to partition the two and re-couple them at the point of finalisation, so that no output is committed that vigilance has not verified. We show that quantum control information forces exactly this construction — telemetry is consumed by every layer of the control stack yet governed by none of them; observation of a quantum plant must be non-perturbative by discipline, not by hope; and an estimator that is fluent but ungoverned reproduces, on the control substrate, the same confident-and-blind failure the series identified generically. We then state the architecture that discharges the constraint, in its public units: a non-perturbative observer (NPO); the QCK detection floor; fail-closed gates that allow, abstain, or refuse; a state-coherence and equilibrium discipline over commits; provenance-checked memory that refuses known-failure patterns; a lifecycle and loop supervisor; a measurement plane of stability, coupling, margin, and cost features; and an integrity plane that audits the architecture’s own calibration model and gates its portability to new hardware on provably leak-free relocation. We are explicit about maturity throughout: the kernel is demonstrated at Technology Readiness Level 4 under published bounds; the architecture beyond it is compile-ready geometry — derived, specified, and internally consistent, not validated as live middleware on partner hardware. The architecture is advisory by construction: the operator owns the plant at every depth.

•Jul 22, 2026•0 citations

The Quantum Control Architecture: From a Fail-Closed Estimator to a Governed Measurement-and-Control Layer for Cryogenic Quantum Systems

Majid Hussain

A companion paper reported a fail-closed estimator — the Quantum Control Kernel (QCK) — that detects the precursor of systematic bias drift in cryogenic quantum control before actuator saturation, validated in simulation and against live, publicly accessible IBM hardware-calibration data. This paper reports what the estimator is for: the Quantum Control Architecture (QCA), a governed measurement-and-control layer in which the demonstrated kernel is the sensing floor of a larger construction. The construction is not free design. It is the quantum instantiation of a result established generically in the Finite Cognition series: a finite observer serving both a committing execution demand and a wide-field vigilance demand is forced to partition the two and re-couple them at the point of finalisation, so that no output is committed that vigilance has not verified. We show that quantum control information forces exactly this construction — telemetry is consumed by every layer of the control stack yet governed by none of them; observation of a quantum plant must be non-perturbative by discipline, not by hope; and an estimator that is fluent but ungoverned reproduces, on the control substrate, the same confident-and-blind failure the series identified generically. We then state the architecture that discharges the constraint, in its public units: a non-perturbative observer (NPO); the QCK detection floor; fail-closed gates that allow, abstain, or refuse; a state-coherence and equilibrium discipline over commits; provenance-checked memory that refuses known-failure patterns; a lifecycle and loop supervisor; a measurement plane of stability, coupling, margin, and cost features; and an integrity plane that audits the architecture’s own calibration model and gates its portability to new hardware on provably leak-free relocation. We are explicit about maturity throughout: the kernel is demonstrated at Technology Readiness Level 4 under published bounds; the architecture beyond it is compile-ready geometry — derived, specified, and internally consistent, not validated as live middleware on partner hardware. The architecture is advisory by construction: the operator owns the plant at every depth.

•Jul 22, 2026•0 citations
Public access to pulse-level and control-electronics interfaces in commercial quantum computing has bifurcated. This paper proposes a six-axis rubric for measuring control-plane openness, the layer between gate-level circuit specification and physical control electronics, defined operationally so that the same evidence produces the same grade across vendors. The rubric is validated three ways: a blinded re-grading pass that tests whether the cited evidence and the level definitions alone reproduce the recorded grades, a boundary-case methodology that fixes where each level begins and ends, and a published grading protocol that lets others reproduce and contest any cell. A time-point comparison anchored on the February 2025 removal of pulse-level access from IBM hardware establishes that the rubric measures change rather than describing a snapshot. The rubric is applied to thirteen commercial vendors across superconducting, trapped-ion, neutral-atom, and photonic modalities as of May 1, 2026, and one of the three harms it detects is demonstrated through a reproduction-access audit of five pre-2025 IBM Qiskit Pulse experiments, carried through to a structural port to Rigetti Quil-T. The catalog ships as a machine-readable artifact under CC-BY-4.0 with per-cell source URLs (https://doi.org/10.5281/zenodo.20163276). The readings will go stale; the rubric is the contribution that survives them.
This paper presents the experimental validation and execution of the EIEZ Language (Version 3) on real physical quantum hardware. Deployed across IBM Quantum processors (ibm_fez, ibm_marrakesh, and ibm_torino, featuring 133 to 156 physical qubits), the EIEZ v3 framework introduces hybrid compilation targeting OpenQASM 2.0 and OpenQASM 3.0, adaptive classical control flow (while, repeat-until with rich CondExpr logic), and hardware topology validation (EIEZTopologyError). The test series evaluated 2- and 3-qubit entanglement circuits (Bell State, GHZ State), quantum algorithms (Deutsch), and depth-scaling tests (H×1H \times 1H×1 to H×10H \times 10H×10), executed with up to 4,096 shots per job. Key Results: Full Compilation Compatibility: Seamless execution flow from EIEZ source code to OpenQASM and IBM Quantum hardware. High Entanglement Fidelity: Average fidelity of ~95% across Bell State, GHZ, and Deutsch algorithm executions on physical QPUs. Critical Decoherence Point: Empirical observation of quantum interference breakdown at depth H×3H \times 3H×3 (~50% deviation from the ideal EIEZ simulator), providing physical evidence of criticality and confirming the applicability of the EIE/ZIE adaptive control framework (Patent BR 10 2025 024459 4). Transpiler Depth Recovery: Fidelity restoration to ~99.7% at depth H×10H \times 10H×10 driven by internal sequence optimization in Qiskit transpilation. Open FAIR Dataset: Release of machine-readable raw measurement counts (JSON/CSV), UTC timestamps, and IBM Job IDs for open verification. Links & Resources: IBM Quantum Cloud Platform: https://quantum.cloud.ibm.com/ Raw Execution Counts (JSON / CSV): https://github.com/joemerson/eiez-lang/blob/main/eiez-lang/Teste_rodados_IBM_/JSON.json Local Simulation Notebooks (Zenodo): https://doi.org/10.5281/zenodo.19078764 EIEZ Compiler Source Code (GitHub): https://github.com/joemerson/eiez-lang Complete EIE/ZIE Theory & Framework (Zenodo): https://doi.org/10.5281/zenodo.19005280 Zenodo DOI: https://doi.org/10.5281/zenodo.19078829
This manuscript presents a methods-forward, operational protocol for evaluating whether any structured dependence remains in quantum-computing measurement records after explicit modeling of standard quantum and device-level mechanisms. Classical definiteness is defined at the record layer, and pre-record states are treated as predictive descriptions rather than as classical outcome facts. Within this operational stance, the protocol converts questions about outcome status and record formation into a falsifiable test program grounded in preregistered analysis rules and standard measurement telemetry. A locked null-model family is specified in advance, incorporating standard quantum dynamics together with documented device-level mechanisms including drift, correlated and non-Markovian noise, crosstalk proxies, and leakage indicators. The framework provides operational definitions, a conservative postulate set, preregistered endpoints, residual-adjudication criteria, negative controls, a fixed windowing discipline, and a bound-first reporting standard designed to yield informative constraints under null results. Any candidate contribution beyond the declared null family must appear as structured, reproducible residual dependence that survives the locked null family and the full residual-filter sequence. Version 4.4 refines the protocol specification, clarifies evidentiary boundaries, and strengthens the integration of the synthetic demonstration. The manuscript includes a fully specified classical simulation that executes the decision pipeline under controlled conditions. The synthetic study illustrates how the protocol classifies a bounded-null case, a measured-artifact case, a partial-artifact/unresolved-covariate case, an injected structured-residual case, and a failed-topology case. This demonstration establishes computational executability of the protocol and clarifies the behavior of the decision tree, but it does not constitute empirical evidence for any physical mechanism. Because the protocol relies only on standard measurement telemetry and preregistered analysis rules, it is directly implementable across contemporary quantum-computing platforms and does not depend on any single dataset, backend, or hardware realization. The manuscript is a specification paper: it defines a reproducible evidentiary framework for record-level claims, while large-scale empirical implementation, hardware benchmarking, and cross-platform replication remain subsequent studies.
The maturation of quantum computing from theoretical physics to engineering reality presents a complex landscape for stakeholders navigating the transition from Noisy Intermediate-Scale Quantum (NISQ) devices toward Fault-Tolerant Quantum Computation (FTQC). This report provides a comprehensive, technically rigorous analysis of the current quantum ecosystem, examining the hardware mosaic of leading qubit modalities—superconducting circuits, trapped ions, neutral atoms, and silicon spin qubits—and evaluating them against operational metrics, including coherence times, gate fidelities, and cryogenic infrastructure requirements. We dissect the full software stack, differentiating the near-term utility of error mitigation techniques such as Zero-Noise Extrapolation (ZNE) from the long-term necessity of Quantum Error Correction (QEC) and the milestone of logical qubit break-even. The analysis benchmarks hybrid algorithms (VQE, QAOA) and circuit knitting strategies against current cloud-accessible hardware performance, while also addressing the imminent non-computational impact of PostQuantum Cryptography (PQC) migration. Experimental data synthesised from leading vendor roadmaps and pre-print literature indicate that superconducting platforms currently lead in gate speed (nanosecond regime) but face crosstalk scaling challenges beyond 1,000 qubits. In contrast, trapped-ion and neutral-atom architectures demonstrate superior connectivity and coherence. The report concludes with a grounded, evidence-based five-year projection, identifying high-value vertical use cases in pharmaceuticals and finance, and providing a strategic framework for enterprises to separate quantum hype from tangible commercial opportunity. Future research directions include the realisation of low-overhead Quantum LDPC codes and the development of modular photonic interconnects to scale beyond single-chip architectures.
This project operationalizes the 2026 preprint "There is no self-evidence: A physics of emptiness realisation" as a source-anchored software artifact. Its central claim is that a finite agent can use a boundary for prediction while never obtaining evidence that the boundary is ontologically real, and the software separates three local artifact roles: formal sanity checks for source equations, positive-control-style finite mechanism checks, and discriminating tests that reject stronger readings when a control is perturbed. The formal layer maps the paper's quantum free-energy principle (qFEP) and quantum reference frame (QRF) equations into finite operational surrogates, bridging each paper equation to a specific software artifact. The computed artifacts are a suite of finite quantum-information and contextuality audits — spanning two-qubit separability and entanglement entropy, Bell and contextuality witnesses, thermodynamic and open-system dynamics, seeded quantum-trajectory sampling checked against exact solutions, and frame-covariance checks for the quantum reference frame relabelings — with explicit positive controls, negative controls, or boundary checks recorded where the corresponding artifact contract requires them. The software represents QRF deployments as policies over boundary-channel sectorisations, using the same finite bitstream under self/environment/contextual relabelings so that QRF labels can organize prediction, action selection, and transformation covariance while failing to become evidence for an ontological self/world boundary. Bayesian model reduction is implemented as a sweep over prior precision and metacognitive access, extended with a sensitivity grid over observation noise. The separation prior is pruned only when removing it lowers the model's free energy, and kept when its remaining contribution to accuracy still offsets its complexity cost. The active-inference layer uses the inferactively-pymdp library (Heins et al. 2022) with profile-specific likelihood, transition, preference, and prior arrays for the separation-constrained, opacified, and post-dual quantum reference frame deployments, then records posterior beliefs, policy posteriors, selected actions, expected-free-energy summaries, seeded stochastic ensembles with null controls and replay seeds, and confidence intervals, without treating those simulations as empirical subject data. Practice protocols, compassion-policy scope, criticality-style indicators, quantum-boundary dynamics, empirical adapters, and artifact-release readiness are therefore written as bounded model interfaces, simulated indicators, local private release-readiness records, or blocked evidence classes. A physical realization of the quantum free-energy principle, public independent reproduction, and any human practice efficacy, neural measurement, or clinical outcome remain blocked future evidence classes. All manuscript and code source materials are available at https://github.com/docxology/realizing_emptiness
A companion paper reported a fail-closed estimator — the Quantum Control Kernel (QCK) — that detects the precursor of systematic bias drift in cryogenic quantum control before actuator saturation, validated in simulation and against live, publicly accessible IBM hardware-calibration data. This paper reports what the estimator is for: the Quantum Control Architecture (QCA), a governed measurement-and-control layer in which the demonstrated kernel is the sensing floor of a larger construction. The construction is not free design. It is the quantum instantiation of a result established generically in the Finite Cognition series: a finite observer serving both a committing execution demand and a wide-field vigilance demand is forced to partition the two and re-couple them at the point of finalisation, so that no output is committed that vigilance has not verified. We show that quantum control information forces exactly this construction — telemetry is consumed by every layer of the control stack yet governed by none of them; observation of a quantum plant must be non-perturbative by discipline, not by hope; and an estimator that is fluent but ungoverned reproduces, on the control substrate, the same confident-and-blind failure the series identified generically. We then state the architecture that discharges the constraint, in its public units: a non-perturbative observer (NPO); the QCK detection floor; fail-closed gates that allow, abstain, or refuse; a state-coherence and equilibrium discipline over commits; provenance-checked memory that refuses known-failure patterns; a lifecycle and loop supervisor; a measurement plane of stability, coupling, margin, and cost features; and an integrity plane that audits the architecture’s own calibration model and gates its portability to new hardware on provably leak-free relocation. We are explicit about maturity throughout: the kernel is demonstrated at Technology Readiness Level 4 under published bounds; the architecture beyond it is compile-ready geometry — derived, specified, and internally consistent, not validated as live middleware on partner hardware. The architecture is advisory by construction: the operator owns the plant at every depth.
A companion paper reported a fail-closed estimator — the Quantum Control Kernel (QCK) — that detects the precursor of systematic bias drift in cryogenic quantum control before actuator saturation, validated in simulation and against live, publicly accessible IBM hardware-calibration data. This paper reports what the estimator is for: the Quantum Control Architecture (QCA), a governed measurement-and-control layer in which the demonstrated kernel is the sensing floor of a larger construction. The construction is not free design. It is the quantum instantiation of a result established generically in the Finite Cognition series: a finite observer serving both a committing execution demand and a wide-field vigilance demand is forced to partition the two and re-couple them at the point of finalisation, so that no output is committed that vigilance has not verified. We show that quantum control information forces exactly this construction — telemetry is consumed by every layer of the control stack yet governed by none of them; observation of a quantum plant must be non-perturbative by discipline, not by hope; and an estimator that is fluent but ungoverned reproduces, on the control substrate, the same confident-and-blind failure the series identified generically. We then state the architecture that discharges the constraint, in its public units: a non-perturbative observer (NPO); the QCK detection floor; fail-closed gates that allow, abstain, or refuse; a state-coherence and equilibrium discipline over commits; provenance-checked memory that refuses known-failure patterns; a lifecycle and loop supervisor; a measurement plane of stability, coupling, margin, and cost features; and an integrity plane that audits the architecture’s own calibration model and gates its portability to new hardware on provably leak-free relocation. We are explicit about maturity throughout: the kernel is demonstrated at Technology Readiness Level 4 under published bounds; the architecture beyond it is compile-ready geometry — derived, specified, and internally consistent, not validated as live middleware on partner hardware. The architecture is advisory by construction: the operator owns the plant at every depth.