About
We develop a classical counterpart of the Krylov complexity framework by running the Lanczos algorithm directly on the algebra of observables of a Hamiltonian system on a compact symplectic manifold. This construction arises naturally as the semiclassical limit of the quantum Lanczos algorithm. We demonstrate the usefulness of classical Krylov complexity in characterisation early-time dynamics in chaotic quantum systems with a semiclassical limit, and derive a Krylov-Ehrenfest theorem, which captures the eventual divergence of semiclassical and exact Krylov dynamics.
00:00:00 Slide 1
00:00:36 Slide 2
00:02:58 Slide 3
00:06:04 Slide 4
00:07:57 Slide 5
00:13:45 Slide 6
00:18:50 Slide 7
00:19:11 Slide 8
00:19:23 Slide 9
00:19:53 Slide 10
00:22:03 Slide 11
The talk
Credits and licence
- Institution
- CERN
- Speaker
- Julian Sonner
- Year
- 2026
- Language
- English
- Subjects
- Mathematics, Astronomy and space
- Source
- CERN
- Licence
- CERN, as CERN states it. CERN's terms
- Attribution
- © CERN. CERN provides its audiovisual media free of charge for educational and informational use, credited to CERN; this lecture is shown in CERN's own player.
- Who can watch
- CERN gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed