Randomness of exact unitary designs under symmetry
Abstract
We define the unitary design strength of a finite unitary ensemble to be the maximal integer t for which its t-th statistical moment is identical to that of the unitary group. In the presence of physical symmetry, not all operators of an ensemble are symmetry-compatible. This motivates us to define the symmetric design strength of a finite unitary ensemble to be the maximal integer t for which the t-th moments of its symmetry-compatible sub-ensemble match those of the group of symmetry-compatible unitaries. We show that in sufficiently high dimension and for a broad family of symmetries, which includes the global on-site U(1) and SU(d) symmetries, there exist finite unitary ensembles of arbitrarily high design strength whose symmetric design strength is strictly higher. Ensembles with this property may be more versatile under symmetry constraints for protocols that rely on unitary randomization than they are without symmetry. Our results extend the previous work [Mitsuhashi and Yoshioka, PRX Quantum 4.4 (Nov. 2023)] showing that the symmetric design strength of the Clifford group is strictly upper bounded by its unitary design strength for symmetries that do not trivialize the symmetry-compatible unitaries. Due to the special significance of unitary designs with a group structure, we also derive a variety of bounds on the unitary and symmetric design strengths of finite unitary ensembles whose operators form a group. In particular, we provide a simple proof that an arbitrary ensemble of operators forming a finite group must have a symmetric design strength of at most two under the global on-site U(1) and SU(d) symmetries. Along the way, we show that there exist uniformly weighted groups of arbitrarily high symmetric design strength in arbitrary dimension and analyze their structure.
Related
- Unitary Designs from Doped Matchgate Circuits
- Designs without disorder: unitary k-designs from a single-site bulk defect
- Unitary designs from perturbed time evolutions of a chaotic Hamiltonian
- Optimal linear-optical interferometers for unitary t-designs in a multi-photon Fock space
- Optimal Disorder Strength for Approximate Unitary k-Designs in Spin Chains
BibTeX
@misc{vairogs2026randomness,
title = {{Randomness of exact unitary designs under symmetry}},
author = {Christopher Vairogs and Felix Leditzky},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.40227},
eprint = {2609.40227},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.40227},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Randomness of exact unitary designs under symmetry
AU - Christopher Vairogs
AU - Felix Leditzky
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.40227
UR - https://arxiv.org/abs/2609.40227
AB - We define the unitary design strength of a finite unitary ensemble to be the maximal integer t for which its t-th statistical moment is identical to that of the unitary group. In the presence of physical symmetry, not all operators of an ensemble are symmetry-compatible. This motivates us to define the symmetric design strength of a finite unitary ensemble to be the maximal integer t for which the t-th moments of its symmetry-compatible sub-ensemble match those of the group of symmetry-compatible unitaries. We show that in sufficiently high dimension and for a broad family of symmetries, which includes the global on-site U(1) and SU(d) symmetries, there exist finite unitary ensembles of arbitrarily high design strength whose symmetric design strength is strictly higher. Ensembles with this property may be more versatile under symmetry constraints for protocols that rely on unitary randomization than they are without symmetry. Our results extend the previous work [Mitsuhashi and Yoshioka, PRX Quantum 4.4 (Nov. 2023)] showing that the symmetric design strength of the Clifford group is strictly upper bounded by its unitary design strength for symmetries that do not trivialize the symmetry-compatible unitaries. Due to the special significance of unitary designs with a group structure, we also derive a variety of bounds on the unitary and symmetric design strengths of finite unitary ensembles whose operators form a group. In particular, we provide a simple proof that an arbitrary ensemble of operators forming a finite group must have a symmetric design strength of at most two under the global on-site U(1) and SU(d) symmetries. Along the way, we show that there exist uniformly weighted groups of arbitrarily high symmetric design strength in arbitrary dimension and analyze their structure.
ER -