Related papers: A Constant Complexity Algorithm for Solving the Bo…
This paper has been withdrawn.
This paper has been withdrawn by the author; see the much expanded, improved, and generalized version at arXiv:0811.2080.
This paper was withdrawn on 20.11.97.
This paper has been withdrawn by the author due to some problems.
This paper has been withdrawn by the authors due to a gap in the proof of the main result (in 5.3).
The paper has been withdrawn by the author due to unhappy mistake in the initial scope of the work.
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm…
The paper has been withdrawn by the author.
This paper has been withdrawn by the author.
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…
This paper has been withdrawn by the author
We discuss the quantum search algorithm using complex queries that has recently been published by Grover (quant-ph/9706005). We recall the algorithm adding some details showing which complex query has to be evaluated. Based on this version…
This paper has been withdrawn by the author. A much more revised version is available as arXiv:0909.4238.
In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date. Such problems are believed to be difficult to solve, even with a quantum computer, but have the…
This paper is withdrawn because the results in the paper are included in a paper to be published in Mathematical and Computer Modelling.
The article is taken out.
This paper has been withdrawn by the authors.
This paper has been withdrawn by the author(s) and included into the new version of "An extension theorem for separately holomorphic functions with singularities", math.CV/0104089.
The k-satisfiability problem is a well-known task in computational complexity theory. In this paper approach for it's solving is introduced.
This paper has been withdrawn by the authors due to a crucial error.