Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

Resource data



Ver

Quantum Algorithm for the Non Abelian Hidden Subgroup Problem
Carlos Magno Martins Cosme
Location: http://www.lncc.br/tdmc/tde_busca/arquivo.php?codArquivo=149

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 can solve efficiently de HSP on the semidirect product of the groups by , where has a special prime factorization.

Belongs to: BDTD Ibict

Descargar SCORM

¡Sea el primero en solicitar este recurso!

Para poder solicitar este recurso debe identificarse como usuario de la biblioteca

Users rating

No hay ninguna valoración para este recurso. Sea el primero en valorar este recurso.

Detalles del recurso

Quantum Algorithm for the Non Abelian Hidden Subgroup Problem
Id. 35239151
Idioma PT
Titulo Quantum Algorithm for the Non Abelian Hidden Subgroup Problem
Autor(es) Carlos Magno Martins Cosme
Location http://www.lncc.br/tdmc/tde_busca/arquivo.php?codArquivo=149
Versión 1.0
Estado Final
Descripción 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 can solve efficiently de HSP on the semidirect product of the groups by , where has a special prime factorization.
Tipo PDF
Palabras clave Hidden Subgroup Problem (HSP)
Tipo de recurso Electronic Thesis or Dissertation
Tese ou Dissertacao Eletronica
Tipo de Interactividad Expositivo
Nivel de Interactividad muy bajo
Audiencia Estudiante
Profesor
Autor
Estructura Atomic
Coste no
Copyright
Liberar o conteúdo dos arquivos para acesso público
Formatos PDF
Requerimientos técnicos Browser: Any
Fecha de contribución 24-ago-2008
Contacto