A quantum polylog algorithm for non-normal maximal cyclic hidden subgroups in the affine group of a finite field
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- with (polylog) complexity O((q)R()2) where R<∞.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.