SU(d)-Symmetric Random Unitaries: Quantum Scrambling, Error Correction, and Machine Learning
arXiv:2309.16556 · doi:10.1038/s41534-025-01045-6
Abstract
Quantum information processing in the presence of continuous symmetry is of wide importance and exhibits many novel physical and mathematical phenomena. SU(d) is a continuous group of particular interest since it represents a fundamental type of non-Abelian symmetry and also plays a vital role in quantum computation. Here, we explicate three particularly interesting applications of symmetric random unitaries in diverse contexts ranging from physics to quantum computing: information scrambling with non-Abelian conserved quantities, covariant quantum error correcting random codes, and geometric quantum machine learning. First, we show that, in the presence of SU(d) symmetry, the local conserved quantities would exhibit residual values even at which decays as under local Pauli basis for qubits and under symmetric basis for general qudits with respect to the system size, in contrast to O(1/n) decay for U(1) case and the exponential decay for no-symmetry case in the sense of out-of-time ordered correlator. Second, we show that SU(d)-symmetric unitaries can be used to construct asymptotically optimal (in the sense of saturating the fundamental limits on the code error, or the approximate Eastin--Knill theorems) SU(d)-covariant codes that encode any constant number of logical qudits, extending [Kong & Liu; PRXQ 3, 020314 (2022)]. Finally, we derive an overpartameterization threshold via the quantum neural tangent kernel required for exponential convergence guarantee of generic ansatz for geometric quantum machine learning, which reveals that the number of parameters required scales only with the dimension of desired subspaces rather than the entire Hilbert space. Our work invites further research on quantum information with continuous symmetries, where the mathematical tools developed in this work are expected to be useful.
9+38 pages
References in corpus (57)
- Black holes as mirrors: quantum information in random subsystems
- Randomized Benchmarking of Quantum Gates
- Universal Quantum Computation with the Exchange Interaction
- Quantum Extremal Surfaces: Holographic Entanglement Entropy beyond the Classical Regime
- The entropy of bulk quantum fields and the entanglement wedge of an evaporating black hole
- Power of data in quantum machine learning
- Chaos in quantum channels
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Random Quantum Circuits
- Holographic duality from random tensor networks
- Chaos and complexity by design
- Restrictions on Transversal Encoded Quantum Gate Sets
- Towards the fast scrambling conjecture
- Evenly distributed unitaries: on the structure of unitary designs
- Verified Quantum Information Scrambling
- Exploiting symmetry in variational quantum machine learning
- Preparing random states and benchmarking with many-body quantum chaos
- Group-Invariant Quantum Machine Learning
- Entangling Bosonic Modes via an Engineered Exchange Interaction
- A general framework for randomized benchmarking
- General conditions for approximate quantum error correction and near-optimal recovery channels
- NetKet: A Machine Learning Toolkit for Many-Body Quantum Systems
- Scrambling Dynamics and Out-of-Time Ordered Correlators in Quantum Many-Body Systems: a Tutorial
- Restricted Boltzmann Machines for Quantum States with Nonabelian or Anyonic Symmetries
- Theory for Equivariant Quantum Neural Networks
- Symmetry restoration and quantum Mpemba effect in symmetric random circuits
- Symmetry-adapted variational quantum eigensolver
- Representation Learning via Quantum Neural Tangent Kernels
- Efficient decoding for the Hayden-Preskill protocol
- Restrictions on realizable unitary operations imposed by symmetry and locality
- Finite-size scaling of out-of-time-ordered correlators at late times
- Analytic theory for the dynamics of wide quantum neural networks
- Building spatial symmetries into parameterized quantum circuits for faster training
- Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem
- Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
- Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ansätze
- Critical phase and spin sharpening in SU(2)-symmetric monitored quantum circuits
- Noncommuting conserved charges in quantum thermodynamics and beyond
- Non-Abelian symmetry can increase entanglement entropy
- New perspectives on covariant quantum error correction
- Quantum Information Scrambling in Quantum Many-body Scarred Systems
- A Separation of Out-of-time-ordered Correlation and Entanglement
- Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries
- Soft mode and interior operator in Hayden-Preskill thought experiment
- Optimal Universal Quantum Error Correction via Bounded Reference Frames
- Many-Body Quantum States with Exact Conservation of Non-Abelian and Lattice Symmetries through Variational Monte Carlo
- Scrambling and decoding the charged quantum information
- Group Convolutional Neural Networks Improve Quantum State Accuracy
- Short random circuits define good quantum error correcting codes
- Black holes as clouded mirrors: the Hayden-Preskill protocol with symmetry
- Quantum Schur Sampling Circuits can be Strongly Simulated
- Universal limitation of quantum information recovery: symmetry versus coherence
- One-Shot Randomized and Nonrandomized Partial Decoupling
- 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
- Designs from Local Random Quantum Circuits with SU(d) Symmetry
- Universal trade-off structure between symmetry, irreversibility, and quantum coherence in quantum processes