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

DOI10.4230/LIPIcs.TQC.2016.8zbMath1370.68103arXiv1608.02005OpenAlexW2500676371MaRDI QIDQ5278349

Martin Roetteler

Publication date: 19 July 2017

Full work available at URL: https://arxiv.org/abs/1608.02005

zbMATH Keywords

Fourier transformsquantum algorithmsdifference setshidden subgroup problemhidden shift problem

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

Quantum algorithms for typical hard problems: a perspective of cryptanalysis ⋮ Twin prime difference set and its application on a coded mask ⋮ Unnamed Item ⋮ The hidden subgroup problem and MKTP ⋮ Leveraging the hardness of dihedral coset problem for quantum cryptography ⋮ Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts

This page was built for publication: Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups