The parallel Grover as dynamic system
classification
🪐 quant-ph
keywords
groverparallelapplicationdynamicrepresentationsolutionsystemalgorithm
read the original abstract
A sequential application of the Grover algorithm to solve the iterated search problem has been improved by Ozhigov by parallelizing the application of the oracle. In this work a representation of the parallel Grover as dynamic system of inversion about the mean and Grover operators is given. Within this representation the parallel Grover for $k = 2$ can be interpreted as rotation in three-dimensional space and it can be shown that the sole application of the parallel Grover operator does not lead to a solution for $k > 2$. We propose a solution for $k = 3$ with a number of approximately $1.51\sqrt{N}$ iterations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.