Exact formula for geometric quantum complexity of cosmological perturbations

• URL: http://arxiv.org/abs/2512.14875v1
• Date: Tue, 16 Dec 2025 19:39:36 GMT
• Title: Exact formula for geometric quantum complexity of cosmological perturbations
• Authors: Satyaki Chowdhury, Jakub Mielczarek,
• Abstract summary: In this work, complexity is defined as the length of the minimal geodesic in a suitably constructed geometric space associated with the Lie group of relevant operators.<n>We focus on the $mathfraksu (1,1)$ Lie algebra, relevant for quantum fields evolving on homogeneous and isotropic cosmological backgrounds.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nielsen's geometric approach offers a powerful framework for quantifying the complexity of unitary transformations. In this formulation, complexity is defined as the length of the minimal geodesic in a suitably constructed geometric space associated with the Lie group of relevant operators. Despite its conceptual appeal, determining geodesic distances on Lie group manifolds is generally challenging, and existing treatments often rely on perturbative expansions in the structure constants. In this work, we circumvent these limitations by employing a finite-dimensional matrix representation of the generators, which enables an exact computation of the geodesic distance and hence a precise determination of the complexity. We focus on the $\mathfrak{su}(1,1)$ Lie algebra, relevant for quantum scalar fields evolving on homogeneous and isotropic cosmological backgrounds. The resulting expression for the complexity is applied to de Sitter spacetime as well as to asymptotically static cosmological models undergoing contraction or expansion.

Related papers

• Sparsity is Combinatorial Depth: Quantifying MoE Expressivity via Tropical Geometry [21.251058776601553]
  We present the first analysis of MoE through the lens of tropical geometry.<n>Our framework unifies the discrete geometry of the Hyperx with the continuous geometry of neural functions.
  arXiv  Detail & Related papers  (2026-02-03T07:17:38Z)
• Geometric Complexity of Quantum Channels via Unitary Dilations [0.0]
  We introduce and analyze a geometric complexity functional for families of quantum channels based on unitary dilations.<n>We quantify the loss of geometric complexity relative to a prescribed ideal closed evolution.
  arXiv  Detail & Related papers  (2026-01-02T16:28:36Z)
• Subdimensional entanglement entropy: from virtual response to mixed-state holography [13.658615899723381]
  We introduce the textitsubdimensional entanglement entropy (SEE) as a response theory characterizing many-body systems.<n>By bridging entanglement, mixed-state and categorical symmetries, holographic principles of topological order, and geometric-topological responses, SEE provides a unified framework.
  arXiv  Detail & Related papers  (2025-10-17T15:54:55Z)
• Mutual Information Free Topological Generalization Bounds via Stability [46.63069403118614]
  We introduce a novel learning theoretic framework that departs from the existing strategies.<n>We prove that the generalization error of trajectory-stable algorithms can be upper bounded in terms of TDA terms.
  arXiv  Detail & Related papers  (2025-07-09T12:03:25Z)
• Decoder ensembling for learned latent geometries [15.484595752241122]
  We show how to easily compute geodesics on the associated expected manifold. We find this simple and reliable, thereby coming one step closer to easy-to-use latent geometries.
  arXiv  Detail & Related papers  (2024-08-14T12:35:41Z)
• Topological Generalization Bounds for Discrete-Time Stochastic Optimization Algorithms [15.473123662393169]
  Deep neural networks (DNNs) show remarkable generalization properties.<n>The source of these capabilities remains elusive, defying the established statistical learning theory.<n>Recent studies have revealed that properties of training trajectories can be indicative of generalization.
  arXiv  Detail & Related papers  (2024-07-11T17:56:03Z)
• Geometric measure of quantum complexity in cosmological systems [0.0]
  An explicit formula for an upper bound on the quantum complexity of a harmonic oscillator Hamiltonian with time-dependent frequency is derived.<n>Applying to a massless test scalar field on a cosmological de Sitter background, the upper bound on complexity as a function of the scale factor exhibits a logarithmic increase on super-Hubble scales.
  arXiv  Detail & Related papers  (2024-07-01T18:00:03Z)
• Toward a physically motivated notion of Gaussian complexity geometry [0.0]
  We present a construction of a geometric notion of circuit complexity for Gaussian states. We show how to account for time-reversal symmetry breaking in measures of complexity. This establishes a first step towards building a quantitative, geometric notion of complexity.
  arXiv  Detail & Related papers  (2023-09-25T18:00:01Z)
• Spectral Convergence of Complexon Shift Operators [38.89310649097387]
  We study the transferability of Topological Signal Processing via a generalized higher-order version of graphon, known as complexon. Inspired by the graphon shift operator and message-passing neural network, we construct a marginal complexon and complexon shift operator. We prove that when a simplicial complex signal sequence converges to a complexon signal, the eigenvalues, eigenspaces, and Fourier transform of the corresponding CSOs converge to that of the limit complexon signal.
  arXiv  Detail & Related papers  (2023-09-12T08:40:20Z)
• Geometric quantum complexity of bosonic oscillator systems [0.0]
  The length of the minimal geodesic in a geometric realization of a suitable operator space provides a measure of the quantum complexity of an operation. New insights about complexity can be found in a low-dimensional setting, with the potential of systematic extensions to higher dimensions as well as interactions.
  arXiv  Detail & Related papers  (2023-07-25T18:00:07Z)
• Dynamical-Corrected Nonadiabatic Geometric Quantum Computation [9.941657239723108]
  We present an effective geometric scheme combined with a general dynamical-corrected technique. Our scheme represents a promising way to explore large-scale fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2023-02-08T16:18:09Z)
• Topological Singularity Detection at Multiple Scales [11.396560798899413]
  Real-world data exhibits distinct non-manifold structures that can lead to erroneous findings. We develop a framework that quantifies the local intrinsic dimension, and yields a Euclidicity score for assessing the'manifoldness' of a point along multiple scales. Our approach identifies singularities of complex spaces, while also capturing singular structures and local geometric complexity in image data.
  arXiv  Detail & Related papers  (2022-09-30T20:00:32Z)
• Bounds on quantum evolution complexity via lattice cryptography [0.0]
  We address the difference between integrable and chaotic motion in quantum theory as manifested by the complexity of the corresponding evolution operators. Complexity is understood here as the shortest geodesic distance between the time-dependent evolution operator and the origin within the group of unitaries.
  arXiv  Detail & Related papers  (2022-02-28T16:20:10Z)
• Unitary preparation of many body Chern insulators: Adiabatic bulk boundary correspondence [14.4034719868008]
  We prepare an out-of-equilibrium many-body Chern insulator (CI) and associated bulk-boundary correspondence unitarily. We show that a non-linear ramp may work more efficiently in approaching the topological state. We also compute the edge current in the time evolved state of the system under a semi-periodic boundary condition.
  arXiv  Detail & Related papers  (2020-05-04T13:14: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.