A Note on the Quantum Query Complexity of the Hidden Subgroup Problem

Details A Note on the Quantum Query Complexity of the Hidden Subgroup Problem A Note on the Quantum Query Complexity of the Hidden Subgroup Problem

2004-04-11

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

Physics

Quantum Physics

11 pages

Scientific paper

We are concerned with the Hidden Subgroup Problem for finite groups. We
present a simplified analysis of a quantum algorithm proposed by Hallgren,
Russell and Ta-Shma as well as a detailed proof of a lower bound on the
probability of success of the algorithm.

Affiliated with

Also associated with

No associations

Rating

A Note on the Quantum Query Complexity of the Hidden Subgroup Problem 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 A Note on the Quantum Query Complexity of the Hidden Subgroup Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on the Quantum Query Complexity of the Hidden Subgroup Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5252