This release presents PooleQ/P Capture v5.6, a channel-resolved local-geometry framework for analyzing measured binary fields, p-bit samples, readout histories, and quantum syndrome-event data. The method preserves the Poole birth, survival, over-support, and strain channels rather than collapsing them into a single cellular-automaton update. The v5.6 amendment reframes PooleQ/P as a local-geometry spectrometer. It defines a decomposed signature vector[\mathcal S_{\rm Poole}(X)=(R_B,R_H,R_\psi),]where (R_B) measures birth-window or boundary geometry, (R_H) measures high-support geometry, and (R_\psi) measures support-strain geometry. The normalized spectrum (\Sigma_{\rm Poole}) identifies which local Poole geometry carries the measured structure. The included benchmark uses exact active-density matching, IID null controls, and same-density shuffled controls. Because shuffling preserves active-cell count while destroying local geometry, the results support the paper-safe claim that PooleQ/P detects structured local correlation beyond active density alone. This work does not claim to reconstruct unknown quantum states, clone qubits, or demonstrate quantum decoder superiority. It is presented as an interpretable measurement-side feature transform and diagnostic layer for structured binary data.
This release presents PooleQ/P Capture v5.6, a channel-resolved local-geometry framework for analyzing measured binary fields, p-bit samples, readout histories, and quantum syndrome-event data. The method preserves the Poole birth, survival, over-support, and strain channels rather than collapsing them into a single cellular-automaton update. The v5.6 amendment reframes PooleQ/P as a local-geometry spectrometer. It defines a decomposed signature vector[\mathcal S_{\rm Poole}(X)=(R_B,R_H,R_\psi),]where (R_B) measures birth-window or boundary geometry, (R_H) measures high-support geometry, and (R_\psi) measures support-strain geometry. The normalized spectrum (\Sigma_{\rm Poole}) identifies which local Poole geometry carries the measured structure. The included benchmark uses exact active-density matching, IID null controls, and same-density shuffled controls. Because shuffling preserves active-cell count while destroying local geometry, the results support the paper-safe claim that PooleQ/P detects structured local correlation beyond active density alone. This work does not claim to reconstruct unknown quantum states, clone qubits, or demonstrate quantum decoder superiority. It is presented as an interpretable measurement-side feature transform and diagnostic layer for structured binary data.
Matched quantum readouts often contain more structure than their local marginals display.The experiments studied here show a recurring pattern: some implemented-history squarescarry a stable non-additive component, while matched branch, key, retained-marker, Borncompatible, and separable controls collapse. History-selected geometric readout (HSGR) isintroduced as the geometry that summarizes this pattern. It keeps standard Born probabilitiesinside each specified operational channel, but assigns a relational scalar to the implementedhistory coordinate that survives presentation effects. The elementary coordinate is KHSGR =12(pAB + pBA − pAA − pBB), the mixed Walsh-Hadamard component of a four-cell probabilitytable. It cancels common bias, additive leakage, branch-separable response, matched-depth offsets,and separable analyzer effects. Superconducting, photonic, and raw-count quantum data motivateand test the construction. Tuna-9 gives selected mixed coordinates, orientation-odd signedholonomy, history-key nulls, and a retained-marker veto. Photonic mode-count data give signalcontrol screens, closed-holonomy fringes, coherent-key recovery, and lock-shadow-antilock controls.IBM count reductions give local-null decompression, phase-holonomy transport, quantum-eraserrecoverability, Born-compatible nulls, and backflow controls. The same geometry then gives arelational kernel for a hard CMV-B7 carrier-closure assay. A four-state RPHERNGFTVL/HLAB*07:02 kernel is selected from 3072 candidate protocols, with exactly one kernel satisfying thecarrier rules. A high-count Tuna-9 block measures the sixteen history cells at 6144 shots per cell.The hard-reference endpoint is positive, ΓRPH = 0.063070, with model-based SEind = 0.012351and zind = 5.11. Pooling with the earlier completed 2048-shot block gives ΓRPH = 0.065674,model-based SEind = 0.010712, and zind = 6.13. The result is a single carrier-kernel signal: a nonadditive antigenic relation is recovered by the connected history coordinate after local biologicalsimilarity, support-swap, pHLA-swap, raw-maximum, and separable zero-HSGR reductions fail,while strict subcell projections are reported as partial shadows of the implemented-historycoordinate
This paper reframes logical-qubit benchmarking from a scalar error-suppression problem into a branch-resolved logical-state maintenance problem. Conventional quantum error-correction reporting focuses on logical error rates, better-than-physical comparisons, code-distance scaling, decoder performance, and accepted-stream outcomes. These metrics are essential, but they do not by themselves reveal which stabilization mechanism produced the improvement, whether the result depends on active correction or detection-assisted filtering, how much acceptance overhead was paid, or which branches remain underdetermined because raw timing, reset, syndrome, leakage, or feed-forward records are unavailable. The central contribution is QHOME-RETROFIT, a branch-resolved diagnostic framework that operationalizes the Quantum-State Homeostasis condition of Paper 22 on published quantum error-correction records. The framework converts logical-state maintenance into normalized engineering margins, evidence-status labels, tiered verdicts, limiting-branch reports, and a reproducible CSV-first evaluation workflow. It separates restoration capacity, logical-basis sharpness, protected-mode occupation, source-sink coupling, logical gain, acceptance overhead, and repeated-round stability instead of collapsing them into a single logical-error-rate claim. QHOME-RETROFIT is not a new quantum processor, error-correcting code, decoder, or threshold theorem. It does not claim raw shot-level access where such records are not publicly available, and it does not treat detection-assisted post-selection as equivalent to full real-time source-sink closure. The core operating rule is: score only the branch supported by the released evidence, label what is weakly proxied, and leave underdetermined what the public record cannot decide. The manuscript is a systems-code and reproducibility-layer paper, not a hardware demonstration. It defines a diagnostic grammar, evidence classes, tier gates, reproducibility plans, raw-record replay boundaries, and package-level audit artifacts. Its companion package provides fixed CSV inputs, generated outputs, dashboards, tests, and manifest checks so that the branch verdicts can be inspected rather than accepted as prose claims. Before scaling claims about fault-tolerant quantum computing, this paper argues, researchers should test logical-state maintenance: whether a reported improvement is correction-driven, detection-assisted, acceptance-limited, repeated-round stable, source-sink supported, and sufficiently evidenced to justify the engineering claim being made. Keywords: QHOME-RETROFIT, quantum error correction, logical qubits, fault-tolerant quantum computing, logical-state maintenance, branch-resolved diagnostics, source-sink architecture, post-selection, accepted-stream filtering, reproducibility, systems code, evidence-status labels, tiered verdicts, logical error suppression.
Abstract We study whether a fixed qutrit feature geometry built from classical time-series derivatives and residual variability supports compact readouts that remain meaningful across heterogeneous cohorts. The eight special-unitary-group SU(3) Gell-Mann coordinates are derived analytically as deterministic functions of the four classical inputs, making the representation's inductive structure explicit. We then separate representation, candidate readout subspace, fitted direction, target detectability, and predictive utility under participant-separated evaluation. Human Activities and Postural Transitions (HAPT) data repeatedly select the gauge-fixed sector {λ₆, λ₈}. On Daphnet freezing-of-gait data, this core reaches pooled area under the receiver operating characteristic curve (AUROC) 0.72572 with participant-cluster jackknife 95% interval [0.63792, 0.81352], close to 0.72872 for the full eight-coordinate qutrit representation (Q3). A prospectively frozen FoG-STAR lower-back test fails its empirical detectability screen: the best pre-specified model has AUROC 0.50977 [0.45615, 0.56339]. A post-hoc event-level audit using archived fold-specific thresholds finds high nominal event sensitivity but 4.06 false alarms per minute on Daphnet and 27.69 on FoG-STAR primary, excluding a practical detector interpretation. Local encoder perturbations do not rescue the failed primary transfer. Same-information classical interaction features match or exceed reconstructed Q3 on several external settings. Thus neither quantum advantage nor SU(3)-specific predictive gain is supported. The contribution is a falsification-oriented, gauge-aware framework for testing whether compact operator readouts survive cohort, sensor, and task shifts.
We introduce the Quantum Measurement Timeline Framework (QMTF): an operational, target-relative account of quantum measurement that is timeline-complete and probability-correct. Core idea Declare a measurement target explicitly: what is registered, where it is registered, and when it is admitted as “the measurement,” at stated finite resolutions. Treat “measurement” as a localized quantum instrument, not as “anything that interacts.” Pipeline Target frame: 𝒟* = { (x_i, t_j) } (declared spacetime bins on which the measurement is admitted). Pre-measurement output: a sub-normalized joint spacetime support f_xt(x_i,t_j) = Tr(ρ E_(x_i,t_j)) p_surv = Σ_(x,t)∈𝒟* f_xt(x,t) Prediction layers (explicitly separated): Per-run (unconditional): P_abs over 𝒟* ∪ {∅} Conditional (given survival): P_cond defined only when p_surv > 0 Null handling (explicit): Includes a null outcome ∅ and a null decomposition (missed target vs reporting shortfall). Formal guarantees (in Appendix A) Formation→detection plane equivalence (“timeline equivalence”): evaluate at a formation plane and propagate, or evaluate directly at detection—predictions agree (up to discretization). No-signalling for localized instruments (operational locality). Finite-resolution stability via coarse-graining: predictions are stable under binning and converge under refinement. Worked constructions + artifacts Double slit benchmark (standard screen statistics) with a resolution-aware recombination/formation plane. Which-slit variant using an explicit instrument, with a tunable decoherence factor. Photon baseline (no intervening interactions) to show the same target logic in the simplest case. Runnable computational artifacts are released alongside the manuscript, with quality gates for verification. Positioning QMTF is interpretation-neutral: it does not assume any ontology for ψ. It is compatible with time-of-event POVMs and dilation (as an optional compatibility note, not a required ingredient).
This preprint studies finite-shot reconstruction of hidden quantum factor structure from global calibration-free sequence statistics without assuming an internal tensor-product cut in advance. A probability-only complex-projective 3-design self-test is used as an imported anchor for the active Hilbert/Jordan geometry. From this anchor, global control maps are reconstructed with explicit confidence bounds, including a weighted estimator for unequal shot counts and missing reference settings whenever the surviving frame remains full rank. The main certification result is a whole-commutant-energy lower bound. For reconstructed controls, the sum of the lowest commutator singular energies yields a basis-free lower bound on the aggregate projective Hilbert–Schmidt distance to every common hidden matrix factor of a specified multiplicity. Combined with exact Choi-to-projective-unitary conversion and finite-shot confidence balls, this produces a one-sided lower bound on distance to the complete common-factor model class. An explicit exact factor witness gives the complementary PROXIMAL-RECOVER certificate; otherwise the procedure returns ABSTAIN. The paper also proves that exact generated-algebra / tensor-product-structure type is not uniformly identifiable from finite samples without a structural separation margin. For the fixed two-qubit 60-state stabilizer benchmark, the paper provides an anchor-inclusive raw-count validation and an exact-rational / outward-rounded one-sided trust path from integer counts through anchor and control confidence radii to factor RECOVER/REJECT. The scope is deliberately operational: the result certifies active factor structure supported by the augmented data and does not claim identification of arbitrary inactive spectator degrees of freedom or a uniquely true microscopic decomposition.
We study how much of the Hilbert-space and Born-rule structure of quantum theory can be obtained from operational primitives that involve records but not probabilities. The setting is a regime in which coherent alternatives recombine without leaving a stable record. We obtain three results of different kinds. Geometry. From composable contributions, record-inert reversible controls and amplitude scalings, under named conditions, we obtain a real inner-product event geometry. The existence of the inner product is equivalent to bounded mixing and is assumed in that form. In a worked interferometer with one mode per channel, the metric is not an input: metric-free port swaps and phase flips fix the form up to scale, and boundedness only forces the other controls to preserve it. Its uniqueness up to scale, the orthogonality of distinct outcomes, and the representation of events by orthogonal projections are derived. Obstruction. This geometry, even with full symmetry about the preparation and exact dyadic standards, does not select the quadratic weight: the preparation mixed with the maximally mixed state survives. The structural operations exhibited here certify only values on which the quadratic weight equals the counting weight. On restricted event families where Gleason’s theorem is unavailable, a calibration order oriented by the quadratic magnitude selects it: given exact standards, a state is the quadratic one exactly when it respects all such brackets. Whether such an orientation can be earned is the open problem. Given such brackets and refinement only to a finite depth K, every admissible state lies within 2^-K of the quadratic weight, without the Archimedean step. On the full projection lattice, Gleason’s theorem with null support, or sphere-transitive symmetry with null support, gives other conditional routes. Bridge. A predictive probability kernel is introduced separately. Its identification with the real quadratic weight ||P_A ψ||² / ||ψ||² is conditional on kernel-admission hypotheses, one of which is equivalent to the Born value; the complex form needs phase invariance in addition. The hypotheses select a class of contexts, and none is shown to be forced. For each we state the physical feature it expresses and a sufficient condition where one is known, and we work out one apparatus in which the geometry-stage hypotheses hold together. For all but one we give a context in which it fails (for the founding conditions, one that leaves the regime); for the remaining one, TCC-1, we give an illustration. This paper is the first in a series built on a common framework, Structural Ledger Consistency (in preparation).