Hidden subgroup problem
In computer science, the task in which one is given a function on a group that is constant on cosets of an unknown subgroup and one tries to reconstruct this subgroup
The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. It is a generalization of problems including factoring, discrete logarithm, graph isomorphism, and the shortest vector problem.
Nº Q5752087 ★
Común · Saberes
Hidden subgroup problem
In computer science, the task in which one is given a function on a group that is constant on cosets of an unknown subgroup and one tries to reconstruct this subgroup
The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. It is a generalization of problems including factoring, discrete logarithm, graph isomorphism, and the shortest vector problem.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. It is a generalization of problems including factoring, discrete logarithm, graph isomorphism, and the shortest vector problem. This makes it especially important in the theory of quantum computing because Shor's algorithms for factoring and finding discrete logarithms in quantum computing are instances of the hidden subgroup problem for finite abelian groups, while the other problems correspond to finite groups that are not abelian.
Texto: Wikipedia en inglés, CC BY-SA 4.0. ·
Cartas cercanas
-
P
Problema de la suma de subconjuntos
Nº Q1154420 ★★
Sin ofertas
-
P
Problema de la partición
Nº Q1065968 ★
Sin ofertas
-
Problema del clique
Nº Q1196873 ★
Sin ofertas
-
Problema del horizonte
Nº Q590581 ★★
Sin ofertas
-
Problema del camino Hamiltoniano
Nº Q987652 ★★
Sin ofertas
-
Problema de la parada
Problema de determinar si un programa dado terminará o continuará ejecutándose por siempre
Nº Q622849 ★★★
Sin ofertas