Krylov Complexity in Canonical Quantum Cosmology

• URL: http://arxiv.org/abs/2511.17711v1
• Date: Fri, 21 Nov 2025 19:02:44 GMT
• Title: Krylov Complexity in Canonical Quantum Cosmology
• Authors: Meysam Motaharfar, Maxwell R. Siebersma, Parampreet Singh,
• Abstract summary: 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.
• Score: 1.0195618602298682
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We explore Krylov complexity for two exactly solvable models, one in the Wheeler-DeWitt (WDW) quantum cosmology and another in loop quantum cosmology (LQC), for a spatially flat, homogeneous, and isotropic universe sourced with a massless scalar field, which serves the role of clock. While the WDW quantization of this model cannot avoid the big bang/big crunch singularity, it is replaced by a big bounce in LQC. We construct the Krylov basis analytically by applying the Lanczos algorithm and evaluate both the Krylov state and operator complexity. In regimes where the wave function of the universe is sharply peaked, our results indicate that the Krylov complexity grows quadratically with the scalar field clock for the state and operator complexities in both the WDW quantum cosmology and LQC. We further show that operator complexity is exactly twice the state complexity in these regimes. We discuss the interpretation of the global behavior of these systems by calculating the Krylov entropy for both quantum cosmological frameworks. We observe that in LQC, the Krylov complexity and entropy remain finite at the bounce, whereas in the WDW quantum cosmology, they diverge at the big bang/crunch singularity. Our work paves the way for computing Krylov complexity in more intricate quantum cosmological models, including those exhibiting phenomena such as quantum chaos.

Related papers

• Identifying quantum coherence in quantum annealers [37.067444579637076]
  We use many-body coherent oscillations (MBCO) as a diagnostic for the identification of system-wide coherence in analog quantum simulators.<n>This work gives a general roadmap for the search for quantum coherence in noisy, large-scale quantum platforms.
  arXiv  Detail & Related papers  (2026-02-24T20:39:41Z)
• Quantum Chaos Diagnostics for Open Quantum Systems from Bi-Lanczos Krylov Dynamics [2.0603431589684518]
  In Hermitian systems, Krylov complexity has emerged as a powerful diagnostic of quantum dynamics.<n>Here, we demonstrate that Krylov complexity, computed via the bi-Lanczos algorithm, effectively identifies chaotic and integrable phases in open quantum systems.
  arXiv  Detail & Related papers  (2025-08-19T15:49:09Z)
• Quantum complexity phase transition in fermionic quantum circuits [14.723621424225973]
  We develop a general scaling theory for Krylov complexity phase transitions on quantum percolation models.<n>For non-interacting systems across diverse lattices, our scaling theory reveals that the KCPT coincides with the classical percolation transition.<n>For interacting systems, we find the KCPT develops a generic separation from the percolation transition due to the highly complex quantum many-body effects.
  arXiv  Detail & Related papers  (2025-07-29T18:00:25Z)
• 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.<n>We find that Krylov complexity is given by the expectation value of a length operator acting on the Hilbert space of the theory.<n>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 as an order parameter for quantum chaotic-integrable transitions [0.0]
  Krylov complexity has emerged as a new paradigm to characterize quantum chaos in many-body systems.<n>Recent insights have revealed that in quantum chaotic systems Krylov state complexity exhibits a distinct peak during time evolution.<n>We propose that this Krylov complexity peak (KCP) is a hallmark of quantum chaotic systems and suggest that its height could serve as an order parameter' for quantum chaos.
  arXiv  Detail & Related papers  (2024-07-24T07:32:27Z)
• Quantum coarsening and collective dynamics on a programmable simulator [27.84599956781646]
  We experimentally study collective dynamics across a (2+1)D Ising quantum phase transition.<n>By deterministically preparing and following the evolution of ordered domains, we show that the coarsening is driven by the curvature of domain boundaries.<n>We quantitatively explore these phenomena and further observe long-lived oscillations of the order parameter, corresponding to an amplitude (Higgs) mode.
  arXiv  Detail & Related papers  (2024-07-03T16:29:12Z)
• No-Regret Learning and Equilibrium Computation in Quantum Games [29.768913836823973]
  We show that no-regret algorithms converge to separable quantum Nash equilibria in time-average.<n>In the case of general multi-player quantum games, our work leads to a novel solution concept, that of the separable quantum coarse correlated equilibria.
  arXiv  Detail & Related papers  (2023-10-12T16:29:56Z)
• 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)
• Unitary Complexity and the Uhlmann Transformation Problem [39.6823854861458]
  We introduce a framework for unitary synthesis problems, including notions of reductions and unitary complexity classes.<n>We use this framework to study the complexity of transforming one entangled state into another via local operations.<n>Our framework for unitary complexity thus provides new avenues for studying the computational complexity of many natural quantum information processing tasks.
  arXiv  Detail & Related papers  (2023-06-22T17:46:39Z)
• Krylov complexity in quantum field theory, and beyond [41.99844472131922]
  We study Krylov complexity in various models of quantum field theory.<n>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)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.