Quantum Algorithm for the Non Abelian Hidden Subgroup Problem

Quantum Algorithm for the Non Abelian Hidden Subgroup Problem

We present an efficient quantum algorithm for the Hidden Subgroup Problem (HSP) on the semidirect product of the cyclic groups and , where is any odd prime number, and are positives integers and the homomorphism which defines the group is given by the root such that . As a consequence we ca...

Full description

Bibliographic Details
Main Author: Carlos Magno Martins Cosme
Other Authors: Renato Portugal
Format: Others
Language:Portuguese
Published: Laboratório Nacional de Computação Científica 2008
Subjects:
Hidden Subgroup Problem (HSP)
Quantum Computation
Teoria de Grupos.
Algoritmos Quânticos
Problema do Subgrupo Oculto
Computação Quântica
COMPUTABILIDADE E MODELOS DE COMPUTACAO
Quantum Algorithm
Groups Theory
Online Access:http://www.lncc.br/tdmc/tde_busca/arquivo.php?codArquivo=149

Internet

http://www.lncc.br/tdmc/tde_busca/arquivo.php?codArquivo=149

Similar Items