Inflationary Krylov complexity

• URL: http://arxiv.org/abs/2401.09307v4
• Date: Thu, 23 May 2024 08:06:31 GMT
• Title: Inflationary Krylov complexity
• Authors: Tao Li, Lei-Hua Liu,
• Abstract summary: We investigate the Krylov complexity of curvature perturbation for the modified dispersion relation in inflation. Our analysis could be applied to the most inflationary models.
• Score: 3.0346001106791323
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we have systematically investigated the Krylov complexity of curvature perturbation for the modified dispersion relation in inflation, using the algorithm in closed system and open system. Our analysis could be applied to the most inflationary models. Following the Lanczos algorithm, we find the very early universe is an infinite, many-body, and maximal chaotic system. Our numerics shows that the Lanczos coefficient and Lyapunov index of the standard dispersion relation are mainly determined by the scale factor. As for the modified case, it is nearly determined by the momentum. In a method of the closed system, we discover that the Krylov complexity will show irregular oscillation before the horizon exits. The modified case will present faster growth after the horizon exists. Since the whole universe is an open system, the approach of an open system is more realistic and reliable. Then, we construct the exact wave function which is very robust only requiring the Lanczos coefficient proportional to $n$ (main quantum number). Based on it, we find the Krylov complexity and Krylov entropy could nicely recover in the case of a closed system under the weak dissipative approximation, in which our analysis shows that the evolution of Krylov complexity will not be the same with the original situation. We also find the inflationary period is a strong dissipative system. Meanwhile, our numerics clearly shows the Krylov complexity will grow during the whole inflationary period. But for the small scales, there will be a peak after the horizon exits. Our analysis reveals that the dramatic change in background (inflation) will significantly impact the evolution of Krylov complexity. Since the curvature perturbation will transit from the quantum level to the classical level.

Related papers

• Classically estimating observables of noiseless quantum circuits [36.688706661620905]
  We present a classical algorithm for estimating expectation values of arbitrary observables on most quantum circuits. For non-classically-simulable input states or observables, the expectation values can be estimated by augmenting our algorithm with classical shadows of the relevant state or observable.
  arXiv  Detail & Related papers  (2024-09-03T08:44:33Z)
• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• Inflationary complexity of thermal state [3.0346001106791323]
  We investigate inflationary complexity of the two-mode squeezed state with thermal effect for the single field inflation, modified dispersion relation, and non-trivial sound speed. Our investigations show the evolution of Krylov complexity will enhance upon some peaks factoring in the thermal effects. Our derivation for the Krylov complexity and Krylov entropy could nicely recover into the case of closed system.
  arXiv  Detail & Related papers  (2024-05-02T16:22:59Z)
• Krylov complexity as an order parameter for deconfinement phase transitions at large $N$ [0.0]
  Krylov complexity is an order parameter of confinement/deconfinement transitions in large $N$ quantum field theories. We show that Krylov complexity reflects the confinement/deconfinement phase transitions through the continuity of mass spectrum.
  arXiv  Detail & Related papers  (2024-01-09T07:04:17Z)
• Krylov complexity in the IP matrix model II [0.0]
  We study how the Krylov complexity changes from a zero-temperature oscillation to an infinite-temperature exponential growth. The IP model for any nonzero temperature shows exponential growth for the Krylov complexity even though the Green function decays by a power law in time.
  arXiv  Detail & Related papers  (2023-08-15T04:25:55Z)
• 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)
• Quantum Lyapunov exponent in dissipative systems [68.8204255655161]
  The out-of-time order correlator (OTOC) has been widely studied in closed quantum systems. We study the interplay between these two processes. The OTOC decay rate is closely related to the classical Lyapunov.
  arXiv  Detail & Related papers  (2022-11-11T17:06:45Z)
• 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)
• Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit [36.17720004582283]
  This work conducts such an exploration through the lens of learning $k$-sparse parities of $n$ bits. We find that neural networks exhibit surprising phase transitions when scaling up dataset size and running time.
  arXiv  Detail & Related papers  (2022-07-18T17:55:05Z)
• Cosmological Krylov Complexity [0.0]
  We study the Krylov complexity ($K$) from the planar/inflationary patch of the de Sitter space using the two mode squeezed state formalism. We show that the Krylov complexity ($K$) for this system is equal to average particle numbers suggesting it's relation to the volume.
  arXiv  Detail & Related papers  (2022-03-27T15:36:58Z)
• Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise [19.970633213740363]
  It has long been known that the existence of certain superquantum nonlocal correlations would cause communication complexity to collapse. We show that communication complexity collapses in any physical theory whose maximal winning probability exceeds the quantum value. We provide evidence that the 0.91 result is the best possible using a large class of proof strategies.
  arXiv  Detail & Related papers  (2018-09-25T22:39:03Z)

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.