Metraipolis › archive › dc_2147bfbc9e0f

Learning quantum symmetries — arXiv:2609.38085

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38085
License (as archived)
CC0-1.0
Archived
2026-10-07T19:29:24.214Z
SHA-256 of the archived text
4805d2c102c760e0346d0494bd45a4510817ebc061e16308bd96ed8c8e85017b
Stable URL of this page
https://metraipolis.com/documento/dc_2147bfbc9e0f

How to cite

Learning quantum symmetries — arXiv:2609.38085 — arXiv (en), https://arxiv.org/abs/2609.38085 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2147bfbc9e0f (Metraipolis archive dc_2147bfbc9e0f, sha256 4805d2c102c760e0346d0494bd45a4510817ebc061e16308bd96ed8c8e85017b)
BibTeX
@misc{dc2147bfbc9e0f,
  title = {Learning quantum symmetries — arXiv:2609.38085},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38085},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2147bfbc9e0f; sha256 4805d2c102c760e0346d0494bd45a4510817ebc061e16308bd96ed8c8e85017b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38085. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Quantum algorithms are powerful tools for finding symmetries of classical objects, most famously through Shor's algorithm and the Hidden Subgroup Problem (HSP). In this work, we study quantum algorithms for learning symmetries of \emph{quantum} objects. Existing work in this area centres on the recently introduced State Hidden Subgroup Problem (StateHSP), a quantum generalisation of HSP in which the task is to learn the symmetry subgroup of a quantum state. We develop efficient quantum algorithms for non-abelian StateHSP when the hidden subgroup is normal and the ambient group belongs to a broad class of non-abelian groups, extending the previous general theory beyond the abelian setting. StateHSP learns \emph{Bose} symmetries, under which a state must be invariant exactly under the action of the symmetry group. In quantum mechanics, however, physically equivalent pure states are defined only up to global phase. Motivated by this, we introduce a natural notion of \emph{Anyonic} state symmetry learning, based on invariance up to global phase. We give an efficient quantum algorithm by reducing the problem to StateHSP, where the reduction rests on a new correspondence between linearisations of projective representations and linear error-correcting codes. As an application, we obtain an improved algorithm for learning stabiliser groups of mixed qudit states of arbitrary local dimension. Finally, we introduce symmetry learning problems for other quantum objects, including unitaries, Hamiltonians, and finite collections of states, and give efficient algorithms for them by reduction to state symmetry learning. Together, these results broaden the scope of state symmetry learning as a common algorithmic primitive for learning quantum symmetries.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-30 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.38085 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T18:55:50.633Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).