pith. sign in

Title resolution pending

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

citation-role summary

background 2

citation-polarity summary

verdicts

UNVERDICTED 4

roles

background 2

polarities

background 1 unclear 1

representative citing papers

Krylov Dynamics and Operator Growth in Time-Dependent Systems via Lie Algebras

quant-ph · 2026-05-06 · unverdicted · novelty 7.0

The paper establishes a Lie-algebraic framework for exact Krylov dynamics in time-dependent quantum systems and introduces a quantum speed limit for complexity growth that retains its time-independent form but saturates only when the Hamiltonian commutes with itself at different times.

A Quantum Computational Perspective on Spread Complexity

hep-th · 2025-06-08 · unverdicted · novelty 5.0

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

hep-th · 2025-07-08 · unverdicted · novelty 2.0

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.

Quantum Dynamics in Krylov Space: Methods and Applications

quant-ph · 2024-05-15 · unverdicted · novelty 2.0

Krylov subspace methods efficiently describe quantum evolution, operator growth, and chaos in many-body systems, with metrics like Krylov complexity and applications in open systems, QFT, and quantum computing.

citing papers explorer

Showing 4 of 4 citing papers.

  • Krylov Dynamics and Operator Growth in Time-Dependent Systems via Lie Algebras quant-ph · 2026-05-06 · unverdicted · none · ref 13

    The paper establishes a Lie-algebraic framework for exact Krylov dynamics in time-dependent quantum systems and introduces a quantum speed limit for complexity growth that retains its time-independent form but saturates only when the Hamiltonian commutes with itself at different times.

  • A Quantum Computational Perspective on Spread Complexity hep-th · 2025-06-08 · unverdicted · none · ref 13

    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 hep-th · 2025-07-08 · unverdicted · none · ref 116

    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.

  • Quantum Dynamics in Krylov Space: Methods and Applications quant-ph · 2024-05-15 · unverdicted · none · ref 194

    Krylov subspace methods efficiently describe quantum evolution, operator growth, and chaos in many-body systems, with metrics like Krylov complexity and applications in open systems, QFT, and quantum computing.