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
- 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) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Diamond-shaped quantum circuit for real-time quantum dynamics in one
dimension [0.0]
We show that quantum many-body states can be universally represented using a quantum circuit comprising multi-qubit gates.
We also evaluate the efficiency of a quantum circuit constructed with two-qubit gates in quench dynamics for the transverse-field Ising model.
Our results reveal that a diamond-shaped quantum circuit, designed to approximate the multi-qubit gate-based quantum circuit, remarkably excels in accurately representing the long-time dynamics of the system.
arXiv Detail & Related papers (2023-11-10T07:07:54Z) - Quantum complexity phase transitions in monitored random circuits [0.29998889086656577]
We study the dynamics of the quantum state complexity in monitored random circuits.
We find that the evolution of the exact quantum state complexity undergoes a phase transition when changing the measurement rate.
arXiv Detail & Related papers (2023-05-24T18:00:11Z) - 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) - 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) - 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.