The principle of majorization: application to random quantum circuits
arXiv:2102.09999 · doi:10.1103/PhysRevA.104.012602
Abstract
We test the principle of majorization [J. I. Latorre and M. A. Martin-Delgado, Phys. Rev. A 66, 022305 (2002)] in random circuits. Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. The studied families are: {CNOT, H, T}, {CNOT, H, NOT}, {CNOT, H, S} (Clifford), matchgates, and IQP (instantaneous quantum polynomial-time). We verified that all the families of circuits satisfy on average the principle of decreasing majorization. In most cases the asymptotic state (number of gates going to infinity) behaves like a random vector. However, clear differences appear in the fluctuations of the Lorenz curves associated to asymptotic states. The fluctuations of the Lorenz curves discriminate between universal and non-universal classes of random quantum circuits, and they also detect the complexity of some non-universal but not classically efficiently simulatable quantum random circuits. We conclude that majorization can be used as a indicator of complexity of quantum dynamics, as an alternative to, e.g., entanglement spectrum and out-of-time-order correlators (OTOCs).
arXiv comment8 pages, 4 figures
References in corpus (39)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A bound on chaos
- Improved Simulation of Stabilizer Circuits
- The distribution of the ratio of consecutive level spacings in random matrix ensembles
- Quantum Computational Supremacy
- Fundamental limitations for quantum and nano thermodynamics
- Maximal work extraction from quantum systems
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Measuring out-of-time-order correlators on a nuclear magnetic resonance quantum simulator
- The resource theory of informational nonequilibrium in thermodynamics
- Randomizing quantum states: Constructions and applications
- Classical simulation of noninteracting-fermion quantum circuits
- Local random quantum circuits are approximate polynomial-designs
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Reversible transformations from pure to mixed states, and the unique measure of information
- Matchgates and classical simulation of quantum circuits
- The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
- Instantaneous Quantum Computation
- Decoupling with random quantum circuits
- Emergent irreversibility and entanglement spectrum statistics
- A measure of majorisation emerging from single-shot statistical mechanics
- Entanglement Complexity in Quantum Many-Body Dynamics, Thermalization and Localization
- Efficient classical simulation of matchgate circuits with generalized inputs and measurements
- Quantum Commuting Circuits and Complexity of Ising Partition Functions
- Quantum circuits for maximally entangled states
- Irreversibility and Entanglement Spectrum Statistics in Quantum Circuits
- Diagonal quantum circuits: their computational power and applications
- Work Cost of Thermal Operations in Quantum and Nano Thermodynamics
- The Majorization Arrow in Quantum Algorithm Design
- Further extensions of Clifford circuits and their classical simulation complexities
- Systematic Analysis of Majorization in Quantum Algorithms
- Commuting quantum circuits: efficient classical simulations versus hardness results
- Majorization and the time complexity of linear optical networks
- Observation of Majorization Principle for quantum algorithms via 3-D integrated photonic circuits
- Natural majorization of the Quantum Fourier Transformation in phase-estimation algorithms
- Majorization in General Grover's Algorithms: Efficient vs Non-efficient cases
- Majorization in Quantum Adiabatic Algorithms