This preprint studies a structural failure mode in variational quantum mereology using the compact generalized-bipartition construction of Kabernik, Pollack, and Singh (KPS) as a benchmark. KPS previously reported non-uniqueness of the selected low-field structures, including six distinct state-reduction maps for the N=3 example. The contribution of this work is not the discovery of that degeneracy, but an explanation of its structural origin and its physical consequences.For finite open Ising chains, within the fixed computational-basis compact family, the diagonal Ising interaction does not contribute to the inter-row part of the short-time linear-entropy selector. As a result, the selector factorizes into a positive field-dependent normalization multiplied by a graph functional that is independent of the interaction ordering. This interaction blindness produces a criterion-symmetry surplus: the selector has a larger permutation symmetry than the discrete symmetry of the physical open-chain Hamiltonian.The mechanism is derived analytically, while its realization as physical non-identification is exhaustively certified for N=3, N=4, and N=5. The complete exact-selected sets contain 6, 48, and 120 compact maps, respectively, which split into 2, 12, and 30 discrete Hamiltonian-symmetry classes. An independent reduced-state information diagnostic varies across these classes, showing that structures considered equivalent by the selector can retain different physical information.For N=5, the exact selector optimum is 9/140. The full selected set contains 120 maps and 30 discrete Hamiltonian-symmetry classes, reproduced by independent exhaustive computational implementations. The accompanying reproducibility archive includes the manuscript, Supplemental Material, numerical certificates, symmetry audits, independent verification scripts, integrity manifests, and package-level reproducibility checks.An N=6 computational certificate is also included as a boundary check. It improves the certified loss bound to LOSS >= 51250 and gives the bracket 1232336 <= Z_F <= 1288670. This does not constitute closure of the exact N=6 optimum and is not used to claim an asymptotic scaling law.
This preprint studies a structural failure mode in variational quantum mereology using the compact generalized-bipartition construction of Kabernik, Pollack, and Singh (KPS) as a benchmark. KPS previously reported non-uniqueness of the selected low-field structures, including six distinct state-reduction maps for the N=3 example. The contribution of this work is not the discovery of that degeneracy, but an explanation of its structural origin and its physical consequences.For finite open Ising chains, within the fixed computational-basis compact family, the diagonal Ising interaction does not contribute to the inter-row part of the short-time linear-entropy selector. As a result, the selector factorizes into a positive field-dependent normalization multiplied by a graph functional that is independent of the interaction ordering. This interaction blindness produces a criterion-symmetry surplus: the selector has a larger permutation symmetry than the discrete symmetry of the physical open-chain Hamiltonian.The mechanism is derived analytically, while its realization as physical non-identification is exhaustively certified for N=3, N=4, and N=5. The complete exact-selected sets contain 6, 48, and 120 compact maps, respectively, which split into 2, 12, and 30 discrete Hamiltonian-symmetry classes. An independent reduced-state information diagnostic varies across these classes, showing that structures considered equivalent by the selector can retain different physical information.For N=5, the exact selector optimum is 9/140. The full selected set contains 120 maps and 30 discrete Hamiltonian-symmetry classes, reproduced by independent exhaustive computational implementations. The accompanying reproducibility archive includes the manuscript, Supplemental Material, numerical certificates, symmetry audits, independent verification scripts, integrity manifests, and package-level reproducibility checks.An N=6 computational certificate is also included as a boundary check. It improves the certified loss bound to LOSS >= 51250 and gives the bracket 1232336 <= Z_F <= 1288670. This does not constitute closure of the exact N=6 optimum and is not used to claim an asymptotic scaling law.
Paper-5 develops a reproducible symmetry-resolved method for analyzing the internal structure of fixed-order many-body quantum correlator fields using Johnson-harmonic decomposition. Instead of compressing a large collection of labelled correlators into a single overall number, the method keeps the subset structure of the data and separates the centered correlator field into different harmonic layers. This makes it possible to see how correlations are organized inside a quantum system, not only how large the total correlation is. J742_Paper5_Main_Manuscript_DOI… This work is part of the broader QDL five-paper progression: Paper-1 — Exact Permutation Moments: develops exact finite-sample mean, variance, and covariance formulas for Walsh interaction-order energies under permutation. Paper-2 — Exact Distribution Laws: extends the framework to structured exact distributions, Krawtchouk-based reductions, computational-complexity boundaries, and continuation-horizon classification. Paper-3 — Exact Certified Tail Computation: develops certified deterministic counting methods for difficult exact tail probabilities in a structured finite Walsh/Clebsch problem. Paper-4 — Identifiability, Contrast Closure, and Frozen External Testing: studies restricted four-variable log-linear interaction models, rank, identifiability, contrast closure, and a frozen external statistical test. Paper-5 — Johnson-Harmonic Correlator Profiles: applies a symmetry-resolved framework to complete labelled quantum correlator fields and studies how their internal correlation structure is distributed across Johnson-harmonic layers. The central challenge in Paper-5 is that a many-body experiment can produce hundreds or thousands of labelled correlators. If these are reduced to one aggregate norm, important structural information can be lost. Paper-5 preserves the full labelled subset geometry and resolves the correlator field into interpretable harmonic components. What Paper-5 does: reconstructs complete fixed-order labelled correlator fields from public experimental data; removes the common-mode component and decomposes the remaining structure into Johnson-harmonic layers; computes layer energies and normalized structural statistics; uses exact finite-population projector calibration; preserves subset-label information instead of reducing everything to a single total norm; propagates uncertainty using source-native randomized experimental replicates; applies an exact finite-shot bias correction to quadratic layer energies; compares the physical signal with a source-defined noise-reference cohort; provides a reproducible computational route through QDL Research Suite v1.3.0. The mathematical Johnson/slice decomposition itself is established mathematics; the contribution of Paper-5 is the combined experimental-analysis workflow and its application to two independent public quantum datasets. J742_Paper5_Main_Manuscript_DOI… Main locked results: For the six-qubit tomography dataset, each setting contains 20 three-body correlators with harmonic dimensions 20 = 1 + 5 + 9 + 5. Across 28 source measurement settings, the pooled centered correlation structure is: H1 = 48.4133% H2 = 36.7277% H3 = 14.8590% This shows a distributed harmonic profile rather than concentration in a single layer. J742_Paper5_Main_Manuscript_DOI… For the independent 32-qubit hardware dataset, each seed contains 4,960 three-body correlators, decomposed as 4,960 = 1 + 31 + 464 + 4,464. Across nine frozen seeds, the pooled profile is: H1 = 0.341937% H2 = 0.123369% H3 = 99.534694% showing an extremely strong H3-dominant structure. J742_Paper5_Main_Manuscript_DOI… The H3-dominant result remains stable across 675 source-randomized physical twirls. A seed-blocked bootstrap gives a pooled H3 95% interval of approximately: 99.5301% – 99.5388%. J742_Paper5_Main_Manuscript_DOI… After exact finite-shot correction, the pooled H3 fraction changes only from approximately 99.53469% → 99.53486%, showing that ordinary finite-shot sampling bias is extremely small relative to the observed structure. J742_Paper5_Main_Manuscript_DOI… A source-defined noise-renormalization reference cohort gives the opposite profile: Physical corrected H3: 99.534860% Noise-reference corrected H3: 0.138145% providing a strong diagnostic contrast between the physical cohort and the source-defined reference data. J742_Paper5_Main_Manuscript_DOI… How Paper-5 connects to the earlier papers:Paper-1 provides exact permutation-moment tools. Paper-2 studies structured exact distributions. Paper-3 develops certified exact-tail computation. Paper-4 focuses on identifiability and restricted interaction models. Paper-5 moves to a different but related application layer: it uses structured mathematical tools to analyze the internal organization of many-body quantum correlation fields. Why it is useful:The method is useful when a quantum experiment produces many labelled multi-qubit or many-body correlators and researchers want to understand where the structure is located inside that large correlation field. Potential applications include: quantum-state tomography; randomized-measurement analysis; many-body quantum experiments; multi-qubit correlation analysis; quantum-hardware characterization; comparison of correlation structures across devices or experiments; finite-shot robustness checks; structured analysis of subset-indexed data; reproducibility and independent verification of quantum experiments. Rather than asking only: “How much correlation is present?” Paper-5 also asks: “How is that correlation organized across different symmetry layers?” This makes the method useful as a structure scanner for complex quantum correlation data. Reproducibility:The computational implementation for Paper-5 is included in QDL Research Suite v1.3.0, DOI 10.5281/zenodo.22972830. The software provides the Paper-5 computational reproduction route while preserving the original public datasets as the source authority. J742_Paper5_Main_Manuscript_DOI… Paper-5 Preprint DOI:10.5281/zenodo.22974172 J742_Paper5_Main_Manuscript_DOI… Scope:Paper-5 provides a structural and statistical diagnostic workflow. The Johnson decomposition itself is established mathematics. The paper does not claim a new universal Johnson theorem, Bell nonlocality, neutrino thermalization from the H3 statistic, a new physical mechanism, causation, retrocausality, future-state prediction, or a nonzero physical intervention parameter. J742_Paper5_Main_Manuscript_DOI… In simple terms:Paper-5 takes a large set of quantum correlations and breaks it into meaningful symmetry layers. Instead of giving only one total correlation number, it shows where the correlation structure lives inside the data. In the six-qubit experiment, the structure is spread across several layers. In the 32-qubit dataset, almost all of the centered structure appears in the highest Johnson layer, and this pattern remains stable after randomized-twirl analysis and finite-shot correction. In one sentence:Paper-5 is a reproducible structure-analysis framework for complex quantum correlation data that shows not only how much correlation exists, but how that correlation is organized inside the system.
## Overview This theorem-focused paper studies one logical qubit encoded into two physical qubits and exposed to two independent temporally ordered dephasing events, one collective and one differential, whose binary history labels are coherently stored by an environment. The objective is to minimize the worst-case logical information leaked into the environment’s history register over all rank-two quantum codes. A probability-adapted Bernoulli basis reduces the complementary output difference for arbitrary independent event probabilities to a traceless three-dimensional Hermitian arrow matrix. Phase-reflection and event-exchange symmetries then show that the fixed-code worst-phase leakage and its all-code minimax depend on the event probabilities only through their Bernoulli variances. ## Main results At equal event probabilities μ+=μ−=1/5, an explicit transverse non-isoclinic code satisfies L1/5,1/5wc(V)≤25099<52, where 2/5 is the exact optimum over the complete parity-isoclinic manifold. The strict upper bound is certified using exact rational tensor-Bernstein arithmetic. Distributional stability extends this separation to an explicit two-parameter rectangle whose open interior is a region of forced non-isoclinic optimality. On the symmetric independent line, the paper proves a thresholdless bifurcation: every nondeterministic nonbalanced distribution destroys parity-isoclinic global optimality. Near the balanced point, probability bias selects the universal finite anisotropy η0=832−4, and the minimax over the full rank-two code Grassmannian satisfies Λdiag(δ)=21−(21−62)δ2+o(δ2),δ=1−2μ. Every asymptotically minimizing code accumulates on the transverse balanced-minimizer stratum with r=21,η=η0,ez=oz=0, and with relative transverse-axis overlap bounded by ∣e⋅o∣≤32−1. Thus probability bias breaks the balanced continuum of globally minimizing codes and selects a genuinely non-isoclinic geometric phase with a universal leading anisotropy over the full code Grassmannian. ## Scope The paper does not claim an exact finite-bias formula for the complete minimax, a determination of the order at which the remaining transverse-axis overlap is selected, or a complete off-diagonal phase boundary for unequal event variances. These are identified as follow-up problems. ## Reproducibility package This record contains: - the manuscript PDF;- the complete LaTeX source;- a standalone reproducibility bundle;- seven deterministic exact-arithmetic theorem verifiers;- machine-readable JSON verification reports;- a SHA-256 manifest and verification utility. No floating-point comparison enters a verifier’s PASS decision. The scripts certify the exact rational or symbolic identities used in the proofs. Compactness, localization, perturbative-envelope, and Grassmannian liminf arguments remain analytic parts of the manuscript and are not replaced by computation. ## Version Version v0.3r2, July 2026. ## Related public records - Directional code-geometry foundation: DOI `10.5281/zenodo.21523950`- Balanced finite-history benchmark and complete minimizer geometry: DOI `10.5281/zenodo.21560397`
This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
Version 1 (first deposit, 2026-08). 19 pages. Every quantitative claim traces to a pre-registered evidence block with an archived log in the companion zip; the ledger of failed predictions is an appendix of the paper. A long-running dispute asks whether a quantum world selects its own decomposition into subsystems from the Hamiltonian and the state alone. Stoica (Adv. Theor. Math. Phys. 26, 3895 (2022)) proves that a structure so constructed cannot be both essentially unique and physically relevant, the non-uniqueness being modulo the unitaries commuting with H; Soulas, Franzmann and Di Biagio (arXiv:2512.07468) object that producing a second structure that way modifies the input pair, and prove a positive uniqueness theorem under two hypotheses. Both are correct, about different groups, and this paper makes the difference arithmetic. Working inside the collision architecture of the companion flagship (doi:10.5281/zenodo.22014601, all versions), where an interior memory writes records of a system and audits itself from them, the two invariance groups an interior audit actually has are measured. FIRST, the audit's Hamiltonian-side content is exactly constant on the orbits of the commutant of H, the fibres of the transport map are exactly those orbits, and the resulting gauge has the closed form sum_i m_i^2 - 1 in the eigenvalue multiplicities: the degeneracy has a computable size, three dimensions inside sixteen for a generic four-level Hamiltonian, five at (2,3), and larger exactly when the symmetry group is NON-ABELIAN (Heisenberg gives nine; abelian symmetry forces no spectral degeneracy). SECOND, the audit's total content is invariant not under that commutant but under the stabiliser of the PAIR (H, psi), which is trivial precisely under the Soulas hypotheses: the orbit holds the Hamiltonian side fixed to 2.7e-15 and pays for the second structure entirely on the state side, 1.14. The stabiliser formula quantifies exactly when their free-action condition holds and by how many dimensions it fails otherwise. THIRD, the record statistics carry their own blindness: the directions invisible to the census, whatever the state and the time, form a group, and for a register read in one basis per cell it is exactly span{I, T} at every fragment count, proved by a symplectic argument over F_2 requiring no induction -- in this deposit, by two algorithmically independent F_2 implementations plus a dense-matrix verification. That scope is the result rather than a caveat: the one-bit blindness is the price of a one-basis readout, and it is the only thing that price buys; reading a second basis on every cell collapses the group to the identity and credentials the full matrix algebra. The twist is the product of the observer's own precession with all of its own readouts, T = P R_1 ... R_k exactly, so the blindness group is the CENTRE of the credentialed algebra: an interior observer cannot see the centre its own operations generate. The credentialed algebra is everything commuting with that one bit, of dimension d^2/2. Blindness under this reading is an identity and not a similarity: for T in the blindness group the census under rho and under T rho T-dagger agrees exactly at trace distance 0.740, so no additional sampling can separate them. The paper prints the response functional every margin and census count is computed from, together with its grid and state. Around the group sit its measured collapse conditions: the price list of restorations (menus that eject the twist restore visibility at costs that double register by register, 10/20/40 contexts on the z-menu and 4/8/16 on the y/z-menu at k = 2, 3, 4, stated as observed at three points, not derived); the sorting condition for which twist configurations a restoration menu revives, named as reach membership of the displacement in the Krylov closure of the menu (63/63 exact at k = 2 in three independent engines, 255/255 at k = 3 in exact rational arithmetic; an all-time reach lemma proves the decision grid decision-faithful and shows it deliberately not span-complete); the genericity of visibility (the blindness locus is a union of alignment strata computed in part: a QND family at the minimal codimension 2 and twist families indexed by subsets of cells at codimension 2k, with a bounded search that surfaced a mixed partial-twist family the hand count had missed); and both branches of the open-world dichotomy reproduced from the group definition alone. The transport side is independently rebuilt: the W-alone computation the framework's kill switch depends on was reconstructed from the printed setting alone and the switch does not fire. A closing section isolates the mechanism shared with an earlier half-space result and shows, against the natural reading, that the two halves are distinct subspaces meeting in a quarter: one lemma, distinct instances. All quantitative claims were pre-registered before their runs. The ledger of failed predictions is an appendix and is kept in full, including a posted mechanism that died, a symmetry law corrected to Schur's criterion, a numerics trap caught only because a posted claim came back wrong, engine deaths from the exact-census campaign convicted by their own gates, and errors printed in earlier drafts and caught in review. The delineation of what is inherited from the literature is stated throughout; the paper asserts no priority claims.
Ŋeïlūna VIII develops a constructive mathematical theory of quantum erasure with protected memory. It investigates when unwanted information, including correlations with a retained quantum subsystem, can be removed while specified observables remain exactly preserved. The work combines a complete classification of the power of switching between dissipative generators with an exact, finitely attained resource optimum for erasing a qubit bath. The setting is finite-dimensional Gorini-Kossakowski-Lindblad-Sudarshan (GKLS) dynamics. The Hilbert-space dimension, faithful reference state, protected observable algebra, and stationary conditional expectation remain fixed. Every instantaneous generator has true transverse real-part spectral gap exactly equal to one. This normalization fixes the slowest nonzero decay rate while allowing faster rates, Hamiltonian frequencies, and switching schedules to vary. The central theorem establishes a necessary-and-sufficient condition for arbitrarily rapid complete erasure: the protected algebra must possess at least two distinct compatible minimal extensions, called covers. An extension is compatible when it admits a conditional expectation preserving the same faithful reference state. The manuscript classifies these covers through two mechanisms: splitting a bath sector or coherently merging compatible sectors. Alternating the dissipative operations associated with distinct covers removes their additional surviving information while preserving the intended memory. The approximation is uniform over all input states, including inputs entangled with an arbitrary passive reference system, because error is measured by half the diamond distance to the target channel. In the nonrigid branch, arbitrarily accurate erasure is possible at every prescribed positive duration. Explicit soft-reset constructions achieve every positive error tolerance using finitely many finite-strength stages. Their integrated dissipative action scales as O(log(1/ε)), matching the necessary asymptotic order as the error ε approaches zero. An optimal leading coefficient in general dimension is not claimed. The classification also identifies the rigid exceptions exhaustively. Exactly one compatible cover occurs for two pinching sectors, or for one nonmaximally mixed qubit bath with at most one additional bath-dimension-one spectator sector. Protected logical dimensions are unrestricted. Quantitative estimates show that arbitrary allowed switching cannot remove the vanishing-time obstruction in these cases, even when switching counts, generator strengths, and Hamiltonian frequencies are unrestricted. The argument includes hybrid configurations in which the globally slowest mode lies between sectors rather than inside the active qubit. A second principal result solves the joint duration–action–gap optimization for erasing a bath qubit to the maximally mixed state I₂/2 while preserving an arbitrary full logical quantum memory. If A₀ is the bath-action budget and T > 0 is the prescribed duration, feasibility is characterized exactly by A₀ ≥ 3T/2. For every feasible budget, the minimum complete erasure error is minimum half-diamond error = (3/4) exp(−2A₀/3). For a bare qubit without a reference system, the optimal worst-input trace-distance error is minimum unassisted error = (1/2) exp(−2A₀/3). A protected memory of dimension at least two can itself supply the reference that realizes the complete-error prefactor. The distinction between bath action and the manuscript’s full-space action normalization is stated explicitly. Three equal-duration dissipative stages attain these optima exactly. Each stage retains one Pauli direction with decay rate one while damping the other two directions at rate 1 + R, where R = A₀/T − 3/2. Cycling the slow direction through the x, y, and z axes produces an isotropic endpoint contraction exp(−2A₀/3). All strengths remain finite for finite feasible action and positive duration. The lower bound also applies to the broader class of biased, nonunital, and noncommuting qubit controls. Equality requires a depolarizing endpoint composed with a unitary. The higher-dimensional boundary is established constructively. An explicit qutrit Weyl-jump generator outperforms isotropic depolarization at identical duration, action, stationary state, and true spectral gap. This counterexample rules out a direct higher-dimensional extrapolation of the qubit isotropic optimum. Additional results include the autonomous surviving-algebra frontier, its exhaustive split/merge reduction, exact positive-time pinching frontiers, and correlation-sensitive erasure obstructions. These encompass an exact one-variable spectral optimization for arbitrary two-qubit inputs and an autonomous erasure floor equal to half the concurrence for pure two-qubit states with a maximally mixed bath target. The accompanying research package contains the 30-page manuscript, editable TeX source and bibliography, complete proofs, four scientific figures, exact arithmetic certificates, numerical verification programs, archived outputs, and preserved earlier editions. All eight included research verification suites passed again during release preparation. Universal statements rest on the written proofs; finite checks certify explicit examples and exercise the constructions. Mathematical development and audits are AI-assisted. Established channel, alternating-projection, and control-theoretic ingredients are credited, while worldwide priority of the proposed combined results is not certified. Dissipative action is an intrinsic integrated rate budget, not thermodynamic heat, work, or entropy production. Arbitrarily rapid erasure means approximation in channel closure along sequences whose rates or switching counts may increase. Exact zero-error erasure is not achieved by a finite-action propagator. Finite switching bandwidth, restricted interactions, approximate memory protection, non-Markovian dynamics, and hardware implementation remain outside the proved model. Author credit: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Research version: 8.0. Release date: 29 October 2026.
We develop a finite operational response theory for controlled quantum systems in which observer closure, hidden microscopic structure, and higher-order response are treated within a single algebraic framework. The central distinction is between generic higher-order observability and Closure–Residue (CR)-constrained generative response. Standard finite-dimensional quantum theory does not, by itself, impose the specific CR accessibility condition introduced here; physically realizable controls are ordinarily determined by the microscopic Hamiltonian, hardware connectivity, conservation laws, and environmental couplings of the system under study. We therefore formulate First-Residue Accessibility as an additional finite selection principle for the coherent-control sector studied here: the infinitesimal deformation of the observer closure algebra generated by any admissible tangent in the declared target control manifold must lie in the first-residue derivation space inherited from an underlying microscopic CR sector. The algebraic consequences are rigid. Within this coherent-control sector, the maximal abelianness of the population algebra implies that the infinitesimal action of a control on the closure algebra determines its anti-Hermitian generator uniquely modulo a diagonal population gauge. First-Residue Accessibility therefore forces the declared coherent control class, up to this gauge, to lie in a canonical graph-internal subtype extracted from the microscopic CR sector. For diagonal prepared states, the visible first-order population response is silent, while the second variation factorizes through a graph-divergence map of a microscopic bilinear edge flow. A three-site single-excitation benchmark realizes the factorization exactly and yields an even response law of the form Sigma(epsilon X) = epsilon^2 Q_CR(X,X) + O(epsilon^4). We also separate exact discrete support transport from continuous-time quasilocality. A hard one-step support cone has a singular continuous-time limit whenever the limiting generator genuinely spreads local observables; finite propagation in the continuous limit must therefore be formulated by soft tails rather than exact support. We introduce a normalized-trace visible-leakage profile and derive a soft causal readout bound. In the coherent single-excitation sector this profile is uniformly equivalent, up to fixed observer-volume constants, to intrinsic operator-norm quasilocality. For finite-range exchange with simultaneous site dephasing we prove an N-uniform normalized-trace quasilocality estimate without using rank preservation. This genuinely nonunitary extension establishes a common finite-time exponential locality class with standard open-system quasilocality, while the stronger two-sided intrinsic equivalence is claimed only for the coherent unitary subclass. We further show that divergence-image membership is non-discriminating for connected full-population readout, construct an explicit standard CPTP control family that is first-order silent but violates the CR component constraint on a disconnected graph, and isolate experimentally measurable null tests. We distinguish a declared target-control manifold from the larger independently calibrated manifold of physically available coherent controls, thereby separating a conditional declared-manifold accessibility hypothesis from the stronger Physical First-Residue Accessibility statement. Under star-compatible oriented provenance we also derive an observable cross-prediction bound that links independently fixed static CR data to a measurable quadratic response coefficient. A framework-discriminating test requires both that the CR structure be fixed without using the target Hessian data and that the resulting constraint be stronger than what follows from the same calibrated microscopic information in a standard quantum model. We further exhibit a connected three-site collective-mode candidate in which CR Accessibility predicts an exact left–right quadratic null, while a same-support standard comparator constrained only by independently fixed aggregate tangent norms permits a nonzero response envelope. This yields a strict prediction-set separation under an explicit Dataset-A information condition, while also making clear that the separation disappears if standard microscopic calibration independently fixes the same collective tangent relation. We map this strict comparator onto a single-electron linear triple quantum dot, construct a four-point mixed-Hessian estimator, and propagate swap-odd instrumental asymmetry, finite-difference bias, and shot noise into a preregistered experimental envelope. The deeper derivation of the accessibility principle from the full Generative Map is left to the subsequent axiomatic stage of the program.