Saved in:
Bibliographic Details
Main Authors: Chen, Imin, Sun, David
Format: Preprint
Published: 2021
Subjects:
Online Access:https://arxiv.org/abs/2106.09907
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911833243254784
author Chen, Imin
Sun, David
author_facet Chen, Imin
Sun, David
contents We give an exposition of the hidden subgroup problem for dihedral groups from the point of view of the standard hidden subgroup quantum algorithm for finite groups. In particular, we recall the obstructions for strong Fourier sampling to succeed, but at the same time, show how the standard algorithm can be modified to establish polynomial quantum query complexity. Finally, we explain a new connection between the dihedral coset problem and cloning of quantum states.
format Preprint
id arxiv_https___arxiv_org_abs_2106_09907
institution arXiv
publishDate 2021
record_format arxiv
spellingShingle The dihedral hidden subgroup problem
Chen, Imin
Sun, David
Quantum Physics
Computational Complexity
We give an exposition of the hidden subgroup problem for dihedral groups from the point of view of the standard hidden subgroup quantum algorithm for finite groups. In particular, we recall the obstructions for strong Fourier sampling to succeed, but at the same time, show how the standard algorithm can be modified to establish polynomial quantum query complexity. Finally, we explain a new connection between the dihedral coset problem and cloning of quantum states.
title The dihedral hidden subgroup problem
topic Quantum Physics
Computational Complexity
url https://arxiv.org/abs/2106.09907