LogK complexity via replicas distinguishes genuine scrambling from saddle effects in quantum and classical systems and refines the measure for integrable cases.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
hep-th 5verdicts
UNVERDICTED 5roles
background 1polarities
background 1representative citing papers
Holographic complexity measures show universal linear growth followed by late-time saturation, proven necessary and sufficient via pole structures in the energy basis using the residue theorem, arising from random matrix statistics.
Arnoldi coefficients approach unity exponentially in heating phases of driven CFTs but oscillate in non-heating phases; lattice realizations show distinct spectral and graph signatures despite similar CFT Krylov growth.
A first-order phase transition in the Berkooz-Brukner-Jia-Mamroud interpolating model causes chord number, Krylov complexity, and operator size to switch discontinuously from chaotic (linear/exponential) to quasi-integrable (quadratic) growth.
Spread complexity is recovered as the infinitesimal-time limit of a circuit complexity defined by minimal-cost synthesis with time-evolution and beam-splitting operations.
citing papers explorer
-
Towards a Refinement of Krylov Complexity: Scrambling, Classical Operator Growth and Replicas
LogK complexity via replicas distinguishes genuine scrambling from saddle effects in quantum and classical systems and refines the measure for integrable cases.
-
Universal Time Evolution of Holographic and Quantum Complexity
Holographic complexity measures show universal linear growth followed by late-time saturation, proven necessary and sufficient via pole structures in the energy basis using the residue theorem, arising from random matrix statistics.
-
Krylov Complexity in Periodically Driven CFTs and Critical Fermions
Arnoldi coefficients approach unity exponentially in heating phases of driven CFTs but oscillate in non-heating phases; lattice realizations show distinct spectral and graph signatures despite similar CFT Krylov growth.
-
Probing the Chaos to Integrability Transition in Double-Scaled SYK
A first-order phase transition in the Berkooz-Brukner-Jia-Mamroud interpolating model causes chord number, Krylov complexity, and operator size to switch discontinuously from chaotic (linear/exponential) to quasi-integrable (quadratic) growth.
-
A Quantum Computational Perspective on Spread Complexity
Spread complexity is recovered as the infinitesimal-time limit of a circuit complexity defined by minimal-cost synthesis with time-evolution and beam-splitting operations.