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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
In W3 CFTs, Lanczos coefficients b_N grow as N^2 for generalized Liouvillian with W generators, violating the universal linear growth bound and causing divergent Krylov complexity, with the same quadratic growth in the SL(3,R) subalgebra.
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
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.
-
Violation of Universal Operator Growth Hypothesis in $\mathcal{W}_3$Conformal Field Theories
In W3 CFTs, Lanczos coefficients b_N grow as N^2 for generalized Liouvillian with W generators, violating the universal linear growth bound and causing divergent Krylov complexity, with the same quadratic growth in the SL(3,R) subalgebra.
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.