Permutation groups, minimal degrees and quantum computing

Details Permutation groups, minimal degrees and quantum computing Permutation groups, minimal degrees and quantum computing

2006-07-28

arxiv.org/abs/quant-ph/0607204v1

Physics

Quantum Physics

28 pages, no figures

Scientific paper

We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support. These results contribute to the foundations of a non-commutative coding theory. A main application of our results concerns the Hidden Subgroup Problem for the symmetric group in Quantum Computing. We completely characterize the hidden subgroups of the symmetric group that can be distinguished from identity with weak Quantum Fourier Sampling, showing these are exactly the subgroups with bounded minimal degree. This implies that the weak standard method for the symmetric group has no advantage whatsoever over classical exhaustive search.

Affiliated with

Also associated with

No associations

Rating

Permutation groups, minimal degrees and quantum computing 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 Permutation groups, minimal degrees and quantum computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Permutation groups, minimal degrees and quantum computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-250992