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

The Andreadakis–Dallas–Zanardi conjecture for algebras of bounded ratio spread

Anthony Moreno

Published Sep 30, 2026• 0 citations
Publisher

Abstract

For an algebra of observables A ≅ ⊕_J 1_{n_J} ⊗ L(C^{d_J}) and a Hamiltonian satisfying the non-resonance condition, Andreadakis, Dallas and Zanardi [Phys. Rev. A 109, 052424 (2024)] conjectured a lower bound on the long-time average of the algebra out-of-time-order correlator. A previous preprint (DOI 10.5281/zenodo.23044570) proved it for collinear algebras, where the ratio n_J/d_J is the same in every sector. Here we prove it for every algebra whose ratios lie within a factor (91+10√66)/41 ≈ 4.20 of each other, for any number of sectors, and within a factor (5+√21)/2 ≈ 4.79 when there are two sectors. In particular the conjecture holds whenever all ratios lie within a factor 4. The case of large ratio spread remains open. Preprint, version 1, not peer reviewed. The record contains the paper (PDF and LaTeX source), the verification code with its reference outputs, and SHA-256 checksums of all files. AI assistance is disclosed in the paper.

DOI
10.5281/zenodo.23066194

Related papers

The Andreadakis–Dallas–Zanardi long-time scrambling conjecture holds for every algebra

Anthony Moreno

For an algebra of observables A ≅ ⊕_J 1_{n_J} ⊗ L(C^{d_J}) and a Hamiltonian satisfying the non-resonance condition, Andreadakis, Dallas and Zanardi [Phys. Rev. A 109, 052424 (2024)] conjectured a lower bound on the long-time average of the algebra out-of-time-order correlator. Previous preprints proved it for collinear algebras (DOI 10.5281/zenodo.23044570) and for algebras whose sector ratios n_J/d_J lie within a factor (91+10√66)/41 ≈ 4.20 of each other (DOI 10.5281/zenodo.23066195). Here we prove it for every algebra. The proof keeps the reduction to a per-eigenvector inequality. It replaces the geometric-mean bound used before by the exact weighted-covariance identity applied to the Schmidt blocks of each eigenvector, and bounds the negative cross-sector pairs by assigning each of them to one of its blocks. The problem then splits into one inequality per pair of sectors, which reduces, by concavity and affine reductions, to explicit polynomial inequalities in one variable. Preprint, version 1, not peer reviewed. The record contains the paper (PDF and LaTeX source), the verification code with its reference outputs, and SHA-256 checksums of all files. AI assistance is disclosed in the paper.

•Sep 30, 2026•0 citations

The Andreadakis–Dallas–Zanardi long-time scrambling conjecture holds for all collinear algebras

Anthony Moreno

For an algebra of observables A ≅ ⊕_J 1_{n_J} ⊗ L(C^{d_J}) and a Hamiltonian satisfying the non-resonance condition, Andreadakis, Dallas and Zanardi [Phys. Rev. A 109, 052424 (2024)] conjectured a lower bound on the long-time average of the algebra out-of-time-order correlator. We prove the conjecture for every collinear algebra (n_J/d_J the same for all sectors J) and show that the minimum is attained only by eigenbases that are products within the sectors. The general, non-collinear case remains open. Preprint, version 1, not peer reviewed. The record contains the paper (PDF and LaTeX source), the verification code with its reference outputs, an independent second implementation, and SHA-256 checksums of all files. AI assistance is disclosed in the paper.

•Sep 29, 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

How Far Can a Qutrit Beat a Qubit on Antipodal Tables? An Exact Qubit Test, Bounds, and a Conjectured Constant for Three Queries

Vasily Psykovsky

Third note in a series on qubit–qutrit equivalence for centrally symmetric prepare-and-measure correlations (doi:10.5281/zenodo.24093433, doi:10.5281/zenodo.24121836). Setting: fixed binary measurements, no shared randomness, and tables of antipodal pairs of target expectation vectors. The question: by how much must a qutrit table be shrunk before a qubit can reproduce it? Proved: A qubit reproduces such a table exactly if and only if it factors through 3-dimensional real space with all rows and columns in the unit ball. With at most three queries this is the condition γ₂(T) ≤ 1 on the factorization norm, a single semidefinite program. Every qutrit table has γ₂(T) ≤ 2/√3, while the same argument gives exactly 1 for qubits. The worst-case factor κ(n) never decreases with the number of queries n. For three queries, γ₂(T)² ≥ I(T)/9, where I ≤ 9 is the qubit inequality of the previous note. Averaging a core over relabellings of the measurements can never raise the shrink factor. Certified in exact rational arithmetic (computer-assisted): κ(3) ≥ 1.002813276 and κ(4) ≥ 1.007479. For a fixed rational reference triple A*, close to the numerically best symmetric triple, the shrink factor lies in [1.002813276, 1.00281429]. The upper bound uses a new second-order covering of the direction sphere. Conjectured (not proved): κ(3) = √(I*)/3 = 1.0028142848…, and the worst triple is cyclically symmetric. No numerical search found a larger value. The note explains why the obvious proof strategies fail. Files: the preprint (PDF), and a reproducibility archive (ZIP) with five preregistered research stages, including failed and stopped runs, all certificates, and a SHA-256 manifest. After unpacking, two pure-Python exact checks reproduce the certificates in about 20 s, without any numerical solver. They check the certificates, not the surrounding proofs. Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.

•Nov 11, 2026•2 citations

Quantum-mechanical correlations and Tsirelson bound from geometric algebra

Carsten Held

arXiv:2007.05301•Quantum Studies Mathematics and Foundations•Sep 12, 2021•1 citation

Bell Causality and Operational Rigidity in Quantum Sequential Growth: What noncommuting transition operators can do on reachable causal-set histories

Thomas G Hamilton

A quantum sequential-growth dynamics should allow interference between causal-set histories while respecting the causal and relabelling principles that constrain classical growth. Recent work on causal-past-ordered Bell causality (CPOBC) allows noncommuting transition operators, raising a physical question: can this algebraic freedom act nontrivially on histories that the dynamics actually prepares? For invertible operator-valued growth satisfying the operator Markov sum rule and strict state-vector covariance, we prove a dimension-independent answer for immediate sibling births. At every reached parent with at least two elements, the gregarious operators of its children act identically on the parent's state, and all same-parent transition commutators annihilate that state. The proof uses only source-faithful spectator reductions; it assumes neither operator-level covariance nor global factorization. An all-stage dark-sector model shows why this is not a theorem of operator commutativity. The local conclusion strengthens to the full cyclic module generated by the transitions of any fixed reached parent, ruling out an irreducible transition algebra on that parent for carrier dimension at least two. Conditional reductions and three-dimensional examples delineate the surviving possibilities, including a measure-level effect at the exceptional singleton junction. To our knowledge, this on-state rigidity consequence has not previously been isolated for this CPOBC convention. We identify, but do not resolve, the question of independent non-sibling quantum-measure effects at later births. Contents of this record: the manuscript (PDF) and its LaTeX source, and a certificates bundle. The bundle holds seven standalone Python scripts that reproduce every finite-stage computation in the paper, using exact rational or algebraic-number arithmetic. It also contains logs, result files and SHA-256 checksums. Reproducibility: the scripts use only the Python standard library. Unzip the bundle, create an empty folder, and from it run: python -I ../certificates/run_all.py. All outputs are written to the current folder. Status: research preprint, not peer reviewed. Companion to T. G. Hamilton, "Noncommutative quantum sequential growth under state-level covariance: existence, fixed-seed rigidity, and geometric limits", Zenodo (2026), doi:10.5281/zenodo.23953788.

•Nov 6, 2026•1 citation
For an algebra of observables A ≅ ⊕J 1{n_J} ⊗ L(C^{d_J}) and a Hamiltonian satisfying the non-resonance condition, Andreadakis, Dallas and Zanardi [Phys. Rev. A 109, 052424 (2024)] conjectured a lower bound on the long-time average of the algebra out-of-time-order correlator. A previous preprint (DOI 10.5281/zenodo.23044570) proved it for collinear algebras, where the ratio n_J/d_J is the same in every sector. Here we prove it for every algebra whose ratios lie within a factor (91+10√66)/41 ≈ 4.20 of each other, for any number of sectors, and within a factor (5+√21)/2 ≈ 4.79 when there are two sectors. In particular the conjecture holds whenever all ratios lie within a factor 4. The case of large ratio spread remains open. Preprint, version 1, not peer reviewed. The record contains the paper (PDF and LaTeX source), the verification code with its reference outputs, and SHA-256 checksums of all files. AI assistance is disclosed in the paper.
For an algebra of observables A ≅ ⊕_J 1_{n_J} ⊗ L(C^{d_J}) and a Hamiltonian satisfying the non-resonance condition, Andreadakis, Dallas and Zanardi [Phys. Rev. A 109, 052424 (2024)] conjectured a lower bound on the long-time average of the algebra out-of-time-order correlator. Previous preprints proved it for collinear algebras (DOI 10.5281/zenodo.23044570) and for algebras whose sector ratios n_J/d_J lie within a factor (91+10√66)/41 ≈ 4.20 of each other (DOI 10.5281/zenodo.23066195). Here we prove it for every algebra. The proof keeps the reduction to a per-eigenvector inequality. It replaces the geometric-mean bound used before by the exact weighted-covariance identity applied to the Schmidt blocks of each eigenvector, and bounds the negative cross-sector pairs by assigning each of them to one of its blocks. The problem then splits into one inequality per pair of sectors, which reduces, by concavity and affine reductions, to explicit polynomial inequalities in one variable. Preprint, version 1, not peer reviewed. The record contains the paper (PDF and LaTeX source), the verification code with its reference outputs, and SHA-256 checksums of all files. AI assistance is disclosed in the paper.
For an algebra of observables A ≅ ⊕_J 1_{n_J} ⊗ L(C^{d_J}) and a Hamiltonian satisfying the non-resonance condition, Andreadakis, Dallas and Zanardi [Phys. Rev. A 109, 052424 (2024)] conjectured a lower bound on the long-time average of the algebra out-of-time-order correlator. We prove the conjecture for every collinear algebra (n_J/d_J the same for all sectors J) and show that the minimum is attained only by eigenbases that are products within the sectors. The general, non-collinear case remains open. Preprint, version 1, not peer reviewed. The record contains the paper (PDF and LaTeX source), the verification code with its reference outputs, an independent second implementation, and SHA-256 checksums of all files. AI assistance is disclosed in the paper.
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.
Third note in a series on qubit–qutrit equivalence for centrally symmetric prepare-and-measure correlations (doi:10.5281/zenodo.24093433, doi:10.5281/zenodo.24121836). Setting: fixed binary measurements, no shared randomness, and tables of antipodal pairs of target expectation vectors. The question: by how much must a qutrit table be shrunk before a qubit can reproduce it? Proved: A qubit reproduces such a table exactly if and only if it factors through 3-dimensional real space with all rows and columns in the unit ball. With at most three queries this is the condition γ₂(T) ≤ 1 on the factorization norm, a single semidefinite program. Every qutrit table has γ₂(T) ≤ 2/√3, while the same argument gives exactly 1 for qubits. The worst-case factor κ(n) never decreases with the number of queries n. For three queries, γ₂(T)² ≥ I(T)/9, where I ≤ 9 is the qubit inequality of the previous note. Averaging a core over relabellings of the measurements can never raise the shrink factor. Certified in exact rational arithmetic (computer-assisted): κ(3) ≥ 1.002813276 and κ(4) ≥ 1.007479. For a fixed rational reference triple A*, close to the numerically best symmetric triple, the shrink factor lies in [1.002813276, 1.00281429]. The upper bound uses a new second-order covering of the direction sphere. Conjectured (not proved): κ(3) = √(I*)/3 = 1.0028142848…, and the worst triple is cyclically symmetric. No numerical search found a larger value. The note explains why the obvious proof strategies fail. Files: the preprint (PDF), and a reproducibility archive (ZIP) with five preregistered research stages, including failed and stopped runs, all certificates, and a SHA-256 manifest. After unpacking, two pure-Python exact checks reproduce the certificates in about 20 s, without any numerical solver. They check the certificates, not the surrounding proofs. Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.
A quantum sequential-growth dynamics should allow interference between causal-set histories while respecting the causal and relabelling principles that constrain classical growth. Recent work on causal-past-ordered Bell causality (CPOBC) allows noncommuting transition operators, raising a physical question: can this algebraic freedom act nontrivially on histories that the dynamics actually prepares? For invertible operator-valued growth satisfying the operator Markov sum rule and strict state-vector covariance, we prove a dimension-independent answer for immediate sibling births. At every reached parent with at least two elements, the gregarious operators of its children act identically on the parent's state, and all same-parent transition commutators annihilate that state. The proof uses only source-faithful spectator reductions; it assumes neither operator-level covariance nor global factorization. An all-stage dark-sector model shows why this is not a theorem of operator commutativity. The local conclusion strengthens to the full cyclic module generated by the transitions of any fixed reached parent, ruling out an irreducible transition algebra on that parent for carrier dimension at least two. Conditional reductions and three-dimensional examples delineate the surviving possibilities, including a measure-level effect at the exceptional singleton junction. To our knowledge, this on-state rigidity consequence has not previously been isolated for this CPOBC convention. We identify, but do not resolve, the question of independent non-sibling quantum-measure effects at later births. Contents of this record: the manuscript (PDF) and its LaTeX source, and a certificates bundle. The bundle holds seven standalone Python scripts that reproduce every finite-stage computation in the paper, using exact rational or algebraic-number arithmetic. It also contains logs, result files and SHA-256 checksums. Reproducibility: the scripts use only the Python standard library. Unzip the bundle, create an empty folder, and from it run: python -I ../certificates/run_all.py. All outputs are written to the current folder. Status: research preprint, not peer reviewed. Companion to T. G. Hamilton, "Noncommutative quantum sequential growth under state-level covariance: existence, fixed-seed rigidity, and geometric limits", Zenodo (2026), doi:10.5281/zenodo.23953788.