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

Quantum Dynamics Interpretation of Black-box Optimization.

Peng Wang, Gang Xin, Yuwei Jiao

Published Jun 26, 2021• 0 citations
OpenAlex

Abstract

In recent decades, with the emergence of numerous novel intelligent optimization algorithms, many optimization researchers have begun to look for a basic search mechanism for their schemes that provides a more essential explanation of their studies. This paper aims to study the basic mechanism of an algorithm for black-box optimization with quantum theory. To achieve this goal, the Schroedinger equation is employed to establish the relationship between the optimization problem and the quantum system, which makes it possible to study the dynamic search behaviors in the evolution process with quantum theory. Moreover, to explore the basic behavior of the optimization system, the optimization problem is assumed to be decomposed and approximated. Then, a multilevel approximation quantum dynamics model of the optimization algorithm is established, which provides a mathematical and physical framework for the analysis of the optimization algorithm. Correspondingly, the basic search behavior based on this model is derived, which is governed by quantum theory. Comparison experiments and analysis between different bare-bones algorithms confirm the existence of the quantum mechanic based basic search mechanism of the algorithm on black-box optimization.

Related papers

Quantum Dynamics of Optimization Problems

Peng Wang, Gang Xin, Yuwei Jiao

In this letter, by establishing the Schrödinger equation of the optimization problem, the optimization problem is transformed into a constrained state quantum problem with the objective function as the potential energy. The mathematical relationship between the objective function and the wave function is established, and the quantum interpretation of the optimization problem is realized. Under the black box model, the Schrödinger equation of the optimization problem is used to establish the kinetic equation, i.e., the Fokker-Planck equation of the time evolution of the optimization algorithm, and the basic iterative structure of the optimization algorithm is given according to the interpretation of the Fokker-Planck equation. The establishment of the Fokker-Planck equation allows optimization algorithms to be studied using dynamic methods and is expected to become an important theoretical basis for algorithm dynamics.

arXiv:2012.03312•Dec 6, 2020•1 citation

Quantum mechanical framework for quantization-based optimization: from Gradient flow to Schroedinger equation

Jinwuk Seok, Changsik Cho

This work presents a quantum mechanical framework for analyzing quantization-based optimization algorithms. The sampling process of the quantization-based search is modeled as a gradient-flow dissipative system, leading to a Hamilton-Jacobi-Bellman (HJB) representation. Through a suitable transformation of the objective function, this formulation yields the Schroedinger equation, which reveals that quantum tunneling enables escape from local minima and guarantees access to the global optimum. By establishing the connection to the Fokker-Planck equation, the framework provides a thermodynamic interpretation of global convergence. Such an analysis between the thermodynamic and the quantum dynamic methodology unifies combinatorial and continuous optimization, and extends naturally to machine learning tasks such as image classification. Numerical experiments demonstrate that quantization-based optimization consistently outperforms conventional algorithms across both combinatorial problems and nonconvex continuous functions.

quant-pharXiv:2603.11536•Mar 13, 2026•0 citations

Investigation of Bare-bones Algorithms from Quantum Perspective: A Quantum Dynamical Global Optimizer

Peng Wang, Gang Xin, Wang Sheng Fang

Recent decades, the emergence of numerous novel algorithms makes it a gimmick to propose an intelligent optimization system based on metaphor, and hinders researchers from exploring the essence of search behavior in algorithms. However, it is difficult to directly discuss the search behavior of an intelligent optimization algorithm, since there are so many kinds of intelligent schemes. To address this problem, an intelligent optimization system is regarded as a simulated physical optimization system in this paper. The dynamic search behavior of such a simplified physical optimization system are investigated with quantum theory. To achieve this goal, the Schroedinger equation is employed as the dynamics equation of the optimization algorithm, which is used to describe dynamic search behaviours in the evolution process with quantum theory. Moreover, to explore the basic behaviour of the optimization system, the optimization problem is assumed to be decomposed and approximated. Correspondingly, the basic search behaviour is derived, which constitutes the basic iterative process of a simple optimization system. The basic iterative process is compared with some classical bare-bones schemes to verify the similarity of search behavior under different metaphors. The search strategies of these bare bones algorithms are analyzed through experiments.

arXiv:2106.13927•Jun 26, 2021•0 citations

A Comprehensive Review of Metaheuristic Algorithms Inspired by Quantum Mechanics

Sunita S. Biswal, Dipak Ranjan Swain, Pravat Kumar Rout +2 more

This article comprehensively reviews the recently developed quantum mechanics-based optimization techniques. The quantum theory has been employed to speed up the evolutionary method and enhance the possibility of finding the optimal solution of conventional optimization techniques. Current developments in quantum computing have demonstrated that quantum theory can offer significant benefits over conventional theory for certain optimization techniques. The future prospective and benefits and drawbacks of this fresh category of quantum optimization techniques have been presented in this review. It also enables new researchers and algorithm developers to use these simple but extremely effective algorithms for problem-solving. This paper aims to give readers an overview of the fundamental elements and recent advances in optimization techniques so that they can develop and implement these for various applications. Finally, a few findings are reached, and future study on quantum-based optimization techniques is discussed.

International Conference in Advances in Power, Signal, and Information Technology (APSIT)•Jun 9, 2023•1 citation

Quantum Optimization and Quantum Learning: A Survey

Yangyang Li, Mengzhuo Tian, Guangyuan Liu +2 more

Quantum mechanism, which has received widespread attention, is in continuous evolution rapidly. The powerful computing power and high parallel ability of quantum mechanism equip the quantum field with broad application scenarios and brand-new vitality. Inspired by nature, intelligent algorithm has always been one of the research hotspots. It is a frontier interdisciplinary subject with a perfect integration of biology, mathematics and other disciplines. Naturally, the idea of combining quantum mechanism with intelligent algorithms will inject new vitality into artificial intelligence system. This paper lists major breakthroughs in the development of quantum domain firstly, then summarizes the existing quantum algorithms from two aspects: quantum optimization and quantum learning. After that, related concepts, main contents and research progresses of quantum optimization and quantum learning are introduced respectively. At last, experiments are conducted to prove that quantum intelligent algorithms have strong competitiveness compared with traditional intelligent algorithms and possess great potential by simulating quantum computing.

IEEE Access•Jan 1, 2020•177 citations

Dynamic Quantum Self-Organization Optimization

Jincheng Zhang

This paper introduces a novel dynamic quantum self-organization optimization framework. Traditional optimization methods often struggle to effectively address complex systems due to the inherent challenges of quantum mechanics. We propose a framework that utilizes quantum mechanics to automatically identify and optimize complex systems, leveraging a combination of quantum phenomena and optimization principles. The framework focuses on identifying optimal configurations within a system through iterative quantum self-organization, offering a fundamentally new approach to optimization challenges. The core claim of this work is that this framework provides a significantly more robust and effective method for optimizing complex systems compared to conventional techniques. We present a detailed overview of the proposed framework, its mathematical foundations, and preliminary results demonstrating its effectiveness in a specific, albeit simplified, case study.

•Sep 2, 2026•0 citations
In recent decades, with the emergence of numerous novel intelligent optimization algorithms, many optimization researchers have begun to look for a basic search mechanism for their schemes that provides a more essential explanation of their studies. This paper aims to study the basic mechanism of an algorithm for black-box optimization with quantum theory. To achieve this goal, the Schroedinger equation is employed to establish the relationship between the optimization problem and the quantum system, which makes it possible to study the dynamic search behaviors in the evolution process with quantum theory. Moreover, to explore the basic behavior of the optimization system, the optimization problem is assumed to be decomposed and approximated. Then, a multilevel approximation quantum dynamics model of the optimization algorithm is established, which provides a mathematical and physical framework for the analysis of the optimization algorithm. Correspondingly, the basic search behavior based on this model is derived, which is governed by quantum theory. Comparison experiments and analysis between different bare-bones algorithms confirm the existence of the quantum mechanic based basic search mechanism of the algorithm on black-box optimization.
In this letter, by establishing the Schrödinger equation of the optimization problem, the optimization problem is transformed into a constrained state quantum problem with the objective function as the potential energy. The mathematical relationship between the objective function and the wave function is established, and the quantum interpretation of the optimization problem is realized. Under the black box model, the Schrödinger equation of the optimization problem is used to establish the kinetic equation, i.e., the Fokker-Planck equation of the time evolution of the optimization algorithm, and the basic iterative structure of the optimization algorithm is given according to the interpretation of the Fokker-Planck equation. The establishment of the Fokker-Planck equation allows optimization algorithms to be studied using dynamic methods and is expected to become an important theoretical basis for algorithm dynamics.
This work presents a quantum mechanical framework for analyzing quantization-based optimization algorithms. The sampling process of the quantization-based search is modeled as a gradient-flow dissipative system, leading to a Hamilton-Jacobi-Bellman (HJB) representation. Through a suitable transformation of the objective function, this formulation yields the Schroedinger equation, which reveals that quantum tunneling enables escape from local minima and guarantees access to the global optimum. By establishing the connection to the Fokker-Planck equation, the framework provides a thermodynamic interpretation of global convergence. Such an analysis between the thermodynamic and the quantum dynamic methodology unifies combinatorial and continuous optimization, and extends naturally to machine learning tasks such as image classification. Numerical experiments demonstrate that quantization-based optimization consistently outperforms conventional algorithms across both combinatorial problems and nonconvex continuous functions.
Recent decades, the emergence of numerous novel algorithms makes it a gimmick to propose an intelligent optimization system based on metaphor, and hinders researchers from exploring the essence of search behavior in algorithms. However, it is difficult to directly discuss the search behavior of an intelligent optimization algorithm, since there are so many kinds of intelligent schemes. To address this problem, an intelligent optimization system is regarded as a simulated physical optimization system in this paper. The dynamic search behavior of such a simplified physical optimization system are investigated with quantum theory. To achieve this goal, the Schroedinger equation is employed as the dynamics equation of the optimization algorithm, which is used to describe dynamic search behaviours in the evolution process with quantum theory. Moreover, to explore the basic behaviour of the optimization system, the optimization problem is assumed to be decomposed and approximated. Correspondingly, the basic search behaviour is derived, which constitutes the basic iterative process of a simple optimization system. The basic iterative process is compared with some classical bare-bones schemes to verify the similarity of search behavior under different metaphors. The search strategies of these bare bones algorithms are analyzed through experiments.
This article comprehensively reviews the recently developed quantum mechanics-based optimization techniques. The quantum theory has been employed to speed up the evolutionary method and enhance the possibility of finding the optimal solution of conventional optimization techniques. Current developments in quantum computing have demonstrated that quantum theory can offer significant benefits over conventional theory for certain optimization techniques. The future prospective and benefits and drawbacks of this fresh category of quantum optimization techniques have been presented in this review. It also enables new researchers and algorithm developers to use these simple but extremely effective algorithms for problem-solving. This paper aims to give readers an overview of the fundamental elements and recent advances in optimization techniques so that they can develop and implement these for various applications. Finally, a few findings are reached, and future study on quantum-based optimization techniques is discussed.
Quantum mechanism, which has received widespread attention, is in continuous evolution rapidly. The powerful computing power and high parallel ability of quantum mechanism equip the quantum field with broad application scenarios and brand-new vitality. Inspired by nature, intelligent algorithm has always been one of the research hotspots. It is a frontier interdisciplinary subject with a perfect integration of biology, mathematics and other disciplines. Naturally, the idea of combining quantum mechanism with intelligent algorithms will inject new vitality into artificial intelligence system. This paper lists major breakthroughs in the development of quantum domain firstly, then summarizes the existing quantum algorithms from two aspects: quantum optimization and quantum learning. After that, related concepts, main contents and research progresses of quantum optimization and quantum learning are introduced respectively. At last, experiments are conducted to prove that quantum intelligent algorithms have strong competitiveness compared with traditional intelligent algorithms and possess great potential by simulating quantum computing.
This paper introduces a novel dynamic quantum self-organization optimization framework. Traditional optimization methods often struggle to effectively address complex systems due to the inherent challenges of quantum mechanics. We propose a framework that utilizes quantum mechanics to automatically identify and optimize complex systems, leveraging a combination of quantum phenomena and optimization principles. The framework focuses on identifying optimal configurations within a system through iterative quantum self-organization, offering a fundamentally new approach to optimization challenges. The core claim of this work is that this framework provides a significantly more robust and effective method for optimizing complex systems compared to conventional techniques. We present a detailed overview of the proposed framework, its mathematical foundations, and preliminary results demonstrating its effectiveness in a specific, albeit simplified, case study.