Abstract: It follows from a result by Friedl, Ivanyos, Magniez, Santha and Sen from 2014 that, for any fixed integer \(m > 0\) (thought of as being small), there exists a quantum algorithm for solving the hidden shift problem in an arbitrary finite abelian group \((G, +)\) with time complexity
Loading