BINDU–VECTRA reports a Lean 4.19.0 machine-checked, ancilla-uniform Schatten-1 mixing bound for finite products of independent generalized amplitude-damping (GAD) channels. The result covers any number N of sites, strictly positive local pumping and decay rates Gₖ and Kₖ, nonnegative time t, every finite-dimensional ancilla, and arbitrary complex input matrices X—not only density operators. With rₖ(t) = exp[−(Gₖ + Kₖ)t/2], the explicit envelope C_N(t) = min{2, Σₖ₌₀ᴺ⁻¹ [rₖ(t) + rₖ(t)²]} controls the distance between the product GAD evolution Φₜ⁽ᴺ⁾ and the stationary-replacement channel ℛ⁽ᴺ⁾: ‖[(Φₜ⁽ᴺ⁾ − ℛ⁽ᴺ⁾) ⊗ id_A](X)‖₁ ≤ C_N(t)‖X‖₁. This is a pointwise estimate uniform over finite ancillas; it is not presented as a separate formal construction of the diamond-norm supremum. The principal advance is the removal of previously conditional site-kernel and hybrid-step hypotheses. Eight named Lean declarations connect physical Kraus actions to the global native-index channel representation, establish stationary-replacer and Pauli-Z/dephasing bridges, and prove the unconditional hybrid increment ‖[(ℋₖ₊₁ − ℋₖ) ⊗ id_A](X)‖₁ ≤ [rₖ(t) + rₖ(t)²]‖X‖₁. Telescoping these increments yields the N-site envelope, while a uniform bound of 2 supplies its cap. The site-to-global correspondence is established in the proof chain rather than assumed as an informal relabeling of tensor indices. The accompanying reproducibility materials identify 53 source modules, SHA-256 inventories, and pinned Lean 4.19.0/Mathlib v4.19.0 dependencies. The eight target declarations have source-matched, user-supplied successful build and axiom records reporting only Lean’s standard foundational axioms; however, a fresh independent kernel replay remains necessary before an independently certified release can be claimed. The work does not establish an exact GAD diamond norm, an optimal mixing exponent, or results for interacting Lindbladians. It instead supplies a reproducible formal foundation for future independent certification, explicit diamond-norm formalization, and investigation of sharper or more general quantum mixing estimates.
BINDU–VECTRA reports a Lean 4.19.0 machine-checked, ancilla-uniform Schatten-1 mixing bound for finite products of independent generalized amplitude-damping (GAD) channels. The result covers any number N of sites, strictly positive local pumping and decay rates Gₖ and Kₖ, nonnegative time t, every finite-dimensional ancilla, and arbitrary complex input matrices X—not only density operators. With rₖ(t) = exp[−(Gₖ + Kₖ)t/2], the explicit envelope C_N(t) = min{2, Σₖ₌₀ᴺ⁻¹ [rₖ(t) + rₖ(t)²]} controls the distance between the product GAD evolution Φₜ⁽ᴺ⁾ and the stationary-replacement channel ℛ⁽ᴺ⁾: ‖(Φₜ⁽ᴺ⁾ − ℛ⁽ᴺ⁾) ⊗ id_A‖₁ ≤ C_N(t)‖X‖₁. This is a pointwise estimate uniform over finite ancillas; it is not presented as a separate formal construction of the diamond-norm supremum. The principal advance is the removal of previously conditional site-kernel and hybrid-step hypotheses. Eight named Lean declarations connect physical Kraus actions to the global native-index channel representation, establish stationary-replacer and Pauli-Z/dephasing bridges, and prove the unconditional hybrid increment ‖(ℋₖ₊₁ − ℋₖ) ⊗ id_A‖₁ ≤ [rₖ(t) + rₖ(t)²]‖X‖₁. Telescoping these increments yields the N-site envelope, while a uniform bound of 2 supplies its cap. The site-to-global correspondence is established in the proof chain rather than assumed as an informal relabeling of tensor indices. The accompanying reproducibility materials identify 53 source modules, SHA-256 inventories, and pinned Lean 4.19.0/Mathlib v4.19.0 dependencies. The eight target declarations have source-matched, user-supplied successful build and axiom records reporting only Lean’s standard foundational axioms; however, a fresh independent kernel replay remains necessary before an independently certified release can be claimed. The work does not establish an exact GAD diamond norm, an optimal mixing exponent, or results for interacting Lindbladians. It instead supplies a reproducible formal foundation for future independent certification, explicit diamond-norm formalization, and investigation of sharper or more general quantum mixing estimates.
This work establishes the exact, unhalved diamond-norm distance between a qubit generalized-amplitude-damping (GAD) channel Φₚ,ᵣ and its stationary-replacement channel Rₚ(X) = Tr(X) diag(1 − p, p). For stationary excited-state population 0 ≤ p ≤ 1 and coherence-amplitude factor 0 ≤ r ≤ 1, the closed-form result is ‖Φₚ,ᵣ − Rₚ‖⋄ = 2r[1 − p(1 − p)r²]/(2 − r). The result accounts for arbitrary finite-dimensional ancillas and arbitrary complex input matrices, rather than only unentangled states or density operators; a two-dimensional ancilla attains the optimum. The derivation includes the boundary cases r = 0 and r = 1 and the extreme stationary populations p = 0 and p = 1, without limiting arguments. The equality is supported by two explicit analytic certificates. A constructed three-Kraus completely positive, trace-preserving map Λₚ,ᵣ gives the factorization Φₚ,ᵣ − Rₚ = (δ/2)(id − Λₚ,ᵣ), where δ is the exact distance above. Trace-norm contractivity supplies a universal upper bound, while the normalized Schmidt state √(v/h)|00⟩ + √(u/h)|11⟩, with h = 2 − r, u = 1 − pr and v = 1 − (1 − p)r, saturates it through perfect discrimination of id from Λₚ,ᵣ. Independently, an explicit 4 × 4 semidefinite-programming dual witness satisfies Z ± J ⪰ 0 and Trₒᵤₜ(Z) = δI₂, reproducing the same upper bound without numerical optimization. A consolidated Lean 4 formalization of the physical four-Kraus channel and its finite-ancilla norm equality is accompanied by an author-reported successful kernel compilation, source hashes, and a replay protocol; the manuscript explicitly distinguishes this record from an independent rerun, which was not performed during assembly. The SDP certificate and the independent multi-qubit corollaries are analytic results, not separately claimed as kernel-checked. For independent channels, these corollaries bound the product-to-equilibrium distance between maxₖ δₖ and min{2, Σₖ δₖ}, and yield the asymptotic decay exponent minₖ γₖ when rₖ(t) = exp(−γₖt). The exact single-use discrimination error for equal prior probabilities is Pₑᵣᵣ = 1/2 − δ/4. Together, these results provide analytic and formally reproducible benchmarks for finite-temperature quantum noise and mixing, without asserting optimal multi-qubit discrimination strategies or experimental performance.
Can a quantum event be certified without simulating the full quantum state? This study develops rigorous, event-specific probability bounds for constrained, finite-dimensional open quantum systems described by Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) dynamics. For initially unexcited targets, locally bounded Hamiltonian transitions that change at most one target occupation, and dissipation that preserves or lowers these occupations, it proves the sharp joint-excitation envelope pA(t) ≤ ∏j∈A sin²(min{π/2, ∫₀ᵗ uj(s) ds}). Independent resonant drives attain this bound within the stated model class. Complementary rational-polynomial certificates, interaction-dependent estimates, and bounds under pumping, coherent leakage, and guaranteed loss provide checkable alternatives for finite-time and all-time reachability questions. The analysis also examines how much information a particular event actually requires, distinguishing exact observable reductions and scalar trajectories from the exponentially larger ambient state description. Positive-operator barriers and operator-Schmidt-rank constraints clarify the resources and limitations of compact certificates. For independent generalized-amplitude-damping channels, the work establishes an ancilla-stable dissipative mixing bound: ‖⊗ⱼ Φⱼ,ₜ − ⊗ⱼ Rⱼ‖⋄ ≤ min{2, ∑ⱼ(rⱼ + rⱼ²)} ≤ 2N exp(−γ*t), where rⱼ = exp(−λⱼt/2) and γ* = minⱼ(λⱼ/2). The arbitrary-finite-ancilla hybrid inequality and resulting product-channel envelope are supported by kernel-checked Lean theorems; the leading long-time diamond-norm coefficient is established analytically, not formally verified. A separate formal development checks gauge-fixed Fibonacci fusion and braiding coherence identities, including pentagon and hexagon relations, and provides an ideal braid benchmark with conditional bounds for noisy encoded implementations. Taken together, the results offer a framework for auditable quantum-event certificates, model-specific noise benchmarks, and experimentally distinguishable predictions, while keeping their scope explicit: the claims depend on specified dynamics and controls and do not establish a new conservation law, microscopic topological protection, or universal computational advantage. Natural next steps include broader machine-checked dynamical certificates and validated interfaces from experimental models to formal proof objects.
Finite local calibration does not by itself determine how a preparation and a detector are related through a joint physical transport. We study the ancilla-orientation family A_theta(rho) = (1-theta)rho + theta rho^Gamma for an arbitrary two-qubit state rho and binary effect E, followed by an unknown joint completely positive trace-preserving channel. Eight jointly transmitted product inputs, comprising the complete X tensor X and Z tensor Z bases, give a complementary-basis bound on the channel's Choi infidelity. A channel-distance estimate and the retained local calibration bound then yield the uniform selector enclosure b_E + sqrt(2 s_rho) + (1+theta)epsilon, including the generally nonpositive candidate. One physical compatibility set gives simultaneous inner and outer confidence intervals for the restricted safe class. A sufficient fixed allocation of 21,600,000 trials has coverage at least 0.99; an explicit integer rule has transpose-exclusion power at least 0.996 at a stated alternative and an accepted upper endpoint at most -0.000620. The construction consumes 43,200,000 prepared qubit instances. Conversely, an exact joint channel can fix every isolated-leg input with the other leg held in |0>, remain at maximal half diamond distance from identity, and change the safe interval while preserving the complete permitted record law. A one-basis phase-channel obstruction provides a second control. The result combines established process-verification methods with a finite-count safety certificate and precisely specified weaker-record obstructions. Compatible complex types, bounded controls, a common transport context, and declared drift remain explicit premises. The source-and-evidence companion preserves the paper-specific Lean sources and historical execution, exact numerical programs and receipts, the separate AI-assisted review return, and the release source/build/validation records. Formal support remains conditional on eleven analytic-law inputs and three acquisition contracts. No end-to-end formal verification, experimental validation, or external human peer review is claimed. Release rights are scoped by component: CC BY 4.0 for the article and author-owned documentation/data; a newly prepared MIT grant for original author-owned software and Lean sources; and the original licenses and notices for third-party or inherited material. The companion rights notice specifies the scope and exclusions.
The problem of finding the optimal strategy for estimating a generalized amplitude damping channel ${\ensuremath{\Gamma}}_{\ensuremath{\eta}}^{(p)}$ by means of the extension $\mathrm{id}\ensuremath{\bigotimes}{\ensuremath{\Gamma}}_{\ensuremath{\eta}}^{(p)}$ is addressed. We first evaluate the quantum Fisher information of output states based on the symmetric logarithmic derivative and specify all pure-state inputs that maximize the quantum Fisher information. We next investigate the ${\ensuremath{\nabla}}^{e}$ autoparallelity of output state manifolds and characterize the condition for the existence of an efficient estimator. A comparison of these results concludes that, while there is no uniformly optimal input for all p and $\ensuremath{\eta}$, a maximally entangled input is an admissible one under a nonasymptotic setting.
We study independent one-message shuffling through a common channel with replacement adjacency and arbitrary deterministic backgrounds. Under one local Rényi budget, without a pointwise likelihood-ratio cap, the optimal uniform same-order rate is n−min{1,α−1} for fixed α>1; a local KL budget alone gives no uniform amplification. We determine the exact asymptotic worst-case approximate-DP envelope at each fixed positive privacy parameter and the leading inverse calibration at failure probability d/n for all fixed α>1. Matching upper bounds are uniform over channels and alphabets varying with n. At and above order three, the calibration coefficient is the square root of an attained local triple-variance frontier, realizable on at most nine output symbols. At order three we evaluate this frontier on a certified budget interval and identify the unique extremal ratio law. The same frontier determines the limiting central-window profile for α>2 and the logarithmic moderate-window exponent. Under local χ2 diameter C, the exact asymptotic neighboring coefficient is 2C(C+5)/(C+4); we also give explicit finite amplification bounds and a fixed-channel background reduction. Formal verification. All statements of the paper have been formalized in Lean 4 (version 4.35.0) with Mathlib (release v4.35.0), including the computer-assisted order-three theorem, for which all certificate computations are checked by the Lean kernel. The formal proofs contain no sorry and use only the standard axioms propext, Classical.choice and Quot.sound. The project builds from scratch, every module passes a replay by the Lean kernel (leanchecker), and all theorems of the interface file Statements.lean, together with everything they depend on (69 078 declarations in total), were rechecked by the independent type checker nanoda. ChatGPT was used to write the Lean code and Claude to audit it; the author takes full responsibility for all results. Files. The PDF is the paper (24 pages). The ZIP archive Uniform_Renyi_arXiv_source_2026-11-09.zip is the LaTeX source. Its folder anc/ contains the exact rational polynomial certificate for the computer-assisted order-three theorem (verify_order_three_frontier.py, needs only the Python standard library) and further exact checks. The ZIP archive UniformRenyiShuffle-Lean-1.0.0-2026-11-09.zip is the Lean project UniformRenyiShuffle 1.0.0; its file MAP.md gives the Lean name of every statement of the paper. Changes from version 1. The Lean formalization is added. The paper and its LaTeX source are unchanged.
We prove an improved lower bound of 0.097387436922 on the largest normalised Ingleton violation among four-variable almost-entropic vectors. Previously reported constructions reach approximately 0.0925, used as a rounded benchmark; the best published universal upper bound is 19/124. Conditional parity hashing combines local binary parity labels, one common linear hash, simultaneous conditional privacy amplification and joint conditioning. Applied to a 24-atom source of Matúš and Csirmaz, it subtracts a multiple of the uniform-matroid rank function U(3,4) from all fifteen entropy coordinates. The limiting signed score lies in [-0.097387436923, -0.097387436922], and finite-alphabet distributions with score below -0.09738 exist. This record contains the preprint PDF, manuscript sources, Lean proof sources, exact numerical checkers, build instructions and verification evidence. The main theorem, including the closed rate interval, score enclosure and finite-alphabet existence statement, was rebuilt and kernel-checked in Lean 4.35.0-rc2 with pinned Mathlib dependencies. The finite sampler and fixed-path optimality argument are written proofs rather than separate Lean declarations. Søren Riis is the creator and coordinator and directed the research. Astra/Codex and Claude contributed mathematical development, computation and verification; Claude contributed the Lean formalisation and adversarial review. The source construction is due to Matúš and Csirmaz; the paper gives full references to the earlier entropy-region and privacy-amplification work. AI checks do not constitute independent human peer review. Licences by component: the paper PDF, LaTeX sources and original figures are CC BY 4.0; Lean sources, Python checkers and build scripts are Apache-2.0. Third-party dependencies retain their own licences. Repository: https://github.com/SR123/conditional-parity-hashing