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 long-time scrambling conjecture holds for all collinear algebras

Anthony Moreno

Published Sep 29, 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. 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.

DOI
10.5281/zenodo.23044569

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

Quantum scrambling of algebras of observables: the $\mathbb{Z}_2$-symmetric case

Paolo Zanardi, J. Karson Lewis

We consider unitary quantum scrambling for an entire class of observable algebras $\mathcal A$ whose commutant ${\mathcal A}'=\mathbb{C}\mathbb{Z}_2$ is generated by a Hermitian involution $S$, i.e., a parity operator. We adopt two different, although related, scrambling measures: (a) the algebraic out-of-time-order correlator (A-OTOC) introduced in [Andreadakis, Anand, and Zanardi, Phys. Rev. A 107, 042217 (2023)], and (b) a Slater-determinant-type quantity, dubbed the Plücker fidelity, obtained by embedding operator algebras into a higher-dimensional projective operator space. Both measures admit a simple geometric interpretation in terms of distances between algebras and their dynamical images. Moreover, they can be expressed in terms of the norm of the $\mathbb{Z}_2$-symmetry-breaking component of the unitary, which is in turn controlled by the time autocorrelation function of the $\mathbb{Z}_2$ generator $S$. We derive exact expressions for the A-OTOC and the Plücker fidelity in the general case, as well as their values for a random unitary. For Hamiltonian-generated channels, we compute their long-time averages, as well as the typical values of these long-time averages for random generators $S$. Finally, we numerically explore the results of our formalism for interacting spin chains in different phases and for different physical parity operators.

quant-pharXiv:2606.29137•Jun 30, 2026•1 citation

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

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

•Sep 30, 2026•0 citations

Long-time quantum scrambling and generalized tensor product structures

Faidon Andreadakis, Emanuel Dallas, Paolo Zanardi

Much recent work has been devoted to the study of information scrambling in quantum systems. In this paper, we study the long-time properties of the algebraic out-of-time-order-correlator (``$\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$'') and derive an analytical expression for its long-time average under the nonresonance condition. The $\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$ quantifies quantum scrambling with respect to degrees of freedom described by an operator subalgebra $\mathcal{A}$, which is associated with a partitioning of the corresponding system into a generalized tensor product structure. Recently, the short-time growth of the $\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$ was proposed as a criterion to determine which partition arises naturally from the system's unitary dynamics. In this paper, we extend this program to the long-time regime where the long-time average of the $\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$ serves as the metric of subsystem emergence. Under this framework, natural system partitions are characterized by the tendency to minimally scramble information over long timescales. We consider several physical examples, ranging from quantum many-body systems and stabilizer codes to quantum reference frames, and perform the minimization of the $\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$ long-time average both analytically and numerically over relevant families of algebras. For simple cases subject to the nonresonant condition, minimal $\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$ long-time average is shown to be related to minimal entanglement of the Hamiltonian eigenstates across the emergent system partition. Finally, we conjecture and provide evidence for a general structure of the algebra that minimizes the average for nonresonant Hamiltonians.

arXiv:2312.13386•Physical Review A•May 15, 2024•7 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

Cancellation of Correlated Readout Errors in Measurement-Based Quantum Wires: Exact Channels, Finite-Memory Crossover, and Length-Reversal Boundaries

Jun Tsuzurugi

This record contains the revision 9 preprint and its verification and figure-reproduction materials. We determine when correlated readout-label errors cancel in a fixed measurement-based quantum wire and how finite correlation and independent noise determine its optimal length. Quantum operations and X measurements are ideal. A stationary binary Markov component with marginal 0 < p < 1/2 and persistence 0 ≤ c ≤ 1, combined with independent flips of probability 0 ≤ r < 1/2, yields an exact output Pauli channel through two-dimensional transfer matrices. The channel acts on arbitrary inputs, including reference-entangled inputs, and its entanglement infidelity equals its half-diamond distance from the identity. Common-mode errors cancel at lengths divisible by four when c = 1 and r = 0. Every fixed c < 1 instead gives a completely depolarizing long-wire limit; two residue-class crossover functions resolve the singular limit. Fidelity decreases within each even residue class, so its maximum over all positive even lengths is attained at two or four steps. Exact boundaries select the maximizer, and an effective depolarizing penalty quantifies the overhead tolerance of the four-step advantage. Contents. The ZIP includes the latest 19-page manuscript PDF, its authoritative LaTeX source, the three manuscript figures, the unchanged ESM_1.zip containing Python verification and figure-generation code, numerical data, saved execution records and provenance, plus licensing information, a BibTeX citation, and SHA-256 checksums. Scientific files are unchanged from the supplied revision 9 materials. The packaging did not rerun calculations or recompile the manuscript. The earlier reference-only PDF and submission-preparation working records are excluded. Licenses. MIT applies to Python source code, including code inside ESM_1.zip. CC BY 4.0 applies to the manuscript, LaTeX source, figures, numerical data, documentation, and other non-code research materials. These licenses apply to the respective material categories; see the README and license files for scope. Funding. No funding or grants were received for this study. Competing interests. The author has no relevant financial or non-financial interests to disclose. AI-assisted preparation. ChatGPT (OpenAI) was used to assist with mathematical analysis, code development, figure preparation, English-language editing, LaTeX submission preparation, and organization of supplementary files. The author carefully reviewed the mathematical reasoning, code, figures, and manuscript text, and takes full responsibility for the scientific content and the final manuscript.

•Nov 10, 2026•0 citations
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.
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.
Quantum scrambling of algebras of observables: the Z2\mathbb{Z}_2Z2​-symmetric case
We consider unitary quantum scrambling for an entire class of observable algebras A\mathcal AA whose commutant A′=CZ2{\mathcal A}'=\mathbb{C}\mathbb{Z}_2A′=CZ2​ is generated by a Hermitian involution SSS, i.e., a parity operator. We adopt two different, although related, scrambling measures: (a) the algebraic out-of-time-order correlator (A-OTOC) introduced in [Andreadakis, Anand, and Zanardi, Phys. Rev. A 107, 042217 (2023)], and (b) a Slater-determinant-type quantity, dubbed the Plücker fidelity, obtained by embedding operator algebras into a higher-dimensional projective operator space. Both measures admit a simple geometric interpretation in terms of distances between algebras and their dynamical images. Moreover, they can be expressed in terms of the norm of the Z2\mathbb{Z}_2Z2​-symmetry-breaking component of the unitary, which is in turn controlled by the time autocorrelation function of the Z2\mathbb{Z}_2Z2​ generator SSS. We derive exact expressions for the A-OTOC and the Plücker fidelity in the general case, as well as their values for a random unitary. For Hamiltonian-generated channels, we compute their long-time averages, as well as the typical values of these long-time averages for random generators SSS. Finally, we numerically explore the results of our formalism for interacting spin chains in different phases and for different physical parity operators.
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.
Much recent work has been devoted to the study of information scrambling in quantum systems. In this paper, we study the long-time properties of the algebraic out-of-time-order-correlator (``$\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$'') and derive an analytical expression for its long-time average under the nonresonance condition. The $\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$ quantifies quantum scrambling with respect to degrees of freedom described by an operator subalgebra A\mathcal{A}A, which is associated with a partitioning of the corresponding system into a generalized tensor product structure. Recently, the short-time growth of the $\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$ was proposed as a criterion to determine which partition arises naturally from the system's unitary dynamics. In this paper, we extend this program to the long-time regime where the long-time average of the $\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$ serves as the metric of subsystem emergence. Under this framework, natural system partitions are characterized by the tendency to minimally scramble information over long timescales. We consider several physical examples, ranging from quantum many-body systems and stabilizer codes to quantum reference frames, and perform the minimization of the $\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$ long-time average both analytically and numerically over relevant families of algebras. For simple cases subject to the nonresonant condition, minimal $\mathcal{A}\text{\ensuremath{-}}\mathrm{OTOC}$ long-time average is shown to be related to minimal entanglement of the Hamiltonian eigenstates across the emergent system partition. Finally, we conjecture and provide evidence for a general structure of the algebra that minimizes the average for nonresonant Hamiltonians.
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.
This record contains the revision 9 preprint and its verification and figure-reproduction materials. We determine when correlated readout-label errors cancel in a fixed measurement-based quantum wire and how finite correlation and independent noise determine its optimal length. Quantum operations and X measurements are ideal. A stationary binary Markov component with marginal 0 < p < 1/2 and persistence 0 ≤ c ≤ 1, combined with independent flips of probability 0 ≤ r < 1/2, yields an exact output Pauli channel through two-dimensional transfer matrices. The channel acts on arbitrary inputs, including reference-entangled inputs, and its entanglement infidelity equals its half-diamond distance from the identity. Common-mode errors cancel at lengths divisible by four when c = 1 and r = 0. Every fixed c < 1 instead gives a completely depolarizing long-wire limit; two residue-class crossover functions resolve the singular limit. Fidelity decreases within each even residue class, so its maximum over all positive even lengths is attained at two or four steps. Exact boundaries select the maximizer, and an effective depolarizing penalty quantifies the overhead tolerance of the four-step advantage. Contents. The ZIP includes the latest 19-page manuscript PDF, its authoritative LaTeX source, the three manuscript figures, the unchanged ESM_1.zip containing Python verification and figure-generation code, numerical data, saved execution records and provenance, plus licensing information, a BibTeX citation, and SHA-256 checksums. Scientific files are unchanged from the supplied revision 9 materials. The packaging did not rerun calculations or recompile the manuscript. The earlier reference-only PDF and submission-preparation working records are excluded. Licenses. MIT applies to Python source code, including code inside ESM_1.zip. CC BY 4.0 applies to the manuscript, LaTeX source, figures, numerical data, documentation, and other non-code research materials. These licenses apply to the respective material categories; see the README and license files for scope. Funding. No funding or grants were received for this study. Competing interests. The author has no relevant financial or non-financial interests to disclose. AI-assisted preparation. ChatGPT (OpenAI) was used to assist with mathematical analysis, code development, figure preparation, English-language editing, LaTeX submission preparation, and organization of supplementary files. The author carefully reviewed the mathematical reasoning, code, figures, and manuscript text, and takes full responsibility for the scientific content and the final manuscript.