Irreversibility and Entanglement Spectrum Statistics in Quantum Circuits

Abstract

We show that in a quantum system evolving unitarily under a stochastic quantum circuit the notions of irreversibility, universality of computation, and entanglement are closely related. As the state evolves from an initial product state, it gets asymptotically maximally entangled. We define irreversibility as the failure of searching for a disentangling circuit using a Metropolis-like algorithm. We show that irreversibility corresponds to Wigner-Dyson statistics in the level spacing of the entanglement eigenvalues, and that this is obtained from a quantum circuit made from a set of universal gates for quantum computation. If, on the other hand, the system is evolved with a non-universal set of gates, the statistics of the entanglement level spacing deviates from Wigner-Dyson and the disentangling algorithm succeeds. These results open a new way to characterize irreversibility in quantum systems.

arXiv comment15 pages, 4 figures

References in corpus (7)

• Localization of interacting fermions at high temperature
• The foundations of statistical mechanics from entanglement: Individual states vs. averages
• The distribution of the ratio of consecutive level spacings in random matrix ensembles
• Quantum tensor product structures are observable-induced
• Emergent irreversibility and entanglement spectrum statistics
• Quantum entanglement in random physical states
• How complex is the quantum motion?

Cited by in corpus (33)

• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Two-component Structure in the Entanglement Spectrum of Highly Excited States
• Probing symmetries of quantum many-body systems through gap ratio statistics
• Entanglement Complexity in Quantum Many-Body Dynamics, Thermalization and Localization
• Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics
• Complexity of frustration: a new source of non-local non-stabilizerness
• Transitions in Entanglement Complexity in Random Circuits
• Quantum State Complexity in Computationally Tractable Quantum Circuits
• Quantum and classical dynamics of a three-mode absorption refrigerator
• 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
• Universal fluctuations around typicality for quantum ergodic systems
• Entanglement of random hypergraph states
• Signatures of information scrambling in the dynamics of the entanglement spectrum
• Scrambling via Braiding of Nonabelions
• Entanglement Transitions in Unitary Circuit Games
• Entanglement complexity of the Rokhsar-Kivelson-sign wavefunctions
• Efficient MPS representations and quantum circuits from the Fourier modes of classical image data
• The principle of majorization: application to random quantum circuits
• Quantum Information Scrambling Through a High-Complexity Operator Mapping
• Detecting high-dimensional entanglement in cold-atom quantum simulators
• Random unitaries, Robustness, and Complexity of Entanglement
• Disentangling magic states with classically simulable quantum circuits
• Entanglement spectrum of matchgate circuits with universal and non-universal resources
• Entangled quantum cellular automata, physical complexity, and Goldilocks rules
• Machine Learning Entanglement Freedom Or: How I Learned to Stop Worrying and Love Linear Regression
• Bridging Classical and Quantum Information Scrambling with the Operator Entanglement Spectrum
• Optimal quantum reservoir learning in proximity to universality
• Quantum Algorithms for State Preparation and Data Classification based on Stabilizer Codes