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 ★
Comum · 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.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em 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: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
P
Problema da soma dos subconjuntos
Nº Q1154420 ★★
Sem ofertas
-
P
Problema da partição
Nº Q1065968 ★
Sem ofertas
-
Problema do clique
Nº Q1196873 ★
Sem ofertas
-
Problema do horizonte
Nº Q590581 ★★
Sem ofertas
-
Problema do caminho hamiltoniano
Nº Q987652 ★★
Sem ofertas
-
Problema da parada
Nº Q622849 ★★★
Sem ofertas