Exact spectral gaps of random one-dimensional quantum circuits
arXiv:2408.11201 · doi:10.1103/8p5j-mxhh
Abstract
The spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. When studying spectral gaps, it is common to bound these quantities using tools from statistical mechanics or via quantum information-based inequalities. By focusing on the second moment of one-dimensional unitary circuits where nearest neighboring gates act on sets of qudits (with open and closed boundary conditions), we show that one can exactly compute the associated spectral gaps. Indeed, having access to their functional form allows us to prove several important results, such as the fact that the spectral gap for closed boundary condition is exactly the square of the gap for open boundaries, as well as improve on previously known bounds for approximate design convergence. Finally, we verify our theoretical results by numerically computing the spectral gap for systems of up to 70 qubits, as well as comparing them to gaps of random orthogonal and symplectic circuits.
10 + 6 pages, 3 figures, updated to published version
References in corpus (32)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Barren plateaus in quantum neural network training landscapes
- Characterizing Quantum Supremacy in Near-Term Devices
- Strong quantum computational advantage using a superconducting quantum processor
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Operator Spreading in Random Unitary Circuits
- Measurement-Induced Phase Transitions in the Dynamics of Entanglement
- Quantum Zeno Effect and the Many-body Entanglement Transition
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Quantum Entanglement Growth Under Random Unitary Dynamics
- Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
- Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws
- Measurement-induced criticality in random quantum circuits
- Random Quantum Circuits are Approximate 2-designs
- Local random quantum circuits are approximate polynomial-designs
- Provably efficient machine learning for quantum many-body problems
- Barren Plateaus in Variational Quantum Computing
- A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
- Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
- Approximate unitary -designs by short random quantum circuits using nearest-neighbor and long-range gates
- Exact emergent quantum state designs from quantum chaotic dynamics
- Convergence rates for arbitrary statistical moments of random quantum circuits
- Random quantum circuits are approximate unitary -designs in depth
- Efficient unitary designs with nearly time-independent Hamiltonian dynamics
- Symbolic integration with respect to the Haar measure on the unitary group
- The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
- Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
- Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
- Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows
- Computing exact moments of local random quantum circuits via tensor networks
- Quantum neural networks form Gaussian processes
- Architectures and random properties of symplectic quantum circuits