The Effective Solving of the Tasks from NP by a Quantum Computer
Computational Complexity
2014-12-10 v2
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.
Cite
@article{arxiv.1401.6030,
title = {The Effective Solving of the Tasks from NP by a Quantum Computer},
author = {Sergey Sysoev},
journal= {arXiv preprint arXiv:1401.6030},
year = {2014}
}
Comments
The paper is submitted to the IEEE Transactions on Information Theory journal