On Quantum Algorithms for Noncommutative Hidden Subgroups

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, no figures, LaTeX2e

Scientific paper

Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden subgroups of noncommutative groups. We present a quantum algorithm for the special case of dihedral groups which determines the hidden subgroup in a linear number of calls to the input function. We also explore the difficulties of developing an algorithm to process the data to explicitly calculate a generating set for the subgroup. A general framework for the noncommutative hidden subgroup problem is discussed and we indicate future research directions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On Quantum Algorithms for Noncommutative Hidden Subgroups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Quantum Algorithms for Noncommutative Hidden Subgroups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Quantum Algorithms for Noncommutative Hidden Subgroups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-303183

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.