Quantum algorithms for some hidden shift problems

  title={Quantum algorithms for some hidden shift problems},
  author={Wim van Dam and Sean Hallgren and Lawrence Ip},
  booktitle={ACM-SIAM Symposium on Discrete Algorithms},
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… 

Figures from this paper

Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm

Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used

Quantum algorithm for the Boolean hidden shift problem

While the extremal case of the Boolean hidden shift problem over so-called bent functions can be reduced to a hidden subgroup problem over an abelian group, the more general case studied here does not seem to allow such a reduction.

Quantum algorithm based on the ε-random linear disequations for the continuous hidden shift problem

By employing the newly defined concepts, it is shown that there exists a quantum computational algorithm which solves the continuous hidden shift problem on Rn with a continuous oracle function in time polynomial in n.

An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem

This work proposes an efficient and deterministic quantum algorithm for finding the square-free part of a large integer - a problem for which no efficient classical algorithm exists.

Quantum algorithms for highly non-linear Boolean functions

New quantum algorithms are presented that solve the hidden shift problems for several well-known classes of bent functions in polynomial time and with a constant number of queries, while the classical query complexity is shown to be exponential.

An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups

This work shows that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer and uses Clebsch-Gordan decompositions to combine and reduce tensor products of irreducible representations.

An Efficient Exact Quantum Algorithm for the Integer Square-free Decomposition Problem

This work proposes an efficient and exact quantum algorithm for finding the square-free part of a large integer - a problem for which no efficient classical algorithm exists.

Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups

This work considers the problem of identifying a shifted version of the characteristic function of a (known) difference set and presents a general algorithm that can be used to tackle any hidden shift problem for any difference set in any abelian group.

The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts

This article shows that hidden subgroups of theq-hedral groups, i.e., semidirect products, and in particular the affine groups $A_p, can be information-theoretically reconstructed using the strong standard method, and proves a simple closure property for the class of groups over which the hidden subgroup problem can be solved efficiently.

On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems

We consider an approach to deciding isomorphism of rigid n-vertex graphs (and related isomorphism problems) by solving a nonabelian hidden shift problem on a quantum computer using the standard



The Hidden Subgroup Problem and Quantum Computation Using Group Representations

A natural generalization of the algorithm for the abelian case to the nonabelian case is analyzed and it is shown that the algorithm determines the normal core of a hidden subgroup: in particular, normal subgroups can be determined.

The quantum fourier transform and extensions of the abelian hidden subgroup problem

Improved parallel circuits for both the QFT over a power of 2 and the Q FT over an arbitrary cyclic group are given and it is shown that this problem of period-finding over ℜ, viewed as an oracle promise problem, is strictly harder than its integral counterpart.

Quantum computation of Fourier transforms over symmetric groups

A quantum polynomial time algorithm for the Fourier transform for the symmetric groups Sn is given, adapting results obtained by Clausen and Diaconis–Rockmore to the quantum setting.

Normal subgroup reconstruction and quantum computation using group representations

It is shown that an immediate generalization of the Abelian case solution to the non-Abelian case does not efficiently solve Graph Isomorphism.

Efficient Quantum Algorithms for Shifted Quadratic Character Problems

The Shifted Legendre Symbol Problem and some variants along with efficient quantum algorithms to solve them are introduced and the classical complexity of the problem is unknown.

Solving Shift Problems and Hidden Coset Problem Using the Fourier Transform

A quantum algorithm for solving a shifted multiplicative character problem over Z/nZ and finite fields is given and it is shown that combining the shift problem with the hidden subgroup problem results in a hidden coset problem.

On Quantum Algorithms for Noncommutative Hidden Subgroups

A quantum algorithm is presented for the special case of dihedral groups which determines the hidden subgroup in a linear number of calls to the input function.

Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)

It is shown that any cryptosystem based on what is referred to as a ‘hidden linear form’ can be broken in quantum polynomial time and the notion of ‘junk bits’ is introduced which are helpful when performing classical computations that are not injective.

An improved quantum Fourier transform algorithm and applications

  • Lisa HalesSean Hallgren
  • Mathematics, Computer Science
    Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
We give an algorithm for approximating the quantum Fourier transform over an arbitrary Z/sub p/ which requires only O(n log n) steps where n=log p to achieve an approximation to within an arbitrary

Sharp Quantum vs. Classical Query Complexity Separations

A black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved exactly in the quantum case with a single query (and a polynomial number of auxiliary operations).