Paper 2021/419

On The Dihedral Coset Problem

Javad Doliskani

Abstract

We propose an efficient quantum algorithm for a specific quantum state discrimination problem. An immediate corollary of our result is a polynomial time quantum algorithm for the Dihedral Coset Problem with a smooth modulus. This, in particular, implies that $\text{poly}(n)$-unique-SVP is in BQP.

Metadata
Available format(s)
-- withdrawn --
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Dihedral Coset ProblemQuantum WalkSVP
Contact author(s)
javad doliskani @ ryerson ca
History
2021-03-30: withdrawn
2021-03-30: received
See all versions
Short URL
https://ia.cr/2021/419
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.