Convergence Conditions for Random Quantum Circuits
arXiv:quant-ph/0503210 · doi:10.1103/PhysRevA.72.060302
Abstract
Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudo-random ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group and describe how the rate of convergence may be calculated for specific applications.
4 pages (revtex), comments welcome. v2: reference added, title changed; v3: published version, minor changes, references updated
References in corpus (5)
Cited by in corpus (70)
- Quantum discord and the power of one qubit
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Scalable Noise Estimation with Random Unitary Operators
- Chaos and complexity by design
- Towards the fast scrambling conjecture
- Random Quantum Circuits are Approximate 2-designs
- Local random quantum circuits are approximate polynomial-designs
- On the role of entanglement and correlations in mixed-state quantum computation
- Onset of Random Matrix Behavior in Scrambling Systems
- Efficient Generation of Generic Entanglement
- On barren plateaus and cost function locality in variational quantum algorithms
- Exact emergent quantum state designs from quantum chaotic dynamics
- Architectures for quantum simulation showing a quantum speedup
- Decoupling with random quantum circuits
- Random Quantum Operations
- Convergence rates for arbitrary statistical moments of random quantum circuits
- Quantum chaos in the Brownian SYK model with large finite : OTOCs and tripartite information
- A Random Unitary Circuit Model for Black Hole Evaporation
- Exact convergence times for generation of random bipartite entanglement
- Emergence of typical entanglement in two-party random processes
- Typical entanglement of stabilizer states
- Unitary designs from statistical mechanics in random quantum circuits
- Quantum Circuit Cutting with Maximum Likelihood Tomography
- Entanglement of random vectors
- Scrambling speed of random quantum circuits
- Optimal quantum tomography for states, measurements, and transformations
- Multi-qubit Randomized Benchmarking Using Few Samples
- Classical simulation of boson sampling based on graph structure
- Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
- Optimal two-qubit gate for generation of random bipartite entanglement
- Efficient Simulation of Random Quantum States and Operators
- Efficiency of Producing Random Unitary Matrices with Quantum Circuits
- Parameters of Pseudo-Random Quantum Circuits
- Fastest local entanglement scrambler, multistage thermalization, and a non-Hermitian phantom
- Efficient algorithm for multi-qudit twirling for ensemble quantum computation
- Relaxation due to random collisions with a many-qudit environment
- Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
- Complete Hilbert-Space Ergodicity in Quantum Dynamics of Generalized Fibonacci Drives
- Entanglement dynamics and relaxation in a few qubit system interacting with random collisions
- Ensembles of physical states and random quantum circuits on graphs
- Short random circuits define good quantum error correcting codes
- Quantum pseudo-randomness from cluster-state quantum computation
- Stringy effects in scrambling
- Local random quantum circuits are approximate polynomial-designs - numerical results
- Operator growth in random quantum circuits with symmetry
- Designs via Free Probability
- Quantum leakage detection using a model-independent dimension witness
- Derandomizing quantum circuits with measurement based unitary designs
- Random circuits by measurements on weighted graph states
- On the negativity of random pure states
- Observation of entanglement negativity transition of pseudo-random mixed states
- Impact of the form of weighted networks on the quantum extreme reservoir computation
- Pseudo-randomness and Learning in Quantum Computation
- Distribution of interference in random quantum algorithms
- Randomized Benchmarking of Clifford Operators
- Unitary k-designs from random number-conserving quantum circuits
- Designs from Local Random Quantum Circuits with SU(d) Symmetry
- Structural change in multipartite entanglement sharing: a random matrix approach
- Exploring Shallow-Depth Boson Sampling: Towards Scalable Quantum Supremacy
- Quantum algorithms for group convolution, cross-correlation, and equivariant transformations
- Monitoring-induced Entanglement Entropy and Sampling Complexity
- Quantum circuit for three-qubit random states
- Generation of Pseudo-Random Quantum States on Actual Quantum Processors
- Effective field theory of random quantum circuits
- Pseudo-Random Circuits from Clifford Plus T-Gates
- Fidelity decay and error accumulation in random quantum circuits
- Studies on the Role of Entanglement in Mixed-state Quantum Computation
- Sampling and the complexity of nature
- Shallow quantum circuit for generating extremely low-entangled approximate state designs
- Holographic Interpretation of Relative State Complexity