Skip to main content
Conference Proceedings

Quantum resonance for solving NP-complete problems by simulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1509 160-166
DOI: 10.1007/3-540-49208-9_13
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Quantum analog computing is based upon similarity between mathematical formalism of a quantum phenomenon and phenomena to be analyzed. In this paper, the mathematical formalism of quantum resonance combined with tensor product decomposability of unitary evolutions is mapped onto a class of NP-complete combinatorial problems.

Cite

CITATION STYLE

APA

Zak, M. (1999). Quantum resonance for solving NP-complete problems by simulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1509, pp. 160–166). Springer Verlag. https://doi.org/10.1007/3-540-49208-9_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free