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

Demerson Nunes Goncalves, Renato Portugal, Tharso D. Fernandes

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.

Palavras-chave


Quantum Algorithms, Hidden Subgroup Problem, Quantum Computational Group Theory

Texto completo:

PDF


DOI: https://doi.org/10.5540/03.2015.003.02.0045

Apontamentos

  • Não há apontamentos.


SBMAC - Sociedade de Matemática Aplicada e Computacional
Edifício Medical Center - Rua Maestro João Seppe, nº. 900, 16º. andar - Sala 163 | São Carlos/SP - CEP: 13561-120
 

Normas para publicação | Contato