Metraipolis › archive › dc_47abb7fec3c2
The power of oracle access: Optimal sample and query complexity of the abelian state hidden subgroup problem — arXiv:2609.35656
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.35656
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T00:45:39.404Z
- SHA-256 of the archived text
85550ab16552006c7cdb615f8cd33460cb2fca35b75f56462e360a055875fd0b- Stable URL of this page
https://metraipolis.com/documento/dc_47abb7fec3c2
How to cite
The power of oracle access: Optimal sample and query complexity of the abelian state hidden subgroup problem — arXiv:2609.35656 — arXiv (en), https://arxiv.org/abs/2609.35656 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_47abb7fec3c2 (Metraipolis archive dc_47abb7fec3c2, sha256 85550ab16552006c7cdb615f8cd33460cb2fca35b75f56462e360a055875fd0b)
BibTeX
@misc{dc47abb7fec3c2,
title = {The power of oracle access: Optimal sample and query complexity of the abelian state hidden subgroup problem — arXiv:2609.35656},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.35656},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_47abb7fec3c2; sha256 85550ab16552006c7cdb615f8cd33460cb2fca35b75f56462e360a055875fd0b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.35656. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In the quest to identify further quantum algorithms exhibiting superpolynomial speed-ups, a recurring theme is that the complexity of a problem is largely shaped by the input access model. Here, we study this phenomenon for the state hidden subgroup problem (StateHSP), a quantum generalization of the hidden subgroup problem in which the goal is to identify the symmetries of an unknown quantum state. For finite abelian groups, existing Fourier-sampling algorithms use $O(\log(|G|)/\epsilon)$ copies of the state, but whether this scaling is optimal has remained open. We settle the complexity of the abelian StateHSP in both the previously studied sample model and a new query model, which is a stronger and operationally natural generalization that provides access to the state-preparation unitary and its inverse. In the query model, we give a time-efficient quantum algorithm using $O(\log(|G/H|)/\sqrt{\epsilon})$ forward and inverse queries, and prove a matching $\Omega(\log(|G/H|)/\sqrt{\epsilon})$ lower bound which holds even in the stronger conjugate-query and controlled-query settings. By contrast, we show that in the sample model, $\Theta(\log(|G/H|)/\epsilon)$ copies are both sufficient and information-theoretically necessary, even if one allows for arbitrary collective measurements. Thus, the quadratic improvement in $\epsilon$ genuinely arises from coherent access to the preparation circuit. As applications, we obtain faster algorithms for learning stabilizer groups, locating unentanglement, and identifying hidden translation symmetries.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-29 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.35656 — 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-08T00:19:23.532Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).