DeepAI AI Chat
Log In Sign Up

The dihedral hidden subgroup problem

by   Imin Chen, et al.
Simon Fraser University

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.


page 1

page 2

page 3

page 4


Deterministic Algorithms for the Hidden Subgroup Problem

In this note, we present deterministic algorithms for the Hidden Subgrou...

The special case of cyclotomic fields in quantum algorithms for unit groups

Unit group computations are a cryptographic primitive for which one has ...

A Quantum Polynomial-Time Solution to The Dihedral Hidden Subgroup Problem

We present a polynomial-time quantum algorithm for the Hidden Subgroup P...

Zero sum subsequences and hidden subgroups

We propose a method for solving the hidden subgroup problem in nilpotent...

The Coxeter symmetries of high-level general sequential computation in the invertible-digital and quantum domains

The article investigates high-level general invertible-sequential proces...

The Hidden Subgroup Problem for Universal Algebras

The Hidden Subgroup Problem (HSP) is a computational problem which inclu...

Very strong evidence in favor of quantum mechanics and against local hidden variables from a Bayesian analysis

The data of four recent experiments --- conducted in Delft, Vienna, Boul...