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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
hep-th 2years
2025 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
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
-
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.
-
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.