| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9867911 | Physics Letters A | 2005 | 6 Pages |
Abstract
Quantum computing by simulations is based upon similarity between mathematical formalism of a quantum phenomenon and phenomena to be analyzed. In this Letter, the mathematical formalism of quantum resonance combined with tensor product decomposability of unitary evolutions is mapped onto a class of NP-complete combinatorial problems. It has been demonstrated that nature has polynomial resources for solving NP-complete problems and that will help to develop a new strategy for artificial intelligence, as well as to re-evaluate the role of natural selection in biological evolution.
Related Topics
Physical Sciences and Engineering
Physics and Astronomy
Physics and Astronomy (General)
Authors
Michail Zak, Amir Fijany,