Ultimate Speed Limits to the Growth of Operator Complexity
- URL: http://arxiv.org/abs/2202.05006v2
- Date: Mon, 30 Jan 2023 09:37:19 GMT
- Title: Ultimate Speed Limits to the Growth of Operator Complexity
- Authors: Niklas H\"ornedal, Nicoletta Carabba, Apollonas S. Matsoukas-Roubeas,
Adolfo del Campo
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In an isolated system, the time evolution of a given observable in the
Heisenberg picture can be efficiently represented in Krylov space. In this
representation, an initial operator becomes increasingly complex as time goes
by, a feature that can be quantified by the Krylov complexity. We introduce a
fundamental and universal limit to the growth of the Krylov complexity by
formulating a Robertson uncertainty relation, involving the Krylov complexity
operator and the Liouvillian, as generator of time evolution. We further show
the conditions for this bound to be saturated and illustrate its validity in
paradigmatic models of quantum chaos.
Related papers
- Krylov Complexity as a Probe for Chaos [0.7373617024876725]
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.
arXiv Detail & Related papers (2024-08-19T17:52:42Z) - Krylov complexity for 1-matrix quantum mechanics [0.0]
This paper investigates the notion of Krylov complexity, a measure of operator growth, within the framework of 1-matrix quantum mechanics (1-MQM)
We analyze the Lanczos coefficients derived from the correlation function, revealing their linear growth even in this integrable system.
Our findings in both ground and thermal states of 1-MQM provide new insights into the nature of complexity in quantum mechanical models.
arXiv Detail & Related papers (2024-06-28T18:00:03Z) - Computational supremacy in quantum simulation [22.596358764113624]
We show that superconducting quantum annealing processors can generate samples in close agreement with solutions of the Schr"odinger equation.
We conclude that no known approach can achieve the same accuracy as the quantum annealer within a reasonable timeframe.
arXiv Detail & Related papers (2024-03-01T19:00:04Z) - Spectral chaos bounds from scaling theory of maximally efficient
quantum-dynamical scrambling [49.1574468325115]
A key conjecture about the evolution of complex quantum systems towards an ergodic steady state, known as scrambling, is that this process acquires universal features when it is most efficient.
We develop a single- parameter scaling theory for the spectral statistics in this scenario, which embodies exact self-similarity of the spectral correlations along the complete scrambling dynamics.
We establish that scaling predictions are matched by a privileged process, and serve as bounds for other dynamical scrambling scenarios, allowing one to quantify inefficient or incomplete scrambling on all timescales.
arXiv Detail & Related papers (2023-10-17T15:41:50Z) - 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) - Growth of entanglement of generic states under dual-unitary dynamics [77.34726150561087]
Dual-unitary circuits are a class of locally-interacting quantum many-body systems.
In particular, they admit a class of solvable" initial states for which, in the thermodynamic limit, one can access the full non-equilibrium dynamics.
We show that in this case the entanglement increment during a time step is sub-maximal for finite times, however, it approaches the maximal value in the infinite-time limit.
arXiv Detail & Related papers (2022-07-29T18:20:09Z) - 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) - Krylov Localization and suppression of complexity [0.0]
We investigate Krylov complexity for the case of interacting integrable models at finite size.
We find that complexity saturation is suppressed as compared to chaotic systems.
We demonstrate this behavior for an interacting integrable model, the XXZ spin chain.
arXiv Detail & Related papers (2021-12-22T18:45:32Z) - Operator Complexity for Quantum Scalar Fields and Cosmological
Perturbations [0.0]
We study the complexity of the unitary evolution of quantum cosmological perturbations in de Sitter space.
The complexity of cosmological perturbations scales as the square root of the (exponentially) growing volume of de Sitter space.
arXiv Detail & Related papers (2021-10-15T20:37:36Z) - Time and Evolution in Quantum and Classical Cosmology [68.8204255655161]
We show that it is neither necessary nor sufficient for the Poisson bracket between the time variable and the super-Hamiltonian to be equal to unity in all of the phase space.
We also discuss the question of switching between different internal times as well as the Montevideo interpretation of quantum theory.
arXiv Detail & Related papers (2021-07-02T09:17:55Z) - Toda chain flow in Krylov space [77.34726150561087]
We show that the singularity along the imaginary axis, which is a generic behavior for quantum non-integrable many-body system, is due to delocalization in Krylov space.
arXiv Detail & Related papers (2019-12-27T16:40:10Z)
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.