Transitions in Entanglement Complexity in Random Circuits
arXiv:2202.02648 · doi:10.22331/q-2022-09-22-818
Abstract
Entanglement is the defining characteristic of quantum mechanics. Bipartite entanglement is characterized by the von Neumann entropy. Entanglement is not just described by a number, however; it is also characterized by its level of complexity. The complexity of entanglement is at the root of the onset of quantum chaos, universal distribution of entanglement spectrum statistics, hardness of a disentangling algorithm and of the quantum machine learning of an unknown random circuit, and universal temporal entanglement fluctuations. In this paper, we numerically show how a crossover from a simple pattern of entanglement to a universal, complex pattern can be driven by doping a random Clifford circuit with gates. This work shows that quantum complexity and complex entanglement stem from the conjunction of entanglement and non-stabilizer resources, also known as magic.
References in corpus (53)
- Barren plateaus in quantum neural network training landscapes
- Black holes as mirrors: quantum information in random subsystems
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Fast Scramblers
- The distribution of the ratio of consecutive level spacings in random matrix ensembles
- Quantum Computational Supremacy
- Operator Spreading in Random Unitary Circuits
- Chaos in quantum channels
- Quantum Entanglement Growth Under Random Unitary Dynamics
- Localized shocks
- Quantum mechanical evolution towards thermal equilibrium
- Black Holes and Random Matrices
- Measuring the scrambling of quantum information
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Chaos and complexity by design
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Verified Quantum Information Scrambling
- Visual Analysis of Nonlinear Dynamical Systems: Chaos, Fractals, Self-Similarity and the Limits of Prediction
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Lieb-Robinson and the butterfly effect
- Information Scrambling in Computationally Complex Quantum Circuits
- Stabilizer Rényi entropy
- Chaos, Complexity, and Random Matrices
- Entanglement as a signature of quantum chaos
- Onset of Random Matrix Behavior in Scrambling Systems
- An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
- Barren plateaus preclude learning scramblers
- Divergence of the entanglement range in low dimensional quantum systems
- Quantum Chaos is Quantum
- Emergent irreversibility and entanglement spectrum statistics
- Catalysis and activation of magic states in fault tolerant architectures
- Efficient decoding for the Hayden-Preskill protocol
- Quantum entanglement in random physical states
- Entanglement Complexity in Quantum Many-Body Dynamics, Thermalization and Localization
- Out-of-time-order Operators and the Butterfly Effect
- Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics
- Realization of efficient quantum gates with a superconducting qubit-qutrit circuit
- Universal Spectral Correlations in the Chaotic Wave Function, and the Development of Quantum Chaos
- Entanglement, quantum randomness, and complexity beyond scrambling
- Transitions in entanglement complexity in random quantum circuits by measurements
- Conditional Mutual Information of Bipartite Unitaries and Scrambling
- Operator Spreading in Quantum Maps
- Irreversibility and Entanglement Spectrum Statistics in Quantum Circuits
- Isospectral twirling and quantum chaos
- Random Matrix Theory of the Isospectral twirling
- A Separation of Out-of-time-ordered Correlation and Entanglement
- Higher-order level spacings in random matrix theory based on Wigner's conjecture
- Untangling entanglement and chaos
- Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry
- Ensembles of physical states and random quantum circuits on graphs
- Chaos by Magic
- Entanglement and Quantum Computation
Cited by in corpus (29)
- Scalable measures of magic resource for quantum computers
- Magic-state resource theory for the ground state of the transverse-field Ising model
- Dynamical Magic Transitions in Monitored Clifford+T Circuits
- Complexity of frustration: a new source of non-local non-stabilizerness
- Stabilizer entropy dynamics after a quantum quench
- Learning efficient decoders for quasi-chaotic quantum scramblers
- Unscrambling Quantum Information with Clifford decoders
- Stabilizer entropy in non-integrable quantum evolutions
- Magic-induced computational separation in entanglement theory
- Phase transition in Stabilizer Entropy and efficient purity estimation
- Retrieving information from a black hole using quantum machine learning
- Magic of quantum hypergraph states
- Clifford Dressed Time-Dependent Variational Principle
- Stabilizer Entropy and entanglement complexity in the Sachdev-Ye-Kitaev model
- Quantum Non-Local Nonstabilizerness
- Stabilizer entropy of quantum tetrahedra
- Stabilizer Tensor Networks with Magic State Injection
- Entanglement Transitions in Unitary Circuit Games
- Spectral Properties Versus Magic Generation in -doped Random Clifford Circuits
- Entanglement complexity of the Rokhsar-Kivelson-sign wavefunctions
- Random unitaries, Robustness, and Complexity of Entanglement
- Disentangling magic states with classically simulable quantum circuits
- Designs from magic-augmented Clifford circuits
- Entanglement spectrum of matchgate circuits with universal and non-universal resources
- Rise and fall of nonstabilizerness via random measurements
- Non-stabilizerness and entanglement from cat-state injection
- Optimal quantum reservoir learning in proximity to universality
- Limits of Clifford Disentangling in Tensor Network States
- High-expressibility Quantum Neural Networks using only classical resources