Finite coordinate-Bethe solutions in three XXZ sectors supply strictly positive four-bit laws through marginal-preserving residual transfer. For a ten-site, four-excitation sector and twelve-site sectors with four or five excitations, we certify four affinely independent laws per sector. All twelve laws share every one-site and two-site marginal; each sector spans a three-dimensional simplex. Interval root and maximum-entropy projection inclusions certify positivity and nonzero determinants. An exact signed-law formula transfers the two inequivalent triple moments and four-site moment through positionwise token channels; distinct channel pairs preserve dimension. A target constructed from the source under identity emission demonstrates a strict acceptance effect. An exploratory initial-block test on SmolLM2-135M selects one source vertex and loses to a matched-budget classical search; an exact-arithmetic cover bounds every continuous mixture of that original simplex below the classical control under the archived emissions. A separately frozen follow-up compares 495 expanded Bethe and 495 classical candidates at target-generated contexts in two model settings, including a 1.7B target with a target-specific continued 135M draft. On 64 fresh held-out questions per setting, the late-context Bethe-classical differences are 0.000204 and 0.000143 accepted proposal tokens/block; both adjusted 97.5% descriptive intervals cross zero and neither preset practical criterion is met. All 767 context records are arithmetically audited. The certified construction therefore broadens the available higher-order sources without establishing a practical Bethe or decoding-speed advantage. A retrospective linear-programming analysis gives numerical upper estimates of about 0.0140 and 0.0113 additional tokens/block over the archived references for any joint proposal sharing their one- and two-token marginals on the saved development supports. These estimates are distinct from the exact-arithmetic mixture certificate.
Finite coordinate-Bethe solutions in three XXZ sectors supply strictly positive four-bit laws through marginal-preserving residual transfer. For a ten-site, four-excitation sector and twelve-site sectors with four or five excitations, we certify four affinely independent laws per sector. All twelve laws share every one-site and two-site marginal; each sector spans a three-dimensional simplex. Interval root and maximum-entropy projection inclusions certify positivity and nonzero determinants. An exact signed-law formula transfers the two inequivalent triple moments and four-site moment through positionwise token channels; distinct channel pairs preserve dimension. A target constructed from the source under identity emission demonstrates a strict acceptance effect. An exploratory initial-block test on SmolLM2-135M selects one source vertex and loses to a matched-budget classical search; an exact-arithmetic cover bounds every continuous mixture of that original simplex below the classical control under the archived emissions. A separately frozen follow-up compares 495 expanded Bethe and 495 classical candidates at target-generated contexts in two model settings, including a 1.7B target with a target-specific continued 135M draft. On 64 fresh held-out questions per setting, the late-context Bethe-classical differences are 0.000204 and 0.000143 accepted proposal tokens/block; both adjusted 97.5% descriptive intervals cross zero and neither preset practical criterion is met. All 767 context records are arithmetically audited. The certified construction therefore broadens the available higher-order sources without establishing a practical Bethe or decoding-speed advantage. A retrospective linear-programming analysis gives numerical upper estimates of about 0.0140 and 0.0113 additional tokens/block over the archived references for any joint proposal sharing their one- and two-token marginals on the saved development supports. These estimates are distinct from the exact-arithmetic mixture certificate.
Parallel token proposals need a joint law, not merely accurate token marginals. We construct coordinate-Bethe-ansatz laws from the periodic XXZ chain and compare them with their maximum-entropy pairwise projections at identical one- and two-site moments. In an eight-site, three-excitation sector, symmetry makes the full probability-law difference one-dimensional, determined by a contiguous three-site moment δ. Along the Bethe branch, this gap changes sign and vanishes exactly at Δ=(3+3)/2, where the eigenstate law becomes pairwise. A nonlinear two-token readout preserves separate token marginals yet exposes a distance 2∣δ∣; a direct three-token readout preserves all one- and two-token marginals yet exposes 4∣δ∣. At Δ=1.5 these deterministic binary distances are 0.02654573 and 0.05309145. We give an exact target-alignment formula and prove a strict speculative accepted-prefix advantage throughout an unrestricted open neighborhood of a constructed target. These are finite-law existence results, not measured language-model or wall-clock gains.
This record gives an exact, machine-checked resource analysis of a specific USp(6) = Sp(3)-covariant quantum compression construction, and the reproducible certificates behind it. The carrier is W = V14 ⊕ V21 (dimension 35), the memory is the sixdimensional irreducible V6, the source is the balanced sector-mixed state with weights (1/28, 1/42), and the figure of merit is the Schumacher entanglement fidelity 𝜔. The construction and its coherent witness are inherited from the companion compression paper (DOI 10.5281/zenodo.21744306), which certifies F*_effEB,V6 ≤ 1/100 < 1/40 < 39587/1382976 = 𝜔(witness): a coherent covariant channel through the six-dimensional memory beats every entanglement-breaking channel through that memory. Four results, each verified exactly over the rationals, answer one coherent question — what preserves the compression advantage in this symmetry-constrained construction: (1) Sector-dephasing benchmark. Removing all coherence between the two output sectors drops the fidelity from 39587/1382976 to the within-sector value 55/3528, which still exceeds the 1/100 entanglement-breaking upper bound; the certified advantage survives, and the coarse output-sector label is blind to the input. (2) Branch entanglement. The two normalized output-sector channels N14 and N21 (output sector restricted, input/reference kept full) are both completely positive, trace-preserving, and have a negative partial transpose; each retains reference entanglement, so neither is entanglement-breaking. (3) Branch replacement. Replacing one branch at a time by an entanglement-breaking channel, at fixed sector probabilities and through the same memory, keeps the V14 branch (M14, 𝜔 = 835/74088 > 1/100) above the bound while the V21-retaining channel (M21, 𝜔 = 263/49392 < 1/100) does not clear it; both complete channels remain NPT. (4) Entanglement-breaking comparator. An explicit admissible covariant entanglementbreaking channel through the same memory strictly outperforms M21, with 𝜔 = 1544075/288004752 > 263/49392 (exact margin 5261/144002376 > 0). This resolves the previously open comparison and brackets the entanglement-breaking optimum as 1544075/288004752 ≤ F*_effEB,V6 ≤ 1/100. The overall lesson is objective-specific: retaining reference entanglement and obtaining a task-specific quantum advantage are distinct here. Every claim is checked by an exact rational verifier (python-flint): Choi positivity and partial-transpose tests use the certificate’s own Gram metric, and the comparator’s score is confirmed by reconstructing the actual channel and re-evaluating the original objective. Scope and caveats: the results have been audited for correctness by an independent reviewer; this record does not claim comprehensive novelty relative to the existing literature on quantum-memory resource theories and operational benchmarks, nor establish journal suitability. Any connection to the author’s broader “Presence Hypothesis” program is
This preprint studies a cycle-reflection operation on a supplied six-qubit realization of paired trigram configurations. A four-matched-pulse identity and a minimum within its stated serial grammar are separated from an ordinary-exchange endpoint construction. The raw full-source reflection and its full domain-safe alternative are different tasks: the latter is excluded by a collective-symmetry obstruction in the admitted source-only exchange model. Strict preservation of the addressable sector throughout the path is also excluded for the full task, while finite-action lower bounds quantify peak no-address population and time-integrated exposure. The paper presents an explicit low-excursion balanced word and a conditional joint clock–amplitude error certificate. Root settings and trajectory inputs remain tied to their supplied computer-assisted certificates. The second internal review reproduced all ten advertised numerical routes and twenty-four outputs using the original programs; this is same-program reproducibility, not independent implementation or external peer review. A separate Lean supplement covers the finite raw/safe operator algebra and the obstruction for arbitrary finite words of the declared algebraic factors. It does not formalize the numerical roots, matrix exponentials, continuous-time dynamics or resource theorems. No global pulse optimum, measured hardware feasibility, general noise tolerance, or automatic connection to the companion recovery code is claimed.
Dans cette thèse, nous discuterons des systèmes intégrables quantiques et des chaînes de spins. Nous présenterons la notion d'intégrabilité quantique ainsi que des structures mathématiques, les groupes quantiques, reliées à cette dernière. Cela nous permettra d'introduire les chaînes de spins universelles étudiées par le groupe d' Annecy depuis plusieurs années. Ces chaînes universelles ont la particularité d'englober l'ensemble des chaînes de spins préalablement étudiées dans la littérature. La question posée pour cette thèse était d'utiliser l'ansatz de Bethe algébrique pour déterminer les valeurs propres et les vecteurs propres de ces chaînes de spins universelles . Nous discuterons donc cette méthode pour les chaînes de spins périodiques et avec bords. Cette étude mettra en évidence les limites de l'ansatz de Bethe algébrique pour certaines chaînes avec bords et nous présenterons un nouveau cadre mathématique qui permettrait d'obtenir le spectre dans ces cas. Nous discuterons aussi le problème du produit scalaire des vecteurs propres obtenus grâce à l'ansatz de Bethe algébrique.
From a finite event record to Bell correlations and their loss under recording A pair is prepared together, read at two separated instruments, and allowed to leave a material record. This paper builds the correlation law from a real source geometry in Artian's Quantum Traction Theory. Its source-to-access equation is pK(r,s∣a,b)=C(KΩ)C[(Πr(a)⊗Πs(b)⊗I)KΩ] Here C is an additive, basis-invariant event capacity, Omega is the normalized orientation-neutral two-channel source, K is a specified record contact, and the projectors select the two instrument outputs. A real quarter-turn and a qualified shared-reference composition generate the readout algebra. Capacity symmetry fixes its quadratic weight. A separately stated capacity-to-frequency condition connects that weight to laboratory counts. The correlation follows before the Bell comparison For a phase-compensated record contact with overlap g between its two normalized record profiles, the construction gives EK(a,b)=−azbz−g(axbx+ayby),0≤g≤1. The intact-source limit is E = -a dot b. The same calculation yields the fixed-setting and optimized Bell responses: S45=2(1+g),Sopt=21+g2. Fresh independent record contacts multiply their overlaps. The paper derives the repeated-contact law, a capacity-based overlap calibration, uncertainty bounds, and a protocol that separates calibration from the Bell observations being judged. A source-first account with an explicit dependency map A1 supplies event-time labels and the clock-angle correspondence; A4 supplies the real dial; A5-X supplies completed-event support, with its inherited A6/A7 conditions. The two-channel preparation, balanced composition, capacity symmetry, frequency bridge, and record coupling are printed separately. Each theorem states exactly which conditions it uses. The Access uncertainty commutator is treated as a distinct inherited algebraic premise, rather than inferred from Bell correlations. When a receiver follows the source Version 2.0 constructs a matched receiver rather than assigning its transformation by name. Preserving every probability of the stated bilinear contact forces its transport to be the conjugate of the source transport, up to an overall phase: ∣rTVTUs∣2=∣rTs∣2for all r,s⟹V=eiαU. A finite set of basis and sum probes certifies this relation. A robust extension converts imperfect probe probabilities into an operator-error bound. Finite clock and shift operations then produce the comparison loop L=M+ω(I−M),ω=e2πi/d. The matched sector cancels the comparison phase while the unmatched sector retains it. This is a joint comparison law; each local readout can remain incompatible. The paper identifies the binary loop's ambiguity, provides additional probes that distinguish it, and transfers the Bell correlations into a complete detector record when the original carrier is consumed. One contact, two observable roles A specified marker contact supplies both the Bell record overlap and a resolved weak-measurement instrument: γK0K1=sinθ,=diag(cos(θ/2),sin(θ/2)),=diag(sin(θ/2),cos(θ/2)). An independent replay executes this instrument on all 40,032 tree records in the public Feng and colleagues archive, reproducing every stored decoder success/failure score. The main five-setting batch contains 32,000 records; the complete archive has six settings. The reproduced job-cluster residual probabilities are p = 0.0188753 and p = 0.0442603, respectively. These diagnose modest tension with the ideal instrument under the stated retrospective covariance. The matched QTT and quantum representations make the same archival predictions, so this replay is not a significance test between them. The package preserves the complete source-first Bell construction and adds finite receiver certificates, physical transport-error bounds, a common-contact derivation, five vector figures, a twelve-item achievements ledger, and offline reproducibility materials. The next operational question is precise: which independently qualified physical contact fixes both the record overlap and the receiver comparison response? Dependencies: QTT Main Book; finite address-capacity counting; real source histories and composition; A1-CHSH spinor character; Observation as Access.