Quantum Algorithms, Hidden Subgroup Problem, Quantum Computational Group Theory
Resumo
The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms are special cases of the HSP. In this paper we show that there exist a new efficient quantum algorithm for the HSP on groups ZN o Zqs where N is an integer with a special prime factorization.