The hidden subgroup problem and permutation group theory
| dc.creator | Kempe, Julia | |
| dc.creator | Shalev, Aner | |
| dc.date | 2004-06-08 | |
| dc.date.accessioned | 2026-07-07T06:26:59Z | |
| dc.date.available | 2026-07-07T06:26:59Z | |
| dc.description | We employ concepts and tools from the theory of finite permutation groups in order to analyse the Hidden Subgroup Problem via Quantum Fourier Sampling (QFS) for the symmetric group. We show that under very general conditions both the weak and the random-strong form (strong form with random choices of basis) of QFS fail to provide any advantage over classical exhaustive search. In particular we give a complete characterisation of polynomial size subgroups, and of primitive subgroups, that can be distinguished from the identity subgroup with the above methods. Furthermore, assuming a plausible group theoretic conjecture for which we give supporting evidence, we show that weak and random-strong QFS for the symmetric group have no advantage whatsoever over classical search. | |
| dc.description | 12 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0406046 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0406046 | |
| dc.identifier | Proc. 16th ACM-SIAM SODA, p. 1118-1125 (2005) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/97288 | |
| dc.subject | Quantum Physics | |
| dc.subject | Computational Complexity | |
| dc.title | The hidden subgroup problem and permutation group theory | |
| dc.type | text |