Related papers: Solving in the quantum computer every classical NP…

This paper has been withdrawn by the author due to a crucial problem in Lemma 3. This equation must be changed.

This paper has been withdrawn due to crucial erros in equations (24)--(31).

This paper has been withdrawn by the author, due to an error in relation (11).

Withdrawn; replaced by longer, more detailed paper quant-ph/0010065.

This paper has been withdrawn by the author and replaced by arXiv:0809.4751

This paper has been withdrawn by the author due to a crucial error in last part of proof.

This paper has been withdrawn by the author due to an error.

This paper has been withdrawn by the author due to a crucial mistakes.

This paper has been withdrawn by the author due to a error in attachment of source file.

The paper has been withdrawn because the research work is still in progress.

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…

In this paper we propose a totally serious algorithm to solve NP problems in polynomial time provided one is willing to wager the fate of all observers in the universe on the many-world interpretation of quantum theory being correct.

This paper has been withdrawn by the author due to the presented idea is wrong.

Unfortunately, after an imprudent sumbission of the paper to the e-print archive, I discovered in it many serious mistakes. So I draw back it .

This paper has been withdrawn by the author due to an error.

Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the…

In complexity theory, there exists a famous unsolved problem whether NP can be P or not. In this paper, we discuss this aspect in SAT (satisfiability) problem, and it is shown that the SAT can be solved in plynomial time by means of quantum…

This paper has been withdrawn by the author(s), due a crucial error in Eqn. 30.

This paper has been withdrawn by Christino Tamon and Tomoyuki Yamakami because of errors of the main theorems. An erratum appeared in the Proceedings of the UMC 2000 Conference published by Springer.

The paper is withdrawn.