Quantum algorithms for solvable groups

Details Quantum algorithms for solvable groups Quantum algorithms for solvable groups

2000-11-07

arxiv.org/abs/quant-ph/0011023v2

Physics

Quantum Physics

13 pages. Several corrections

Scientific paper

In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing normality of a subgroup in a given solvable group, reduce to computing orders of solvable groups and therefore admit polynomial-time quantum algorithms as well. Our algorithm works in the setting of black-box groups, wherein none of these problems can be computed classically in polynomial time. As an important byproduct, our algorithm is able to produce a pure quantum state that is uniform over the elements in any chosen subgroup of a solvable group, which yields a natural way to apply existing quantum algorithms to factor groups of solvable groups.

Affiliated with

Also associated with

No associations

Rating

Quantum algorithms for solvable 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 Quantum algorithms for solvable groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum algorithms for solvable groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466131