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

Designing a New Continuous Quantum Evolutionary Algorithm for Nonlinear Optimization and Efficiency Frontier Evaluation

Tahereh Azizpour, Majid Yarahmadi

Published Jan 1, 2026• 0 citations
Publisher

Abstract

In this paper, we introduce a new continuous quantum evolutionary optimization algorithm designed for optimizing nonlinear convex functions, non-convex functions, and efficiency evaluation problems using quantum computing principles. Traditional quantum evolutionary algorithms have primarily been implemented for discrete and binary decision variables. The proposed method has been designed as a novel continuous quantum evolutionary optimization algorithm tailored to problems with continuous decision variables. To assess the algorithm’s performance, several numerical experiments are conducted, and the simulated results are compared with the Grey Wolf Optimizer and Magnet Fish Optimization search algorithm. The simulation results indicate that the proposed algorithm can approximate the optimal solution more accurately than the two compared algorithms.

DOI
10.30473/coam.2025.74960.1316

Related papers

Improving Quantum Genetic Algorithms through Recursive Search Space Exploration

Giovanni Acampora, Autilia Vitiello

Recently, quantum computing has emerged as a new paradigm that promises to improve artificial intelligence techniques. One of the research fields that is certainly benefiting from this new computational paradigm is evolutionary optimization. In literature, efforts have been already made to run evolutionary algorithms on quantum computers using quantum effects such as superposition and entanglement to converge towards sub-optimal solutions of hard problems. However, the performance of these quantum evolutionary approaches is limited by the number of qubits available on current quantum devices. This limitation is more noticeable in the case of continuous optimization problems, where the search space is potentially infinite. This paper presents a recursive algorithmic structure that embodies a quantum evolutionary algorithm to overcome the limitations mentioned above. The result is an innovative and efficient approach in the context of quantum evolutionary optimization.

IEEE Congress on Evolutionary Computation (CEC)•Jun 30, 2024•0 citations

Improving quantum genetic optimization through granular computing

Giovanni Acampora, Autilia Vitiello

Abstract Quantum computers promise to revolutionize the world of computing thanks to some features of quantum mechanics that can enable massive parallelism in computation. This benefit may be particularly relevant in the design of evolutionary algorithms, where the quantum paradigm could support the exploration of multiple regions of the search space in a concurrent way. Although some efforts in this research field are ongoing, the potential of quantum computing is not yet fully expressed due to the limited number of qubits of current quantum processors. This limitation is even more acute when one wants to deal with continuous optimization problems, where the search space is potentially infinite. The goal of this paper is to address this limitation by introducing a hybrid and granular approach to quantum algorithm design, specifically designed for genetic optimization. This approach is defined as hybrid, because it uses a digital computer to evaluate fitness functions, and a quantum processor to evolve the genetic population; moreover, it uses granular computing to hierarchically reduce the size of the search space of a problem, so that good near-optimal solutions can be identified even on small quantum computers. As shown in the experiments, where IBM Q family processors are used, the usage of a granular computation scheme statistically enhances the performance of the state-of-the-art evolutionary algorithm implemented on quantum computers, when it is run to optimize well-known benchmark continuous functions.

Granular Computing•Oct 8, 2022•9 citations

Quantum-inspired evolutionary algorithm for a class of combinatorial optimization

Kuk-Hyun Han, Jong-Hwan Kim

This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, evaluation function, and population dynamics. However, instead of binary, numeric, or symbolic representation, QEA uses a Q-bit, defined as the smallest unit of information, for the probabilistic representation and a Q-bit individual as a string of Q-bits. A Q-gate is introduced as a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, experiments were carried out on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that QEA performs well, even with a small population, without premature convergence as compared to the conventional genetic algorithm.

IEEE Transactions on Evolutionary Computation•Dec 1, 2002•1,619 citations

Quantum-Inspired Evolutionary Algorithms for Complex Optimization

Jincheng Zhang

This paper presents a novel approach to complex optimization problems by integrating quantum-inspired concepts within an evolutionary algorithm framework. Traditional evolutionary algorithms, such as Genetic Algorithms and Differential Evolution, can struggle with high-dimensional and complex search spaces, often exhibiting slow convergence rates. We hypothesize that principles derived from quantum mechanics, specifically superposition and entanglement, can provide a more effective mechanism for exploring these spaces. Our proposed Quantum-Inspired Evolutionary Algorithm (QIEA) incorporates operators designed to mimic quantum interference and entanglement, allowing for a more nuanced and potentially faster exploration of the solution landscape. The core claim is that these quantum-inspired mechanisms can significantly enhance the efficiency of evolutionary optimization. The paper details the algorithm's design, including the implementation of interference and entanglement operators, and discusses its potential advantages and challenges. Experimental results (though not presented through dedicated experimental sections) demonstrate the algorithm's ability to outperform standard evolutionary algorithms on a range of benchmark problems.

•Aug 29, 2026•0 citations

Quantum-Based Probabilistic Optimization Algorithm

Jincheng Zhang

This paper introduces a novel probabilistic optimization algorithm leveraging the unique capabilities of quantum computing. Traditional optimization techniques often struggle with large-scale problems, limiting their applicability. We propose a quantum-enhanced algorithm designed to accelerate and improve the solution of complex optimization tasks. This algorithm utilizes quantum mechanics principles to enhance the search process, leading to more efficient and accurate results. The core mechanism centers around quantum superposition and entanglement to explore solution spaces in a fundamentally different manner. We detail the algorithm's design, the quantum circuit implementation, and the resulting performance improvements compared to classical approaches. The paper concludes with a discussion of the potential implications of this approach for various real-world optimization challenges.

•Sep 6, 2026•0 citations

A Quantum Approximate Optimization Algorithm for continuous problems

Guillaume Verdon, Juan Miguel Arrazola, Kamil Brádler +1 more

We introduce a quantum approximate optimization algorithm (QAOA) for continuous optimization. The algorithm is based on the dynamics of a quantum system moving in an energy potential which encodes the objective function. By approximating the dynamics at finite time steps, the algorithm can be expressed as alternating evolution under two non-commuting Hamiltonians. We show that each step of the algorithm updates the wavefunction in the direction of its local gradient, with an additional momentum-dependent displacement. For initial states in a superposition over many points, this method can therefore be interpreted as a coherent version of gradient descent, i.e., 'gradient descent in superposition.' This approach can be used for both constrained and unconstrained optimization. In terms of computational complexity, we show how variants of the algorithm can recover continuous-variable Grover search, and how a single iteration can replicate continuous-variable instantaneous quantum polynomial circuits. We also discuss how the algorithm can be adapted to solve discrete optimization problems. Finally, we test the algorithm through numerical simulation in optimizing the Styblinski-Tang function.

arXiv:1902.00409•Feb 1, 2019•67 citations
In this paper, we introduce a new continuous quantum evolutionary optimization algorithm designed for optimizing nonlinear convex functions, non-convex functions, and efficiency evaluation problems using quantum computing principles. Traditional quantum evolutionary algorithms have primarily been implemented for discrete and binary decision variables. The proposed method has been designed as a novel continuous quantum evolutionary optimization algorithm tailored to problems with continuous decision variables. To assess the algorithm’s performance, several numerical experiments are conducted, and the simulated results are compared with the Grey Wolf Optimizer and Magnet Fish Optimization search algorithm. The simulation results indicate that the proposed algorithm can approximate the optimal solution more accurately than the two compared algorithms.
Recently, quantum computing has emerged as a new paradigm that promises to improve artificial intelligence techniques. One of the research fields that is certainly benefiting from this new computational paradigm is evolutionary optimization. In literature, efforts have been already made to run evolutionary algorithms on quantum computers using quantum effects such as superposition and entanglement to converge towards sub-optimal solutions of hard problems. However, the performance of these quantum evolutionary approaches is limited by the number of qubits available on current quantum devices. This limitation is more noticeable in the case of continuous optimization problems, where the search space is potentially infinite. This paper presents a recursive algorithmic structure that embodies a quantum evolutionary algorithm to overcome the limitations mentioned above. The result is an innovative and efficient approach in the context of quantum evolutionary optimization.
Abstract Quantum computers promise to revolutionize the world of computing thanks to some features of quantum mechanics that can enable massive parallelism in computation. This benefit may be particularly relevant in the design of evolutionary algorithms, where the quantum paradigm could support the exploration of multiple regions of the search space in a concurrent way. Although some efforts in this research field are ongoing, the potential of quantum computing is not yet fully expressed due to the limited number of qubits of current quantum processors. This limitation is even more acute when one wants to deal with continuous optimization problems, where the search space is potentially infinite. The goal of this paper is to address this limitation by introducing a hybrid and granular approach to quantum algorithm design, specifically designed for genetic optimization. This approach is defined as hybrid, because it uses a digital computer to evaluate fitness functions, and a quantum processor to evolve the genetic population; moreover, it uses granular computing to hierarchically reduce the size of the search space of a problem, so that good near-optimal solutions can be identified even on small quantum computers. As shown in the experiments, where IBM Q family processors are used, the usage of a granular computation scheme statistically enhances the performance of the state-of-the-art evolutionary algorithm implemented on quantum computers, when it is run to optimize well-known benchmark continuous functions.
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, evaluation function, and population dynamics. However, instead of binary, numeric, or symbolic representation, QEA uses a Q-bit, defined as the smallest unit of information, for the probabilistic representation and a Q-bit individual as a string of Q-bits. A Q-gate is introduced as a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, experiments were carried out on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that QEA performs well, even with a small population, without premature convergence as compared to the conventional genetic algorithm.
This paper presents a novel approach to complex optimization problems by integrating quantum-inspired concepts within an evolutionary algorithm framework. Traditional evolutionary algorithms, such as Genetic Algorithms and Differential Evolution, can struggle with high-dimensional and complex search spaces, often exhibiting slow convergence rates. We hypothesize that principles derived from quantum mechanics, specifically superposition and entanglement, can provide a more effective mechanism for exploring these spaces. Our proposed Quantum-Inspired Evolutionary Algorithm (QIEA) incorporates operators designed to mimic quantum interference and entanglement, allowing for a more nuanced and potentially faster exploration of the solution landscape. The core claim is that these quantum-inspired mechanisms can significantly enhance the efficiency of evolutionary optimization. The paper details the algorithm's design, including the implementation of interference and entanglement operators, and discusses its potential advantages and challenges. Experimental results (though not presented through dedicated experimental sections) demonstrate the algorithm's ability to outperform standard evolutionary algorithms on a range of benchmark problems.
This paper introduces a novel probabilistic optimization algorithm leveraging the unique capabilities of quantum computing. Traditional optimization techniques often struggle with large-scale problems, limiting their applicability. We propose a quantum-enhanced algorithm designed to accelerate and improve the solution of complex optimization tasks. This algorithm utilizes quantum mechanics principles to enhance the search process, leading to more efficient and accurate results. The core mechanism centers around quantum superposition and entanglement to explore solution spaces in a fundamentally different manner. We detail the algorithm's design, the quantum circuit implementation, and the resulting performance improvements compared to classical approaches. The paper concludes with a discussion of the potential implications of this approach for various real-world optimization challenges.
We introduce a quantum approximate optimization algorithm (QAOA) for continuous optimization. The algorithm is based on the dynamics of a quantum system moving in an energy potential which encodes the objective function. By approximating the dynamics at finite time steps, the algorithm can be expressed as alternating evolution under two non-commuting Hamiltonians. We show that each step of the algorithm updates the wavefunction in the direction of its local gradient, with an additional momentum-dependent displacement. For initial states in a superposition over many points, this method can therefore be interpreted as a coherent version of gradient descent, i.e., 'gradient descent in superposition.' This approach can be used for both constrained and unconstrained optimization. In terms of computational complexity, we show how variants of the algorithm can recover continuous-variable Grover search, and how a single iteration can replicate continuous-variable instantaneous quantum polynomial circuits. We also discuss how the algorithm can be adapted to solve discrete optimization problems. Finally, we test the algorithm through numerical simulation in optimizing the Styblinski-Tang function.