aiqbench analysis
This paper establishes a concrete experimental framework for measuring Krylov complexity in driven optical systems by linking abstract chain dynamics to observable quantities like excitation counting and phase. The authors provide rigorous mathematical disentanglement of control history, state preparation, and reference frames across various Hamiltonian structures, including oscillators and three-level atoms. These findings offer a clear pathway for validating theoretical complexity measures in real-world quantum optics experiments.
Krylov Complexity of Time-Dependent Optical Hamiltonians
arXiv:2409.04156v2 Announce Type: replace Abstract: State Krylov complexity becomes experimentally concrete in driven optics because its chain can be interrogated through excitation counting, parity, return probability, and phase. Its meaning, however, is fixed jointly by the control history, the prepared state, and the reference used to follow explicit time dependence. We disentangle these ingredients for oscillator, $SU(2)$, $SU(1,1)$, and three-level Hamiltonians and determine when preparation dependence preserves exact solvability. A fixed group displacement of an extremal state can be absorbed into transformed controls, giving an undo-and-count readout for arbitrary drives. A polynomial preparation instead Christoffel-transforms the spectral measure of a fixed operator; an affine moving frame then transports its complete seed-adapted chain even when laboratory Hamiltonians at different times do not commute. We also resolve seed dependence in stroboscopic dynamics and driven three-level geometry. A periodically forced mode started from any finite Fock state has cyclic dimension equal to the denominator of a nonzero-displacement rational rotation and infinite dimension for an irrational rotation. At a half turn its complexity becomes a Laguerre survival deficit and a magnitude-sensitive Wigner readout. In a driven $V$ atom, bright-state geometry interferes with excited-manifold dynamics and controls bright-dark decoupling. Preparation therefore changes not only the initial state but also the chain and the optical observable that realizes its complexity.
Abstract:State Krylov complexity becomes experimentally concrete in driven optics because its chain can be interrogated through excitation counting, parity, return probability, and phase. Its meaning, however, is fixed jointly by the control history, the prepared state, and the reference used to follow explicit time dependence. We disentangle these ingredients for oscillator, $SU(2)$, $SU(1,1)$, and three-level Hamiltonians and determine when preparation dependence preserves exact solvability. A fixed group displacement of an extremal state can be absorbed into transformed controls, giving an undo-and-count readout for arbitrary drives. A polynomial preparation instead Christoffel-transforms the spectral measure of a fixed operator; an affine moving frame then transports its complete seed-adapted chain even when laboratory Hamiltonians at different times do not commute. We also resolve seed dependence in stroboscopic dynamics and driven three-level geometry. A periodically forced mode started from any finite Fock state has cyclic dimension equal to the denominator of a nonzero-displacement rational rotation and infinite dimension for an irrational rotation. At a half turn its complexity becomes a Laguerre survival deficit and a magnitude-sensitive Wigner readout. In a driven $V$ atom, bright-state geometry interferes with excited-manifold dynamics and controls bright-dark decoupling. Preparation therefore changes not only the initial state but also the chain and the optical observable that realizes its complexity.
30 pages, 13 figures. v2 substantially rewritten and extended, with seed-dependent and Floquet results, moving-frame and driven bright-dark dynamics, and optical readouts. Physical interpretations, title and author list revised
arXiv:2409.04156 [quant-ph]
(or arXiv:2409.04156v2 [quant-ph] for this version)
Full text under the publisher's open licence · 246 words
Related coverage

Sharif University Researchers Detail New Complexity Growth Methods
Quantum Zeitgeist · Jul 14, 2026

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
Quantum Journal · Aug 3, 2026
Krylov Complexity from Loschmidt Amplitude
arXiv · Sep 30, 2026
A Bogoliubov-ratio framework for quantum-information diagnostics of time-dependent two-mode Boson Hamiltonian
arXiv · Jul 28, 2026