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

Temporal Correlations Reshape Causal Resources in Qubit Hamiltonian Recognition: Exact Two-Query General-Strategy Phase Diagram

王有福

Published Sep 10, 2026• 0 citations
Publisher

Abstract

Hamiltonian recognition asks which candidate Hamiltonian generated an unknown quantum evolution when the evolution angle is not observed. This preprint solves a binary two-query qubit setting in which the two unknown angles range from independently resampled to fully shared. A task-specific symmetrization theorem reduces the full sequential optimization exactly to a three-dimensional correlation elliptope. A nine-dimensional legal subset of the most general tester dual is then shown to reduce, by semidefinite-program duality, to the same elliptope problem, yielding P_GEN(beta,eta) = P_SEQ(beta,eta) throughout the stated parameter domain. The resulting PAR-versus-GEN phase diagram contains an exact interior equality curve and an exact high-angle reentrant regime in which the globally optimal causal-processing advantage vanishes at both zero and full temporal correlation but is positive at every intermediate strength. Arbitrarily weak temporal correlation can activate a strict advantage. In this archival v1.1 release, the weak-correlation statement is conservatively formulated as explicit constructive lower bounds of orders eta^2 below 45 degrees, eta^(4/3) at 45 degrees, and eta above 45 degrees. No matching upper-bound derivation is claimed for exact asymptotic equivalence of those exponents. The record includes the main preprint, Supplemental Material, and a reproducibility archive containing proof notes, symbolic verification scripts, numerical cross-check data, revised manuscript source, figures, and integrity hashes. Status: public preprint; not independently peer-reviewed.

DOI
10.5281/zenodo.22685036

Related papers

Temporal Correlations Reshape Causal Resources in Qubit Hamiltonian Recognition: Exact Two-Query Strategy Comparison and a Uniform Critical Crossover

Youfuwang王有福

We investigate binary recognition of an unknown qubit Hamiltonian using two queries of its evolution, with unknown evolution angles that are either independently resampled or shared with tunable temporal correlation. For a symmetric pair of nonorthogonal qubit Hamiltonians, we compare parallel (PAR), sequential (SEQ), and general (GEN) quantum strategies. An exact symmetry reduction expresses the sequential optimization through a three-dimensional correlation elliptope. A general-strategy dual certificate establishes the equality between optimal general and sequential strategies within the studied model. We analyze the operational advantage generated by temporal correlations and establish distinct weak-correlation scaling regimes separated by a critical angle of 45 degrees. This revised and extended version (v1.2) adds a uniform double-scaling critical crossover theorem, including an explicit positive crossover function and consolidated mathematical proofs. The result characterizes a previously unresolved critical transition within the specified quantum Hamiltonian recognition model. The complete mathematical derivations are provided in the accompanying supplementary material (Sections S1–S19). This work is conducted within standard quantum information theory and does not claim physics beyond quantum mechanics. Version: 1.2 Resource type: Publication — Preprint Author: Youfu Wang Affiliation: Independent Researcher, OCN Research

•Oct 16, 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

δ and Physical Reality

Washburn

A physical identification requires a domain of experiments, a realization, and an observation that distinguishes competing mechanisms. We construct these for the δ framework. Within finite causal quantum experiments, computable Choi data are equivalent to finite arithmetic programs producing valid instrument approximations at every requested accuracy. A separate pointer reader preserves the quantum posterior and supports adaptive composition. For the native two-atom census, the actual join update and common-mode retention select golden scaling and a signed contraction. Coherent return selects its minimal conserving completion; an independently calibrated spectral band then selects its constant interaction. A bright-mode construction and a stable short-time calibration procedure supply an explicit realization and uncertainty budget; measured duration and frequency supply the dimensional units. We derive a general endpoint identity between stored record energy and comparison imbalance, and distinguish the monotone fresh-record trajectory from coherent recurrence. The logical-to-physical bridge also has a sharp boundary: an explicit instance of the proposed completion generator has no effective value-reflecting physical reader or numerical comparison receipt. Sequence completion requires precisely the corresponding halting-oracle resource, not an unexplained scalar cost. This obstructs operational completion while leaving purely proof-language transport distinct. Native implementations of identical logical strength nevertheless carry different physical receipts. Joint covariance and the exact endpoint law state the valid relationship between those quantities. Finally, calibrated return and three-outcome tests distinguish the relevant phase and recording alternatives, with quantitative error bounds. First public preprint release, version 1.0. The files include the PDF and the main TeX file. AI-use disclosure: AI assistance was used for source analysis, mathematical exploration, manuscript drafting and revision, diagram preparation, and computational verification support. GPT-6 Astra reviews assessed arguments, scope, readability, and schematics. These were internal model reviews, not external peer review. Jonathan Washburn is the sole listed author and is responsible for the released manuscript.

•Sep 17, 2026•0 citations

Bias-Induced Non-Isoclinic Optimality in Finite Quantum Error Histories: Exact Separation, Thresholdless Bifurcation, and Near-Balanced All-Code Minimax

Byoungwoo Lee

## Overview This theorem-focused paper studies one logical qubit encoded into two physical qubits and exposed to two independent temporally ordered dephasing events, one collective and one differential, whose binary history labels are coherently stored by an environment. The objective is to minimize the worst-case logical information leaked into the environment’s history register over all rank-two quantum codes. A probability-adapted Bernoulli basis reduces the complementary output difference for arbitrary independent event probabilities to a traceless three-dimensional Hermitian arrow matrix. Phase-reflection and event-exchange symmetries then show that the fixed-code worst-phase leakage and its all-code minimax depend on the event probabilities only through their Bernoulli variances. ## Main results At equal event probabilities \(\mu_+=\mu_-=1/5\), an explicit transverse non-isoclinic code satisfies $$L^{\mathrm{wc}}_{1/5,1/5}(V)\le \frac{99}{250}<\frac25,$$ where \(2/5\) is the exact optimum over the complete parity-isoclinic manifold. The strict upper bound is certified using exact rational tensor-Bernstein arithmetic. Distributional stability extends this separation to an explicit two-parameter rectangle whose open interior is a region of forced non-isoclinic optimality. On the symmetric independent line, the paper proves a thresholdless bifurcation: every nondeterministic nonbalanced distribution destroys parity-isoclinic global optimality. Near the balanced point, probability bias selects the universal finite anisotropy $$\eta_0=\sqrt{\frac{3\sqrt2-4}{8}},$$ and the minimax over the full rank-two code Grassmannian satisfies $$\Lambda_{\mathrm{diag}}(\delta)=\frac12-\left(\frac12-\frac{\sqrt2}{6}\right)\delta^2+o(\delta^2),\qquad \delta=1-2\mu.$$ Every asymptotically minimizing code accumulates on the transverse balanced-minimizer stratum with $$r=\frac12,\qquad \eta=\eta_0,\qquad e_z=o_z=0,$$ and with relative transverse-axis overlap bounded by $$|\mathbf e\cdot\mathbf o|\le\frac{\sqrt2-1}{3}.$$ Thus probability bias breaks the balanced continuum of globally minimizing codes and selects a genuinely non-isoclinic geometric phase with a universal leading anisotropy over the full code Grassmannian. ## Scope The paper does not claim an exact finite-bias formula for the complete minimax, a determination of the order at which the remaining transverse-axis overlap is selected, or a complete off-diagonal phase boundary for unequal event variances. These are identified as follow-up problems. ## Reproducibility package This record contains: - the manuscript PDF;- the complete LaTeX source;- a standalone reproducibility bundle;- seven deterministic exact-arithmetic theorem verifiers;- machine-readable JSON verification reports;- a SHA-256 manifest and verification utility. No floating-point comparison enters a verifier’s PASS decision. The scripts certify the exact rational or symbolic identities used in the proofs. Compactness, localization, perturbative-envelope, and Grassmannian liminf arguments remain analytic parts of the manuscript and are not replaced by computation. ## Version Version v0.3r2, July 2026. ## Related public records - Directional code-geometry foundation: DOI `10.5281/zenodo.21523950`- Balanced finite-history benchmark and complete minimizer geometry: DOI `10.5281/zenodo.21560397`

•Jul 26, 2026•2 citations

Exchange Realization of Relational Coherence: Exact Synthesis and Resource Bounds

Qingchun Zhang

This preprint studies a cycle-reflection operation on a supplied six-qubit realization of paired trigram configurations. A four-matched-pulse identity and a minimum within its stated serial grammar are separated from an ordinary-exchange endpoint construction. The raw full-source reflection and its full domain-safe alternative are different tasks: the latter is excluded by a collective-symmetry obstruction in the admitted source-only exchange model. Strict preservation of the addressable sector throughout the path is also excluded for the full task, while finite-action lower bounds quantify peak no-address population and time-integrated exposure. The paper presents an explicit low-excursion balanced word and a conditional joint clock–amplitude error certificate. Root settings and trajectory inputs remain tied to their supplied computer-assisted certificates. The second internal review reproduced all ten advertised numerical routes and twenty-four outputs using the original programs; this is same-program reproducibility, not independent implementation or external peer review. A separate Lean supplement covers the finite raw/safe operator algebra and the obstruction for arbitrary finite words of the declared algebraic factors. It does not formalize the numerical roots, matrix exponentials, continuous-time dynamics or resource theorems. No global pulse optimum, measured hardware feasibility, general noise tolerance, or automatic connection to the companion recovery code is claimed.

•Sep 10, 2026•0 citations

A four-qubit counterexample to first-excited parity in phase-shifted EPR-like Hamiltonians

Shunpei Shimizu

This source-only preprint gives a four-qubit counterexample to the arbitrary-phase extension of the first-excited parity conjecture discussed in Wong, Bravyi, Gosset and Liu, Lee-Yang tensors and Hamiltonian complexity, arXiv:2602.03605v1, Section 5.6. For an unweighted four-cycle with phase pi on one edge and a common parameter 0 <= s < 1, it derives the complete 16-dimensional spectrum and an exact parity threshold. The rational value s = 2/3 is an explicit witness; a specified fixed-witness robustness interval is also proved. The original zero-phase conjecture and the general all-graph gap problem remain open. Ground-state uniqueness and the non-strict gap bound are known inputs, explicitly credited to Wei, arXiv:2609.26802v2, Corollary 5.8 and Section 5.4, and Bravyi, Gosset, Liu and Wong, arXiv:2607.14401v1, Theorem 1. The concrete phase counterexample, complete spectrum and threshold are distinguished from these known results. The primary-source comparison is dated and bounded; worldwide priority is not certified. Read the unchanged PHASE_EPR_FINAL_MANUSCRIPT_v0.1.3_R2_20261010.tex or .md first, together with the current public source/verification supplement and PUBLIC_RELEASE_NOTE. Older versions and administrative private-draft wording, if present as provenance, describe historical preparation stages and do not define this public version or its reviewed scope. Auxiliary six-qubit exploration is outside this paper's completed claim. Shunpei Shimizu initiated and directed this personal independent project, arranged verification, and coordinated the materials. No university or institutional affiliation is declared. AI systems performed research exploration, proof construction, computational checks, analytical review and manuscript preparation. The reviews are internal AI analyses; independent human verification of every proof, specialist human peer review and complete proof-assistant verification are not claimed. No PDF of editorial revision R2 has been generated or visually verified: the available compiler failed during environment setup. Editable TeX, a readable Markdown manuscript and verification materials are provided. This is a limited, unrefereed research preprint, released under Creative Commons Attribution 4.0.

•Oct 10, 2026•0 citations
Hamiltonian recognition asks which candidate Hamiltonian generated an unknown quantum evolution when the evolution angle is not observed. This preprint solves a binary two-query qubit setting in which the two unknown angles range from independently resampled to fully shared. A task-specific symmetrization theorem reduces the full sequential optimization exactly to a three-dimensional correlation elliptope. A nine-dimensional legal subset of the most general tester dual is then shown to reduce, by semidefinite-program duality, to the same elliptope problem, yielding P_GEN(beta,eta) = P_SEQ(beta,eta) throughout the stated parameter domain. The resulting PAR-versus-GEN phase diagram contains an exact interior equality curve and an exact high-angle reentrant regime in which the globally optimal causal-processing advantage vanishes at both zero and full temporal correlation but is positive at every intermediate strength. Arbitrarily weak temporal correlation can activate a strict advantage. In this archival v1.1 release, the weak-correlation statement is conservatively formulated as explicit constructive lower bounds of orders eta^2 below 45 degrees, eta^(4/3) at 45 degrees, and eta above 45 degrees. No matching upper-bound derivation is claimed for exact asymptotic equivalence of those exponents. The record includes the main preprint, Supplemental Material, and a reproducibility archive containing proof notes, symbolic verification scripts, numerical cross-check data, revised manuscript source, figures, and integrity hashes. Status: public preprint; not independently peer-reviewed.
We investigate binary recognition of an unknown qubit Hamiltonian using two queries of its evolution, with unknown evolution angles that are either independently resampled or shared with tunable temporal correlation. For a symmetric pair of nonorthogonal qubit Hamiltonians, we compare parallel (PAR), sequential (SEQ), and general (GEN) quantum strategies. An exact symmetry reduction expresses the sequential optimization through a three-dimensional correlation elliptope. A general-strategy dual certificate establishes the equality between optimal general and sequential strategies within the studied model. We analyze the operational advantage generated by temporal correlations and establish distinct weak-correlation scaling regimes separated by a critical angle of 45 degrees. This revised and extended version (v1.2) adds a uniform double-scaling critical crossover theorem, including an explicit positive crossover function and consolidated mathematical proofs. The result characterizes a previously unresolved critical transition within the specified quantum Hamiltonian recognition model. The complete mathematical derivations are provided in the accompanying supplementary material (Sections S1–S19). This work is conducted within standard quantum information theory and does not claim physics beyond quantum mechanics. Version: 1.2 Resource type: Publication — Preprint Author: Youfu Wang Affiliation: Independent Researcher, OCN Research
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.
A physical identification requires a domain of experiments, a realization, and an observation that distinguishes competing mechanisms. We construct these for the δ framework. Within finite causal quantum experiments, computable Choi data are equivalent to finite arithmetic programs producing valid instrument approximations at every requested accuracy. A separate pointer reader preserves the quantum posterior and supports adaptive composition. For the native two-atom census, the actual join update and common-mode retention select golden scaling and a signed contraction. Coherent return selects its minimal conserving completion; an independently calibrated spectral band then selects its constant interaction. A bright-mode construction and a stable short-time calibration procedure supply an explicit realization and uncertainty budget; measured duration and frequency supply the dimensional units. We derive a general endpoint identity between stored record energy and comparison imbalance, and distinguish the monotone fresh-record trajectory from coherent recurrence. The logical-to-physical bridge also has a sharp boundary: an explicit instance of the proposed completion generator has no effective value-reflecting physical reader or numerical comparison receipt. Sequence completion requires precisely the corresponding halting-oracle resource, not an unexplained scalar cost. This obstructs operational completion while leaving purely proof-language transport distinct. Native implementations of identical logical strength nevertheless carry different physical receipts. Joint covariance and the exact endpoint law state the valid relationship between those quantities. Finally, calibrated return and three-outcome tests distinguish the relevant phase and recording alternatives, with quantitative error bounds. First public preprint release, version 1.0. The files include the PDF and the main TeX file. AI-use disclosure: AI assistance was used for source analysis, mathematical exploration, manuscript drafting and revision, diagram preparation, and computational verification support. GPT-6 Astra reviews assessed arguments, scope, readability, and schematics. These were internal model reviews, not external peer review. Jonathan Washburn is the sole listed author and is responsible for the released manuscript.
## Overview This theorem-focused paper studies one logical qubit encoded into two physical qubits and exposed to two independent temporally ordered dephasing events, one collective and one differential, whose binary history labels are coherently stored by an environment. The objective is to minimize the worst-case logical information leaked into the environment’s history register over all rank-two quantum codes. A probability-adapted Bernoulli basis reduces the complementary output difference for arbitrary independent event probabilities to a traceless three-dimensional Hermitian arrow matrix. Phase-reflection and event-exchange symmetries then show that the fixed-code worst-phase leakage and its all-code minimax depend on the event probabilities only through their Bernoulli variances. ## Main results At equal event probabilities μ+=μ−=1/5\mu_+=\mu_-=1/5μ+​=μ−​=1/5, an explicit transverse non-isoclinic code satisfies L1/5,1/5wc(V)≤99250<25,L^{\mathrm{wc}}_{1/5,1/5}(V)\le \frac{99}{250}<\frac25,L1/5,1/5wc​(V)≤25099​<52​, where 2/52/52/5 is the exact optimum over the complete parity-isoclinic manifold. The strict upper bound is certified using exact rational tensor-Bernstein arithmetic. Distributional stability extends this separation to an explicit two-parameter rectangle whose open interior is a region of forced non-isoclinic optimality. On the symmetric independent line, the paper proves a thresholdless bifurcation: every nondeterministic nonbalanced distribution destroys parity-isoclinic global optimality. Near the balanced point, probability bias selects the universal finite anisotropy η0=32−48,\eta_0=\sqrt{\frac{3\sqrt2-4}{8}},η0​=832​−4​​, and the minimax over the full rank-two code Grassmannian satisfies Λdiag(δ)=12−(12−26)δ2+o(δ2),δ=1−2μ.\Lambda_{\mathrm{diag}}(\delta)=\frac12-\left(\frac12-\frac{\sqrt2}{6}\right)\delta^2+o(\delta^2),\qquad \delta=1-2\mu.Λdiag​(δ)=21​−(21​−62​​)δ2+o(δ2),δ=1−2μ. Every asymptotically minimizing code accumulates on the transverse balanced-minimizer stratum with r=12,η=η0,ez=oz=0,r=\frac12,\qquad \eta=\eta_0,\qquad e_z=o_z=0,r=21​,η=η0​,ez​=oz​=0, and with relative transverse-axis overlap bounded by ∣e⋅o∣≤2−13.|\mathbf e\cdot\mathbf o|\le\frac{\sqrt2-1}{3}.∣e⋅o∣≤32​−1​. Thus probability bias breaks the balanced continuum of globally minimizing codes and selects a genuinely non-isoclinic geometric phase with a universal leading anisotropy over the full code Grassmannian. ## Scope The paper does not claim an exact finite-bias formula for the complete minimax, a determination of the order at which the remaining transverse-axis overlap is selected, or a complete off-diagonal phase boundary for unequal event variances. These are identified as follow-up problems. ## Reproducibility package This record contains: - the manuscript PDF;- the complete LaTeX source;- a standalone reproducibility bundle;- seven deterministic exact-arithmetic theorem verifiers;- machine-readable JSON verification reports;- a SHA-256 manifest and verification utility. No floating-point comparison enters a verifier’s PASS decision. The scripts certify the exact rational or symbolic identities used in the proofs. Compactness, localization, perturbative-envelope, and Grassmannian liminf arguments remain analytic parts of the manuscript and are not replaced by computation. ## Version Version v0.3r2, July 2026. ## Related public records - Directional code-geometry foundation: DOI `10.5281/zenodo.21523950`- Balanced finite-history benchmark and complete minimizer geometry: DOI `10.5281/zenodo.21560397`
This preprint studies a cycle-reflection operation on a supplied six-qubit realization of paired trigram configurations. A four-matched-pulse identity and a minimum within its stated serial grammar are separated from an ordinary-exchange endpoint construction. The raw full-source reflection and its full domain-safe alternative are different tasks: the latter is excluded by a collective-symmetry obstruction in the admitted source-only exchange model. Strict preservation of the addressable sector throughout the path is also excluded for the full task, while finite-action lower bounds quantify peak no-address population and time-integrated exposure. The paper presents an explicit low-excursion balanced word and a conditional joint clock–amplitude error certificate. Root settings and trajectory inputs remain tied to their supplied computer-assisted certificates. The second internal review reproduced all ten advertised numerical routes and twenty-four outputs using the original programs; this is same-program reproducibility, not independent implementation or external peer review. A separate Lean supplement covers the finite raw/safe operator algebra and the obstruction for arbitrary finite words of the declared algebraic factors. It does not formalize the numerical roots, matrix exponentials, continuous-time dynamics or resource theorems. No global pulse optimum, measured hardware feasibility, general noise tolerance, or automatic connection to the companion recovery code is claimed.
This source-only preprint gives a four-qubit counterexample to the arbitrary-phase extension of the first-excited parity conjecture discussed in Wong, Bravyi, Gosset and Liu, Lee-Yang tensors and Hamiltonian complexity, arXiv:2602.03605v1, Section 5.6. For an unweighted four-cycle with phase pi on one edge and a common parameter 0 <= s < 1, it derives the complete 16-dimensional spectrum and an exact parity threshold. The rational value s = 2/3 is an explicit witness; a specified fixed-witness robustness interval is also proved. The original zero-phase conjecture and the general all-graph gap problem remain open. Ground-state uniqueness and the non-strict gap bound are known inputs, explicitly credited to Wei, arXiv:2609.26802v2, Corollary 5.8 and Section 5.4, and Bravyi, Gosset, Liu and Wong, arXiv:2607.14401v1, Theorem 1. The concrete phase counterexample, complete spectrum and threshold are distinguished from these known results. The primary-source comparison is dated and bounded; worldwide priority is not certified. Read the unchanged PHASE_EPR_FINAL_MANUSCRIPT_v0.1.3_R2_20261010.tex or .md first, together with the current public source/verification supplement and PUBLIC_RELEASE_NOTE. Older versions and administrative private-draft wording, if present as provenance, describe historical preparation stages and do not define this public version or its reviewed scope. Auxiliary six-qubit exploration is outside this paper's completed claim. Shunpei Shimizu initiated and directed this personal independent project, arranged verification, and coordinated the materials. No university or institutional affiliation is declared. AI systems performed research exploration, proof construction, computational checks, analytical review and manuscript preparation. The reviews are internal AI analyses; independent human verification of every proof, specialist human peer review and complete proof-assistant verification are not claimed. No PDF of editorial revision R2 has been generated or visually verified: the available compiler failed during environment setup. Editable TeX, a readable Markdown manuscript and verification materials are provided. This is a limited, unrefereed research preprint, released under Creative Commons Attribution 4.0.