Quantum complexity phase transitions in monitored random circuits
- URL: http://arxiv.org/abs/2305.15475v2
- Date: Wed, 10 Jul 2024 07:38:54 GMT
- Title: Quantum complexity phase transitions in monitored random circuits
- Authors: Ryotaro Suzuki, Jonas Haferkamp, Jens Eisert, Philippe Faist,
- Abstract summary: 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.
- Score: 0.29998889086656577
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Recently, the dynamics of quantum systems that involve both unitary evolution and quantum measurements have attracted attention due to the exotic phenomenon of measurement-induced phase transitions. The latter refers to a sudden change in a property of a state of $n$ qubits, such as its entanglement entropy, depending on the rate at which individual qubits are measured. At the same time, quantum complexity emerged as a key quantity for the identification of complex behaviour in quantum many-body dynamics. In this work, we investigate the dynamics of the quantum state complexity in monitored random circuits, where $n$ qubits evolve according to a random unitary circuit and are individually measured with a fixed probability at each time step. We find that the evolution of the exact quantum state complexity undergoes a phase transition when changing the measurement rate. Below a critical measurement rate, the complexity grows at least linearly in time until saturating to a value $e^{\Omega(n)}$. Above, the complexity does not exceed $\operatorname{poly}(n)$. In our proof, we make use of percolation theory to find paths along which an exponentially long quantum computation can be run below the critical rate, and to identify events where the state complexity is reset to zero above the critical rate. We lower bound the exact state complexity in the former regime using recently developed techniques from algebraic geometry. Our results combine quantum complexity growth, phase transitions, and computation with measurements to help understand the behavior of monitored random circuits and to make progress towards determining the computational power of measurements in many-body systems.
Related papers
- Taming Quantum Time Complexity [50.10645865330582]
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) - Complexity for one-dimensional discrete time quantum walk circuits [0.0]
We compute the complexity for the mixed state density operator derived from a one-dimensional discrete-time quantum walk (DTQW)
The complexity is computed using a two-qubit quantum circuit obtained from canonically purifying the mixed state.
arXiv Detail & Related papers (2023-07-25T12:25:03Z) - Measurement-induced entanglement and teleportation on a noisy quantum
processor [105.44548669906976]
We investigate measurement-induced quantum information phases on up to 70 superconducting qubits.
We use a duality mapping, to avoid mid-circuit measurement and access different manifestations of the underlying phases.
Our work demonstrates an approach to realize measurement-induced physics at scales that are at the limits of current NISQ processors.
arXiv Detail & Related papers (2023-03-08T18:41:53Z) - Circuit Complexity through phase transitions: consequences in quantum
state preparation [0.0]
We analyze the circuit complexity for preparing ground states of quantum many-body systems.
In particular, how this complexity grows as the ground state approaches a quantum phase transition.
arXiv Detail & Related papers (2023-01-11T19:00:10Z) - 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) - Experimental Realization of a Measurement-Induced Entanglement Phase
Transition on a Superconducting Quantum Processor [0.0]
We report the realization of a measurement-induced entanglement transition on superconducting quantum processors with mid-circuit readout capability.
Our work paves the way for the use of mid-circuit measurement as an effective resource for quantum simulation on near-term quantum computers.
arXiv Detail & Related papers (2022-03-08T19:01:04Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - 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) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z) - Quantum Statistical Complexity Measure as a Signalling of Correlation
Transitions [55.41644538483948]
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions.
We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain.
We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
arXiv Detail & Related papers (2020-02-05T00:45:21Z)
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.