Quantum Information Seminar Series

Quantum Algorithms for Some Hidden Shift Problems

Lawrence Ip

UC Berkeley

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.

We present some examples of 'unknown shift' problems that can be solved efficiently on a quantum computer using the quantum Fourier transform. For one of these problems, the shifted Legendre symbol problem, we give evidence that the problem is hard to solve classically, by showing a reduction from breaking algebraically homomorphic cryptosystems. 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.

(joint work with Wim van Dam and Sean Hallgren)

Tuesday, April 1, 2003
2:00 PM
Gant Science Complex
Physics Department
Room P121

© 2003 Department of Physics, University of Connecticut
This page was last updated by WWW administrator on March 31, 2003

Valid HTML 4.01! Text only page version