H

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 ★

Commune · Savoirs

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

Texte en anglais

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.

Sur Wikipédia

Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.

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.

Texte : Wikipédia en anglais, CC BY-SA 4.0. ·

Cartes voisines

Ouvrir

…

Confirmation