1 paper · 1 filter
R. Schützhold, W. G. Unruh
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {f(U[x])=f(x)}. Follo…