Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, LaTeX2e, 3 figures

Scientific paper

We present a family of non-abelian groups for which the hidden subgroup
problem can be solved efficiently on a quantum computer.

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

Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups 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 Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-618182

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