The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. The framework captures problems such as factoring, discrete logarithm, graph isomorphism, and the shortest vector problem. This makes it especially important in the theory of quantum computing because Shor's algorithm for factoring in quantum computing is an instance of the hidden subgroup problem for finite abelian groups, while the other problems correspond to finite groups that are not abelian.
and 20 Related for: Hidden subgroup problem information
The hiddensubgroupproblem (HSP) is a topic of research in mathematics and theoretical computer science. The framework captures problems such as factoring...
classical algorithm. The difference between the hiddensubgroupproblem and the hidden shift problem is that the former focuses on the underlying group...
given graph H; this problem is known to be NP-complete. It is also known to be a special case of the non-abelian hiddensubgroupproblem over the symmetric...
solving the dihedral hiddensubgroupproblem, which would break many lattice based cryptosystems, is a well-studied open problem. It has been proven that...
the eigenvalues of a unitary operator, and algorithms for the hiddensubgroupproblem. The quantum Fourier transform was discovered by Don Coppersmith...
distinct problems, they share some properties: both are special cases of the hiddensubgroupproblem for finite abelian groups, both problems seem to be...
sensitive person, with high sensory processing sensitivity (SPS) Hiddensubgroupproblem, in mathematics High Speed Photometer, Hubble Space Telescope instrument...
(2005). "A Subexponential-Time Quantum Algorithm for the Dihedral HiddenSubgroupProblem". SIAM Journal on Computing. 35 (1). Philadelphia: 188. arXiv:quant-ph/0302112...
at certain roots of unity Harrow-Hassidim-Lloyd (HHL) algorithm Hiddensubgroupproblem Polynomial hierarchy (PH) Quantum complexity theory QMA, the quantum...
(2005). "A subexponential-time quantum algorithm for the dihedral hiddensubgroupproblem". SIAM Journal on Computing. 35 (1): 170–188. arXiv:quant-ph/0302112...
problem, was named a Computing Reviews "Notable Paper" in 2012. In quantum computation, he is known for his work on the non-abelian hiddensubgroup problem...
The hidden linear function problem, is a search problem that generalizes the Bernstein–Vazirani problem. In the Bernstein–Vazirani problem, the hidden function...
Berthier's book "The Hidden Logic of Sudoku" (2007) which considers strategies such as "hidden xy-chains". The general problem of solving Sudoku puzzles...
In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete...
set of possible solutions. Mostly, the optimization problem is formulated as a minimization problem, where one tries to minimize an error which depends...
Hidden Armenians (Armenian: թաքնված հայեր, romanized: t’ak’nvats hayer; Turkish: Gizli Ermeniler) or crypto-Armenians (Kripto Ermeniler) is an umbrella...
equivalent for the perceptron unit from which neural nets are constructed. A problem is that nonlinear activation functions do not immediately correspond to...
with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it...
transitivity, and then ask which subgroup preserves these vectors. These subgroups are called little groups by physicists. The problem is then essentially reduced...
Global Information