Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
NP Problem in Quantum Algorithm
Open Systems & Information Dynamics
On the Ohya-Masuda Quantum SAT Algorithm
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
How Can We Observe and Describe Chaos?
Open Systems & Information Dynamics
On quantum versions of record-breaking algorithms for SAT
ACM SIGACT News
Proceedings of the 2006 ACM symposium on Applied computing
On generalized quantum turing machine and its language classes
MATH'07 Proceedings of the 11th WSEAS International Conference on Applied Mathematics
Quantum algorithm for multiple alignment of amino acid sequences
MCBC'09 Proceedings of the 10th WSEAS international conference on Mathematics and computers in biology and chemistry
Mathematical characterization of quantum algorithm
MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics
QI'12 Proceedings of the 6th international conference on Quantum Interaction
Hi-index | 0.00 |
There exists an important problem whether there exists an algorithm to solve an NP-complete problem in polynomial time. In this paper, a new concept of quantum adaptive stochastic systems is proposed, and it is shown that it can be used to solve the problem above.