Paper
24 August 2004 Quantum optimization and maximum clique problems
Author Affiliations +
Abstract
This paper describes a new approach to global optimization and control uses geometric methods and modern quantum mathematics. Polynomial extremal problems (PEP) are considered. PEP constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. A general approach to optimization based on quantum holonomic computing algorithms and instanton mechanism. An optimization method based on geometric Lie - algebraic structures on Grassmann manifolds and related with Lax type flows is proposed. Making use of the differential geometric techniques it is shown that associated holonomy groups properly realizing quantum computation can be effectively found concerning polynomial problems. Two examples demonstrating calculation aspects of holonomic quantum computer and maximum clique problems in very large graphs, are considered in detail.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Vitaliy Alexeevich Yatsenko, Panos M. Pardalos, and Bruno H. Chiarini "Quantum optimization and maximum clique problems", Proc. SPIE 5436, Quantum Information and Computation II, (24 August 2004); https://doi.org/10.1117/12.546845
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Quantum computing

Optimization (mathematics)

Quantum information

Computer programming

Mathematical modeling

Algorithms

Dynamical systems

Back to Top