4 August 2003 Quantum optimization for solving nonconvex problem
Author Affiliations +
Abstract
This paper presents a quantum optimization problem and solid-state quantum computing architectures. Quantum approach to global optimization and NP-complete problems are considered. Our approach to global optimization based on quantum mechanical entanglement, quantum resonant tunneling, cellular automaton and geometric control methods. A quantum optimization algorithm combines the properties of classical simulated annealing with the possibility of quantum tunneling between the minima. Quantum computation exploits the property of quantum states to implement quantum parallelism for global nonconvex optimization problem. This paper considers new mathematical models of classical (CL) and quantum-mechanical lattices (QML). System-theoretic results on the observability, controllability and minimal realizability theorems are formulated for CL. The cellular dynamaton (CD) based on quantum oscillators is presented. We investigate the conditions when stochastic resonance can occur through the interaction of dynamical neurons with intrinsic deterministic noise and an external periodic control.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Vitaliy Alexeevich Yatsenko, Vitaliy Alexeevich Yatsenko, } "Quantum optimization for solving nonconvex problem", Proc. SPIE 5105, Quantum Information and Computation, (4 August 2003); doi: 10.1117/12.485658; https://doi.org/10.1117/12.485658
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Geometric control of quantum spin systems
Proceedings of SPIE (August 23 2004)
Noise and chaos in motor behavior models
Proceedings of SPIE (April 29 2003)
Quantum optimization and maximum clique problems
Proceedings of SPIE (August 23 2004)
Controlling a chaotic response
Proceedings of SPIE (April 25 1996)
Practical quantum fault tolerance
Proceedings of SPIE (April 27 2009)

Back to Top