Quantum Algorithms for Some Hidden Shift Problems

appeared in Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA) 2003.
ps (537kB), ps.gz (256kB) or pdf (199kB). Also quant-ph/0211140.
The journal version appeared in SIAM Journal on Computing Volume 36, Issue 3, pp. 763-778 (2006).
pdf (200kB)
with Wim van Dam and Sean Hallgren.

Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodicity. The fact that Fourier transforms can also be used to capture shift structure has received far less attention in the context of quantum computation.

In this paper, we present three examples of "unknown shift" problems that can be solved efficiently on a quantum computer using the quantum Fourier transform. We also define the hidden coset problem, which generalizes the hidden shift problem and the hidden subgroup problem. This framework provides a unified way of viewing the ability of the Fourier transform to capture subgroup and shift structure.

Last modified April 15, 2009