Quantum algorithms for abelian difference sets and applications to dihedral hidden subgroups

Abstract

Difference sets are basic combinatorial structures that have applications in signal processing, coding theory, and cryptography. We consider the problem of identifying a shifted version of the characteristic function of a (known) difference set. We present a generic quantum algorithm that can be used to tackle any hidden shift problem for any difference set in any abelian group. We discuss special cases of this framework where the resulting quantum algorithm is efficient. This includes: a) Paley difference sets based on quadratic residues in finite fields, which allows to recover the shifted Legendre function quantum algorithm, b) Hadamard difference sets, which allows to recover the shifted bent function quantum algorithm, and c) Singer difference sets based on finite geometries. The latter class allows us to define instances of the dihedral hidden subgroup problem that can be efficiently solved on a quantum computer.

arXiv comment18 pages, 2 figures, to appear in: Proceedings of the 11th Conference on Theory of Quantum Computation, Communication and Cryptography (TQC 2016)

References in corpus (8)

• Quantum factoring, discrete logarithms and the hidden subgroup problem
• A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
• Quantum algorithms for hidden nonlinear structures
• The Hidden Subgroup Problem - Review and Open Problems
• A Quantum Observable for the Graph Isomorphism Problem
• Quantum rejection sampling
• Quantum algorithms to solve the hidden shift problem for quadratics and for functions of large Gowers norm
• Easy and hard functions for the Boolean hidden shift problem

Cited by in corpus (2)

• Quantum algorithms for group convolution, cross-correlation, and equivariant transformations
• On learning linear functions from subset and its applications in quantum computing