A quantum polylog algorithm for non-normal maximal cyclic hidden subgroups in the affine group of a finite field

Nolan Wallach

A quantum polylog algorithm for non-normal maximal cyclic hidden subgroups in the affine group of a finite field

Quantum Physics 2013-08-13 v2

Authors: Nolan Wallach

Abstract

We give an algorithm to solve the quantum hidden subgroup problem for maximal cyclic non-normal subgroups of the affine group of a finite field (if the field has order $q$ then the group has order $q(q-1)$ ) with probability $1-\varepsilon$ with (polylog) complexity $O(\log(q)^{R}\log(\varepsilon)^{2})$ where $R<\infty.$

Keywords

quantum hidden subgroup problem affine group finite field non-normal maximal cyclic subgroups polylogarithmic complexity quantum algorithm

Cite

@article{arxiv.1308.1415,
  title  = {A quantum polylog algorithm for non-normal maximal cyclic hidden subgroups in the affine group of a finite field},
  author = {Nolan Wallach},
  journal= {arXiv preprint arXiv:1308.1415},
  year   = {2013}
}

Related papers

View all related →