Quantum Hidden Subgroup Algorithms: An Algorithmic Toolkit

Details Quantum Hidden Subgroup Algorithms: An Algorithmic Toolkit Quantum Hidden Subgroup Algorithms: An Algorithmic Toolkit

2006-07-06

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

Physics

Quantum Physics

34 pages, 8 figures

Scientific paper

One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the Deutsch-Jozsa, Simon, Shor algorithms, and many more. In this paper, our strategy for finding new quantum algorithms is to decompose Shor's quantum factoring algorithm into its basic primitives, then to generalize these primitives, and finally to show how to reassemble them into new QHS algorithms. Taking an "alphabetic building blocks approach," we use these primitives to form an "algorithmic toolkit" for the creation of new quantum algorithms, such as wandering Shor algorithms, continuous Shor algorithms, the quantum circle algorithm, the dual Shor algorithm, a QHS algorithm for Feynman integrals, free QHS algorithms, and more. Toward the end of this paper, we show how Grover's algorithm is most surprisingly "almost" a QHS algorithm, and how this result suggests the possibility of an even more complete "algorithmic tookit" beyond the QHS algorithms.

Affiliated with

Also associated with

No associations

Rating

Quantum Hidden Subgroup Algorithms: An Algorithmic Toolkit 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 Hidden Subgroup Algorithms: An Algorithmic Toolkit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Hidden Subgroup Algorithms: An Algorithmic Toolkit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-45145