Krylov Complexity in Quantum Field Theory

• URL: http://arxiv.org/abs/2204.02250v4
• Date: Mon, 12 Jun 2023 12:14:23 GMT
• Title: Krylov Complexity in Quantum Field Theory
• Authors: Kiran Adhikari, Sayantan Choudhury, Abhishek Roy
• Abstract summary: We study the Krylov complexity in quantum field theory and make a connection with the holographic "Complexity equals Volume" conjecture. When Krylov basis matches with Fock basis, for several interesting settings, we observe that the Krylov complexity equals the average particle number showing that complexity scales with volume.
• Score: 0.9998361283909821
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we study the Krylov complexity in quantum field theory and make a connection with the holographic "Complexity equals Volume" conjecture. When Krylov basis matches with Fock basis, for several interesting settings, we observe that the Krylov complexity equals the average particle number showing that complexity scales with volume. Using similar formalism, we compute the Krylov complexity for free scalar field theory and find surprising similarities with holography. We also extend this framework for field theory where an inverted oscillator appears naturally and explore its chaotic behavior.

Related papers

• Semiclassical entanglement entropy for spin-field interaction [41.99844472131922]
  We study a general bipartite quantum system consisting of a spin interacting with a bosonic field.<n>Our goal is to develop a semiclassical framework to describe the entanglement dynamics between these two subsystems.
  arXiv  Detail & Related papers  (2026-01-22T14:07:56Z)
• Krylov Complexity in Canonical Quantum Cosmology [1.0195618602298682]
  We explore Krylov complexity for two exactly solvable models, one in the Wheeler-DeWitt (WDW) quantum cosmology and another in loop quantum cosmology (LQC)<n>We construct the Krylov basis analytically by applying the Lanczos algorithm and evaluate both the Krylov state and operator complexity.<n>Our work paves the way for computing Krylov complexity in more intricate quantum cosmological models, including those exhibiting phenomena such as quantum chaos.
  arXiv  Detail & Related papers  (2025-11-21T19:02:44Z)
• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• On the Complexity of Decoded Quantum Interferometry [39.951444958798014]
  We study the complexity of Decoded Quantum Interferometry (DQI), a recently proposed quantum algorithm for approximate optimization.<n>We argue that DQI is hard to classically simulate, and that the hardness comes from locating an exponentially large hidden subset.
  arXiv  Detail & Related papers  (2025-09-17T21:31:58Z)
• Krylov Complexity in Lifshitz-type Dirac Field Theories [0.0]
  We study Krylov complexity in Lifshitz-type Dirac field theories.<n>We analyze the growth and saturation behavior of Krylov complexity in different regimes.
  arXiv  Detail & Related papers  (2025-06-10T13:05:08Z)
• Local Quenches from a Krylov Perspective [0.0]
  We derive Lanczos coefficients, spread complexity, and Krylov entropies for local joining and splitting quenches in conformal field theories. Our results further demonstrate that spread complexity and Krylov entropies are powerful tools for probing non-equilibrium dynamics of interacting quantum systems.
  arXiv  Detail & Related papers  (2025-02-26T19:00:03Z)
• Operator K-complexity in DSSYK: Krylov complexity equals bulk length [0.0]
  We study the notion of complexity under time evolution in chaotic quantum systems with holographic duals. We find that Krylov complexity is given by the expectation value of a length operator acting on the Hilbert space of the theory. We conclude that evolution on the Krylov chain can equivalently be understood as a particle moving in a Morse potential.
  arXiv  Detail & Related papers  (2024-12-19T18:54:30Z)
• Krylov complexity of purification [0.0]
  purification can map mixed states into pure states and a non-unitary evolution into a unitary one by enlarging the Hilbert space.<n>We establish a connection between the complexities of mixed quantum states and their purification, proposing new inequalities among these complexities.
  arXiv  Detail & Related papers  (2024-08-01T18:00:00Z)
• 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)
• Krylov Spread Complexity of Quantum-Walks [0.0]
  The paper sheds new light on the Krylov complexity measure by exploring it in the context of continuous-time quantum-walks on graphs. A close relationship between Krylov spread complexity and the concept of limiting-distributions for quantum-walks is established. Using a graph optimization algorithm, quantum-walk graphs are constructed that have minimal and maximal long-time average Krylov $bar C$-complexity.
  arXiv  Detail & Related papers  (2023-12-31T16:06:35Z)
• Krylov Complexity of Fermionic and Bosonic Gaussian States [9.194828630186072]
  This paper focuses on emphKrylov complexity, a specialized form of quantum complexity. It offers an unambiguous and intrinsically meaningful assessment of the spread of a quantum state over all possible bases.
  arXiv  Detail & Related papers  (2023-09-19T07:32:04Z)
• Krylov complexity and chaos in quantum mechanics [0.0]
  We numerically evaluate Krylov complexity for operators and states. We find a clear correlation between variances of Lanczos coefficients and classical Lyapunov exponents. Our work provides a firm bridge between Krylov complexity and classical/quantum chaos.
  arXiv  Detail & Related papers  (2023-05-26T06:32:45Z)
• 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)
• A universal approach to Krylov State and Operator complexities [0.0]
  In our formalism, the Krylov complexity is defined in terms of the density matrix of the associated state. This unified definition of complexity enables us to extend the notion of Krylov complexity to subregion or mixed state complexities.
  arXiv  Detail & Related papers  (2022-12-20T19:00:12Z)
• Genuine multipartite entanglement and quantum coherence in an electron-positron system: Relativistic covariance [117.44028458220427]
  We analyze the behavior of both genuine multipartite entanglement and quantum coherence under Lorentz boosts. A given combination of these quantum resources is shown to form a Lorentz invariant.
  arXiv  Detail & Related papers  (2021-11-26T17:22:59Z)
• Entanglement and Complexity of Purification in (1+1)-dimensional free Conformal Field Theories [55.53519491066413]
  We find pure states in an enlarged Hilbert space that encode the mixed state of a quantum field theory as a partial trace. We analyze these quantities for two intervals in the vacuum of free bosonic and Ising conformal field theories.
  arXiv  Detail & Related papers  (2020-09-24T18:00:13Z)
• 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)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46: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.