Primordial Gravitational Wave Circuit Complexity

• URL: http://arxiv.org/abs/2108.10334v3
• Date: Mon, 6 Mar 2023 15:11:18 GMT
• Title: Primordial Gravitational Wave Circuit Complexity
• Authors: Kiran Adhikari, Sayantan Choudhury, Hardey N. Pandya, Rohan Srivastava
• Abstract summary: Quantum information theoretic concepts, such as entanglement entropy, and complexity are playing a pivotal role to understand the dynamics of quantum system. This paper is devoted in studying quantum circuit complexity of PGW for various cosmological models.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this article, we investigate various physical implications of quantum circuit complexity using squeezed state formalism of Primordial Gravitational Waves (PGW). Recently quantum information theoretic concepts, such as entanglement entropy, and complexity are playing a pivotal role to understand the dynamics of quantum system even in the diverse fields such as, high energy physics and cosmology. This paper is devoted in studying quantum circuit complexity of PGW for various cosmological models, such as de Sitter, inflation, radiation, reheating, matter, bouncing, cyclic and black hole gas model etc. We compute complexity measure using both Covariance and Nielsen's wave function method for three different choices of quantum initial vacua: Motta-Allen, $\alpha$ and Bunch-Davies. Besides computing circuit complexity, we have also computed Von-Neumann entanglement entropy. By making the comparison of complexity with entanglement entropy, we are able to probe various features regarding the dynamics of evolution for different cosmological models. Because entanglement entropy is independent of the squeezing angle, we are able to understand more details of the system using Nielsen's measure of complexity which is dependent on both squeezing parameter and angle. This implies that quantum complexity could indeed be a useful probe to study quantum features in cosmological scale. Quantum complexity is also becoming a powerful technique to understand the chaotic behaviour and random fluctuations of quantum fields. Using the growth of complexity, we are able to compute quantum Lyapunov exponent for various cosmological models and comment on it's chaotic nature.

Related papers

• Benchmarking quantum chaos from geometric complexity [0.23436632098950458]
  We consider a new method to study geometric complexity for interacting non-Gaussian quantum mechanical systems. Within some limitations, geometric complexity can indeed be a good indicator of quantum chaos.
  arXiv  Detail & Related papers  (2024-10-24T14:04:58Z)
• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• 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)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Unitary Complexity and the Uhlmann Transformation Problem [41.67228730328207]
  We introduce a framework for unitary synthesis problems, including notions of reductions and unitary complexity classes. We use this framework to study the complexity of transforming one entangled state into another via local operations. 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)
• On the sampling complexity of open quantum systems [0.0]
  We show how the complexity of the underlying quantum process corresponds to the complexity of the associated family of master equations for the dynamics. Our results pave the way for studying open quantum systems from a complexity-theoretic perspective.
  arXiv  Detail & Related papers  (2022-09-22T09:09:28Z)
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations [55.41644538483948]
  We study strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. We find that the gate complexity using second order Trotter- Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing.
  arXiv  Detail & Related papers  (2022-07-07T09:39:40Z)
• How smooth is quantum complexity? [0.0]
  The "quantum complexity" of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. In this paper, we present a unified perspective on various notions of quantum complexity, viewed as functions on the space of unitary operators.
  arXiv  Detail & Related papers  (2021-06-15T17:58:08Z)
• Circuit Complexity as a novel probe of Quantum Entanglement: A study with Black Hole Gas in arbitrary dimensions [0.0]
  We investigate the quantum circuit complexity and entanglement entropy in the recently studied black hole gas framework. We compute the various complexity measures and study the evolution of these complexities by following two different prescriptions. We observe that irrespective of the spatial dimension, the equilibrium temperature depends quartically on entanglement entropy.
  arXiv  Detail & Related papers  (2021-04-28T18:00:10Z)
• 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)
• Quantum State Complexity in Computationally Tractable Quantum Circuits [0.0]
  We discuss a special class of numerically tractable quantum circuits, known as quantum automaton circuits. We show that automaton wave functions have high quantum state complexity. We present evidence of a linear growth of design complexity in local quantum circuits.
  arXiv  Detail & Related papers  (2020-09-11T16:25:11Z)

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.