Is Grover's algorithm a quantum hidden subgroup algorithm?
From MaRDI portal
Publication:2467208
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2079375 (Why is no real title available?)
- scientific article; zbMATH DE number 1775388 (Why is no real title available?)
- scientific article; zbMATH DE number 1406124 (Why is no real title available?)
- EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
- Normal subgroup reconstruction and quantum computation using group representations
- Quantum algorithms and the Fourier transform
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
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)