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 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 fields which allow to recover the shifted Legendre function quantum algorithm, b) Hadamard difference sets which allow to recover the shifted bent function quantum algorithm, and c) Singer difference sets which allow us to define instances of the dihedral hidden subgroup problem which can be efficiently solved on a quantum computer.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
