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

A computer-assisted proof of the dimension threshold for turns in a coaxial resting curve

Gervaseus Nerik

Published Nov 12, 2026• 0 citations
Publisher

Abstract

A computer-assisted proof of the dimension threshold for turns in a coaxial resting curve, version 1.3. The paper proves that the curve of coaxial resting points of an entropic Bures-type gradient flow (Zenodo 10.5281/zenodo.23901246) has no turns for real dimension 4 ≤ d < d_c and exactly two turns for d > d_c, with a single threshold d_c in (4222.5584838595, 4222.5584838596). New in version 1.3: the Coq proof now covers ordinary complex matrices, without separately assuming that an eigenbasis exists. Version 1.2 relied on two stated assumptions, the spectral theorem for Hermitian matrices and the standard form of the matrix logarithm. Both are now proved in Coq. A combined Coq theorem joins the dimension threshold, the exact counts of scalar resting points, and the classification of full-rank stationary states: for every integer d ≥ 4, a full-rank density matrix is stationary exactly when it is diag(p, l, …, l) in a basis beginning with the distinguished vector and √p is a resting point of the scalar curve. The proof compiled from source on two machines using Coq 8.18.0 and 8.20.1, every new proof file passed Coq's separate kernel checker on both, and it rests on the same 55-name assumption inventory as versions 1.1 and 1.2. The theorem classifies stationary states; it does not address dynamics, stability, or dimensions 2 and 3. The package contains the paper, the complete Coq proof with one-command check scripts and the build logs from both machines, and two of the three independent certificate programs; the first is published separately (Zenodo 10.5281/zenodo.24092187). Start with README.md. This work has not been peer reviewed. We invite readers to attack it: Section 6 of the paper lists where we think an error would most likely hide. Prepared with AI assistance (ChatGPT by OpenAI; Claude by Anthropic).

DOI
10.5281/zenodo.24173290

Related papers

Nerik Theory of Conscious Refinement (V4.27 Addendum): A Forward-Invariant Riemannian Bures Gradient Flow with Emergent Interior Attractor on the d=2 Qubit State Manifold

G.E. Nerik

Version 2 (25 October 2026) adds an erratum. The main results of this record check out: the inverse Bures metric, the eigenvalue equation (6), the boundary collar 0 < lambda_min < 0.0564, both tables and the attractor p* = 0.9412018 were reproduced independently. Two steps in the proof text are corrected; the 0.0564 collar is labeled as established numerically (the collar proven analytically in version 3 of the Bures paper is 0.0261); and the weights are labeled as modeling choices, because the results depend on them. Every number in the erratum is printed by the attached script (addendum_d2_checks.py), included with its saved output. Version 1 remains available unchanged. The complete d=2 analysis, with full proofs, is at https://doi.org/10.5281/zenodo.23605523 Original description (version 1): We present an exact analytical and numerical analysis of the d=2 qubit reduction and logarithmic boundary barrier dynamics within the Nerik Theory of Conscious Refinement (NTCR V4.27). Through contravariant metric derivation and 50-digit numerical verification, we establish the exact Riemannian Bures eigenvalue velocity equation, superseding earlier heuristic coaxial approximations. By formulating the two-pole structured complexity C(rho) using the smooth Hilbert-Schmidt purity distance B_HS(rho) = 2 Tr((rho - I/2)^2) = r^2 alongside the Bures distance d_B^2(rho, \Pi_*) to the pure boundary projector \Pi_* = |\psi_*><\psi_*| and the von Neumann relative entropy barrier D(rho || I/2) = ln 2 - S(\rho), we eliminate the off-axis 1/sqrt(\lambda_{min}) boundary cusp and remove all ad-hoc coherence penalties and regularization parameters (\epsilon = 0). We prove analytically that: (i) radial Bloch vectors are exact eigenvectors of the 2x2 inverse Bures metric tensor G^{-1} with eigenvalue 1 - r^2 = 4 \lambda_{min} (1 - \lambda_{min}); (ii) d\lambda_{min}/d\tau > 0 holds uniformly across all angles \theta \in [0, 2\pi) inside the boundary collar 0 < \lambda_{min} < 0.0564; and (iii) no off-axis critical points exist anywhere in the full-rank manifold \mathcal{M}_\circ, driving all interior trajectories to the unique emergent interior attractor (p^* = 0.941202, x_c^* = 0, \lambda_{min}^* = 0.058798).

•Oct 17, 2026•0 citations

Global Convergence and Boundary Invariance of the Riemannian Bures Gradient Flow for d = 2 and d = 3

Gervaseus Nerik

We extend the Riemannian Bures gradient-flow analysis of the competing-poles potential $V_{\mathrm{dyn}}[\rho]$ from the $d=2$ qubit Bloch ball to the 8-dimensional manifold $\mathcal{M}_\circ(\mathbb{C}^3)$ of full-rank qutrit density matrices. Using the coordinate-free contravariant inverse Bures metric $G_\rho^{-1}(H) = 2(\rho H + H\rho) - 4\operatorname{Tr}(\rho H)\rho$ and the normalized $SU(3)$ Hilbert–Schmidt purity distance $B_{\mathrm{HS}}(\rho) = \frac{1}{2}(3\operatorname{Tr}(\rho^2)-1)$, we prove the following analytical results without boundary clamping ($\epsilon = 0$): Operator Commutation: Every critical point on $\mathcal{M}_\circ(\mathbb{C}^d)$ commutes with the reference pure projector $\Pi_*$. Orientation Reduction: At fixed spectrum, the non-logarithmic outward eigenvalue pull is strictly increasing in $\sqrt{\rho_{00}}$, reducing the $SU(3)$ boundary-orientation problem to a two-parameter diagonal family. Forward Invariance: The one-sided derivative of $\lambda_{\min}(\rho)$ along the flow is strictly positive on the analytic collar $0 < \lambda_{\min} \le 6.84 \times 10^{-5}$, establishing manifold forward invariance (with sharp numerical threshold $\lambda_{\mathrm{collar}} = 0.00481018$). Transverse Uniqueness: No asymmetric critical points ($\lambda_2 \neq \lambda_3$) exist despite the transverse potential's concavity. Coaxial Attractor: The coaxial balance equation admits a unique root $p^* = 0.961593764$, $\lambda_\perp^* = 0.019203118$, $B_{\mathrm{HS}}(\rho^*) = 0.888100$. Global Convergence: By LaSalle's Invariance Principle, every trajectory initialized in $\mathcal{M}_\circ(\mathbb{C}^3)$ converges globally to $\rho^*$. Includes complete standalone Python verification suite (ntcr_d3_verify.py) and rigorous numerical cross-checks across 105 complex starts.

•Oct 18, 2026•0 citations

Certified Depth–Width Frontiers for Reversible SELECT Circuits: Exact four-target curves, an all-width eight-target lower bound, and DRAT-certified boundary instances

Daniel Martín

We determine the complete fixed-width depth curve of the four-target one-hot selector SELECT_X in a fully declared classical-reversible model: gate set {X, CNOT, Toffoli}, pairwise-disjoint-support layers, all-to-all connectivity, dirty data targets, and clean ancillae restored to zero. The curve is D∗_SELECT(4,Q) = infinity for Q < 6; 5 for Q = 6; and 4 for Q >= 7. The two finite values are exact by exhaustive meet-in-the-middle; the all-width statement rests on a lossless normal-form reduction of every depth-3 clean-ancilla circuit to an independently certified finite core. A causal argument gives D∗(2^k,Q) >= k+1 for every k and every width. We then prove a conditional parametric saturation obstruction: if the width-free k-layer frontier contains at most 2^(k-1) carriers of the top address monomial but fewer than 2^(k-1) distinct minterms, then D∗(2^k,Q) >= k+2 at every width. For k = 3, independent Python and C++ exhaustions produce byte-identical complete frontiers (57 and 18,215 canonical states) and establish the hypotheses, yielding the all-width theorem D∗(8,Q) >= 5 for every Q >= 11. An explicit four-layer construction gives C_4(4) >= 10 > 8, so this sufficient criterion does not induct to k = 4. The prospective k+2 law therefore remains open and requires a different lower-bound invariant. If workspace may be left dirty, pure-encoding UNSAT certificates at widths 10 and 11, together with a verified width-12 construction, show that the smallest width at which four-target selection reaches depth 3 is exactly 12; for every Q >= 12, workspace restoration costs exactly one layer at the same width. For ancilla-free dirty-target fan-out we compute the exact depths through seven targets and prove that 2^d - 1 targets require depth at least d+1, above the causal floor. At minimum width the threshold values are 2, 4, 4 for m = 2, 3, 4, and a pure-encoding DRAT certificate gives D∗_THR(5) >= 5; the nonlinear payload has exact depth D∗_carry(6) = 6. The decisive UNSAT formulas and proofs are fixed by SHA-256 and accepted by an independently compiled proof checker; constructions are verified symbolically or exhaustively. We make no priority claim: a systematic novelty search is incomplete, and no result is asserted as first or novel. This record is version 3 of the Zenodo preprint. Earlier versions remain permanently citable through their version-specific DOIs. Version 3 extends version 2 with: the exact closure of the arithmetic-payload depth (D∗_carry(6) = 6, DRAT-certified, and carry(7) in {5,6}); the DRAT-certified threshold bound D∗_THR(5) >= 5; the completed garbage-width curve (minimum width for depth 3 exactly 12, via pure-encoding DRAT exclusions at widths 10 and 11); the all-width eight-target lower bound D∗(8,Q) >= 5 for every valid width, via a conditional parametric saturation argument and independent, byte-identical Python and C++ enumerations of the width-free k=3 frontier; an explicit witness showing the k=3 carrier criterion does not induct to k=4; and restricted (architecture-specific) depth-5 exclusions, explicitly not claimed as general impossibilities. The general depth-5 question at L=8 and the prospective all-k law remain open; the latter appears only as a conjecture. The large DRAT certificate archive is being prepared as a separate, DOI-linked Zenodo dataset.

•Aug 15, 2026•0 citations

Caputa-Di Giulio-Loc Conjecture Resolved in Finite Dimensions: All-Time Inequalities for Symmetry-Resolved Krylov and Spread Complexity

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

This research release presents an analytic proof of the Caputa-Di Giulio-Loc conjecture on symmetry-resolved Krylov complexity and quantum-state spread complexity in finite dimensions. For every real time t, the total complexity satisfies C(t) ≥ Σ_q p_q C_q(t), where C_q(t) is the normalized complexity within sector q and p_q is its initial probability weight. The theorem holds for finite-dimensional Hermitian generators with orthogonal reducing sectors, including degenerate spectra and terminating Lanczos chains. It requires no assumptions of quantum chaos, spectral randomness, or late-time equilibration. The conjecture appears in “Growth of block-diagonal operators and symmetry-resolved Krylov complexity,” Physical Review Research 7, 043055 (2025), DOI: 10.1103/9v9v-54zv, and “Symmetry-resolved spread complexity,” JHEP 02 (2026), 189, DOI: 10.1007/JHEP02(2026)189. The result establishes a general relationship between full-system quantum dynamics and calculations performed separately within symmetry sectors. Its practical importance is that sector computations provide rigorous lower bounds on total complexity at every time. It also identifies precisely when resolving the symmetry leaves complexity unchanged. These conclusions are relevant to mathematical physics, operator growth, quantum many-body dynamics, and the interpretation of Krylov complexity as a diagnostic of quantum chaos. The release proves a stronger statement than the original mean-complexity inequality: the full Krylov-index distribution dominates the probability-weighted sector distribution in first-order stochastic order. Consequently, the inequality extends to every nondecreasing function of the Krylov index. Additional results include: • Two complementary proofs using nested Krylov-space projections and best polynomial approximation in spectral measures.• Concavity under mixing of normalized spectral measures.• Exact nonnegative gap identities, including a moment-Gram formulation valid for singular matrices.• Fixed-time equality criteria and a finite-dimensional characterization of equality at all times.• An explicit three-node example and reproducible numerical diagnostics.• An extension to bounded self-adjoint generators, with explicit domain and completeness assumptions for unbounded generators. The standalone release includes the PDF manuscript, editable LaTeX, complete searchable Markdown proofs, Python verification code, citation metadata, an expert review guide, and machine-readable theorem, assumption, dependency, and proof records for research discovery and AI-assisted retrieval. Research status: a complete analytic proof is supplied for the stated finite-dimensional theorem. Independent peer review and proof-assistant verification have not been completed. Worldwide novelty and priority are not certified; the unrestricted infinite-dimensional conjecture is not claimed to be resolved.

•Sep 27, 2026•0 citations

Grouped endpoint forms and a sharp interior law for the Werner distillability inequalities

Yancun Yan

Preprint and verification scripts for the paper "Grouped endpoint forms and a sharp interior law for the Werner distillability inequalities". For an operator C on H_1 ⊗ … ⊗ H_k, let q_k(−t,C) = Σ_J (−t)^{|J|} ‖Tr_J C‖², over sets J of factors. For rank at most two, nonnegativity of q_k(−1/2,C) is the Schmidt-rank-two test of undistillability of a Werner state from k copies; for k ≥ 4 it is open. We prove an identity, for every k, t and operator, writing q_k(−t,C) − (1−2t)(1−t)^{k−1} ‖C‖² as a combination, with explicit weights nonnegative on [0,1/2], of the endpoint forms of all factor groupings; if a factor has dimension at least two, no other constant admits such an identity with C-independent weights. So, over all local dimensions and for rank at most two, the sharp bound q_k(−t,C) ≥ (1−2t)(1−t)^{k−1} ‖C‖² on [0,1/2] is equivalent to the endpoint inequality; for k = 4, given the computer-assisted three-copy endpoint, it holds for a fixed C if and only if q_4(−1/2,C) ≥ 0. The sharp bound holds for every k when the range or co-range of C contains a fully product vector, and the identity extends to every real m ≥ 1, with 1/m replacing 1/2. For operators with range and co-range in the strings with exactly one digit 2, we give an identity and pair bounds for every k, prove the endpoint inequality for every k on symmetric sectors and, for k = 4, on further classes, one of them given the three-copy endpoint. The inequality also holds when the range lies in the span of the vectors |j⟩^{⊗k} (for even k at every rank), and for k = 4 at every rank when the range lies in a three-dimensional span of W-type vectors. Files: the preprint (PDF); ten Python scripts that check the explicit weights, identities and examples of Sections 3, 4 and 6–8 (exact rational arithmetic, except the checks of Section 7 and of the operator C_0 in Proposition 8.3, which use floating point); README.md, which says what each script checks and how to run it; MANIFEST.tsv with the size and SHA-256 of every file.

•Nov 10, 2026•0 citations

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

Samuel Marquez Gonzalez

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

quant-pharXiv:2609.32979•Sep 29, 2026•0 citations
A computer-assisted proof of the dimension threshold for turns in a coaxial resting curve, version 1.3. The paper proves that the curve of coaxial resting points of an entropic Bures-type gradient flow (Zenodo 10.5281/zenodo.23901246) has no turns for real dimension 4 ≤ d < d_c and exactly two turns for d > d_c, with a single threshold d_c in (4222.5584838595, 4222.5584838596). New in version 1.3: the Coq proof now covers ordinary complex matrices, without separately assuming that an eigenbasis exists. Version 1.2 relied on two stated assumptions, the spectral theorem for Hermitian matrices and the standard form of the matrix logarithm. Both are now proved in Coq. A combined Coq theorem joins the dimension threshold, the exact counts of scalar resting points, and the classification of full-rank stationary states: for every integer d ≥ 4, a full-rank density matrix is stationary exactly when it is diag(p, l, …, l) in a basis beginning with the distinguished vector and √p is a resting point of the scalar curve. The proof compiled from source on two machines using Coq 8.18.0 and 8.20.1, every new proof file passed Coq's separate kernel checker on both, and it rests on the same 55-name assumption inventory as versions 1.1 and 1.2. The theorem classifies stationary states; it does not address dynamics, stability, or dimensions 2 and 3. The package contains the paper, the complete Coq proof with one-command check scripts and the build logs from both machines, and two of the three independent certificate programs; the first is published separately (Zenodo 10.5281/zenodo.24092187). Start with README.md. This work has not been peer reviewed. We invite readers to attack it: Section 6 of the paper lists where we think an error would most likely hide. Prepared with AI assistance (ChatGPT by OpenAI; Claude by Anthropic).
Version 2 (25 October 2026) adds an erratum. The main results of this record check out: the inverse Bures metric, the eigenvalue equation (6), the boundary collar 0 < lambda_min < 0.0564, both tables and the attractor p* = 0.9412018 were reproduced independently. Two steps in the proof text are corrected; the 0.0564 collar is labeled as established numerically (the collar proven analytically in version 3 of the Bures paper is 0.0261); and the weights are labeled as modeling choices, because the results depend on them. Every number in the erratum is printed by the attached script (addendum_d2_checks.py), included with its saved output. Version 1 remains available unchanged. The complete d=2 analysis, with full proofs, is at https://doi.org/10.5281/zenodo.23605523 Original description (version 1): We present an exact analytical and numerical analysis of the d=2 qubit reduction and logarithmic boundary barrier dynamics within the Nerik Theory of Conscious Refinement (NTCR V4.27). Through contravariant metric derivation and 50-digit numerical verification, we establish the exact Riemannian Bures eigenvalue velocity equation, superseding earlier heuristic coaxial approximations. By formulating the two-pole structured complexity C(rho) using the smooth Hilbert-Schmidt purity distance B_HS(rho) = 2 Tr((rho - I/2)^2) = r^2 alongside the Bures distance d_B^2(rho, \Pi_*) to the pure boundary projector \Pi_* = |\psi_*><\psi_*| and the von Neumann relative entropy barrier D(rho || I/2) = ln 2 - S(\rho), we eliminate the off-axis 1/sqrt(\lambda_{min}) boundary cusp and remove all ad-hoc coherence penalties and regularization parameters (\epsilon = 0). We prove analytically that: (i) radial Bloch vectors are exact eigenvectors of the 2x2 inverse Bures metric tensor G^{-1} with eigenvalue 1 - r^2 = 4 \lambda_{min} (1 - \lambda_{min}); (ii) d\lambda_{min}/d\tau > 0 holds uniformly across all angles \theta \in [0, 2\pi) inside the boundary collar 0 < \lambda_{min} < 0.0564; and (iii) no off-axis critical points exist anywhere in the full-rank manifold \mathcal{M}_\circ, driving all interior trajectories to the unique emergent interior attractor (p^* = 0.941202, x_c^* = 0, \lambda_{min}^* = 0.058798).
We extend the Riemannian Bures gradient-flow analysis of the competing-poles potential Vdyn[ρ]V_{\mathrm{dyn}}[\rho]Vdyn​[ρ] from the d=2d=2d=2 qubit Bloch ball to the 8-dimensional manifold M∘(C3)\mathcal{M}_\circ(\mathbb{C}^3)M∘​(C3) of full-rank qutrit density matrices. Using the coordinate-free contravariant inverse Bures metric Gρ−1(H)=2(ρH+Hρ)−4Tr⁡(ρH)ρG_\rho^{-1}(H) = 2(\rho H + H\rho) - 4\operatorname{Tr}(\rho H)\rhoGρ−1​(H)=2(ρH+Hρ)−4Tr(ρH)ρ and the normalized SU(3)SU(3)SU(3) Hilbert–Schmidt purity distance BHS(ρ)=12(3Tr⁡(ρ2)−1)B_{\mathrm{HS}}(\rho) = \frac{1}{2}(3\operatorname{Tr}(\rho^2)-1)BHS​(ρ)=21​(3Tr(ρ2)−1), we prove the following analytical results without boundary clamping (ϵ=0\epsilon = 0ϵ=0): Operator Commutation: Every critical point on M∘(Cd)\mathcal{M}_\circ(\mathbb{C}^d)M∘​(Cd) commutes with the reference pure projector Π∗\Pi_*Π∗​. Orientation Reduction: At fixed spectrum, the non-logarithmic outward eigenvalue pull is strictly increasing in ρ00\sqrt{\rho_{00}}ρ00​​, reducing the SU(3)SU(3)SU(3) boundary-orientation problem to a two-parameter diagonal family. Forward Invariance: The one-sided derivative of λmin⁡(ρ)\lambda_{\min}(\rho)λmin​(ρ) along the flow is strictly positive on the analytic collar 0<λmin⁡≤6.84×10−50 < \lambda_{\min} \le 6.84 \times 10^{-5}0<λmin​≤6.84×10−5, establishing manifold forward invariance (with sharp numerical threshold λcollar=0.00481018\lambda_{\mathrm{collar}} = 0.00481018λcollar​=0.00481018). Transverse Uniqueness: No asymmetric critical points (λ2≠λ3\lambda_2 \neq \lambda_3λ2​=λ3​) exist despite the transverse potential's concavity. Coaxial Attractor: The coaxial balance equation admits a unique root p∗=0.961593764p^* = 0.961593764p∗=0.961593764, λ⊥∗=0.019203118\lambda_\perp^* = 0.019203118λ⊥∗​=0.019203118, BHS(ρ∗)=0.888100B_{\mathrm{HS}}(\rho^*) = 0.888100BHS​(ρ∗)=0.888100. Global Convergence: By LaSalle's Invariance Principle, every trajectory initialized in M∘(C3)\mathcal{M}_\circ(\mathbb{C}^3)M∘​(C3) converges globally to ρ∗\rho^*ρ∗. Includes complete standalone Python verification suite (ntcr_d3_verify.py) and rigorous numerical cross-checks across 105 complex starts.
We determine the complete fixed-width depth curve of the four-target one-hot selector SELECT_X in a fully declared classical-reversible model: gate set {X, CNOT, Toffoli}, pairwise-disjoint-support layers, all-to-all connectivity, dirty data targets, and clean ancillae restored to zero. The curve is D∗_SELECT(4,Q) = infinity for Q < 6; 5 for Q = 6; and 4 for Q >= 7. The two finite values are exact by exhaustive meet-in-the-middle; the all-width statement rests on a lossless normal-form reduction of every depth-3 clean-ancilla circuit to an independently certified finite core. A causal argument gives D∗(2^k,Q) >= k+1 for every k and every width. We then prove a conditional parametric saturation obstruction: if the width-free k-layer frontier contains at most 2^(k-1) carriers of the top address monomial but fewer than 2^(k-1) distinct minterms, then D∗(2^k,Q) >= k+2 at every width. For k = 3, independent Python and C++ exhaustions produce byte-identical complete frontiers (57 and 18,215 canonical states) and establish the hypotheses, yielding the all-width theorem D∗(8,Q) >= 5 for every Q >= 11. An explicit four-layer construction gives C_4(4) >= 10 > 8, so this sufficient criterion does not induct to k = 4. The prospective k+2 law therefore remains open and requires a different lower-bound invariant. If workspace may be left dirty, pure-encoding UNSAT certificates at widths 10 and 11, together with a verified width-12 construction, show that the smallest width at which four-target selection reaches depth 3 is exactly 12; for every Q >= 12, workspace restoration costs exactly one layer at the same width. For ancilla-free dirty-target fan-out we compute the exact depths through seven targets and prove that 2^d - 1 targets require depth at least d+1, above the causal floor. At minimum width the threshold values are 2, 4, 4 for m = 2, 3, 4, and a pure-encoding DRAT certificate gives D∗_THR(5) >= 5; the nonlinear payload has exact depth D∗_carry(6) = 6. The decisive UNSAT formulas and proofs are fixed by SHA-256 and accepted by an independently compiled proof checker; constructions are verified symbolically or exhaustively. We make no priority claim: a systematic novelty search is incomplete, and no result is asserted as first or novel. This record is version 3 of the Zenodo preprint. Earlier versions remain permanently citable through their version-specific DOIs. Version 3 extends version 2 with: the exact closure of the arithmetic-payload depth (D∗_carry(6) = 6, DRAT-certified, and carry(7) in {5,6}); the DRAT-certified threshold bound D∗_THR(5) >= 5; the completed garbage-width curve (minimum width for depth 3 exactly 12, via pure-encoding DRAT exclusions at widths 10 and 11); the all-width eight-target lower bound D∗(8,Q) >= 5 for every valid width, via a conditional parametric saturation argument and independent, byte-identical Python and C++ enumerations of the width-free k=3 frontier; an explicit witness showing the k=3 carrier criterion does not induct to k=4; and restricted (architecture-specific) depth-5 exclusions, explicitly not claimed as general impossibilities. The general depth-5 question at L=8 and the prospective all-k law remain open; the latter appears only as a conjecture. The large DRAT certificate archive is being prepared as a separate, DOI-linked Zenodo dataset.
This research release presents an analytic proof of the Caputa-Di Giulio-Loc conjecture on symmetry-resolved Krylov complexity and quantum-state spread complexity in finite dimensions. For every real time t, the total complexity satisfies C(t) ≥ Σ_q p_q C_q(t), where C_q(t) is the normalized complexity within sector q and p_q is its initial probability weight. The theorem holds for finite-dimensional Hermitian generators with orthogonal reducing sectors, including degenerate spectra and terminating Lanczos chains. It requires no assumptions of quantum chaos, spectral randomness, or late-time equilibration. The conjecture appears in “Growth of block-diagonal operators and symmetry-resolved Krylov complexity,” Physical Review Research 7, 043055 (2025), DOI: 10.1103/9v9v-54zv, and “Symmetry-resolved spread complexity,” JHEP 02 (2026), 189, DOI: 10.1007/JHEP02(2026)189. The result establishes a general relationship between full-system quantum dynamics and calculations performed separately within symmetry sectors. Its practical importance is that sector computations provide rigorous lower bounds on total complexity at every time. It also identifies precisely when resolving the symmetry leaves complexity unchanged. These conclusions are relevant to mathematical physics, operator growth, quantum many-body dynamics, and the interpretation of Krylov complexity as a diagnostic of quantum chaos. The release proves a stronger statement than the original mean-complexity inequality: the full Krylov-index distribution dominates the probability-weighted sector distribution in first-order stochastic order. Consequently, the inequality extends to every nondecreasing function of the Krylov index. Additional results include: • Two complementary proofs using nested Krylov-space projections and best polynomial approximation in spectral measures.• Concavity under mixing of normalized spectral measures.• Exact nonnegative gap identities, including a moment-Gram formulation valid for singular matrices.• Fixed-time equality criteria and a finite-dimensional characterization of equality at all times.• An explicit three-node example and reproducible numerical diagnostics.• An extension to bounded self-adjoint generators, with explicit domain and completeness assumptions for unbounded generators. The standalone release includes the PDF manuscript, editable LaTeX, complete searchable Markdown proofs, Python verification code, citation metadata, an expert review guide, and machine-readable theorem, assumption, dependency, and proof records for research discovery and AI-assisted retrieval. Research status: a complete analytic proof is supplied for the stated finite-dimensional theorem. Independent peer review and proof-assistant verification have not been completed. Worldwide novelty and priority are not certified; the unrestricted infinite-dimensional conjecture is not claimed to be resolved.
Preprint and verification scripts for the paper "Grouped endpoint forms and a sharp interior law for the Werner distillability inequalities". For an operator C on H_1 ⊗ … ⊗ H_k, let q_k(−t,C) = Σ_J (−t)^{|J|} ‖Tr_J C‖², over sets J of factors. For rank at most two, nonnegativity of q_k(−1/2,C) is the Schmidt-rank-two test of undistillability of a Werner state from k copies; for k ≥ 4 it is open. We prove an identity, for every k, t and operator, writing q_k(−t,C) − (1−2t)(1−t)^{k−1} ‖C‖² as a combination, with explicit weights nonnegative on [0,1/2], of the endpoint forms of all factor groupings; if a factor has dimension at least two, no other constant admits such an identity with C-independent weights. So, over all local dimensions and for rank at most two, the sharp bound q_k(−t,C) ≥ (1−2t)(1−t)^{k−1} ‖C‖² on [0,1/2] is equivalent to the endpoint inequality; for k = 4, given the computer-assisted three-copy endpoint, it holds for a fixed C if and only if q_4(−1/2,C) ≥ 0. The sharp bound holds for every k when the range or co-range of C contains a fully product vector, and the identity extends to every real m ≥ 1, with 1/m replacing 1/2. For operators with range and co-range in the strings with exactly one digit 2, we give an identity and pair bounds for every k, prove the endpoint inequality for every k on symmetric sectors and, for k = 4, on further classes, one of them given the three-copy endpoint. The inequality also holds when the range lies in the span of the vectors |j⟩^{⊗k} (for even k at every rank), and for k = 4 at every rank when the range lies in a three-dimensional span of W-type vectors. Files: the preprint (PDF); ten Python scripts that check the explicit weights, identities and examples of Sections 3, 4 and 6–8 (exact rational arithmetic, except the checks of Section 7 and of the operator C_0 in Proposition 8.3, which use floating point); README.md, which says what each script checks and how to run it; MANIFEST.tsv with the size and SHA-256 of every file.
The positive-partial-transpose-squared (PPT-squared) conjecture asks whether the composition of two positive-partial-transpose (PPT) quantum channels must be entanglement breaking (EB). The problem remains open in general and, within the diagonal orthogonal covariant (DOC) class, the first unresolved deterministic dimension is four. A sufficient condition for PPT-squared composition is derived for DOC maps in arbitrary finite dimension. The proof isolates the quantum coherence data into two correlation matrices, mixes each with the identity until it lies in the convex hull of rank-one correlation matrices, and converts the resulting objects into an explicit triplewise completely positive (TCP) core. The remaining contribution is purely classical and is TCP whenever a simple entrywise mixing inequality is satisfied. For PPT DOC maps ΦA,B,CΦ_{A,B,C}ΦA,B,C​ and ΦD,E,FΦ_{D,E,F}ΦD,E,F​ on MdM_dMd​, the entrywise bound (AD)ij≥2⌊d⌋AiiAjjDiiDjj(AD)_{ij}\ge 2\lfloor\sqrt{d}\rfloor\sqrt{A_{ii}A_{jj}D_{ii}D_{jj}}(AD)ij​≥2⌊d​⌋Aii​Ajj​Dii​Djj​​ for all i,ji,ji,j guarantees that ΦA,B,C∘ΦD,E,FΦ_{A,B,C}\circΦ_{D,E,F}ΦA,B,C​∘ΦD,E,F​ is EB. In dimension four the universal coefficient becomes four. A continuous family of bistochastic PPT channels is then constructed; every member with a≠1a\ne1a=1 is not EB, while every pairwise composition within the family is proved to be EB. A rank-sensitive refinement shows explicitly how low coherence rank can improve the universal coefficient. The resulting certificate is sufficient rather than necessary and is complementary to factor-width and semidefinite-hierarchy approaches.