Unitary Designs of Symmetric Local Random Circuits
arXiv:2408.13472 · doi:10.1103/PhysRevLett.134.180404
Abstract
We have established the method of characterizing the unitary design generated by a symmetric local random circuit. Concretely, we have shown that the necessary and sufficient condition for the circuit asymptotically forming a t-design is given by simple integer optimization for general symmetry and locality. By using the result, we explicitly give the maximal order of unitary design under the , U(1), and SU(2) symmetries for general locality. This work reveals the relation between the fundamental notions of symmetry and locality in terms of randomness.
8 pages, 1 figure
References in corpus (29)
- Randomized Benchmarking of Quantum Gates
- Reference frames, superselection rules, and quantum information
- Robust randomized benchmarking of quantum processes
- Chaos, Complexity, and Random Matrices
- Exploiting symmetry in variational quantum machine learning
- Group-Invariant Quantum Machine Learning
- Theory for Equivariant Quantum Neural Networks
- Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
- Solvable model of deep thermalization with distinct design times
- Building spatial symmetries into parameterized quantum circuits for faster training
- Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ansätze
- Critical phase and spin sharpening in SU(2)-symmetric monitored quantum circuits
- Quantum circuits for exact unitary -designs and applications to higher-order randomized benchmarking
- Provably Trainable Rotationally Equivariant Quantum Machine Learning
- Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries
- Black holes as clouded mirrors: the Hayden-Preskill protocol with symmetry
- Approximate symmetries and quantum error correction
- Characterizing symmetry-protected thermal equilibrium by work extraction
- Unraveling the emergence of quantum state designs in systems with symmetry
- Rotationally-Invariant Circuits: Universality with the exchange interaction and two ancilla qubits
- Charge transport, information scrambling and quantum operator-coherence in a many-body system with U(1) symmetry
- Clifford Group and Unitary Designs under Symmetry
- Efficient Local Classical Shadow Tomography with Number Conservation
- Quantum error-correcting codes with a covariant encoding
- Theory of Quantum Circuits with Abelian Symmetries
- Designs from Local Random Quantum Circuits with SU(d) Symmetry
- Symmetry-invariant quantum machine learning force fields
- Characterization of randomness in quantum circuits of continuous gate sets
- Approximate quantum error correction, covariance symmetry, and their relation
Cited by in corpus (7)
- Characterization of randomness in quantum circuits of continuous gate sets
- Non-Haar random circuits form unitary designs as fast as Haar random circuits
- Non-Universality from Conserved Superoperators in Unitary Circuits
- More global randomness from less-random local gates
- Dynamical cluster-based strategy for improving tensor network algorithms in quantum circuit simulations
- Comprehensive Study on Heisenberg-limited Quantum Algorithms for Multiple Observables Estimation
- Entanglement structure for finite system under dual-unitary dynamics