An Efficient Quantum Algorithm for the Hidden Subgroup Problem over some Non-Abelian Groups

Autores

  • Demerson Nunes Goncalves
  • Renato Portugal
  • Tharso D. Fernandes

DOI:

https://doi.org/10.5540/03.2015.003.02.0045

Palavras-chave:

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.

Downloads

Não há dados estatísticos.

Downloads

Publicado

2015-11-18

Edição

Seção

Matemática Discreta