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

  title={Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups},
  author={M. Roetteler},
  • M. Roetteler
  • Published 2016
  • Mathematics, Physics, Computer Science
  • ArXiv
  • 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 and present a general 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 which include a) Paley difference sets based on quadratic residues in finite… CONTINUE READING
    4 Citations
    The Hidden Subgroup Problem and MKTP
    Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
    • 24
    • PDF


    On Quantum Algorithms for Noncommutative Hidden Subgroups
    • 70
    • PDF
    Quantum algorithm for the Boolean hidden shift problem
    • 15
    • PDF
    Quantum algorithms for highly non-linear Boolean functions
    • 29
    • PDF
    A quantum algorithm for computing the unit group of an arbitrary degree number field
    • 50
    • PDF
    Quantum algorithms for some hidden shift problems
    • 144
    • Highly Influential
    • PDF
    Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
    • 13
    • PDF
    The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
    • 166
    • PDF
    Quantum algorithms and the fourier transform
    • 55
    Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
    • 156
    • PDF
    The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
    • 23
    • PDF