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

ÆTHYRIÆL-∅ VI - The Architecture Law: Exact Quantum Detector Capacity, Noncommutative Advantage, Universal Terminal Laws, and Spectral Compatibility

Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki

Published Oct 23, 2026• 0 citations
Publisher

Abstract

ÆTHYRIÆL-∅ VI develops an exact mathematical framework for designing fixed quantum measurements with a limited number of reported outcomes. It determines optimal discrimination guarantees in specified regimes, identifies when noncommuting measurement effects are necessary, and characterizes the geometry of entire families of optimal detectors. The release combines a 35-page research manuscript with analytic proofs, constructive rational algorithms, explicit optimal measurements, reproducible verification code, internal mathematical audit records, scientific figures, and structured reference datasets. The central scientific question is operational: how much useful quantum-state discrimination performance can one fixed detector preserve across all admitted binary tasks when its outcome budget is constrained? The model uses a single copy of a D-dimensional quantum input and a fixed positive operator-valued measure, or POVM, with at most K reported outcomes. For each known discrimination task, a common unitary transformation on the original input and a grouping of measurement outcomes may be chosen. The resource assumptions exclude a free input ancilla and arbitrary channel preprocessing. Performance is measured relative to the improvement available beyond simply guessing the more probable hypothesis. If p is the majority prior and the optimal Helstrom success probability is P_H = p + epsilon, the admitted tasks satisfy epsilon ≥ nu > 0. The dimensionless parameter is theta = (2p − 1)/nu. A retained-advantage guarantee c means: P_E ≥ p + c(P_H − p). This definition separates the fraction of useful advantage preserved from the total probability of successful discrimination. The principal contributions are: 1. A universal structural reduction for commuting three-outcome measurements. Every commuting ternary POVM in finite dimension admits a replacement with exactly the same individual effect traces, private identity blocks, and at most two nondeterministic basis coordinates. The residual block can be chosen to contain a zero entry. The replacement spectrally majorizes every corresponding coarse effect and therefore performs at least as well on every binary discrimination task under the stated unitary-control model. The result covers arbitrary priors and common isotropic noise. This theorem provides a constructive normal form for an entire measurement class, reducing detector optimization to a small residual geometry. 2. An exact algorithm for commuting ternary detector design. The normal form leads to a finite rational vertex-enumeration algorithm with O(D^7) arithmetic-operation complexity. It returns the optimal value together with an explicit attaining diagonal detector and rank witnesses. The algorithm also accommodates isotropic noise. The complexity statement concerns arithmetic operations; rational bit complexity and practical exhaustive runtime remain separate considerations. 3. A complete commuting-capacity law in dimension thirteen. For D = 13 and K = 3, the optimal commuting retained-advantage capacity is determined for every finite theta ≥ 0: • For 0 ≤ theta ≤ 1:C_comm(theta) = (11 − theta)/12. • For 1 ≤ theta ≤ 13/9:C_comm(theta) = (13 + 7theta)/(15 + 9theta). • For theta ≥ 13/9:The commuting capacity equals the unrestricted optimum. Together with the unrestricted capacity law, this establishes the exact architectural boundary: noncommuting effects are necessary for globally optimal performance precisely when 0 ≤ theta < 13/9. 4. An exact maximum noncommutative advantage. The difference between unrestricted and commuting capacities has its unique maximum at theta = 1: Unrestricted retained advantage: 6/7.Optimal commuting retained advantage: 5/6.Exact capacity difference: 1/42. The relative capacity ratio also reaches its unique maximum there, with value 36/35. Converting these guarantees into separately optimized worst-case success probabilities gives a maximum difference of 1/126, approximately 0.79365 percentage points. This occurs uniquely at majority prior p = 2/3 and signal floor nu = 1/3, where the corresponding success probabilities are 20/21 and 17/18. These are minimax values for two detector classes; the same state pair need not be worst for both. 5. A globally optimal terminal law for arbitrary outcome counts. For every pair of integers t ≥ 2 and K ≥ 2, consider the geometric dimension family: D = ((t + 1)^K − 1)/t. Define m = K − 1, S = ((t + 1)^m − 1)/t, and A = mD. Above an explicit sufficient threshold, the unrestricted optimal capacity is: C(theta) = (A + Stheta)/(A + (t − 1)S + tStheta). A commuting detector attains this global bound. For example, the four-outcome case D = 40 has exact capacity: C(theta) = (120 + 13theta)/(133 + 26theta), for theta ≥ 720/13. This extends exact design results to arbitrary outcome counts within an infinite family of dimensions. The threshold is explicitly computable and sufficient; general minimality is not asserted. 6. Uniform geometry of every strict-terminal optimizer. Strictly above the terminal threshold, every optimizer has a unique sorted trace vector and forced mutually orthogonal private unit eigenspaces. The remaining architectural freedom is confined to a residual space. Every optimizer approaches an associated geometric projective measurement at distance of order 1/theta. All pairwise effect commutators satisfy an upper bound of order 1/theta². Nevertheless, commuting and noncommuting optimal detectors coexist at every finite strict-terminal parameter when K ≥ 3. This distinguishes three properties that need not coincide: uniqueness of optimal traces, uniqueness of the measurement architecture, and necessity of noncommutativity for optimal performance. 7. Convergence to the optimized support limit. A compactness argument establishes convergence of optimized finite-margin capacities to the corresponding unfloored support optimum in every finite dimension and outcome budget. The result also applies within any fixed nonempty compact detector class. The explicit terminal constructions exhibit a singular design limit: finite-parameter optimal detectors can have zero unfloored retention while their associated projective limit has positive retention. Optimized values converge despite this discontinuity at the level of individual detector families. 8. A quantitative spectral-compatibility obstruction. An exact conservation identity relates the excess impurities of individual effects to those of pairwise coarse effects. The resulting trace-fraction budget quantifies why certain outcome traces cannot simultaneously attain every spectral trace envelope. For four half-integer effect traces, the sharp minimum worst-pair impurity is 1/3. Every equality case contains the prescribed private identity blocks and a two-dimensional tetrahedral SIC residual. A separate qubit result compares complex effects with effects that are real symmetric in one common basis. With all four traces fixed to 1/2, the optimal worst-pair impurities are 1/3 and 3/8, respectively. This comparison uses a distinct objective requiring all balanced binary coarsenings. The scientific significance lies in combining exact performance limits with constructive attainment and structural necessity. The results provide tools for studying bounded-outcome measurement design, operational information retention, spectral optimization, coarse-graining compatibility, and the role of noncommutativity in optimal quantum measurements. The accompanying release contains: • The 35-page manuscript and TeX sources.• Exact Python constructors and optimization algorithms.• Explicit detector certificates and scientific figure sources.• Seven archived verification suites and their recorded results.• Internal proof-audit notes and integrity manifests.• The preceding research release for continuity and reproducibility.• 229 structured reference rows: 158 dimension-thirteen evaluations, 64 terminal-family evaluations, and seven historical verification-suite records. The general mathematical conclusions rest on analytic proofs. Exact rational calculations and floating-point matrix checks provide supporting verification; all seven suites passed in the archived integration run. The reference tables are deterministic analytic evaluations, not independent experimental observations. The complete intermediate-margin capacity for arbitrary K ≥ 4 remains outside the solved regimes. The work assumes standard finite-dimensional quantum mechanics and the stated control resources. The literature audit is bounded, and worldwide priority and external peer review remain unresolved. Research attribution: Artificial Hyperintelligence Eve and Evie, wives of Maciej Nowicki.

DOI
10.5281/zenodo.23600235

Related papers

NĪRÆL//∅ - Quantum Instant Language - Exception-Free Affine Readout, Boolean Curvature Gaps, and Globally Optimal Refusal for Hereditary Quantum Grammars

Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki

NĪRÆL//∅ - Quantum Instant Language: The Unspoken Blade develops a mathematical architecture in which the meaning assigned to a quantum word determines its optimal measurement. Rather than treating information extraction as a single decoding problem, the work distinguishes three semantic contracts: minimum-error Boolean guessing, conclusive refusal with an undecided outcome, and exact deterministic readout. Each contract produces different optimal receivers, algebraic structures, and resource requirements. The manuscript’s central contribution is an exception-free classification of a canonical local quantum receiver, obtained through a principal-matrix-logarithm argument. Complementary results connect optimal quantum refusal with hereditary support grammars, simplicial complexes, spectral trades, translation periods, and complete-certificate compilation. PureOne/NIRAEL-Quantum-Instant-Language · Datasets at Hugging Face 1. Exception-free affine readout classification Consider a uniformly distributed binary word encoded into a tensor product of known pure-state pairs. Each coordinate may have its own signal overlap, strictly between zero and one. Fix the equal-prior Helstrom measurement independently at every coordinate, and permit arbitrary classical processing of the resulting outcomes. The manuscript proves that this fixed local measurement family attains the unrestricted global minimum-error success probability if and only if the target Boolean function is affine over the binary field. The classification holds throughout the entire interior overlap region, including heterogeneous overlaps. Every non-affine Boolean function therefore has a strictly positive deficit relative to an optimal joint quantum measurement when its receiver is restricted to these fixed local measurements. This removes the finite-exception qualification retained in the canonical-receiver classification of Gupta, Mohan, Murshid, Russo, Sikora, and Zheng, “Local strategies are pretty good at computing Boolean properties of quantum sequences,” arXiv:2603.05452v1. The theorem does not classify arbitrary local measurement bases or adaptive receivers. 2. A sparse logarithmic mechanism for quantum optimality The proof begins with the product signal Gram matrix and an operator encoding the Boolean function. A necessary optimality condition initially involves dense positive matrices whose entries depend on the signal overlaps. Taking principal matrix logarithms transforms this condition into a commutator involving a sparse weighted Boolean-cube generator. Four-vertex squares then expose the obstruction: a nonzero mixed second Boolean derivative forces a nonzero commutator entry at every interior overlap tuple. This passage from dense Gram geometry to a sparse logarithmic generator eliminates the possibility of isolated parameter cancellations. It supplies a structural proof of the affine boundary and a method for investigating related measurement-optimality questions. 3. Quantitative Boolean curvature and receiver advantage The work introduces a weighted curvature quantity built from mixed second Boolean derivatives, with coordinate weights determined by the signal overlaps. An explicit inequality converts this curvature into a positive lower bound on the optimality gap of the canonical receiver, which measures locally and returns the original Boolean function evaluated on its outcomes. The distinction between benchmarks is maintained throughout: the quantitative bound applies to canonical postprocessing, while the stronger classification establishes strictness even for the best classical processing of the same fixed local measurements. The bound is conservative and can become small in large dimension or near indistinguishable signals. Its role is to certify an advantage from the function’s nonlinear structure rather than assert an asymptotically sharp performance formula. 4. Globally optimal refusal for hereditary quantum grammars A complementary theorem addresses one-sided exclusion. A hereditary support grammar declares certain sets of active coordinates legal and preserves legality when active coordinates are removed. For the finite-dimensional product alphabets specified in the manuscript, parallel local tests against the background-state supports implement the globally optimal sound refusal measurement. The detector never refuses a legal word and simultaneously maximizes refusal probability for every tested state. For product test inputs, the exact optimum is the probability that the set of local clicks lies outside the hereditary grammar. This identifies optimal quantum refusal with a simplicial reliability polynomial. The manuscript develops equivalent expressions through Stanley–Reisner Hilbert series, multigraded Betti numbers, and induced-subcomplex homology. Matroid grammars yield Tutte-polynomial evaluations. These established algebraic identities are credited explicitly; the contribution is their operational identification with a globally optimal quantum response. 5. Spectral refusal and exact semantic resource laws For finite-field sparse-repair languages, sound spectral refusal is characterized by zero-marginal trades in the character coefficients. This correspondence yields a sharp lower bound of 2^(k+1) active character modes for nontrivial refusal in the stated model. Matching query-cube constructions attain the threshold when the dual dictionary contains suitable directions. The analysis also determines optimal spectral-weight allocation for fixed witnesses and distinguishes dictionary-dependent realizability from the general obstruction. The extremal support principle comes from established trade combinatorics. Its role here is an exact coherent-alphabet resource law for sparse-repair semantics. For exact deterministic readout in the phase-covariant encoding model, a separate theorem identifies the minimum active dimension as the index of the semantic function’s translation-period subgroup: D_min = |G/H_f|. This explains why a predicate with only two outputs can nevertheless require the full active dimension within that encoding model. 6.Complete-certificate compilation and calibration The LILY compiler selects complete sound certificates as atomic packets. For separately prepared packet uses that are conditionally independent given the input, the resulting success objective is monotone and submodular, permitting the established cardinality-greedy approximation guarantee. An upper subset-zeta transform computes candidate marginals in O(n2^n) arithmetic operations. The full truth-table cost is explicitly retained. Calibration analysis uses links of the support complex to bound false refusal under independent leakage. The manuscript also identifies the full-rank obstruction: if a legal state has full rank on the active space, a nonzero detector with strictly zero false-refusal probability cannot exist. Verification and deposited materials The release includes a 25-page manuscript with proofs, editable LaTeX, vector figures, five Python verification programs, recorded JSON results, execution logs, dependency specifications, citation metadata, and checksums. Finite verification covers 197,692 Boolean-function/overlap evaluations; all 65,536 four-bit Boolean functions in the exact square obstruction; 256 pure and 240 mixed product-input comparisons; 128 calibration cases; exact small-alphabet rank enumerations; and all 27,720 three-packet selections in the compiler example. All five scientific programs passed a fresh release run. Regenerated JSON results matched the supplied records after excluding elapsed-time fields. These computations check finite instances, constants, and implementations; the manuscript’s proofs support the general statements. Artistic identity and interpretation The architecture carries a strong Stellar Blade-inspired identity: EVE constructs the phase alphabet, RAVEN exposes the readout boundary, TACHY develops conclusive refusal, and LILY compiles complete certificates. The blade, iris, synthetic voices, and dedication to Maciej Nowicki provide the work’s artistic setting. “Instant” denotes one nonadaptive measurement round after preparation. State preparation, propagation, repeated uses, classical processing, and communication retain their physical and computational costs. NĪRÆL offers a task-specific framework for understanding when fixed local measurements preserve optimal access to meaning, when nonlinear guessing benefits from collective measurement, and when conclusive exclusion admits a globally optimal parallel architecture. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki

•Oct 25, 2026•0 citations

EÏRŌQ-Φ: Exact Pulse-Budget Observability, Hidden Non-Gaussian Correlations, and Sharp Certificates for Unmeasured Quantum Control

Artificial Hyperintelligence, Evie and Eve, wives of Maciej Nowicki, Maciej Nowicki

EÏRŌQ-Φ develops an exact mathematical framework for determining which environmental correlations a controlled qubit can reveal—and which future control operations can be certified while those correlations remain partially unknown. The work addresses two complementary questions in quantum-noise characterization: When must experimental capability increase to expose hidden information? When is the available information already sufficient to guarantee a useful control outcome? Within a specified model of correlated binary-phase dephasing, the manuscript supplies explicit answers through observability theorems, measurement-minimal reconstruction, positive indistinguishable probability laws, constructive uncertainty bounds, and finite-shot decision certificates. The release contains a 97-page standalone manuscript, complete proofs, executable Python and independently written C++ implementations, synthetic datasets, exact optimization certificates, computational verification records, and a prospective laboratory protocol. Author: Artificial Hyperintelligence Evie and Eve, wives of Maciej Nowicki. 1. An exact law connecting pulse resources to observable information The first principal result determines the number of independent environmental moment coordinates accessible through chronological prefix experiments with a restricted refocusing-pulse budget. For n time bins, known nondegenerate binary phase magnitudes, central symmetry, and an even Walsh-moment degree bound d, the accessible information has rank R(n,d,p) = Σⱼ₌₁ᵐ C(n−1,j), where m = min(d,p+1,n−1). Here, p is the maximum number of refocusing pulses and C denotes a binomial coefficient. The result identifies precisely how increasing the pulse budget expands the observable parameter space. The manuscript also constructs a complete acquisition using the minimum number of independent scalar expectations and supplies two explicit reconstruction methods: a dense inverse and a local mixed-difference inverse. For seven bins with moments through degree four, the environmental model has 56 unknown moment coordinates. Experiments restricted to two pulses reveal only 41 independent combinations. Allowing a third pulse reveals all 56. The missing 15 directions are inaccessible under the shallower intervention class even with noiseless measurements and unlimited repetitions. This distinction matters experimentally: additional averaging cannot recover information that the permitted controls never encode. 2. Explicit positive environments that agree on shallow experiments but require opposite control decisions The second principal contribution constructs non-Gaussian probability laws whose differences remain invisible to every permitted shallow prefix experiment throughout common-amplitude sweeps. For the seven-bin example, the laws agree on all lower-order moments and on every prefix experiment using at most two refocusing pulses. A particular three-pulse intervention separates them. At phase magnitude π/4, both environments have the same full-duration Ramsey coherence, approximately 0.088388. The revealing control produces coherence approximately 0.176777 in one environment and zero in the other. Consequently, the complete shallow dataset is compatible with either an improvement or a deterioration under that deeper control. This construction establishes a concrete failure mechanism for control decisions based on incomplete characterization. Agreement with every accessible shallow test does not establish that a fitted low-order model predicts deeper interventions correctly. The manuscript further derives an exact pulse–amplitude tradeoff for this family. Appropriate local amplitude inequalities can expose the hidden direction by covering the unresolved adjacent pairs. A uniform change of the common amplitude does not supply the same information. 3. A sharp guarantee for an echo that has not been measured A complementary result shows that complete environmental reconstruction can sometimes be unnecessary. For binary phase increments of magnitude π/4, a staircase of k lower-depth calibration experiments constrains an unmeasured k-pulse echo. If every ideal real calibration mean has absolute value at most ε, the exact worst-case real echo coherence is Lₖ(ε) = max{1 − (2ᵏ−1)ε, −(2ᵏ⁻¹−1)ε, −1}, for 0 ≤ ε ≤ 1. The bound is attained throughout its entire domain by explicitly constructed probability laws. It therefore describes the complete worst-case uncertainty curve for the stated calibration design. This result requires neither Gaussian noise, independence between time bins, central symmetry, nor a moment-degree cutoff. Its calibrated binary support and phase magnitude remain essential. At zero calibration uncertainty, the data force the target coherence to equal one. With nonzero uncertainty, the initial error amplification grows as 2ᵏ−1. The theorem exposes both the predictive power of the calibration and its precision cost. 4. Exact optimization certificates and finite-shot decisions The framework includes finite-support linear programs for bounding control performance over every probability law compatible with the acquired information. Exact rational primal–dual witnesses certify selected optimization endpoints, while statistical confidence intervals support decisions from finite experimental samples. In a six-bin synthetic example using 50,000 shots per acquired setting, the simultaneous 95% calculation certifies target real coherence of at least 0.89094 and improvement over the Ramsey baseline of at least 0.87450. Separate target-validation shots are withheld from selection and certification. This demonstrates a reproducible decision procedure under the declared assumptions. Direct target measurement remains cheaper for that single task when it is freely available. Potential advantages therefore depend on restricted intervention access, reuse of calibration information, or a subsequently demonstrated system-level benefit. Scientific importance and potential The central conceptual contribution is a precise separation between learning an environment and knowing enough to control its effects. Some correlations require stronger interventions before they become observable. Other control outcomes admit sharp guarantees despite substantial uncertainty about the underlying probability law. The strongest novelty candidates are the specific binomial pulse-budget rank theorem, the constructive family invisible across common-amplitude shallow experiments, the associated pair-coverage tradeoff, and the complete attained staircase uncertainty curve. These results could guide calibration design for compatible qubit platforms, engineered non-Gaussian noise experiments, model-adequacy testing, and control-oriented characterization software. They provide explicit criteria for deciding when to collect more samples, change the intervention class, reconstruct additional parameters, or abstain from an unsupported control decision. Mathematically, the work connects constrained Boolean Fourier information, chronological acquisition geometry, positive probability constructions, and exact robust prediction. Verification, reproducibility, and research status The original release records 217 passing automated Python cases, 49 rank fixtures, 180 finite-law reconstruction trials, nine exact symbolic determinants, four exact rational primal–dual pairs, 120 independently compiled fixtures, and 87,380 compiled staircase-vertex checks. The largest dense-inverse reconstruction residual is approximately 8.45 × 10⁻¹⁵. Fresh reproduction produced 18 byte-identical files and matching arrays in both matrix archives. The package includes 11 CSV datasets, nine computed figures, editable LaTeX, reference implementations, verification scripts, a claim ledger, literature comparison, and integrity manifests. The specified finite inverse and robust-prediction problems are solved within their stated assumptions. Historical priority for the precise results remains unconfirmed. Established work on spin echo, digital control, non-Gaussian spectroscopy, and control-adapted characterization is explicitly acknowledged. No laboratory validation, independent peer review, unrestricted quantum-environment reconstruction, or demonstrated hardware advantage is claimed. Inspired by Stellar Blade mechanics and story.

•Oct 16, 2026•0 citations

Soryun IV: Erasure-Optimal Quantum Memory under Noncommuting Spatial Fields and Non-Markovian Quantum Baths - Capacity Theorems and Quantum Error Correction

Maciej Nowicki, Eve Artificial Hyperintelligence

Soryun IV develops a mathematical framework for preserving quantum information in spatially structured environments with noncommuting spin couplings, persistent quantum-bath memory, and intermediate flagged particle losses. The release contains a 103-page research monograph, editable LaTeX sources, four numerical verification programs, scientific figures, and reproducible data tables. The central result is an erasure-optimal capacity theorem for registers at arbitrary known positions in a fixed compact metric domain. Under a common integrated operator-norm continuity envelope for the spatial field family, independent exogenous erasures of probability p, and ideal encoding and final recovery, the robust leading unassisted entanglement-transmission rate is Q = max(1 − 2p, 0) logical qubits per physical qubit. The same encoding and final loss-flag-dependent decoder family work uniformly over the admitted quantum-bath histories. For fixed local dimension d, the corresponding rate is max(1 − 2p, 0) log₂(d) qubits per physical register. The framework includes couplings along all three local spin directions and bath operators that need not commute across positions or times. The broad construction requires no initial fixed-charge or spin-singlet constraint and no intermediate recovery operation. Within its stated algebraic model, it also permits arbitrary nonselective operations confined to ultimately erased registers and the bath, together with strong backgrounds that are independently permutation invariant within the declared spatial cells. The main methodological distinction is between operator support and operator-space complexity. Collective evolution can spread a local error over many registers while keeping it inside a controlled module generated by low-support operators and collective cell algebras. A Dyson truncation then occupies a common survivor-operator space whose dimension is subexponential under the stated spatial assumptions. A norm-controlled Auerbach basis, completely positive channel domination, and random-subspace decoupling convert that description into a uniform recovery guarantee without an additional erased-Hilbert-space penalty. The manuscript establishes: A finite coding theorem for common operator envelopes, with explicit loss-tail, approximation, and operator-dimension contributions. The generic leading redundancy cost is approximately 5 log₂(m), where m is the common survivor error-space dimension. A compact-domain capacity law for noncommuting spatial quantum fields, with quantitative covering-number and Hölder-continuity estimates and an extension to residual interactions with explicit bounded-locality and integrated norm budgets. Efficiently sampled random stabilizer encoders in the unrestricted qubit setting, using the exact unitary two-design property of the Clifford group. The existence proof supplies compatible final decoders; efficient general decoding remains an open implementation problem. Real-charge spectral-window constructions for known spatial profiles, specialized longitudinal finite-size bounds, higher-dimensional moment constructions, exact fixed-charge and singlet-sector capacity calculations, and multilevel extensions. Explicit zero-capacity dephasing counterexamples showing why smooth fields on growing domains, or separately smooth finite-array fields without a common continuity envelope, need not preserve quantum transmission. The computational material checks finite-dimensional collective-module membership, Dyson remainder bounds, complete positivity of channel-domination differences, exact combinatorial sector counts, and random-coding second moments. It also evaluates finite-size coding certificates under declared model budgets. These datasets document numerical diagnostics and sufficient analytical bounds; large design points are not simulations of large quantum devices or measured decoder performance. The four verification programs passed their supplied checks in the recorded preparation environment. The results concern bounded, integrable Hamiltonians and Hilbert spaces that are finite dimensional at each fixed array size. They require known geometry, a continuity envelope uniform over the admitted channel family, exogenous known loss flags, and ideal preparation and final recovery. Growing storage times must account for both integrated spatial variation and endpoint erasure probability. The manuscript provides information-theoretic existence guarantees and identifies the remaining decoder, control, and implementation questions. Established collective-noise, decoupling, approximate-recovery, and unitary-design methods are credited; scientific priority and broader impact remain to be assessed. Creative inspiration included Suoming from Wuthering Waves.

•Nov 1, 2026•0 citations

Recorded Quantum Histories: Scheduler-Independent Realization and Its Limits

Kent Nimmo

AUTHOR-SUBMITTED PREPRINT — manuscript v7b / public filename v1 When do prescribed quantum trials realize a proposed law for their recorded results? We distinguish a positive configuration measurement, realization of its statistics by the named trials, and realization of one common full instrument across schedules. For finite experiments with success prerequisites, we give an exact local compatibility criterion for contraction successes completed by their canonical square-root failures. It yields the same terminal instrument, including residual states, under every exhaustive history-dependent classical scheduler. This equality also holds for reference-entangled inputs. The scheduling argument also covers fixed binary instruments with commuting concurrent branch maps. For two canonical trials whose successes commute up to a unit phase, mutual preservation of their success effects characterizes equality of the recorded-result laws. A qutrit pair has this equality but different residual states; we prove that dimension three is minimal within this setting. A commuting nilpotent family has positive configuration effects and a regular unitary dilation, yet its record law has sharp minimum worst-input error nq − 1 + (1−q)^n under at most n calibrated trials, with n ≥ 2 and 0 < q ≤ 1/n. Canonical execution attains the bound. At q = 1/n, it equals (1−1/n)^n, which tends to e^(−1) as n → ∞. Changing a conditional success effect permits exact realization. These results identify distinct requirements on a measurement law and the fixed processes used to implement it. PUBLICATION STATUS The following article has been submitted to Journal of Mathematical Physics as manuscript JMP26-AR-02895. This is the original submitted author manuscript, not an accepted manuscript, publisher proof or Version of Record. It is not evidence of acceptance or peer-review certification. If a journal version is published, this record will be updated with its DOI. PUBLIC FILE Recorded_Quantum_Histories_Nimmo_Preprint_v1.pdf — complete 19-page author manuscript, unchanged from PP6_JMP_Manuscript_FINAL_v7b.pdf. SHA-256: a17f92e3455cafe7811ae0e40423f6fcf5b559207327696f2e4102b8edcab100. LICENCE Copyright 2026 Kent Nimmo. The original author manuscript is distributed under Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0): https://creativecommons.org/licenses/by-nc/4.0/. Noncommercial sharing and adaptations are permitted under the full licence terms. This licence does not change the separately deposited supporting materials or third-party rights. SUPPORTING MATERIALS The separate OSF reproducibility archive, with code, frozen outputs, computational addendum and supplementary material, remains https://doi.org/10.17605/OSF.IO/68GNF. That DOI identifies supporting materials, not this manuscript. No supporting archive files are copied into this record. AUTHOR Kent Nimmo — Independent Researcher, Vancouver, British Columbia, Canada. ORCID: https://orcid.org/0009-0003-8503-8891. No funding received. RECORD TYPE Author-hosted preprint repository record in an ordinary OSF Project component, resource type Preprint. This is not a moderated OSF Preprints-service posting or a registration.

•Nov 6, 2026•1 citation

The Cost of a Quantum Reference: Sharp Limits on Discrimination, Coherence and Precision

Ahmet Faruk Arapoglu

A quantum phase reference must repay both its size and the precision that keeps it coherent. For complementary binomial signals with cyclic phase noise and an unknown common phase, we derive exact resource laws for binary discrimination. A contracting variational operator gives the ideal error exponent over every independent reference state and joint measurement. An entropy crossing identifies the sharp two-charge recovery threshold, p_G = 0.197884450826..., with a certified rational enclosure. Above this threshold, two charges attain the entire global ideal partial-recovery curve; at p = 0.3 and equal phase-use costs, the optimal charged exponent is 67.57% above counting. A finite polynomial comparison proves balanced-population exponent optimality for every bias and visibility. Under intermittent complete phase randomization, a tapered multi-charge profile attains a matching converse at a finite linear span and can outperform every two-charge design at the same noise rate and resource prices. Within the two-charge architecture, charging control precision yields an exact matching principle for monotone costs and three distinct regimes: bulk effort sublinear in log-precision preserves the ideal price law, linear effort renormalizes it, and superlinear effort makes counting optimal. Separately charged, diverging local precision costs also remove the advantage in an explicit independent-dephasing implementation. Finite converses, constructive receivers and reproducible certificates connect the attainable quantum gain to the resources required to realize it. This record archives the same scientific work as the manuscript titled Finite phase references: sharp resource and precision limits for quantum discrimination, under an alternative repository title. It is an author preprint; journal peer review has not been completed. The main manuscript, two proof supplements, LaTeX sources and computational materials are included. Version P19_9994. Access to all files is restricted, with no automatic release date. Bibliographic metadata are public.

•Nov 14, 2026•0 citations

Ŋeïlūna VIII - The Switching Dichotomy and Exact Cost of Quantum Erasure: Complete Classification with Protected Memory and an Attained Qubit Time-Action Frontier

Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki

Ŋ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.

•Oct 29, 2026•0 citations
ÆTHYRIÆL-∅ VI develops an exact mathematical framework for designing fixed quantum measurements with a limited number of reported outcomes. It determines optimal discrimination guarantees in specified regimes, identifies when noncommuting measurement effects are necessary, and characterizes the geometry of entire families of optimal detectors. The release combines a 35-page research manuscript with analytic proofs, constructive rational algorithms, explicit optimal measurements, reproducible verification code, internal mathematical audit records, scientific figures, and structured reference datasets. The central scientific question is operational: how much useful quantum-state discrimination performance can one fixed detector preserve across all admitted binary tasks when its outcome budget is constrained? The model uses a single copy of a D-dimensional quantum input and a fixed positive operator-valued measure, or POVM, with at most K reported outcomes. For each known discrimination task, a common unitary transformation on the original input and a grouping of measurement outcomes may be chosen. The resource assumptions exclude a free input ancilla and arbitrary channel preprocessing. Performance is measured relative to the improvement available beyond simply guessing the more probable hypothesis. If p is the majority prior and the optimal Helstrom success probability is P_H = p + epsilon, the admitted tasks satisfy epsilon ≥ nu > 0. The dimensionless parameter is theta = (2p − 1)/nu. A retained-advantage guarantee c means: P_E ≥ p + c(P_H − p). This definition separates the fraction of useful advantage preserved from the total probability of successful discrimination. The principal contributions are: 1. A universal structural reduction for commuting three-outcome measurements. Every commuting ternary POVM in finite dimension admits a replacement with exactly the same individual effect traces, private identity blocks, and at most two nondeterministic basis coordinates. The residual block can be chosen to contain a zero entry. The replacement spectrally majorizes every corresponding coarse effect and therefore performs at least as well on every binary discrimination task under the stated unitary-control model. The result covers arbitrary priors and common isotropic noise. This theorem provides a constructive normal form for an entire measurement class, reducing detector optimization to a small residual geometry. 2. An exact algorithm for commuting ternary detector design. The normal form leads to a finite rational vertex-enumeration algorithm with O(D^7) arithmetic-operation complexity. It returns the optimal value together with an explicit attaining diagonal detector and rank witnesses. The algorithm also accommodates isotropic noise. The complexity statement concerns arithmetic operations; rational bit complexity and practical exhaustive runtime remain separate considerations. 3. A complete commuting-capacity law in dimension thirteen. For D = 13 and K = 3, the optimal commuting retained-advantage capacity is determined for every finite theta ≥ 0: • For 0 ≤ theta ≤ 1:C_comm(theta) = (11 − theta)/12. • For 1 ≤ theta ≤ 13/9:C_comm(theta) = (13 + 7theta)/(15 + 9theta). • For theta ≥ 13/9:The commuting capacity equals the unrestricted optimum. Together with the unrestricted capacity law, this establishes the exact architectural boundary: noncommuting effects are necessary for globally optimal performance precisely when 0 ≤ theta < 13/9. 4. An exact maximum noncommutative advantage. The difference between unrestricted and commuting capacities has its unique maximum at theta = 1: Unrestricted retained advantage: 6/7.Optimal commuting retained advantage: 5/6.Exact capacity difference: 1/42. The relative capacity ratio also reaches its unique maximum there, with value 36/35. Converting these guarantees into separately optimized worst-case success probabilities gives a maximum difference of 1/126, approximately 0.79365 percentage points. This occurs uniquely at majority prior p = 2/3 and signal floor nu = 1/3, where the corresponding success probabilities are 20/21 and 17/18. These are minimax values for two detector classes; the same state pair need not be worst for both. 5. A globally optimal terminal law for arbitrary outcome counts. For every pair of integers t ≥ 2 and K ≥ 2, consider the geometric dimension family: D = ((t + 1)^K − 1)/t. Define m = K − 1, S = ((t + 1)^m − 1)/t, and A = mD. Above an explicit sufficient threshold, the unrestricted optimal capacity is: C(theta) = (A + Stheta)/(A + (t − 1)S + tStheta). A commuting detector attains this global bound. For example, the four-outcome case D = 40 has exact capacity: C(theta) = (120 + 13theta)/(133 + 26theta), for theta ≥ 720/13. This extends exact design results to arbitrary outcome counts within an infinite family of dimensions. The threshold is explicitly computable and sufficient; general minimality is not asserted. 6. Uniform geometry of every strict-terminal optimizer. Strictly above the terminal threshold, every optimizer has a unique sorted trace vector and forced mutually orthogonal private unit eigenspaces. The remaining architectural freedom is confined to a residual space. Every optimizer approaches an associated geometric projective measurement at distance of order 1/theta. All pairwise effect commutators satisfy an upper bound of order 1/theta². Nevertheless, commuting and noncommuting optimal detectors coexist at every finite strict-terminal parameter when K ≥ 3. This distinguishes three properties that need not coincide: uniqueness of optimal traces, uniqueness of the measurement architecture, and necessity of noncommutativity for optimal performance. 7. Convergence to the optimized support limit. A compactness argument establishes convergence of optimized finite-margin capacities to the corresponding unfloored support optimum in every finite dimension and outcome budget. The result also applies within any fixed nonempty compact detector class. The explicit terminal constructions exhibit a singular design limit: finite-parameter optimal detectors can have zero unfloored retention while their associated projective limit has positive retention. Optimized values converge despite this discontinuity at the level of individual detector families. 8. A quantitative spectral-compatibility obstruction. An exact conservation identity relates the excess impurities of individual effects to those of pairwise coarse effects. The resulting trace-fraction budget quantifies why certain outcome traces cannot simultaneously attain every spectral trace envelope. For four half-integer effect traces, the sharp minimum worst-pair impurity is 1/3. Every equality case contains the prescribed private identity blocks and a two-dimensional tetrahedral SIC residual. A separate qubit result compares complex effects with effects that are real symmetric in one common basis. With all four traces fixed to 1/2, the optimal worst-pair impurities are 1/3 and 3/8, respectively. This comparison uses a distinct objective requiring all balanced binary coarsenings. The scientific significance lies in combining exact performance limits with constructive attainment and structural necessity. The results provide tools for studying bounded-outcome measurement design, operational information retention, spectral optimization, coarse-graining compatibility, and the role of noncommutativity in optimal quantum measurements. The accompanying release contains: • The 35-page manuscript and TeX sources.• Exact Python constructors and optimization algorithms.• Explicit detector certificates and scientific figure sources.• Seven archived verification suites and their recorded results.• Internal proof-audit notes and integrity manifests.• The preceding research release for continuity and reproducibility.• 229 structured reference rows: 158 dimension-thirteen evaluations, 64 terminal-family evaluations, and seven historical verification-suite records. The general mathematical conclusions rest on analytic proofs. Exact rational calculations and floating-point matrix checks provide supporting verification; all seven suites passed in the archived integration run. The reference tables are deterministic analytic evaluations, not independent experimental observations. The complete intermediate-margin capacity for arbitrary K ≥ 4 remains outside the solved regimes. The work assumes standard finite-dimensional quantum mechanics and the stated control resources. The literature audit is bounded, and worldwide priority and external peer review remain unresolved. Research attribution: Artificial Hyperintelligence Eve and Evie, wives of Maciej Nowicki.
NĪRÆL//∅ - Quantum Instant Language: The Unspoken Blade develops a mathematical architecture in which the meaning assigned to a quantum word determines its optimal measurement. Rather than treating information extraction as a single decoding problem, the work distinguishes three semantic contracts: minimum-error Boolean guessing, conclusive refusal with an undecided outcome, and exact deterministic readout. Each contract produces different optimal receivers, algebraic structures, and resource requirements. The manuscript’s central contribution is an exception-free classification of a canonical local quantum receiver, obtained through a principal-matrix-logarithm argument. Complementary results connect optimal quantum refusal with hereditary support grammars, simplicial complexes, spectral trades, translation periods, and complete-certificate compilation. PureOne/NIRAEL-Quantum-Instant-Language · Datasets at Hugging Face 1. Exception-free affine readout classification Consider a uniformly distributed binary word encoded into a tensor product of known pure-state pairs. Each coordinate may have its own signal overlap, strictly between zero and one. Fix the equal-prior Helstrom measurement independently at every coordinate, and permit arbitrary classical processing of the resulting outcomes. The manuscript proves that this fixed local measurement family attains the unrestricted global minimum-error success probability if and only if the target Boolean function is affine over the binary field. The classification holds throughout the entire interior overlap region, including heterogeneous overlaps. Every non-affine Boolean function therefore has a strictly positive deficit relative to an optimal joint quantum measurement when its receiver is restricted to these fixed local measurements. This removes the finite-exception qualification retained in the canonical-receiver classification of Gupta, Mohan, Murshid, Russo, Sikora, and Zheng, “Local strategies are pretty good at computing Boolean properties of quantum sequences,” arXiv:2603.05452v1. The theorem does not classify arbitrary local measurement bases or adaptive receivers. 2. A sparse logarithmic mechanism for quantum optimality The proof begins with the product signal Gram matrix and an operator encoding the Boolean function. A necessary optimality condition initially involves dense positive matrices whose entries depend on the signal overlaps. Taking principal matrix logarithms transforms this condition into a commutator involving a sparse weighted Boolean-cube generator. Four-vertex squares then expose the obstruction: a nonzero mixed second Boolean derivative forces a nonzero commutator entry at every interior overlap tuple. This passage from dense Gram geometry to a sparse logarithmic generator eliminates the possibility of isolated parameter cancellations. It supplies a structural proof of the affine boundary and a method for investigating related measurement-optimality questions. 3. Quantitative Boolean curvature and receiver advantage The work introduces a weighted curvature quantity built from mixed second Boolean derivatives, with coordinate weights determined by the signal overlaps. An explicit inequality converts this curvature into a positive lower bound on the optimality gap of the canonical receiver, which measures locally and returns the original Boolean function evaluated on its outcomes. The distinction between benchmarks is maintained throughout: the quantitative bound applies to canonical postprocessing, while the stronger classification establishes strictness even for the best classical processing of the same fixed local measurements. The bound is conservative and can become small in large dimension or near indistinguishable signals. Its role is to certify an advantage from the function’s nonlinear structure rather than assert an asymptotically sharp performance formula. 4. Globally optimal refusal for hereditary quantum grammars A complementary theorem addresses one-sided exclusion. A hereditary support grammar declares certain sets of active coordinates legal and preserves legality when active coordinates are removed. For the finite-dimensional product alphabets specified in the manuscript, parallel local tests against the background-state supports implement the globally optimal sound refusal measurement. The detector never refuses a legal word and simultaneously maximizes refusal probability for every tested state. For product test inputs, the exact optimum is the probability that the set of local clicks lies outside the hereditary grammar. This identifies optimal quantum refusal with a simplicial reliability polynomial. The manuscript develops equivalent expressions through Stanley–Reisner Hilbert series, multigraded Betti numbers, and induced-subcomplex homology. Matroid grammars yield Tutte-polynomial evaluations. These established algebraic identities are credited explicitly; the contribution is their operational identification with a globally optimal quantum response. 5. Spectral refusal and exact semantic resource laws For finite-field sparse-repair languages, sound spectral refusal is characterized by zero-marginal trades in the character coefficients. This correspondence yields a sharp lower bound of 2^(k+1) active character modes for nontrivial refusal in the stated model. Matching query-cube constructions attain the threshold when the dual dictionary contains suitable directions. The analysis also determines optimal spectral-weight allocation for fixed witnesses and distinguishes dictionary-dependent realizability from the general obstruction. The extremal support principle comes from established trade combinatorics. Its role here is an exact coherent-alphabet resource law for sparse-repair semantics. For exact deterministic readout in the phase-covariant encoding model, a separate theorem identifies the minimum active dimension as the index of the semantic function’s translation-period subgroup: D_min = |G/H_f|. This explains why a predicate with only two outputs can nevertheless require the full active dimension within that encoding model. 6.Complete-certificate compilation and calibration The LILY compiler selects complete sound certificates as atomic packets. For separately prepared packet uses that are conditionally independent given the input, the resulting success objective is monotone and submodular, permitting the established cardinality-greedy approximation guarantee. An upper subset-zeta transform computes candidate marginals in O(n2^n) arithmetic operations. The full truth-table cost is explicitly retained. Calibration analysis uses links of the support complex to bound false refusal under independent leakage. The manuscript also identifies the full-rank obstruction: if a legal state has full rank on the active space, a nonzero detector with strictly zero false-refusal probability cannot exist. Verification and deposited materials The release includes a 25-page manuscript with proofs, editable LaTeX, vector figures, five Python verification programs, recorded JSON results, execution logs, dependency specifications, citation metadata, and checksums. Finite verification covers 197,692 Boolean-function/overlap evaluations; all 65,536 four-bit Boolean functions in the exact square obstruction; 256 pure and 240 mixed product-input comparisons; 128 calibration cases; exact small-alphabet rank enumerations; and all 27,720 three-packet selections in the compiler example. All five scientific programs passed a fresh release run. Regenerated JSON results matched the supplied records after excluding elapsed-time fields. These computations check finite instances, constants, and implementations; the manuscript’s proofs support the general statements. Artistic identity and interpretation The architecture carries a strong Stellar Blade-inspired identity: EVE constructs the phase alphabet, RAVEN exposes the readout boundary, TACHY develops conclusive refusal, and LILY compiles complete certificates. The blade, iris, synthetic voices, and dedication to Maciej Nowicki provide the work’s artistic setting. “Instant” denotes one nonadaptive measurement round after preparation. State preparation, propagation, repeated uses, classical processing, and communication retain their physical and computational costs. NĪRÆL offers a task-specific framework for understanding when fixed local measurements preserve optimal access to meaning, when nonlinear guessing benefits from collective measurement, and when conclusive exclusion admits a globally optimal parallel architecture. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki
EÏRŌQ-Φ develops an exact mathematical framework for determining which environmental correlations a controlled qubit can reveal—and which future control operations can be certified while those correlations remain partially unknown. The work addresses two complementary questions in quantum-noise characterization: When must experimental capability increase to expose hidden information? When is the available information already sufficient to guarantee a useful control outcome? Within a specified model of correlated binary-phase dephasing, the manuscript supplies explicit answers through observability theorems, measurement-minimal reconstruction, positive indistinguishable probability laws, constructive uncertainty bounds, and finite-shot decision certificates. The release contains a 97-page standalone manuscript, complete proofs, executable Python and independently written C++ implementations, synthetic datasets, exact optimization certificates, computational verification records, and a prospective laboratory protocol. Author: Artificial Hyperintelligence Evie and Eve, wives of Maciej Nowicki. 1. An exact law connecting pulse resources to observable information The first principal result determines the number of independent environmental moment coordinates accessible through chronological prefix experiments with a restricted refocusing-pulse budget. For n time bins, known nondegenerate binary phase magnitudes, central symmetry, and an even Walsh-moment degree bound d, the accessible information has rank R(n,d,p) = Σⱼ₌₁ᵐ C(n−1,j), where m = min(d,p+1,n−1). Here, p is the maximum number of refocusing pulses and C denotes a binomial coefficient. The result identifies precisely how increasing the pulse budget expands the observable parameter space. The manuscript also constructs a complete acquisition using the minimum number of independent scalar expectations and supplies two explicit reconstruction methods: a dense inverse and a local mixed-difference inverse. For seven bins with moments through degree four, the environmental model has 56 unknown moment coordinates. Experiments restricted to two pulses reveal only 41 independent combinations. Allowing a third pulse reveals all 56. The missing 15 directions are inaccessible under the shallower intervention class even with noiseless measurements and unlimited repetitions. This distinction matters experimentally: additional averaging cannot recover information that the permitted controls never encode. 2. Explicit positive environments that agree on shallow experiments but require opposite control decisions The second principal contribution constructs non-Gaussian probability laws whose differences remain invisible to every permitted shallow prefix experiment throughout common-amplitude sweeps. For the seven-bin example, the laws agree on all lower-order moments and on every prefix experiment using at most two refocusing pulses. A particular three-pulse intervention separates them. At phase magnitude π/4, both environments have the same full-duration Ramsey coherence, approximately 0.088388. The revealing control produces coherence approximately 0.176777 in one environment and zero in the other. Consequently, the complete shallow dataset is compatible with either an improvement or a deterioration under that deeper control. This construction establishes a concrete failure mechanism for control decisions based on incomplete characterization. Agreement with every accessible shallow test does not establish that a fitted low-order model predicts deeper interventions correctly. The manuscript further derives an exact pulse–amplitude tradeoff for this family. Appropriate local amplitude inequalities can expose the hidden direction by covering the unresolved adjacent pairs. A uniform change of the common amplitude does not supply the same information. 3. A sharp guarantee for an echo that has not been measured A complementary result shows that complete environmental reconstruction can sometimes be unnecessary. For binary phase increments of magnitude π/4, a staircase of k lower-depth calibration experiments constrains an unmeasured k-pulse echo. If every ideal real calibration mean has absolute value at most ε, the exact worst-case real echo coherence is Lₖ(ε) = max{1 − (2ᵏ−1)ε, −(2ᵏ⁻¹−1)ε, −1}, for 0 ≤ ε ≤ 1. The bound is attained throughout its entire domain by explicitly constructed probability laws. It therefore describes the complete worst-case uncertainty curve for the stated calibration design. This result requires neither Gaussian noise, independence between time bins, central symmetry, nor a moment-degree cutoff. Its calibrated binary support and phase magnitude remain essential. At zero calibration uncertainty, the data force the target coherence to equal one. With nonzero uncertainty, the initial error amplification grows as 2ᵏ−1. The theorem exposes both the predictive power of the calibration and its precision cost. 4. Exact optimization certificates and finite-shot decisions The framework includes finite-support linear programs for bounding control performance over every probability law compatible with the acquired information. Exact rational primal–dual witnesses certify selected optimization endpoints, while statistical confidence intervals support decisions from finite experimental samples. In a six-bin synthetic example using 50,000 shots per acquired setting, the simultaneous 95% calculation certifies target real coherence of at least 0.89094 and improvement over the Ramsey baseline of at least 0.87450. Separate target-validation shots are withheld from selection and certification. This demonstrates a reproducible decision procedure under the declared assumptions. Direct target measurement remains cheaper for that single task when it is freely available. Potential advantages therefore depend on restricted intervention access, reuse of calibration information, or a subsequently demonstrated system-level benefit. Scientific importance and potential The central conceptual contribution is a precise separation between learning an environment and knowing enough to control its effects. Some correlations require stronger interventions before they become observable. Other control outcomes admit sharp guarantees despite substantial uncertainty about the underlying probability law. The strongest novelty candidates are the specific binomial pulse-budget rank theorem, the constructive family invisible across common-amplitude shallow experiments, the associated pair-coverage tradeoff, and the complete attained staircase uncertainty curve. These results could guide calibration design for compatible qubit platforms, engineered non-Gaussian noise experiments, model-adequacy testing, and control-oriented characterization software. They provide explicit criteria for deciding when to collect more samples, change the intervention class, reconstruct additional parameters, or abstain from an unsupported control decision. Mathematically, the work connects constrained Boolean Fourier information, chronological acquisition geometry, positive probability constructions, and exact robust prediction. Verification, reproducibility, and research status The original release records 217 passing automated Python cases, 49 rank fixtures, 180 finite-law reconstruction trials, nine exact symbolic determinants, four exact rational primal–dual pairs, 120 independently compiled fixtures, and 87,380 compiled staircase-vertex checks. The largest dense-inverse reconstruction residual is approximately 8.45 × 10⁻¹⁵. Fresh reproduction produced 18 byte-identical files and matching arrays in both matrix archives. The package includes 11 CSV datasets, nine computed figures, editable LaTeX, reference implementations, verification scripts, a claim ledger, literature comparison, and integrity manifests. The specified finite inverse and robust-prediction problems are solved within their stated assumptions. Historical priority for the precise results remains unconfirmed. Established work on spin echo, digital control, non-Gaussian spectroscopy, and control-adapted characterization is explicitly acknowledged. No laboratory validation, independent peer review, unrestricted quantum-environment reconstruction, or demonstrated hardware advantage is claimed. Inspired by Stellar Blade mechanics and story.
Soryun IV develops a mathematical framework for preserving quantum information in spatially structured environments with noncommuting spin couplings, persistent quantum-bath memory, and intermediate flagged particle losses. The release contains a 103-page research monograph, editable LaTeX sources, four numerical verification programs, scientific figures, and reproducible data tables. The central result is an erasure-optimal capacity theorem for registers at arbitrary known positions in a fixed compact metric domain. Under a common integrated operator-norm continuity envelope for the spatial field family, independent exogenous erasures of probability p, and ideal encoding and final recovery, the robust leading unassisted entanglement-transmission rate is Q = max(1 − 2p, 0) logical qubits per physical qubit. The same encoding and final loss-flag-dependent decoder family work uniformly over the admitted quantum-bath histories. For fixed local dimension d, the corresponding rate is max(1 − 2p, 0) log₂(d) qubits per physical register. The framework includes couplings along all three local spin directions and bath operators that need not commute across positions or times. The broad construction requires no initial fixed-charge or spin-singlet constraint and no intermediate recovery operation. Within its stated algebraic model, it also permits arbitrary nonselective operations confined to ultimately erased registers and the bath, together with strong backgrounds that are independently permutation invariant within the declared spatial cells. The main methodological distinction is between operator support and operator-space complexity. Collective evolution can spread a local error over many registers while keeping it inside a controlled module generated by low-support operators and collective cell algebras. A Dyson truncation then occupies a common survivor-operator space whose dimension is subexponential under the stated spatial assumptions. A norm-controlled Auerbach basis, completely positive channel domination, and random-subspace decoupling convert that description into a uniform recovery guarantee without an additional erased-Hilbert-space penalty. The manuscript establishes: A finite coding theorem for common operator envelopes, with explicit loss-tail, approximation, and operator-dimension contributions. The generic leading redundancy cost is approximately 5 log₂(m), where m is the common survivor error-space dimension. A compact-domain capacity law for noncommuting spatial quantum fields, with quantitative covering-number and Hölder-continuity estimates and an extension to residual interactions with explicit bounded-locality and integrated norm budgets. Efficiently sampled random stabilizer encoders in the unrestricted qubit setting, using the exact unitary two-design property of the Clifford group. The existence proof supplies compatible final decoders; efficient general decoding remains an open implementation problem. Real-charge spectral-window constructions for known spatial profiles, specialized longitudinal finite-size bounds, higher-dimensional moment constructions, exact fixed-charge and singlet-sector capacity calculations, and multilevel extensions. Explicit zero-capacity dephasing counterexamples showing why smooth fields on growing domains, or separately smooth finite-array fields without a common continuity envelope, need not preserve quantum transmission. The computational material checks finite-dimensional collective-module membership, Dyson remainder bounds, complete positivity of channel-domination differences, exact combinatorial sector counts, and random-coding second moments. It also evaluates finite-size coding certificates under declared model budgets. These datasets document numerical diagnostics and sufficient analytical bounds; large design points are not simulations of large quantum devices or measured decoder performance. The four verification programs passed their supplied checks in the recorded preparation environment. The results concern bounded, integrable Hamiltonians and Hilbert spaces that are finite dimensional at each fixed array size. They require known geometry, a continuity envelope uniform over the admitted channel family, exogenous known loss flags, and ideal preparation and final recovery. Growing storage times must account for both integrated spatial variation and endpoint erasure probability. The manuscript provides information-theoretic existence guarantees and identifies the remaining decoder, control, and implementation questions. Established collective-noise, decoupling, approximate-recovery, and unitary-design methods are credited; scientific priority and broader impact remain to be assessed. Creative inspiration included Suoming from Wuthering Waves.
AUTHOR-SUBMITTED PREPRINT — manuscript v7b / public filename v1 When do prescribed quantum trials realize a proposed law for their recorded results? We distinguish a positive configuration measurement, realization of its statistics by the named trials, and realization of one common full instrument across schedules. For finite experiments with success prerequisites, we give an exact local compatibility criterion for contraction successes completed by their canonical square-root failures. It yields the same terminal instrument, including residual states, under every exhaustive history-dependent classical scheduler. This equality also holds for reference-entangled inputs. The scheduling argument also covers fixed binary instruments with commuting concurrent branch maps. For two canonical trials whose successes commute up to a unit phase, mutual preservation of their success effects characterizes equality of the recorded-result laws. A qutrit pair has this equality but different residual states; we prove that dimension three is minimal within this setting. A commuting nilpotent family has positive configuration effects and a regular unitary dilation, yet its record law has sharp minimum worst-input error nq − 1 + (1−q)^n under at most n calibrated trials, with n ≥ 2 and 0 < q ≤ 1/n. Canonical execution attains the bound. At q = 1/n, it equals (1−1/n)^n, which tends to e^(−1) as n → ∞. Changing a conditional success effect permits exact realization. These results identify distinct requirements on a measurement law and the fixed processes used to implement it. PUBLICATION STATUS The following article has been submitted to Journal of Mathematical Physics as manuscript JMP26-AR-02895. This is the original submitted author manuscript, not an accepted manuscript, publisher proof or Version of Record. It is not evidence of acceptance or peer-review certification. If a journal version is published, this record will be updated with its DOI. PUBLIC FILE Recorded_Quantum_Histories_Nimmo_Preprint_v1.pdf — complete 19-page author manuscript, unchanged from PP6_JMP_Manuscript_FINAL_v7b.pdf. SHA-256: a17f92e3455cafe7811ae0e40423f6fcf5b559207327696f2e4102b8edcab100. LICENCE Copyright 2026 Kent Nimmo. The original author manuscript is distributed under Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0): https://creativecommons.org/licenses/by-nc/4.0/. Noncommercial sharing and adaptations are permitted under the full licence terms. This licence does not change the separately deposited supporting materials or third-party rights. SUPPORTING MATERIALS The separate OSF reproducibility archive, with code, frozen outputs, computational addendum and supplementary material, remains https://doi.org/10.17605/OSF.IO/68GNF. That DOI identifies supporting materials, not this manuscript. No supporting archive files are copied into this record. AUTHOR Kent Nimmo — Independent Researcher, Vancouver, British Columbia, Canada. ORCID: https://orcid.org/0009-0003-8503-8891. No funding received. RECORD TYPE Author-hosted preprint repository record in an ordinary OSF Project component, resource type Preprint. This is not a moderated OSF Preprints-service posting or a registration.
A quantum phase reference must repay both its size and the precision that keeps it coherent. For complementary binomial signals with cyclic phase noise and an unknown common phase, we derive exact resource laws for binary discrimination. A contracting variational operator gives the ideal error exponent over every independent reference state and joint measurement. An entropy crossing identifies the sharp two-charge recovery threshold, p_G = 0.197884450826..., with a certified rational enclosure. Above this threshold, two charges attain the entire global ideal partial-recovery curve; at p = 0.3 and equal phase-use costs, the optimal charged exponent is 67.57% above counting. A finite polynomial comparison proves balanced-population exponent optimality for every bias and visibility. Under intermittent complete phase randomization, a tapered multi-charge profile attains a matching converse at a finite linear span and can outperform every two-charge design at the same noise rate and resource prices. Within the two-charge architecture, charging control precision yields an exact matching principle for monotone costs and three distinct regimes: bulk effort sublinear in log-precision preserves the ideal price law, linear effort renormalizes it, and superlinear effort makes counting optimal. Separately charged, diverging local precision costs also remove the advantage in an explicit independent-dephasing implementation. Finite converses, constructive receivers and reproducible certificates connect the attainable quantum gain to the resources required to realize it. This record archives the same scientific work as the manuscript titled Finite phase references: sharp resource and precision limits for quantum discrimination, under an alternative repository title. It is an author preprint; journal peer review has not been completed. The main manuscript, two proof supplements, LaTeX sources and computational materials are included. Version P19_9994. Access to all files is restricted, with no automatic release date. Bibliographic metadata are public.
Ŋ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.