Hidden symmetry detection on a quantum computer
Ralf Schützhold, William George Unruh · CERN Document Server (European Organization for Nuclear Research) · 2003
The fastest quantum algorithms (for the solution of classical computational problems) known so far are basically variations of the hidden subgroup problem f(U[x])=f(x). By means of some simple examples it is demonstrated that the detection of more general hidden (two-point) symmetries V{f(x),f(U[x])}=0 by a quantum computer can also admit an exponential speed-up. PACS: 03.67.Lx, 03.67.-a, 89.70.+c.