Saturation and recurrence of quantum complexity in random local quantum dynamics

• URL: http://arxiv.org/abs/2205.09734v2
• Date: Thu, 29 Feb 2024 13:32:54 GMT
• Title: Saturation and recurrence of quantum complexity in random local quantum dynamics
• Authors: Micha{\l} Oszmaniec, Marcin Kotowski, Micha{\l} Horodecki, Nicholas Hunter-Jones
• Abstract summary: 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.
• Score: 5.803309695504831
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing -- in studying the dynamics of quantum many-body systems and the long-time properties of AdS black holes. In this context Brown and Susskind \cite{BrownSusskind17} 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. In this work we prove the saturation and recurrence of complexity in two models of chaotic time evolutions based on (i) random local quantum circuits and (ii) stochastic local Hamiltonian evolution. Our results advance an understanding of the long-time behaviour of chaotic quantum systems and could shed light on the physics of black hole interiors. From a technical perspective our results are based on establishing new quantitative connections between the Haar measure and high-degree approximate designs, as well as the fact that random quantum circuits of sufficiently high depth converge to approximate designs.

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)
• An Efficient Classical Algorithm for Simulating Short Time 2D Quantum Dynamics [2.891413712995642]
  We introduce an efficient classical algorithm for simulating short-time dynamics in 2D quantum systems. Our results reveal the inherent simplicity in the complexity of short-time 2D quantum dynamics. This work advances our understanding of the boundary between classical and quantum computation.
  arXiv  Detail & Related papers  (2024-09-06T09:59:12Z)
• 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)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Hilbert-Space Ergodicity in Driven Quantum Systems: Obstructions and Designs [0.0]
  We study a notion of quantum ergodicity for closed systems with time-dependent Hamiltonians. We show that statistical pseudo-randomness can already be achieved by a quantum system driven with a single frequency.
  arXiv  Detail & Related papers  (2024-02-09T19:00:00Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48: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)
• Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator [41.74498230885008]
  We demonstrate a programmable quantum simulator based on deterministically prepared two-dimensional arrays of neutral atoms. We benchmark the system by creating and characterizing high-fidelity antiferromagnetically ordered states. We then create and study several new quantum phases that arise from the interplay between interactions and coherent laser excitation.
  arXiv  Detail & Related papers  (2020-12-22T19:00:04Z)
• Reinforcement Learning for Digital Quantum Simulation [0.0]
  We introduce a reinforcement learning algorithm to build optimized quantum circuits for digital quantum simulation. We consistently obtain quantum circuits that reproduce physical observables with as little as three entangling gates for long times and large system sizes.
  arXiv  Detail & Related papers  (2020-06-29T18:00: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.