An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups

Simple item page
dc.creatorIvanyos, Gábor
dc.creatorSanselme, Luc
dc.creatorSantha, Miklos
dc.date2007-01-31
dc.date.accessioned2026-07-07T07:44:08Z
dc.date.available2026-07-07T07:44:08Z
dc.descriptionExtraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in extraspecial groups. Our approach is quite different from the recent algorithms presented in [17] and [2] for the Heisenberg group, the extraspecial p-group of size p3 and exponent p. Exploiting certain nice automorphisms of the extraspecial groups we define specific group actions which are used to reduce the problem to hidden subgroup instances in abelian groups that can be dealt with directly.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0701235
dc.identifierhttp://arxiv.org/abs/quant-ph/0701235
dc.identifierstacs 2007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123085
dc.subjectQuantum Physics
dc.titleAn efficient quantum algorithm for the hidden subgroup problem in extraspecial groups
dc.typetext

Files

Collections

arXiv