Krylov Complexity of Open Quantum Systems: From Hard Spheres to Black Holes

• URL: http://arxiv.org/abs/2308.10945v2
• Date: Sun, 3 Dec 2023 21:10:10 GMT
• Title: Krylov Complexity of Open Quantum Systems: From Hard Spheres to Black Holes
• Authors: Vyshnav Mohan
• Abstract summary: We analytically compute the Krylov complexity of a slowly leaking hard-sphere gas using Berry's conjecture. We then connect it to the holographic complexity of a $d+1$- evaporating black hole using the Complexity=Volume proposal. We model the black hole spacetime by stitching together a sequence of static Schwarzschild patches across incoming negative energy null shock waves.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We examine the complexity of quasi-static chaotic open quantum systems. As a prototypical example, we analytically compute the Krylov complexity of a slowly leaking hard-sphere gas using Berry's conjecture. We then connect it to the holographic complexity of a $d+1$-dimensional evaporating black hole using the Complexity=Volume proposal. We model the black hole spacetime by stitching together a sequence of static Schwarzschild patches across incoming negative energy null shock waves. Under certain identification of parameters, we find the late time complexity growth rate during each quasi-static equilibrium to be the same in both systems.

Related papers

• Quantum complexity and localization in random quantum circuits [0.0]
  We study complexity in random quantum circuits with and without measurements. For $N$ qubits without measurements, the saturation value scales as $2N-1$, and the saturation time scales as $2N$. We observe that complexity acts as a novel probe of Anderson localization and many-body localization.
  arXiv  Detail & Related papers  (2024-09-05T16:10:54Z)
• 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)
• 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)
• Learning marginals suffices! [14.322753787990036]
  We investigate the relationship between the sample complexity of learning a quantum state and the circuit complexity of the state. We show that learning its marginals for the quantum state with low circuit complexity suffices for state tomography.
  arXiv  Detail & Related papers  (2023-03-15T21:09:29Z)
• The Complexity of Learning (Pseudo)random Dynamics of Black Holes and Other Chaotic Systems [0.8122270502556374]
  We prove that quantum algorithms cannot accurately predict bounded (pseudo)random unitary dynamics. We use the common simplification of modeling black holes and more generally chaotic systems via (pseudo)random dynamics.
  arXiv  Detail & Related papers  (2023-02-21T21:26:25Z)
• Saturation and recurrence of quantum complexity in random local quantum dynamics [5.803309695504831]
  Quantum complexity is a measure of the minimal number of elementary operations required to prepare a given state or unitary channel. Brown and Susskind conjectured that the complexity of a chaotic quantum system grows linearly in time up to times exponential in the system size, saturating at a maximal value, and remaining maximally complex until undergoing recurrences at doubly-exponential times.
  arXiv  Detail & Related papers  (2022-05-19T17:42:31Z)
• Quantum Computational Complexity -- From Quantum Information to Black Holes and Back [0.0]
  Quantum computational complexity was suggested as a new entry in the holographic dictionary. We show how it can be used to define complexity for generic quantum systems. We highlight the relation between complexity, chaos and scrambling in chaotic systems.
  arXiv  Detail & Related papers  (2021-10-27T18:00:12Z)
• Straddling-gates problem in multipartite quantum systems [20.428960719376164]
  We study a variant of quantum circuit complexity, the binding complexity. We show that any $m$partite Schmidt decomposable state has binding complexity linear in $m$, which hints its multi-separable property.
  arXiv  Detail & Related papers  (2021-10-13T16:28:12Z)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Quantum aspects of chaos and complexity from bouncing cosmology: A study with two-mode single field squeezed state formalism [0.0]
  This paper is devoted to the study of out-of-equilibrium aspects and quantum chaos appearing in the universe. We use the $Out-of-Time Ordered correlation (OTOC)$ functions for probing the random behaviour of the universe both at early and the late times.
  arXiv  Detail & Related papers  (2020-09-08T16:10:52Z)
• Jumptime unraveling of Markovian open quantum systems [68.8204255655161]
  We introduce jumptime unraveling as a distinct description of open quantum systems. quantum jump trajectories emerge, physically, from continuous quantum measurements. We demonstrate that quantum trajectories can also be ensemble-averaged at specific jump counts.
  arXiv  Detail & Related papers  (2020-01-24T09:35:32Z)

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.