Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Quantum optimization for solving nonconvex problem

Vitaliy A. Yatsenko

Published Aug 5, 2003• 0 citations
Publisher

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.

DOI
10.1117/12.485658

Related papers

Quantum computing in control and optimization

Vitaliy A. Yatsenko, Nikita Boyko, Petros Xanthopoulos +1 more

This paper deals with the progress made in applications of quantum computing in control and optimization. It concentrates on applying the geometric technique in order to investigate a finite control problem of a two-level quantum system, resonance control of a three-level system, simulation of bilinear quantum control systems, and optimal control using the Bellman principle. We show that a quantum object described by a Schroedinger equation can be controlled in an optimal way by electromagnetic modes. We also demonstrate an application of these techniques and an algebra-geometric approach to the study of dynamic processes in nonlinear systems. The information processing by means of controlled quantum lattices is discussed: we present new mathematical models of classical (CL) and quantum-mechanical lattices (QML) and their application to information processing. system-theoretical results on the observability, controllability and minimal realizability theorems are formulated for cl. The cellular dynamaton (CD) based on quantum oscillators is presented. Cellular's quantum computational search procedure can provide the basis for implementing adaptive global optimization algorithms. A brief overview of the procedure is given and a framework called lattice adaptive search is set up. A method of Yatsenko and one introduced by the authors fit into this framework and are compared.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Apr 27, 2007•3 citations

On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks

Yizhou Liu, Weijie Su, Tongyang Li

Classical algorithms are often not effective for solving nonconvex optimization problems where local minima are separated by high barriers. In this paper, we explore possible quantum speedups for nonconvex optimization by leveraging the global effect of quantum tunneling. Specifically, we introduce a quantum algorithm termed the quantum tunneling walk (QTW) and apply it to nonconvex problems where local minima are approximately global minima. We show that QTW achieves quantum speedup over classical stochastic gradient descents (SGD) when the barriers between different local minima are high but thin and the minima are flat. Based on this observation, we construct a specific double-well landscape, where classical algorithms cannot efficiently hit one target well knowing the other well but QTW can when given proper initial states near the known well. Finally, we corroborate our findings with numerical experiments.

arXiv:2209.14501•Quantum•Jun 2, 2023•26 citations

Exploiting Quantum Resonance to Solve Combinatorial Problems

Michail A. Zak, Amir Fijany

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

•Oct 1, 2006•0 citations

Quantum Optimization Algorithms and Application

N. Manglani, Dhruv Solanki, Ankit Das

Optimization problems are fundamental across various scientific and industrial domains, from logistics and finance to machine learning and drug discovery. Classical optimization algorithms, such as gradient-based methods and heuristic approaches, often struggle with issues like slow convergence, getting trapped in local minima, and inefficiency in handling high-dimensional or combinatorial problems. Applying the concepts of quantum optimization with quantum mechanics algorithms presents viable substitutes with the potential for speedups and better solution quality. Among the significant quantum optimization techniques investigated in this paper are Grover's Search Algorithm, Variational Quantum Eigensolver (VQE), Quantum Annealing, and the Quantum Approximate Optimization Algorithm (QAOA). QAOA is designed for combinatorial optimization problems, blending quantum and classical techniques to approximate optimal solutions. VQE, widely used in quantum chemistry, employs a hybrid quantum-classical approach to determine ground-state energies efficiently. Grover's algorithm fastens up searching databases, indirectly aiding optimization tasks. Quantum annealing, implemented by systems like D-Wave, solves optimization problems by exploiting quantum tunneling to escape local minima. Despite their advantages, these quantum approaches face challenges, including hardware limitations, noise in quantum systems, and scalability concerns. However, these algorithms are expected to be essential in solving complicated optimization problems that are currently intractable by classical approaches when quantum technology develops.

Wiley eBooks•Oct 30, 2026•0 citations

Developing a Hardware Approach to Simulating Quantum Computing Using an Optimization Algorithm

Пуховский Валерий Николаевич, Sergey M. Gushanskiy, Viktor Potapov

In the past few decades, there has been an acute problem of creating a quantum computer that uses quantum mechanical effects such as quantum parallelism and quantum entanglement for computations. Using these mechanisms, the quantum computer is able to solve some of the NP-class problems in polynomial time. A hardware approach to modeling quantum computing is considered, and a general mathematical model of the operation of a quantum computer is described, and a technique for mathematical modeling of quantum computing is presented. At the stage of consideration of the method of mathematical modeling, the most resource-intensive parts of the model are indicated. Also, issues related to data parallelization on a hardware accelerator, which are planned to be used to simulate quantum computing, were considered, and algorithms for the operation of this type of accelerator were given. A more compact data format is proposed, which is recommended to be used when implementing the accelerator. Using the proposed format, it is possible to reduce the resources spent on elementary arithmetic operations. The possibility of introducing an optimization algorithm to minimize the time spent in computations, as well as to speed up the execution of quantum algorithms in simulators of a quantum computer at the stage of the effect of quantum gates on the quantum register model, is proposed. The results of the optimization algorithm and its comparison with the classical mathematical approach using a software model are presented.

Panhellenic Conference on Informatics•Nov 26, 2021•1 citation

Efficiency of quantum vs. classical annealing in nonconvex learning problems

Carlo Baldassi, Riccardo Zecchina

Quantum annealers aim at solving nonconvex optimization problems by exploiting cooperative tunneling effects to escape local minima. The underlying idea consists of designing a classical energy function whose ground states are the sought optimal solutions of the original optimization problem and add a controllable quantum transverse field to generate tunneling processes. A key challenge is to identify classes of nonconvex optimization problems for which quantum annealing remains efficient while thermal annealing fails. We show that this happens for a wide class of problems which are central to machine learning. Their energy landscapes are dominated by local minima that cause exponential slowdown of classical thermal annealers while simulated quantum annealing converges efficiently to rare dense regions of optimal solutions.

arXiv:1706.08470•Proceedings of the National Academy of Sciences•Jan 30, 2018•67 citations
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.
This paper deals with the progress made in applications of quantum computing in control and optimization. It concentrates on applying the geometric technique in order to investigate a finite control problem of a two-level quantum system, resonance control of a three-level system, simulation of bilinear quantum control systems, and optimal control using the Bellman principle. We show that a quantum object described by a Schroedinger equation can be controlled in an optimal way by electromagnetic modes. We also demonstrate an application of these techniques and an algebra-geometric approach to the study of dynamic processes in nonlinear systems. The information processing by means of controlled quantum lattices is discussed: we present new mathematical models of classical (CL) and quantum-mechanical lattices (QML) and their application to information processing. system-theoretical results on the observability, controllability and minimal realizability theorems are formulated for cl. The cellular dynamaton (CD) based on quantum oscillators is presented. Cellular's quantum computational search procedure can provide the basis for implementing adaptive global optimization algorithms. A brief overview of the procedure is given and a framework called lattice adaptive search is set up. A method of Yatsenko and one introduced by the authors fit into this framework and are compared.
Classical algorithms are often not effective for solving nonconvex optimization problems where local minima are separated by high barriers. In this paper, we explore possible quantum speedups for nonconvex optimization by leveraging the global effect of quantum tunneling. Specifically, we introduce a quantum algorithm termed the quantum tunneling walk (QTW) and apply it to nonconvex problems where local minima are approximately global minima. We show that QTW achieves quantum speedup over classical stochastic gradient descents (SGD) when the barriers between different local minima are high but thin and the minima are flat. Based on this observation, we construct a specific double-well landscape, where classical algorithms cannot efficiently hit one target well knowing the other well but QTW can when given proper initial states near the known well. Finally, we corroborate our findings with numerical experiments.
Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.
Optimization problems are fundamental across various scientific and industrial domains, from logistics and finance to machine learning and drug discovery. Classical optimization algorithms, such as gradient-based methods and heuristic approaches, often struggle with issues like slow convergence, getting trapped in local minima, and inefficiency in handling high-dimensional or combinatorial problems. Applying the concepts of quantum optimization with quantum mechanics algorithms presents viable substitutes with the potential for speedups and better solution quality. Among the significant quantum optimization techniques investigated in this paper are Grover's Search Algorithm, Variational Quantum Eigensolver (VQE), Quantum Annealing, and the Quantum Approximate Optimization Algorithm (QAOA). QAOA is designed for combinatorial optimization problems, blending quantum and classical techniques to approximate optimal solutions. VQE, widely used in quantum chemistry, employs a hybrid quantum-classical approach to determine ground-state energies efficiently. Grover's algorithm fastens up searching databases, indirectly aiding optimization tasks. Quantum annealing, implemented by systems like D-Wave, solves optimization problems by exploiting quantum tunneling to escape local minima. Despite their advantages, these quantum approaches face challenges, including hardware limitations, noise in quantum systems, and scalability concerns. However, these algorithms are expected to be essential in solving complicated optimization problems that are currently intractable by classical approaches when quantum technology develops.
In the past few decades, there has been an acute problem of creating a quantum computer that uses quantum mechanical effects such as quantum parallelism and quantum entanglement for computations. Using these mechanisms, the quantum computer is able to solve some of the NP-class problems in polynomial time. A hardware approach to modeling quantum computing is considered, and a general mathematical model of the operation of a quantum computer is described, and a technique for mathematical modeling of quantum computing is presented. At the stage of consideration of the method of mathematical modeling, the most resource-intensive parts of the model are indicated. Also, issues related to data parallelization on a hardware accelerator, which are planned to be used to simulate quantum computing, were considered, and algorithms for the operation of this type of accelerator were given. A more compact data format is proposed, which is recommended to be used when implementing the accelerator. Using the proposed format, it is possible to reduce the resources spent on elementary arithmetic operations. The possibility of introducing an optimization algorithm to minimize the time spent in computations, as well as to speed up the execution of quantum algorithms in simulators of a quantum computer at the stage of the effect of quantum gates on the quantum register model, is proposed. The results of the optimization algorithm and its comparison with the classical mathematical approach using a software model are presented.
Quantum annealers aim at solving nonconvex optimization problems by exploiting cooperative tunneling effects to escape local minima. The underlying idea consists of designing a classical energy function whose ground states are the sought optimal solutions of the original optimization problem and add a controllable quantum transverse field to generate tunneling processes. A key challenge is to identify classes of nonconvex optimization problems for which quantum annealing remains efficient while thermal annealing fails. We show that this happens for a wide class of problems which are central to machine learning. Their energy landscapes are dominated by local minima that cause exponential slowdown of classical thermal annealers while simulated quantum annealing converges efficiently to rare dense regions of optimal solutions.