Quantum algorithms for some hidden shift problems

Wim Van Dam, Sean Hallgren, Lawrence Ip

Research output: Contribution to journalArticlepeer-review

73 Scopus citations


Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structures 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. 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.

Original languageEnglish (US)
Pages (from-to)763-778
Number of pages16
JournalSIAM Journal on Computing
Issue number3
StatePublished - 2006

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • General Mathematics


Dive into the research topics of 'Quantum algorithms for some hidden shift problems'. Together they form a unique fingerprint.

Cite this