Difference between revisions of "Hidden Subgroup Zoo"
From Quantum Computing Theory Group
(New page: Let <math>f</math> be function from a group <math>G</math> to a set <math>S</math> which is promised to be constant and distinct on different left cosets of an unknown subgroup <math>H</m...) |
|||
| Line 1: | Line 1: | ||
| − | Let <math>f</math> be function from a group <math>G</math> to a set <math>S</math> which is promised to be constant and distinct on different left cosets of an unknown subgroup <math>H</math> : <math>f(g)=f(h)</math> iff <math>gH = gH</math> . The goal of the hidden subgroup problem is, by querying <math>f</math>, to identify the | + | Let <math>f</math> be function from a group <math>G</math> to a set <math>S</math> which is promised to be constant and distinct on different left cosets of an unknown subgroup <math>H</math> : <math>f(g)=f(h)</math> iff <math>gH = gH</math> . The goal of the hidden subgroup problem is, by querying <math>f</math>, to identify the |
subgroup <math>H</math>. | subgroup <math>H</math>. | ||
Revision as of 00:30, 13 June 2008
Let <math>f</math> be function from a group <math>G</math> to a set <math>S</math> which is promised to be constant and distinct on different left cosets of an unknown subgroup <math>H</math> : <math>f(g)=f(h)</math> iff <math>gH = gH</math> . The goal of the hidden subgroup problem is, by querying <math>f</math>, to identify the subgroup <math>H</math>.
