Classical shadows over symmetric spaces

@misc{chang2026classical,
  title = {{Classical shadows over symmetric spaces}},
  author = {Rebecca Chang and Maureen Krumtünger and Martin Larocca and Maxwell West},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2605.05518},
  eprint = {2605.05518},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.05518},
  note = {CC BY 4.0},
}

TY  - UNPB
TI  - Classical shadows over symmetric spaces
AU  - Rebecca Chang
AU  - Maureen Krumtünger
AU  - Martin Larocca
AU  - Maxwell West
PY  - 2026
DA  - 2026/10/28
PB  - arXiv
DO  - 10.48550/arxiv.2605.05518
UR  - https://arxiv.org/abs/2605.05518
AB  - Efficiently learning expectation values of unknown quantum states via classical shadows has become an important primitive in both theoretical and experimental aspects of quantum computation. Typically, classical shadow protocols involve randomised measurements induced by sampling uniformly randomly from a compact group, a situation which is now quite well understood. In this work we go beyond this standard assumption, studying the classical shadow protocols occasioned by sampling uniformly randomly from the so-called compact symmetric spaces. We uncover a unifying theory of such protocols, extending the extent to which the general theory of classical shadows is understood at a mathematical level. Interestingly, for the estimation of observables sampled from certain distributions we further find that some of these protocols allow for slight improvements in sample-complexity over existing shadow schemes. As part of our technical analysis we obtain ε-approximate relative-error k-designs over the n-qubit symplectic group in depth 𝒪(nk+log(1/ε)), which is optimal with respect to n, and may be of some independent interest.
ER  -