Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Simple item page
dc.creatorIvanyos, Gabor
dc.creatorMagniez, Frederic
dc.creatorSantha, Miklos
dc.date2001-02-02
dc.date.accessioned2026-07-07T06:01:36Z
dc.date.available2026-07-07T06:01:36Z
dc.descriptionIn this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups, finding hidden subgroups of groups with small commutator subgroup and of groups admitting an elementary Abelian normal 2-subgroup of small index or with cyclic factor group.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0102014
dc.identifierhttp://arxiv.org/abs/quant-ph/0102014
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89314
dc.subjectQuantum Physics
dc.titleEfficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
dc.typetext

Files

Collections

arXiv