Hidden subgroup problem: Let G be a group, X a finite set, and f : G → X a function that hides a subgroup H ≤ G. The function f is given via an oracle, which uses O(log |G|+log|X|) bits. Using information gained from evaluations of f via its oracle, determine a generating set for H.
A special case is when X is a group and f is a group homomorphism in which case H corresponds to the kernel of f.
Read more about Hidden Subgroup Problem: Motivation, Algorithms
Famous quotes containing the words hidden and/or problem:
“Lap me in soft Lydian airs,
Married to immortal verse,
Such as the meeting soul may pierce
In notes with many a winding bout
Of linked sweetness long drawn out,
With wanton heed and giddy cunning,
The melting voice through mazes running,
Untwisting all the chains that tie
The hidden soul of harmony;”
—John Milton (1608–1674)
“If a problem is insoluble, it is Necessity. Leave it alone.”
—Mason Cooley (b. 1927)