The Effective Solving of the Tasks from NP by a Quantum Computer
classification
💻 cs.CC
keywords
algorithmmodelsolvingcomputationdescribedeffectivegroverquantum
read the original abstract
The new model of quantum computation is proposed, for which an effective algorithm of solving any task in NP is described. The work is based and inspired be the Grover's algorithm for solving NP-tasks with quadratic speedup compared to the classical computation model. The provided model and algorithm exhibit the exponential speedup over that described by Grover.
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.