2014/01/23 by Sergey Sysoev, Sysoev, Sergey
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC
paper · pdf · doi:10.48550/arxiv.1401.6030
The paper is submitted to the IEEE Transactions on Information Theory journal
arxiv created 2014/12/09 · arxiv updated 2014/12/10
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.