Is Grover's algorithm a quantum hidden subgroup algorithm?

From MaRDI portal
Publication:2467208

DOI10.1007/S11128-007-0066-1zbMATH Open1137.81006arXivquant-ph/0603140OpenAlexW1981560782MaRDI QIDQ2467208FDOQ2467208


Authors: S. J. jun. Lomonaco, Louis Kauffman Edit this on Wikidata


Publication date: 21 January 2008

Published in: Quantum Information Processing (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/quant-ph/0603140




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Is Grover's algorithm a quantum hidden subgroup algorithm?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467208)