Hidden Subgroup Problem

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:

    “Whatever events in progress shall disgust men with cities, and infuse into them the passion for country life, and country pleasures, will render a service to the whole face of this continent, and will further the most poetic of all the occupations of real life, the bringing out by art the native but hidden graces of the landscape.”
    —Ralph Waldo Emerson (1803–1882)

    “I don’t have any problem with a reporter or a news person who says the President is uninformed on this issue or that issue. I don’t think any of us would challenge that. I do have a problem with the singular focus on this, as if that’s the only standard by which we ought to judge a president. What we learned in the last administration was how little having an encyclopedic grasp of all the facts has to do with governing.”
    —David R. Gergen (b. 1942)