Cosmological complexity of the modified dispersion relation

• URL: http://arxiv.org/abs/2309.01595v3
• Date: Thu, 23 May 2024 07:51:09 GMT
• Title: Cosmological complexity of the modified dispersion relation
• Authors: Tao Li, Lei-Hua Liu,
• Abstract summary: The curvature perturbation of the scalar field is identified with the two-mode squeezed state. Our numeric indicates that the complexity of the modified dispersion relation will have a non-linear pattern after the horizon exits. Since the modified dispersion relation can be dubbed as the consequences of various frameworks of quantum gravity, it could be applicable to these frameworks.
• Score: 3.0346001106791323
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Complexity will be more and more essential in high-energy physics. It is naturally extended into the very early universe. Considering the universe as a quantum chaotic system, the curvature perturbation of the scalar field is identified with the two-mode squeezed state. By solving the Schr$\ddot{o}$dinger equation, one can obtain the numerical solutions of the angle parameter and squeezing parameter. The solution of the squeezing parameter mainly determines the evolution of complexity. Our numeric indicates that the complexity of the modified dispersion relation will have a non-linear pattern after the horizon exits. Meanwhile, its corresponding Lyapunov index is also larger compared with the standard case. During the inflationary period, the complexity will irregularly oscillate and its scrambling time is also shorter compared with the standard case. Since the modified dispersion relation can be dubbed as the consequences of various frameworks of quantum gravity, it could be applicable to these frameworks. Finally, one can expect the framework of quantum gravity will lead to the fruitful evolution of complexity, which guides us in distinguishing various inflationary models.

Related papers

• Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms [24.890270804373824]
  This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions. We show that quantum algorithms constructed using Schr"odingerisation exhibit acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
  arXiv  Detail & Related papers  (2024-11-17T08:15:37Z)
• Quantum Circuits for the heat equation with physical boundary conditions via Schrodingerisation [33.76659022113328]
  This paper explores the explicit design of quantum circuits for quantum simulation of partial differential equations (PDEs) with physical boundary conditions. We present two methods for handling the inhomogeneous terms arising from time-dependent physical boundary conditions. We then apply the quantum simulation technique from [CJL23] to transform the resulting non-autonomous system to an autonomous system in one higher dimension.
  arXiv  Detail & Related papers  (2024-07-22T03:52:14Z)
• Spread complexity and quantum chaos for periodically driven spin chains [0.0]
  We study the dynamics of spread complexity for quantum maps using the Arnoldi iterative procedure. We find distinctive behaviour of the Arnoldi coefficients and spread complexity for regular vs. chaotic dynamics.
  arXiv  Detail & Related papers  (2024-05-25T11:17:43Z)
• Taming Quantum Time Complexity [45.867051459785976]
  We show how to achieve both exactness and thriftiness in the setting of time complexity. We employ a novel approach to the design of quantum algorithms based on what we call transducers.
  arXiv  Detail & Related papers  (2023-11-27T14:45:19Z)
• The Complexity of Being Entangled [0.0]
  Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations. For a bipartite system, we investigate binding complexity, which corresponds to norms in which gates acting on a single subsystem are free of cost.
  arXiv  Detail & Related papers  (2023-11-07T19:00:02Z)
• Geometric relative entropies and barycentric Rényi divergences [16.385815610837167]
  monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure. We show that monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure.
  arXiv  Detail & Related papers  (2022-07-28T17:58:59Z)
• Quantum dynamics corresponding to chaotic BKL scenario [62.997667081978825]
  Quantization smears the gravitational singularity avoiding its localization in the configuration space. Results suggest that the generic singularity of general relativity can be avoided at quantum level.
  arXiv  Detail & Related papers  (2022-04-24T13:32:45Z)
• 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)
• Complete entropic inequalities for quantum Markov chains [17.21921346541951]
  We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional algebra satisfies a modified log-Sobolev inequality. We also establish the first general approximateization property of relative entropy.
  arXiv  Detail & Related papers  (2021-02-08T11:47:37Z)
• Quantum Circuit Complexity of Primordial Perturbations [0.0]
  We study the quantum circuit complexity of cosmological perturbations in different models of the early universe. Our analysis serves to highlight how different models achieve the same end result for the perturbations via different routes.
  arXiv  Detail & Related papers  (2020-12-09T08:30:07Z)
• Aspects of The First Law of Complexity [0.0]
  We investigate the first law of complexity proposed in arXiv:1903.04511, i.e., the variation of complexity when the target state is perturbed. Based on Nielsen's geometric approach to quantum circuit complexity, we find the variation only depends on the end of the optimal circuit.
  arXiv  Detail & Related papers  (2020-02-13T21:15:57Z)

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.