Quantum complexity phase transitions in monitored random circuits
arXiv:2305.15475 · doi:10.22331/q-2025-02-10-1627
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 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 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 . Above, the complexity does not exceed . 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.
35 pages
References in corpus (35)
- Black holes as mirrors: quantum information in random subsystems
- Complexity and Shock Wave Geometries
- Matrix product states represent ground states faithfully
- Efficient quantum state tomography
- Random Quantum Circuits
- Evenly distributed unitaries: on the structure of unitary designs
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Quantum chaos and the complexity of spread of states
- Measurement and entanglement phase transitions in all-to-all quantum circuits, on quantum trees, and in Landau-Ginsburg theory
- Linear growth of quantum circuit complexity
- SYK meets non-Hermiticity II: measurement-induced phase transition
- Entanglement and charge-sharpening transitions in U(1) symmetric monitored quantum circuits
- Fate of measurement-induced phase transition in long-range interactions
- Ergodic and non-ergodic dual-unitary quantum circuits with arbitrary local Hilbert space dimension
- Measurement as a shortcut to long-range entangled quantum matter
- Does Complexity Equal Anything?
- Hierarchy of topological order from finite-depth unitaries, measurement and feedforward
- Scrambling in Random Unitary Circuits: Exact Results
- Quantum Circuits assisted by LOCC: Transformations and Phases of Matter
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Long-range entanglement from measuring symmetry-protected topological phases
- Random quantum circuits are approximate unitary -designs in depth
- Phase transition in magic with random quantum circuits
- Computational power of one- and two-dimensional dual-unitary quantum circuits
- Entangling power and quantum circuit complexity
- Coherence requirements for quantum communication from hybrid circuit dynamics
- Phase transition of computational power in the resource states for one-way quantum computation
- Exact dynamics in dual-unitary quantum circuits with projective measurements
- Holographic measurement and bulk teleportation
- Resource theory of quantum uncomplexity
- Ultrafast Entanglement Dynamics in Monitored Quantum Circuits
- Short Proofs of Linear Growth of Quantum Circuit Complexity
- On the moments of random quantum circuits and robust quantum complexity
- Characterizing quantum pseudorandomness by machine learning
- Complexity phase transitions in instantaneous quantum polynomial-time circuits