Changing the initial state to Q(H)|K0⟩ is exactly a Christoffel reweighting of the spectral measure by |Q|²; Krylov complexity then transfers from the reference problem through finite-band connectors and finite-rank kernel projections, with closed forms in Charlier, Krawtchouk and Chebyshev chains.
Krylov complexity of purification,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
hep-th 3roles
background 1polarities
unclear 1representative citing papers
Defines tripartite complexity and complexity gap for three-subsystem states and reports that the gap has definite sign across holographic CV, Fisher-Rao, and Krylov measures, suggesting it as a building block for complexity inequalities.
Krylov complexity is a canonical, parameter-independent measure of operator spreading that probes chaotic dynamics to late times and admits a geometric interpretation in holographic duals.
citing papers explorer
-
Polynomial Initial-State Jumps and Christoffel Transforms in Krylov Complexity
Changing the initial state to Q(H)|K0⟩ is exactly a Christoffel reweighting of the spectral measure by |Q|²; Krylov complexity then transfers from the reference problem through finite-band connectors and finite-rank kernel projections, with closed forms in Charlier, Krawtchouk and Chebyshev chains.
-
Complexity Inequalities for Quantum Subsystems
Defines tripartite complexity and complexity gap for three-subsystem states and reports that the gap has definite sign across holographic CV, Fisher-Rao, and Krylov measures, suggesting it as a building block for complexity inequalities.
-
Krylov Complexity
Krylov complexity is a canonical, parameter-independent measure of operator spreading that probes chaotic dynamics to late times and admits a geometric interpretation in holographic duals.