Is grover's algorithm a quantum hidden subgroup algorithm?

  • Lomonaco S
  • Kauffman L
  • 12

    Readers

    Mendeley users who have this article in their library.
  • 1

    Citations

    Citations of this article.

Abstract

The arguments given in this paper suggest that Grover's and Shor's algorithms are more closely related than one might at first expect. Specifically, we show that Grover's algorithm can be viewed as a quantum algorithm which solves a non-abelian hidden subgroup problem (HSP). But we then go on to show that the standard non-abelian quantum hidden subgroup (QHS) algorithm can not find a solution to this particular HSP. This leaves open the question as to whether or not there is some modification of the standard non-abelian QHS algorithm which is equivalent to Grover's algorithm.

Author-supplied keywords

  • Grover's algorithm
  • Hidden subgroup algorithms
  • Hidden subgroup problems
  • Quantum algorithms
  • Shor's algorithm

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Samuel J. Lomonaco

  • Louis H. Kauffman

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free