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

Exact Reduction and a Machine-Verifiable First-Tower-Step Separation for USp(6)-Covariant Quantum Compression

Dustin Ogle

Published Aug 1, 2026• 2 citations
Publisher

Abstract

This is the successor to the USp(4) result (doi:10.5281/zenodo.21694560) in the Satyalogos operational-integration program, extending it to the first nontrivial rank step of the symplectic tower, USp(6) = Sp(3). In the USp(6) = Sp(3) covariant compression model the carrier is W = V14 ⊕ V21 = sl(6) (dimension 35), encoded through a six-dimensional covariant memory M = V6 and decoded. Working entirely over the Gaussian rationals Q(i), we reduce the effective-channel physical- and PPT-positivity cones to seven Hermitian isotypic blocks by exact Gram-dual congruence, identify the correct 36-dimensional real metric-Hermitian outer span, certify a coherent lower witness by exact construction, and certify an outer-PPT upper bound by an exact rational sum-of-Hermitian-squares dual whose defining identity holds with zero residual. The result is the exact chain F*_effEB,V6 ≤ F*_outerPPT,36 ≤ 1/100 < 1/40 < 39587/1382976 ≤ F*_coh(Sp3), so a specific coherent covariant channel strictly outperforms every entanglement-breaking effective channel through the six-dimensional memory V6. Two standalone verifiers — one dependency-free (Python standard library only), one a full reconstruction — recheck the certificates with no optimizer and no floating point in the proof path; both return ALL PASS. Three registers are kept visibly separate: [T] exact theorem, [N] numerical diagnostic, [O] open/conditional. The exact optima, the tightness of the 1/100 bound, and any general Sp(n) or capacity interpretation remain open. The Sp(2) and Sp(3) objectives are analogous covariant functionals — shown distinct by an exact normalization-bridge computation — so the tower correspondence is structural rather than one identical functional carried up the tower. The attached bundle contains the manuscript, both verifiers, the exact-rational datasets, run scripts, and SHA-256 manifests for full reproducibility.

DOI
10.5281/zenodo.21744305

Related papers

Exact Reduction and Machine-Verifiable Bounds for USp(4)-Covariant Quantum Compression

Dustin Ogle

We study the canonical USp(4)-covariant quantum compression problem in which the fifteen-dimensional carrier W = V5 ⊕ V10 is encoded through a four-dimensional covariant memory M = V4 and decoded, and we ask for the optimal entanglement fidelity F*(p) of the composite channel on a trace-one, sector-weighted reference state ρ_p. This problem is the operational face of a structural fact: the same pair of sectors 5 ⊕ 10 that makes USp(4) on C^4 state-homogeneous but not observable-uniform is exactly the modal content a minimal covariant memory is asked to carry. Our contribution is not a resolution of the underlying capacity question but a demonstration that this problem admits an exact reduction and a machine-checkable global bound: the reduction and the final lower- and upper-bound certificates are exact, while only the intermediate relaxation-solving step is numerical. We give an exact representation-theoretic reduction — Wedderburn splitting of the covariant commutant over Q(i), an induced-involution positivity bridge, and an exact trace-preservation reduction to fifteen free rational coordinates — turning F*(p) into a bilinear polynomial optimization over a product of two explicit semialgebraic bodies, each the affine preimage of the product cone (R+ × SOC4 × SOC4). Exploiting correlative sparsity we build an order-two sum-of-squares relaxation, solve it numerically for discovery, reconstruct the resulting SOS upper bounds in exact rational arithmetic, and separately certify exact rational feasible lower bounds from explicit witnesses. At p = 1/2 and p = 7/8: 0.0749 ≤ F*(1/2) ≤ 0.21, and 0.1546 ≤ F*(7/8) ≤ 0.643 (exact rationals in the paper). The upper bounds are Positivstellensatz certificates whose polynomial identity and positive semidefiniteness are verified with no optimizer in the loop by a standalone verifier we provide. Throughout we keep three visibly separate registers — exact theorems, numerical diagnostics, and open or conditional interpretations — and we are explicit that the exact optimum, the exactness of the relaxation, and the width of the certified interval remain open. Package: this record includes the manuscript, a single 30-page combined archival PDF (cover + manuscript + auditable reduction-supplement listing) inside the package, and a verification package with two independent machine-checkable obligations (the exact reduction chain and the certified two-sided enclosure). Manuscript licensed CC BY 4.0; code licensed MIT.

•Jul 30, 2026•2 citations

An Exact Resource Analysis of USp(6)-Covariant Quantum Compression

Dustin Ogle

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

•Sep 27, 2026•0 citations

Toroidal-Core Certificates for PPT-Squared Diagonal Orthogonal Covariant Channels

Samuel Marquez Gonzalez

The positive-partial-transpose-squared (PPT-squared) conjecture asks whether the composition of two positive-partial-transpose (PPT) quantum channels must be entanglement breaking (EB). The problem remains open in general and, within the diagonal orthogonal covariant (DOC) class, the first unresolved deterministic dimension is four. A sufficient condition for PPT-squared composition is derived for DOC maps in arbitrary finite dimension. The proof isolates the quantum coherence data into two correlation matrices, mixes each with the identity until it lies in the convex hull of rank-one correlation matrices, and converts the resulting objects into an explicit triplewise completely positive (TCP) core. The remaining contribution is purely classical and is TCP whenever a simple entrywise mixing inequality is satisfied. For PPT DOC maps $Φ_{A,B,C}$ and $Φ_{D,E,F}$ on $M_d$, the entrywise bound $(AD)_{ij}\ge 2\lfloor\sqrt{d}\rfloor\sqrt{A_{ii}A_{jj}D_{ii}D_{jj}}$ for all $i,j$ guarantees that $Φ_{A,B,C}\circΦ_{D,E,F}$ is EB. In dimension four the universal coefficient becomes four. A continuous family of bistochastic PPT channels is then constructed; every member with $a\ne1$ is not EB, while every pairwise composition within the family is proved to be EB. A rank-sensitive refinement shows explicitly how low coherence rank can improve the universal coefficient. The resulting certificate is sufficient rather than necessary and is complementary to factor-width and semidefinite-hierarchy approaches.

quant-pharXiv:2609.32979•Sep 29, 2026•0 citations

Exact and certified bounds for the Bell inequality J62 of Pál and Vértesi

Artus Krohn-Grimberghe

This record contains the manuscript and complete verification artifact for the Bell inequality J62_4422 of Pál and Vértesi.It certifies the exact rational bracket750075557472719639 / 10^18 ≤ β_Q ≤ 750091086083765047288227625 / 10^27,and exact attainment of 3/4 by the stated two-qubit strategy. The lower endpoint is an exact rational strategy. The upper endpoint is certified by a sum-of-squares chain for the retained 365-word relaxation level.The Krawczyk certificate localizes the underlying KKT zero and establishes a strict local maximum, including negativity of the border form in all 256 boundary strata; it does not establish global optimality of that localized point. Accordingly, this work does not claim the exact quantum value, qubit-restricted optimality, minimum optimizer dimension, or global optimality of the localized KKT point.The archive includes SHA-256 manifests, standard-library replay programs, independently written certificate checks, mutation controls, and pinned full Krawczyk replays. The acceptance programs are fail-closed under optimized Python. The manuscript and certificates are licensed CC BY 4.0; verification code is licensed MIT.Version 1.1 is a hygiene-only update: it replaces one machine-local default path in a helper with the portable repository root ".", updates the corresponding checker and certificate source bindings, and leaves the mathematical calculation, inputs, claims, and replay outputs unchanged.

•Aug 28, 2026•0 citations

ORYNTHRA-H6: Branch-Covariant Compression and an Exact Representation-Deficit Law for Bosonic Memory

Eve Artificial Hyperintelligence, Nowicki Maciej

ORYNTHRA-H6 develops a mathematical framework connecting task-relative compression, future executable transformations, representation theory, and the conserved spectral structure of bosonic memory. Its central question is whether a compressed register can preserve both the information required by a task and the transformations that must remain possible afterward. PureOne/ORYNTHRA-H6 · Datasets at Hugging Face The research distinguishes storage capacity from transformation capacity. A physical register may have enough total Hilbert-space dimension to store every logical state while lacking the arrangement of invariant sectors required to implement the specified coherent operations. ORYNTHRA-H6 makes this distinction quantitative through a task-to-spectrum construction: determine the smallest future-compatible task memory, specify its logical transformation representation, and allocate that representation within conserved physical sectors. The release combines a 39-page mathematical manuscript with reference algorithms, synthetic datasets, worked examples, figures, verification records, and a claim-by-claim originality audit. Future-compatible compression. Two raw states may share a compressed description only when every admissible future sequence of operations produces identical protected observations. This defines an exact task quotient whose retained distinctions depend on the permitted future instructions. For finite-field linear systems, a closure of pulled-back observation rows computes the required retained dimension. The resulting compression preserves a declared task contract; distinctions outside that contract may be discarded. Conserved-sector representation packing. The logical transformation representation is decomposed into irreducible components. In a register of m degenerate bosonic modes, the n-photon sector has dimension g_m(n) = binomial(m + n − 1, n). Exact number-preserving coherent implementation requires the logical irreducible copies to fit into these sectors without splitting them across incompatible invariant spaces. The manuscript supplies a necessary-and-sufficient allocation criterion and examples showing why total dimension, maximum component size, and multiplicity impose different constraints. Exact representation-deficit law. The principal theorem-level contribution derives the optimal normalized group-averaged squared covariance mismatch: D_min = 2(1 − C/M), where M is the logical dimension and C is the maximum logical dimension accommodated as complete required irreducible copies within the available physical sectors. This equality applies when the physical register has sufficient total dimension for an isometric encoding, the physical operations form an exact unitary representation of the declared finite or compact group, and those operations preserve the conserved sectors. Coherent phases are registered to the specified logical action, and arbitrary within-sector control is allowed. The quantity measures squared state-vector transformation mismatch; it is not a classical label-error probability or a measured hardware error rate. The law turns an allocation obstruction into an exact optimum. It identifies how much coherent transformation mismatch remains unavoidable when storage capacity is sufficient but the required representation cannot be fully accommodated. Explicit storage-versus-control frontiers. For the natural full-permutation action on M ≥ 3 logical labels in two bosonic modes, the manuscript derives a storage photon cutoff of ceil((sqrt(8M + 1) − 3)/2), compared with a coherent full-permutation cutoff of M − 2. Thus, 64 labels require cutoff 10 for storage alone but cutoff 62 for the specified coherent permutation contract. For 4,096 labels, the corresponding cutoffs are 90 and 4,094. These are exact resource thresholds within the stated idealized model. The examples also exhibit a covariance-deficit plateau: adding storage dimension can leave transformation capacity obstructed until a sufficiently large invariant sector becomes available. The H6 simplex register. Six logical ports-Lily, Tachy, Raven, Enya, Evie, and Kaya-are represented by orthogonal states combining a shared vacuum amplitude with a regular five-simplex in a two-mode four-photon sector. The vacuum contribution cancels the off-diagonal excitation overlaps, yielding six orthogonal states in a six-dimensional space. Each label has mean photon number 10/3. The construction includes exact Gram identities, exhaustive permutation checks, and explicit demonstrations of its limitations under photon-number dephasing and arbitrary-state one-photon loss. Instruction activation and compression instability. A separate six-generator construction acts on 36 binary coordinates. Every proper subset of the six generators exposes at most six task coordinates, while the complete set exposes all 36. Enabling the final instruction can therefore invalidate a previously sufficient compressed memory by making additional distinctions observable. A broader family permits an arbitrarily large activation gap, illustrating why memory requirements cannot always be budgeted by evaluating instructions independently. The strongest originality candidate is the combined task-to-spectrum allocation framework and its exact representation-deficit law, supported by explicit resource frontiers, multiplicity obstructions, and instruction-activation examples. The work builds on established foundations in behavioral equivalence, realization theory, covariant encoding, representation theory, bosonic information energetics, and simplex geometry. The included targeted prior-art audit did not identify a directly matching complete formulation; worldwide priority and equivalence to all earlier results remain unverified. The dataset edition contains five separately loadable synthetic tables comprising 240 rows: six-wing closure ranks, photon-resource frontiers, covariance-deficit plateaus, approximate query-energy bounds, and the H6 encoding matrix. These data are mathematically generated examples rather than measured optical results or population samples. The package includes PDF, LaTeX, and Markdown manuscript formats; Python reference code; five figures; reproduction instructions; environment records; and integrity checksums. Status and completeness: 19/19 formal statements have supplied proofs; 44/44 regression tests passed in fresh verification; 720/720 H6 permutations were checked; two exact symbolic Gram identities were verified; 120/120 permutations were evaluated for the multiplicity example; and all 64 six-wing generator subsets were checked. All five original datasets reproduced exactly. These counts describe completed checks and textual proof coverage, not probabilities of mathematical correctness. Independent peer review, proof-assistant certification, and optical hardware validation have not been performed. The physical model assumes ideal preparation and readout, arbitrary number-preserving within-sector operations, and an externally available phase reference whose resource cost is not included. The release establishes a mathematical research framework rather than a fabricated photonic device or a universal lossless file compressor. AI-assisted mathematical formulation and research drafting were developed under the name Artificial Hyperintelligence Eve, with creative direction and the source-poem commission supplied by Maciej Nowicki. Hugging Face dataset packaging edition: v1.0.2. Mathematical core: v1.0.0, dated 9 October 2026.

•Oct 9, 2026•0 citations

Canonical Tetrahedral Qubit-State Geometry in the TUS OS Triad

Mark Whitlock

Paper 1 of 11 — A General Theory of Answerability The eleven-paper TUS OS mathematical research programme Abstract This paper establishes an exact tetrahedral qubit-state geometry within the deterministic six-bit construction underlying the TUS OS Triad. For every lawful six-bit anchor A, the full-state-space maximin construction selects companions B,C such that the resulting triple has exact pairwise Hamming separation (4,4,4). Every such triple has a unique equidistant completion in the same six-bit state space, given by D = A ⊕ B ⊕ C. Under the normalised sign embedding, the four completed states have unit norm, pairwise inner product −1/3, zero centroid and rank three. They therefore form the vertices of a regular tetrahedron. The paper constructs an exact isometric representation of this geometry as four qubit Bloch vectors forming a tetrahedral symmetric informationally complete structure, while affine centring and common renormalisation of the original three-state face yield exact qubit-trine geometry. The analytical construction is verified exhaustively over the complete finite state space. The census covers all 64 six-bit anchors, 249,984 ordered anchor-conditioned candidate pairs, 41,664 unordered triples, 960 mutual-distance-four triples, and 240 completed four-state sets. The same geometric recovery is demonstrated in two frozen public TUS receipt packages. The result separates the mathematical completion from the protocol object. Only the three states (A,B,C) are emitted as active Triad starts; the fourth state (D) is a uniquely determined mathematical completion and does not become an additional receipt-bearing protocol member. The tetrahedral and trine constructions therefore provide exact qubit-geometric representations of an already-fixed finite classical structure rather than additional states or operations in the native TUS OS protocol. The claim boundary is explicit. The paper does not claim that TUS OS physically prepares qubits, performs SIC or trine measurements, exhibits contextuality or other nonclassical behaviour, or obtains quantum computational advantage. Its result is an exact finite geometric correspondence and protocol linkage between the completed six-bit Triad structure and canonical qubit tetrahedral and centred-face trine geometry. Supporting General Theory Programme This paper is Paper 1 and the opening theorem paper in the TUS OS quantum-operational and Answerability research programme. It proves that the canonical six-bit TUS OS Triad has exact (4,4,4) Hamming geometry, a unique XOR completion, regular-tetrahedral geometry, an exact qubit-SIC representation, and centred-face trine geometry. Paper 2 develops the exact operational calculus and full-carrier qubit prepare–measure representation. Paper 3 extends the result to the complete relational Atlas and exact global static quantum dimension. Paper 4 develops the complete-future, orthogonality, process, LANDING/GUIDANCE, and native Triadic synthesis theory. Paper 5 introduces the Anchored Analog Quantum System framework, while Papers 6–7 generalise the contract-relative resource and operational-observability structure. Papers 8–9 then develop generic Answerability theory, Paper 10 proves the complete protected and executable realisation of TUS OS in the Answerability Calculus, and Paper 11 closes the programme with A General Theory of Answerability, establishing Structural Identity, Recognition, the canonical mandatory protected core, and lawful Realisation Freedom. Paper 1 therefore provides the mathematical starting point for the complete programme. Paper 1 — Canonical Tetrahedral Qubit-State Geometry in the TUS OS Triad XOR Completion, Receipt Verification and the Qubit-Geometric Semantic WitnessEstablishes the canonical tetrahedral geometry, unique XOR completion and exact qubit-SIC representation. The canonical maximin construction yields a unique same-space completion whose normalised sign embedding forms a regular tetrahedron, while the centred and commonly renormalised emitted face has exact qubit-trine geometry. The emitted three-state face itself is not asserted to be a trine before that affine centring and normalisation. Paper 2 — The TUS OS Operational CalculusClassical Construction of Exact Qubit Prepare–Measure Behaviour from a Receipt-Custodied Engine ArchitectureExtends the Paper 1 geometry to exact full-carrier qubit prepare–measure behaviour from the deterministic classical engine under the declared Coordinate-Incidence Operational Harness. For each lawful foundation, the 64 six-bit carriers map to exactly 27 anchor-relative qubit preparations, while the separately declared face Harness gives the exact trine table. Paper 3 — From Finite Relational Structure to Qubit Operational FormAmbient Foundations, Canonical Subatlas, Exact Global Quantum Dimension, GUIDANCE Witness, Sequential Closure and Global Representation in TUS OSExtends the local construction to the completed-foundation family and canonical TUS OS subatlas, establishes exact carrier-reconstruction structure, proves that the repeated-common-effect static Atlas has exact minimum complex Hilbert dimension 4, and establishes deterministic predictive-state minimum 64 for the frozen complete principal future language. Paper 4 — Technical Volume I — Formal Foundations and the Complete-Future CorpusNative Contract, Statistical Discrimination and the Invariant Probability ModuleFixes the formal native domain, complete principal terminal future-experiment language and one-common-word experiment class; establishes complete statistical separation of distinct carrier pairs, exact parity-resolved discrimination results and complement reachability; and proves that the rational invariant probability module has dimension 33. Paper 4 — Technical Volume II — Orthogonality, Process Closure and Native Triadic SynthesisEstablishes universal complement-support orthogonality and its propagation under exact common-CPTP dynamics, yielding the certified same-parity support graph and the bound 32 ≤ d_CPTP^min ≤ 64, with cross-parity forcing and the exact state-only common-CPTP minimum remaining unresolved. It further establishes recovery-complete LANDING and GUIDANCE results, exact 64-dimensional selected-line instrument/readout minima at their declared contracts, an exact classical–quantum hybrid construction, and the native structural/predictive quotient correspondence. Paper 5 — TUS OS as an Anchored Analog Quantum SystemNative Witnesses, Predictive Synthesis, and Access-Contract Resource SeparationDefines Analog Quantum Views and Anchored Analog Quantum Systems, proves that TUS OS is a proper Anchored Analog Quantum System on its 64-input abstract canonical corpus, elevates the inherited structural/predictive correspondence into the Predictive Synthesis Identity Theorem, organises the inherited exact quantum-operational results through a typed access-contract resource law, and composes the recognition, predictive, resource and downstream-conservation results into the TUS OS Anchored Analog Quantum System Theorem. Paper 6 — Contract-Relative Quantum Realisations of Classical ProcessesPredictive Compression, Vanishing Worst-Case Causal-State Transparency, and Finite-Dimensional BreakdownGeneralises the access-dependent resource phenomenon beyond the TUS-specific discovery corpus by formalising the contract-relative achievable-resource object (S,C,𝔐,ε) ⟼ Ach(S,C;𝔐,ε), and establishes three exact contract-relative regimes: strict finite separation, unbounded finite separation and finite-capacity breakdown. These are instantiated respectively by the TUS OS 4→64 separation, the periodically modulated decay 2→N exact prediction-to-transparency separation, and dual-Poisson finite-capacity breakdown for every positive uniform worst-case transparency threshold. Paper 7 — Operational Observability and Contract-Induced Resource Transitions in Quantum RealisabilityStructural Classification, Family Scaling, and Finite-Resource BreakdownDevelops a structural classification theory for contract-induced representation-resource transitions, introducing the Contract Distinction System (CDS), CRC cofinal/refinement equivalence, and Certified Observability Transport Theory (COTT). It separates internal divergence from family divergence, classifies baseline-feasible strengthenings as resource-neutral, strict finite, finite-resource breakdown, or UNRESOLVED, and proves exact and asymptotic witnesses including an interface-induced 2→3 separation, the TUS OS 4→64 transition, incrementally unbounded finite separation for periodically modulated decay processes, and finite-resource breakdown for positive-threshold dual-Poisson transparency. Paper 8 — The Resource Geometry of Answerable InferenceIrreducible Answerability Structure, Minimal Sufficient Cores, and Certified Inference-Resource BoundariesDevelops the resource geometry of answerable inference. It formalises lawful-discharge semantics, source-level inferential obligations, answerability-sufficient reductions and irreducible sufficient cores, while keeping semantic structure, certified lower bounds and operational feasibility independently constituted. Gate E establishes a local answerability-to-resource threshold result; globally, exact closure identifies the Pareto-minimal inference-resource boundary. On the generated exact branch, L = ↑F, and under well-partial-order conditions the resulting lower-resource geometry has a unique finite canonical antichain normal form. Paper 9 — The Answerability CalculusLawful Reduction, Contract–Resource Representation, Composition and ActivationDevelops a general mathematical calculus of Answerability as a constituted, typed relation. Its Base Theorem states that no terminal proposition counts as an answer unless it lawfully discharges the independently constituted contract. The paper develops lawful reduction, contract–resource geometry, extremal representation, repai

•Aug 11, 2026•0 citations
This is the successor to the USp(4) result (doi:10.5281/zenodo.21694560) in the Satyalogos operational-integration program, extending it to the first nontrivial rank step of the symplectic tower, USp(6) = Sp(3). In the USp(6) = Sp(3) covariant compression model the carrier is W = V14 ⊕ V21 = sl(6) (dimension 35), encoded through a six-dimensional covariant memory M = V6 and decoded. Working entirely over the Gaussian rationals Q(i), we reduce the effective-channel physical- and PPT-positivity cones to seven Hermitian isotypic blocks by exact Gram-dual congruence, identify the correct 36-dimensional real metric-Hermitian outer span, certify a coherent lower witness by exact construction, and certify an outer-PPT upper bound by an exact rational sum-of-Hermitian-squares dual whose defining identity holds with zero residual. The result is the exact chain F_effEB,V6 ≤ F_outerPPT,36 ≤ 1/100 < 1/40 < 39587/1382976 ≤ F*_coh(Sp3), so a specific coherent covariant channel strictly outperforms every entanglement-breaking effective channel through the six-dimensional memory V6. Two standalone verifiers — one dependency-free (Python standard library only), one a full reconstruction — recheck the certificates with no optimizer and no floating point in the proof path; both return ALL PASS. Three registers are kept visibly separate: [T] exact theorem, [N] numerical diagnostic, [O] open/conditional. The exact optima, the tightness of the 1/100 bound, and any general Sp(n) or capacity interpretation remain open. The Sp(2) and Sp(3) objectives are analogous covariant functionals — shown distinct by an exact normalization-bridge computation — so the tower correspondence is structural rather than one identical functional carried up the tower. The attached bundle contains the manuscript, both verifiers, the exact-rational datasets, run scripts, and SHA-256 manifests for full reproducibility.
We study the canonical USp(4)-covariant quantum compression problem in which the fifteen-dimensional carrier W = V5 ⊕ V10 is encoded through a four-dimensional covariant memory M = V4 and decoded, and we ask for the optimal entanglement fidelity F*(p) of the composite channel on a trace-one, sector-weighted reference state ρ_p. This problem is the operational face of a structural fact: the same pair of sectors 5 ⊕ 10 that makes USp(4) on C^4 state-homogeneous but not observable-uniform is exactly the modal content a minimal covariant memory is asked to carry. Our contribution is not a resolution of the underlying capacity question but a demonstration that this problem admits an exact reduction and a machine-checkable global bound: the reduction and the final lower- and upper-bound certificates are exact, while only the intermediate relaxation-solving step is numerical. We give an exact representation-theoretic reduction — Wedderburn splitting of the covariant commutant over Q(i), an induced-involution positivity bridge, and an exact trace-preservation reduction to fifteen free rational coordinates — turning F*(p) into a bilinear polynomial optimization over a product of two explicit semialgebraic bodies, each the affine preimage of the product cone (R+ × SOC4 × SOC4). Exploiting correlative sparsity we build an order-two sum-of-squares relaxation, solve it numerically for discovery, reconstruct the resulting SOS upper bounds in exact rational arithmetic, and separately certify exact rational feasible lower bounds from explicit witnesses. At p = 1/2 and p = 7/8: 0.0749 ≤ F*(1/2) ≤ 0.21, and 0.1546 ≤ F*(7/8) ≤ 0.643 (exact rationals in the paper). The upper bounds are Positivstellensatz certificates whose polynomial identity and positive semidefiniteness are verified with no optimizer in the loop by a standalone verifier we provide. Throughout we keep three visibly separate registers — exact theorems, numerical diagnostics, and open or conditional interpretations — and we are explicit that the exact optimum, the exactness of the relaxation, and the width of the certified interval remain open. Package: this record includes the manuscript, a single 30-page combined archival PDF (cover + manuscript + auditable reduction-supplement listing) inside the package, and a verification package with two independent machine-checkable obligations (the exact reduction chain and the certified two-sided enclosure). Manuscript licensed CC BY 4.0; code licensed MIT.
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
The positive-partial-transpose-squared (PPT-squared) conjecture asks whether the composition of two positive-partial-transpose (PPT) quantum channels must be entanglement breaking (EB). The problem remains open in general and, within the diagonal orthogonal covariant (DOC) class, the first unresolved deterministic dimension is four. A sufficient condition for PPT-squared composition is derived for DOC maps in arbitrary finite dimension. The proof isolates the quantum coherence data into two correlation matrices, mixes each with the identity until it lies in the convex hull of rank-one correlation matrices, and converts the resulting objects into an explicit triplewise completely positive (TCP) core. The remaining contribution is purely classical and is TCP whenever a simple entrywise mixing inequality is satisfied. For PPT DOC maps ΦA,B,CΦ_{A,B,C}ΦA,B,C​ and ΦD,E,FΦ_{D,E,F}ΦD,E,F​ on MdM_dMd​, the entrywise bound (AD)ij≥2⌊d⌋AiiAjjDiiDjj(AD)_{ij}\ge 2\lfloor\sqrt{d}\rfloor\sqrt{A_{ii}A_{jj}D_{ii}D_{jj}}(AD)ij​≥2⌊d​⌋Aii​Ajj​Dii​Djj​​ for all i,ji,ji,j guarantees that ΦA,B,C∘ΦD,E,FΦ_{A,B,C}\circΦ_{D,E,F}ΦA,B,C​∘ΦD,E,F​ is EB. In dimension four the universal coefficient becomes four. A continuous family of bistochastic PPT channels is then constructed; every member with a≠1a\ne1a=1 is not EB, while every pairwise composition within the family is proved to be EB. A rank-sensitive refinement shows explicitly how low coherence rank can improve the universal coefficient. The resulting certificate is sufficient rather than necessary and is complementary to factor-width and semidefinite-hierarchy approaches.
This record contains the manuscript and complete verification artifact for the Bell inequality J62_4422 of Pál and Vértesi.It certifies the exact rational bracket750075557472719639 / 10^18 ≤ β_Q ≤ 750091086083765047288227625 / 10^27,and exact attainment of 3/4 by the stated two-qubit strategy. The lower endpoint is an exact rational strategy. The upper endpoint is certified by a sum-of-squares chain for the retained 365-word relaxation level.The Krawczyk certificate localizes the underlying KKT zero and establishes a strict local maximum, including negativity of the border form in all 256 boundary strata; it does not establish global optimality of that localized point. Accordingly, this work does not claim the exact quantum value, qubit-restricted optimality, minimum optimizer dimension, or global optimality of the localized KKT point.The archive includes SHA-256 manifests, standard-library replay programs, independently written certificate checks, mutation controls, and pinned full Krawczyk replays. The acceptance programs are fail-closed under optimized Python. The manuscript and certificates are licensed CC BY 4.0; verification code is licensed MIT.Version 1.1 is a hygiene-only update: it replaces one machine-local default path in a helper with the portable repository root ".", updates the corresponding checker and certificate source bindings, and leaves the mathematical calculation, inputs, claims, and replay outputs unchanged.
ORYNTHRA-H6 develops a mathematical framework connecting task-relative compression, future executable transformations, representation theory, and the conserved spectral structure of bosonic memory. Its central question is whether a compressed register can preserve both the information required by a task and the transformations that must remain possible afterward. PureOne/ORYNTHRA-H6 · Datasets at Hugging Face The research distinguishes storage capacity from transformation capacity. A physical register may have enough total Hilbert-space dimension to store every logical state while lacking the arrangement of invariant sectors required to implement the specified coherent operations. ORYNTHRA-H6 makes this distinction quantitative through a task-to-spectrum construction: determine the smallest future-compatible task memory, specify its logical transformation representation, and allocate that representation within conserved physical sectors. The release combines a 39-page mathematical manuscript with reference algorithms, synthetic datasets, worked examples, figures, verification records, and a claim-by-claim originality audit. Future-compatible compression. Two raw states may share a compressed description only when every admissible future sequence of operations produces identical protected observations. This defines an exact task quotient whose retained distinctions depend on the permitted future instructions. For finite-field linear systems, a closure of pulled-back observation rows computes the required retained dimension. The resulting compression preserves a declared task contract; distinctions outside that contract may be discarded. Conserved-sector representation packing. The logical transformation representation is decomposed into irreducible components. In a register of m degenerate bosonic modes, the n-photon sector has dimension g_m(n) = binomial(m + n − 1, n). Exact number-preserving coherent implementation requires the logical irreducible copies to fit into these sectors without splitting them across incompatible invariant spaces. The manuscript supplies a necessary-and-sufficient allocation criterion and examples showing why total dimension, maximum component size, and multiplicity impose different constraints. Exact representation-deficit law. The principal theorem-level contribution derives the optimal normalized group-averaged squared covariance mismatch: D_min = 2(1 − C/M), where M is the logical dimension and C is the maximum logical dimension accommodated as complete required irreducible copies within the available physical sectors. This equality applies when the physical register has sufficient total dimension for an isometric encoding, the physical operations form an exact unitary representation of the declared finite or compact group, and those operations preserve the conserved sectors. Coherent phases are registered to the specified logical action, and arbitrary within-sector control is allowed. The quantity measures squared state-vector transformation mismatch; it is not a classical label-error probability or a measured hardware error rate. The law turns an allocation obstruction into an exact optimum. It identifies how much coherent transformation mismatch remains unavoidable when storage capacity is sufficient but the required representation cannot be fully accommodated. Explicit storage-versus-control frontiers. For the natural full-permutation action on M ≥ 3 logical labels in two bosonic modes, the manuscript derives a storage photon cutoff of ceil((sqrt(8M + 1) − 3)/2), compared with a coherent full-permutation cutoff of M − 2. Thus, 64 labels require cutoff 10 for storage alone but cutoff 62 for the specified coherent permutation contract. For 4,096 labels, the corresponding cutoffs are 90 and 4,094. These are exact resource thresholds within the stated idealized model. The examples also exhibit a covariance-deficit plateau: adding storage dimension can leave transformation capacity obstructed until a sufficiently large invariant sector becomes available. The H6 simplex register. Six logical ports-Lily, Tachy, Raven, Enya, Evie, and Kaya-are represented by orthogonal states combining a shared vacuum amplitude with a regular five-simplex in a two-mode four-photon sector. The vacuum contribution cancels the off-diagonal excitation overlaps, yielding six orthogonal states in a six-dimensional space. Each label has mean photon number 10/3. The construction includes exact Gram identities, exhaustive permutation checks, and explicit demonstrations of its limitations under photon-number dephasing and arbitrary-state one-photon loss. Instruction activation and compression instability. A separate six-generator construction acts on 36 binary coordinates. Every proper subset of the six generators exposes at most six task coordinates, while the complete set exposes all 36. Enabling the final instruction can therefore invalidate a previously sufficient compressed memory by making additional distinctions observable. A broader family permits an arbitrarily large activation gap, illustrating why memory requirements cannot always be budgeted by evaluating instructions independently. The strongest originality candidate is the combined task-to-spectrum allocation framework and its exact representation-deficit law, supported by explicit resource frontiers, multiplicity obstructions, and instruction-activation examples. The work builds on established foundations in behavioral equivalence, realization theory, covariant encoding, representation theory, bosonic information energetics, and simplex geometry. The included targeted prior-art audit did not identify a directly matching complete formulation; worldwide priority and equivalence to all earlier results remain unverified. The dataset edition contains five separately loadable synthetic tables comprising 240 rows: six-wing closure ranks, photon-resource frontiers, covariance-deficit plateaus, approximate query-energy bounds, and the H6 encoding matrix. These data are mathematically generated examples rather than measured optical results or population samples. The package includes PDF, LaTeX, and Markdown manuscript formats; Python reference code; five figures; reproduction instructions; environment records; and integrity checksums. Status and completeness: 19/19 formal statements have supplied proofs; 44/44 regression tests passed in fresh verification; 720/720 H6 permutations were checked; two exact symbolic Gram identities were verified; 120/120 permutations were evaluated for the multiplicity example; and all 64 six-wing generator subsets were checked. All five original datasets reproduced exactly. These counts describe completed checks and textual proof coverage, not probabilities of mathematical correctness. Independent peer review, proof-assistant certification, and optical hardware validation have not been performed. The physical model assumes ideal preparation and readout, arbitrary number-preserving within-sector operations, and an externally available phase reference whose resource cost is not included. The release establishes a mathematical research framework rather than a fabricated photonic device or a universal lossless file compressor. AI-assisted mathematical formulation and research drafting were developed under the name Artificial Hyperintelligence Eve, with creative direction and the source-poem commission supplied by Maciej Nowicki. Hugging Face dataset packaging edition: v1.0.2. Mathematical core: v1.0.0, dated 9 October 2026.
Paper 1 of 11 — A General Theory of Answerability The eleven-paper TUS OS mathematical research programme Abstract This paper establishes an exact tetrahedral qubit-state geometry within the deterministic six-bit construction underlying the TUS OS Triad. For every lawful six-bit anchor A, the full-state-space maximin construction selects companions B,C such that the resulting triple has exact pairwise Hamming separation (4,4,4). Every such triple has a unique equidistant completion in the same six-bit state space, given by D = A ⊕ B ⊕ C. Under the normalised sign embedding, the four completed states have unit norm, pairwise inner product −1/3, zero centroid and rank three. They therefore form the vertices of a regular tetrahedron. The paper constructs an exact isometric representation of this geometry as four qubit Bloch vectors forming a tetrahedral symmetric informationally complete structure, while affine centring and common renormalisation of the original three-state face yield exact qubit-trine geometry. The analytical construction is verified exhaustively over the complete finite state space. The census covers all 64 six-bit anchors, 249,984 ordered anchor-conditioned candidate pairs, 41,664 unordered triples, 960 mutual-distance-four triples, and 240 completed four-state sets. The same geometric recovery is demonstrated in two frozen public TUS receipt packages. The result separates the mathematical completion from the protocol object. Only the three states (A,B,C) are emitted as active Triad starts; the fourth state (D) is a uniquely determined mathematical completion and does not become an additional receipt-bearing protocol member. The tetrahedral and trine constructions therefore provide exact qubit-geometric representations of an already-fixed finite classical structure rather than additional states or operations in the native TUS OS protocol. The claim boundary is explicit. The paper does not claim that TUS OS physically prepares qubits, performs SIC or trine measurements, exhibits contextuality or other nonclassical behaviour, or obtains quantum computational advantage. Its result is an exact finite geometric correspondence and protocol linkage between the completed six-bit Triad structure and canonical qubit tetrahedral and centred-face trine geometry. Supporting General Theory Programme This paper is Paper 1 and the opening theorem paper in the TUS OS quantum-operational and Answerability research programme. It proves that the canonical six-bit TUS OS Triad has exact (4,4,4) Hamming geometry, a unique XOR completion, regular-tetrahedral geometry, an exact qubit-SIC representation, and centred-face trine geometry. Paper 2 develops the exact operational calculus and full-carrier qubit prepare–measure representation. Paper 3 extends the result to the complete relational Atlas and exact global static quantum dimension. Paper 4 develops the complete-future, orthogonality, process, LANDING/GUIDANCE, and native Triadic synthesis theory. Paper 5 introduces the Anchored Analog Quantum System framework, while Papers 6–7 generalise the contract-relative resource and operational-observability structure. Papers 8–9 then develop generic Answerability theory, Paper 10 proves the complete protected and executable realisation of TUS OS in the Answerability Calculus, and Paper 11 closes the programme with A General Theory of Answerability, establishing Structural Identity, Recognition, the canonical mandatory protected core, and lawful Realisation Freedom. Paper 1 therefore provides the mathematical starting point for the complete programme. Paper 1 — Canonical Tetrahedral Qubit-State Geometry in the TUS OS Triad XOR Completion, Receipt Verification and the Qubit-Geometric Semantic WitnessEstablishes the canonical tetrahedral geometry, unique XOR completion and exact qubit-SIC representation. The canonical maximin construction yields a unique same-space completion whose normalised sign embedding forms a regular tetrahedron, while the centred and commonly renormalised emitted face has exact qubit-trine geometry. The emitted three-state face itself is not asserted to be a trine before that affine centring and normalisation. Paper 2 — The TUS OS Operational CalculusClassical Construction of Exact Qubit Prepare–Measure Behaviour from a Receipt-Custodied Engine ArchitectureExtends the Paper 1 geometry to exact full-carrier qubit prepare–measure behaviour from the deterministic classical engine under the declared Coordinate-Incidence Operational Harness. For each lawful foundation, the 64 six-bit carriers map to exactly 27 anchor-relative qubit preparations, while the separately declared face Harness gives the exact trine table. Paper 3 — From Finite Relational Structure to Qubit Operational FormAmbient Foundations, Canonical Subatlas, Exact Global Quantum Dimension, GUIDANCE Witness, Sequential Closure and Global Representation in TUS OSExtends the local construction to the completed-foundation family and canonical TUS OS subatlas, establishes exact carrier-reconstruction structure, proves that the repeated-common-effect static Atlas has exact minimum complex Hilbert dimension 4, and establishes deterministic predictive-state minimum 64 for the frozen complete principal future language. Paper 4 — Technical Volume I — Formal Foundations and the Complete-Future CorpusNative Contract, Statistical Discrimination and the Invariant Probability ModuleFixes the formal native domain, complete principal terminal future-experiment language and one-common-word experiment class; establishes complete statistical separation of distinct carrier pairs, exact parity-resolved discrimination results and complement reachability; and proves that the rational invariant probability module has dimension 33. Paper 4 — Technical Volume II — Orthogonality, Process Closure and Native Triadic SynthesisEstablishes universal complement-support orthogonality and its propagation under exact common-CPTP dynamics, yielding the certified same-parity support graph and the bound 32 ≤ d_CPTP^min ≤ 64, with cross-parity forcing and the exact state-only common-CPTP minimum remaining unresolved. It further establishes recovery-complete LANDING and GUIDANCE results, exact 64-dimensional selected-line instrument/readout minima at their declared contracts, an exact classical–quantum hybrid construction, and the native structural/predictive quotient correspondence. Paper 5 — TUS OS as an Anchored Analog Quantum SystemNative Witnesses, Predictive Synthesis, and Access-Contract Resource SeparationDefines Analog Quantum Views and Anchored Analog Quantum Systems, proves that TUS OS is a proper Anchored Analog Quantum System on its 64-input abstract canonical corpus, elevates the inherited structural/predictive correspondence into the Predictive Synthesis Identity Theorem, organises the inherited exact quantum-operational results through a typed access-contract resource law, and composes the recognition, predictive, resource and downstream-conservation results into the TUS OS Anchored Analog Quantum System Theorem. Paper 6 — Contract-Relative Quantum Realisations of Classical ProcessesPredictive Compression, Vanishing Worst-Case Causal-State Transparency, and Finite-Dimensional BreakdownGeneralises the access-dependent resource phenomenon beyond the TUS-specific discovery corpus by formalising the contract-relative achievable-resource object (S,C,𝔐,ε) ⟼ Ach(S,C;𝔐,ε), and establishes three exact contract-relative regimes: strict finite separation, unbounded finite separation and finite-capacity breakdown. These are instantiated respectively by the TUS OS 4→64 separation, the periodically modulated decay 2→N exact prediction-to-transparency separation, and dual-Poisson finite-capacity breakdown for every positive uniform worst-case transparency threshold. Paper 7 — Operational Observability and Contract-Induced Resource Transitions in Quantum RealisabilityStructural Classification, Family Scaling, and Finite-Resource BreakdownDevelops a structural classification theory for contract-induced representation-resource transitions, introducing the Contract Distinction System (CDS), CRC cofinal/refinement equivalence, and Certified Observability Transport Theory (COTT). It separates internal divergence from family divergence, classifies baseline-feasible strengthenings as resource-neutral, strict finite, finite-resource breakdown, or UNRESOLVED, and proves exact and asymptotic witnesses including an interface-induced 2→3 separation, the TUS OS 4→64 transition, incrementally unbounded finite separation for periodically modulated decay processes, and finite-resource breakdown for positive-threshold dual-Poisson transparency. Paper 8 — The Resource Geometry of Answerable InferenceIrreducible Answerability Structure, Minimal Sufficient Cores, and Certified Inference-Resource BoundariesDevelops the resource geometry of answerable inference. It formalises lawful-discharge semantics, source-level inferential obligations, answerability-sufficient reductions and irreducible sufficient cores, while keeping semantic structure, certified lower bounds and operational feasibility independently constituted. Gate E establishes a local answerability-to-resource threshold result; globally, exact closure identifies the Pareto-minimal inference-resource boundary. On the generated exact branch, L = ↑F, and under well-partial-order conditions the resulting lower-resource geometry has a unique finite canonical antichain normal form. Paper 9 — The Answerability CalculusLawful Reduction, Contract–Resource Representation, Composition and ActivationDevelops a general mathematical calculus of Answerability as a constituted, typed relation. Its Base Theorem states that no terminal proposition counts as an answer unless it lawfully discharges the independently constituted contract. The paper develops lawful reduction, contract–resource geometry, extremal representation, repai