Krylov Complexity as a Probe for Chaos

• URL: http://arxiv.org/abs/2408.10194v2
• Date: Mon, 9 Sep 2024 19:06:32 GMT
• Title: Krylov Complexity as a Probe for Chaos
• Authors: Mohsen Alishahiha, Souvik Banerjee, Mohammad Javad Vasli,
• Abstract summary: We show that the dynamics towards saturation precisely distinguish between chaotic and integrable systems. For chaotic models, the saturation value of complexity reaches its infinite time average at a finite saturation time. In integrable models, complexity approaches the infinite time average value from below at a much longer timescale.
• Score: 0.7373617024876725
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we explore in detail, the time evolution of Krylov complexity. We demonstrate, through analytical computations, that in finite many-body systems, while ramp and plateau are two generic features of Krylov complexity, the manner in which complexity saturates reveals the chaotic nature of the system. In particular, we show that the dynamics towards saturation precisely distinguish between chaotic and integrable systems. For chaotic models, the saturation value of complexity reaches its infinite time average at a finite saturation time. In this case, depending on the initial state, it may also exhibit a peak before saturation. In contrast, in integrable models, complexity approaches the infinite time average value from below at a much longer timescale. We confirm this distinction using numerical results for specific spin models.

Related papers

• Time-dependent Neural Galerkin Method for Quantum Dynamics [42.81677042059531]
  We introduce a classical computational method for quantum dynamics that relies on a global-in-time variational principle. We showcase the method's effectiveness simulating global quantum quenches in the paradigmatic Transverse-Field Ising model in both 1D and 2D. Overall, the method presented here shows competitive performance compared to state-of-the-art time-dependent variational approaches.
  arXiv  Detail & Related papers  (2024-12-16T13:48:54Z)
• Spread complexity and quantum chaos for periodically driven spin chains [0.0]
  We study the dynamics of spread complexity for quantum maps using the Arnoldi iterative procedure. We find distinctive behaviour of the Arnoldi coefficients and spread complexity for regular vs. chaotic dynamics.
  arXiv  Detail & Related papers  (2024-05-25T11:17:43Z)
• Spread complexity in saddle-dominated scrambling [0.0]
  We study the spread complexity of the thermofield double state within emphintegrable systems that exhibit saddle-dominated scrambling. Applying the Lanczos algorithm, our numerical investigation reveals that the spread complexity in these systems exhibits features reminiscent of emphchaotic systems.
  arXiv  Detail & Related papers  (2023-12-19T20:41:14Z)
• Unbiasing time-dependent Variational Monte Carlo by projected quantum evolution [44.99833362998488]
  We analyze the accuracy and sample complexity of variational Monte Carlo approaches to simulate quantum systems classically. We prove that the most used scheme, the time-dependent Variational Monte Carlo (tVMC), is affected by a systematic statistical bias. We show that a different scheme based on the solution of an optimization problem at each time step is free from such problems.
  arXiv  Detail & Related papers  (2023-05-23T17:38:10Z)
• Krylov complexity in quantum field theory, and beyond [44.99833362998488]
  We study Krylov complexity in various models of quantum field theory. We find that the exponential growth of Krylov complexity satisfies the conjectural inequality, which generalizes the Maldacena-Shenker-Stanford bound on chaos.
  arXiv  Detail & Related papers  (2022-12-29T19:00:00Z)
• Krylov Complexity in Open Quantum Systems [3.5895926924969404]
  We show that Krylov complexity in open systems can be mapped to a non-hermitian tight-binding model in a half-infinite chain. Our work provides insights for discussing complexity, chaos, and holography for open quantum systems.
  arXiv  Detail & Related papers  (2022-07-27T16:03:41Z)
• Entanglement and correlations in fast collective neutrino flavor oscillations [68.8204255655161]
  Collective neutrino oscillations play a crucial role in transporting lepton flavor in astrophysical settings. We study the full out-of-equilibrium flavor dynamics in simple multi-angle geometries displaying fast oscillations. We present evidence that these fast collective modes are generated by the same dynamical phase transition.
  arXiv  Detail & Related papers  (2022-03-05T17:00:06Z)
• Ultimate Speed Limits to the Growth of Operator Complexity [0.0]
  We introduce a fundamental and universal limit to the growth of the Krylov complexity. We show the conditions for this bound to be saturated and illustrate its validity in paradigmatic models of quantum chaos.
  arXiv  Detail & Related papers  (2022-02-10T13:05:11Z)
• Consistency of mechanistic causal discovery in continuous-time using Neural ODEs [85.7910042199734]
  We consider causal discovery in continuous-time for the study of dynamical systems. We propose a causal discovery algorithm based on penalized Neural ODEs.
  arXiv  Detail & Related papers  (2021-05-06T08:48:02Z)
• Operator complexity: a journey to the edge of Krylov space [0.0]
  Krylov complexity, or K-complexity', quantifies this growth with respect to a special basis. We study the evolution of K-complexity in finite-entropy systems for time scales greater than the scrambling time.
  arXiv  Detail & Related papers  (2020-09-03T18:10:20Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.