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

International Artificial Intelligence and Data Processing Symposium (IDAP)

2D versus 3D Bloch Sphere Representations in Quantum-Inspired Evolutionary Algorithms: An Empirical Comparison on Benchmark Functions

Büşra Özcan, Abdullah Ateş

Published Sep 1, 2026• 0 citations
Publisher

Abstract

The Quantum-inspired Evolutionary Algorithm (QEA) describes each individual with a qubit-based structure that works with probabilities, not fixed sequences of bits. While the Bloch sphere is naturally three-dimensional, most QEA studies focus on just a two-dimensional part and ignore the phase part of the quantum state. This research looks at whether using the third dimension of the Bloch sphere, by adding the phase angle ϕ, actually helps the algorithm do better on continuous optimization problems. Two versions of QEA were tested. The first uses the usual two-dimensional approach, and the second adds a phase angle to make it three-dimensional. The testing procedure was identical for both models: each used three variables, assigned four bits to every variable, and carried out thirty independent runs for each problem. The paper presents ten problems, including some with one peak, some with many peaks, some with variables separated, some with variables not separated, and one engineering example. The results showed that the two-dimensional model had less variation in its results for eight of the ten problems, but the three-dimensional model was better only for the rotated ellipsoid and an engineering example, where the variables are connected to each other. The average CPU time was almost the same for both models. Rather than proposing a new optimiser, the study is designed as a controlled ablation in which the phase degree of freedom is the only manipulated factor, with encoding, population size, selection and computational budget held fixed. In summary, using phase information only helps when the problem has geometric relationships that match the way the three-dimensional update works.

DOI
10.1109/idap71869.2026.11728231

Related papers

Usage Effect of the 3D Sphere Block in Quantum-Inspired Optimization for Some Benchmark Functions

Büşra Özcan, Abdullah Ateş

This paper examines when the three-dimensional Bloch sphere can give better results than the usual two-dimensional model in Quantum-inspired Evolutionary Algorithms. Earlier research has pointed out that the 3D version does better than the 2D one only if the problem has clear links between variables, but there has not been a method to predict this situation. To help with this, a new prediction measure called $\boldsymbol{\psi}$ is introduced. The $\boldsymbol{\psi}$ score brings together three features of the optimization problem. First, it uses the variable interaction ratio, which is based on the off-diagonal elements of the Hessian matrix. Second, it includes the condition number, which shows the difference in curvature in different directions. Third, it considers rotation sensitivity, which is measured by seeing how much the 2D model’s results change if the problem is rotated randomly. Each feature is put on the same scale using the tanh function. A $\boldsymbol{\psi}$ score higher than 0.5 means the 3D model might work better, while a score of 0.5 or less means the 2D model is enough. This method was checked on ten test problems. Three of them had variables that do not affect each other, and seven had variables that do. Each test was repeated thirty times. The results show that the $\boldsymbol{\psi}$ score correctly predicts when the 3D model will be better in seven out of ten problems. In these cases, the 3D model gave better average fitness and more stable results when $\boldsymbol{\psi}$ was 0.5 or higher. However, there were problems with the Rotated Bent Cigar I and II and the Rotated Schwefel II cases. In these cases, $\boldsymbol{\psi}$ was less than 0.5, but the 3D model still did better, which shows that the rotation sensitivity part does not work well for unusual search spaces. The findings suggest that the $\Psi$ score is a good first step, but the type of variable dependency in the problem is more important than just its amount for choosing between 2D and 3D models. In the future, logistic regression will be used to fine-tune the weights for each feature.

International Artificial Intelligence and Data Processing Symposium (IDAP)•Sep 1, 2026•0 citations

Effect of Population Structures on Quantum-Inspired Evolutionary Algorithm

Nija Mani, G.P. Srivastava, A. K. Sinha +1 more

Quantum-inspired evolutionary algorithm (QEA) has been designed by integrating some quantum mechanical principles in the framework of evolutionary algorithms. They have been successfully employed as a computational technique in solving difficult optimization problems. It is well known that QEAs provide better balance between exploration and exploitation as compared to the conventional evolutionary algorithms. The population in QEA is evolved by variation operators, which move the Q-bit towards an attractor. A modification for improving the performance of QEA was proposed by changing the selection of attractors, namely, versatile QEA. The improvement attained by versatile QEA over QEA indicates the impact of population structure on the performance of QEA and motivates further investigation into employing fine-grained model. The QEA with fine-grained population model (FQEA) is similar to QEA with the exception that every individual is located in a unique position on a two-dimensional toroidal grid and has four neighbors amongst which it selects its attractor. Further, FQEA does not use migrations, which is employed by QEAs. This paper empirically investigates the effect of the three different population structures on the performance of QEA by solving well-known discrete benchmark optimization problems.

Applied Computational Intelligence and Soft Computing•Jan 1, 2014•6 citations

On setting the parameters of quantum-inspired evolutionary algorithm for practical application

Kuk-Hyun Han, Jong-Hwan Kim

In this paper, some guidelines for setting the parameters of quantum-inspired evolutionary algorithm (QEA) are presented. QEA is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. However, QEA is not a quantum algorithm, but a novel evolutionary algorithm. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, the evaluation function, and the population dynamics. From recent research on the knapsack problem, the results of QEA are better than those of CGA (conventional GA). Although the performance of QEA is excellent, there is relatively little or no research on the effects of different settings for its parameters. This paper describes some guidelines for setting these parameters. The guidelines are drawn up based on extensive experiments carried out for a class of combinatorial and numerical optimization problems. Through the guidelines, the performance of QEA can be maximized.

IEEE Congress on Evolutionary Computation (CEC)•Jan 1, 2003•71 citations

Quantum-Inspired Evolutionary Algorithms With a New Termination Criterion, $H_epsilon $ Gate, and Two-Phase Scheme

K.-H. Han, J.-H. Kim

From recent research on combinatorial optimization of the knapsack problem, quantum-inspired evolutionary algorithm (QEA) was proved to be better than conventional genetic algorithms. To improve the performance of the QEA, this paper proposes research issues on QEA such as a termination criterion, a Q-gate, and a two-phase scheme, for a class of numerical and combinatorial optimization problems. A new termination criterion is proposed which gives a clearer meaning on the convergence of Q-bit individuals. A novel variation operator H/sub /spl epsi// gate, which is a modified version of the rotation gate, is proposed along with a two-phase QEA scheme based on the analysis of the effect of changing the initial conditions of Q-bits of the Q-bit individual in the first phase. To demonstrate the effectiveness and applicability of the updated QEA, several experiments are carried out on a class of numerical and combinatorial optimization problems. The results show that the updated QEA makes QEA more powerful than the previous QEA in terms of convergence speed, fitness, and robustness.

IEEE Transactions on Evolutionary Computation•Apr 1, 2004•486 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

A quantum evolutionary algorithm inspired by manta ray foraging optimisation

Shikha Gupta, Naveen Kumar V

Manta ray foraging optimisation (MRFO) algorithm, a recent bio-inspired technique, and quantum-motivated computing have proven effective in solving complex combinatorial optimisation problems. Leveraging their qualities, we propose a continuous space optimisation approach that offers a novel combination of encoding and evolution of the chromosomes. The qubits in the quantum individual are encoded with the phase parameters and are based on Bloch representation. The phase angle-encoded qubit simplifies the expression and evolution of an individual. The proposed algorithm can search the optimised solution simultaneously on three coordinate axes of the Bloch sphere, to possibly achieve better convergence. The performance of the proposed algorithm is examined vis-a-vis the standard MRFO algorithm for optimising the value of 20 benchmark functions. While both algorithms compete well in finding the best fitness values, the proposed approach shows better convergence for 16 out of 20 functions.

International Journal of Computational Science and Engineering•Jan 1, 2024•2 citations
The Quantum-inspired Evolutionary Algorithm (QEA) describes each individual with a qubit-based structure that works with probabilities, not fixed sequences of bits. While the Bloch sphere is naturally three-dimensional, most QEA studies focus on just a two-dimensional part and ignore the phase part of the quantum state. This research looks at whether using the third dimension of the Bloch sphere, by adding the phase angle ϕ, actually helps the algorithm do better on continuous optimization problems. Two versions of QEA were tested. The first uses the usual two-dimensional approach, and the second adds a phase angle to make it three-dimensional. The testing procedure was identical for both models: each used three variables, assigned four bits to every variable, and carried out thirty independent runs for each problem. The paper presents ten problems, including some with one peak, some with many peaks, some with variables separated, some with variables not separated, and one engineering example. The results showed that the two-dimensional model had less variation in its results for eight of the ten problems, but the three-dimensional model was better only for the rotated ellipsoid and an engineering example, where the variables are connected to each other. The average CPU time was almost the same for both models. Rather than proposing a new optimiser, the study is designed as a controlled ablation in which the phase degree of freedom is the only manipulated factor, with encoding, population size, selection and computational budget held fixed. In summary, using phase information only helps when the problem has geometric relationships that match the way the three-dimensional update works.
This paper examines when the three-dimensional Bloch sphere can give better results than the usual two-dimensional model in Quantum-inspired Evolutionary Algorithms. Earlier research has pointed out that the 3D version does better than the 2D one only if the problem has clear links between variables, but there has not been a method to predict this situation. To help with this, a new prediction measure called ψ\boldsymbol{\psi}ψ is introduced. The ψ\boldsymbol{\psi}ψ score brings together three features of the optimization problem. First, it uses the variable interaction ratio, which is based on the off-diagonal elements of the Hessian matrix. Second, it includes the condition number, which shows the difference in curvature in different directions. Third, it considers rotation sensitivity, which is measured by seeing how much the 2D model’s results change if the problem is rotated randomly. Each feature is put on the same scale using the tanh function. A ψ\boldsymbol{\psi}ψ score higher than 0.5 means the 3D model might work better, while a score of 0.5 or less means the 2D model is enough. This method was checked on ten test problems. Three of them had variables that do not affect each other, and seven had variables that do. Each test was repeated thirty times. The results show that the ψ\boldsymbol{\psi}ψ score correctly predicts when the 3D model will be better in seven out of ten problems. In these cases, the 3D model gave better average fitness and more stable results when ψ\boldsymbol{\psi}ψ was 0.5 or higher. However, there were problems with the Rotated Bent Cigar I and II and the Rotated Schwefel II cases. In these cases, ψ\boldsymbol{\psi}ψ was less than 0.5, but the 3D model still did better, which shows that the rotation sensitivity part does not work well for unusual search spaces. The findings suggest that the Ψ\PsiΨ score is a good first step, but the type of variable dependency in the problem is more important than just its amount for choosing between 2D and 3D models. In the future, logistic regression will be used to fine-tune the weights for each feature.
Quantum-inspired evolutionary algorithm (QEA) has been designed by integrating some quantum mechanical principles in the framework of evolutionary algorithms. They have been successfully employed as a computational technique in solving difficult optimization problems. It is well known that QEAs provide better balance between exploration and exploitation as compared to the conventional evolutionary algorithms. The population in QEA is evolved by variation operators, which move the Q-bit towards an attractor. A modification for improving the performance of QEA was proposed by changing the selection of attractors, namely, versatile QEA. The improvement attained by versatile QEA over QEA indicates the impact of population structure on the performance of QEA and motivates further investigation into employing fine-grained model. The QEA with fine-grained population model (FQEA) is similar to QEA with the exception that every individual is located in a unique position on a two-dimensional toroidal grid and has four neighbors amongst which it selects its attractor. Further, FQEA does not use migrations, which is employed by QEAs. This paper empirically investigates the effect of the three different population structures on the performance of QEA by solving well-known discrete benchmark optimization problems.
In this paper, some guidelines for setting the parameters of quantum-inspired evolutionary algorithm (QEA) are presented. QEA is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. However, QEA is not a quantum algorithm, but a novel evolutionary algorithm. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, the evaluation function, and the population dynamics. From recent research on the knapsack problem, the results of QEA are better than those of CGA (conventional GA). Although the performance of QEA is excellent, there is relatively little or no research on the effects of different settings for its parameters. This paper describes some guidelines for setting these parameters. The guidelines are drawn up based on extensive experiments carried out for a class of combinatorial and numerical optimization problems. Through the guidelines, the performance of QEA can be maximized.
From recent research on combinatorial optimization of the knapsack problem, quantum-inspired evolutionary algorithm (QEA) was proved to be better than conventional genetic algorithms. To improve the performance of the QEA, this paper proposes research issues on QEA such as a termination criterion, a Q-gate, and a two-phase scheme, for a class of numerical and combinatorial optimization problems. A new termination criterion is proposed which gives a clearer meaning on the convergence of Q-bit individuals. A novel variation operator H/sub /spl epsi// gate, which is a modified version of the rotation gate, is proposed along with a two-phase QEA scheme based on the analysis of the effect of changing the initial conditions of Q-bits of the Q-bit individual in the first phase. To demonstrate the effectiveness and applicability of the updated QEA, several experiments are carried out on a class of numerical and combinatorial optimization problems. The results show that the updated QEA makes QEA more powerful than the previous QEA in terms of convergence speed, fitness, and robustness.
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.
Manta ray foraging optimisation (MRFO) algorithm, a recent bio-inspired technique, and quantum-motivated computing have proven effective in solving complex combinatorial optimisation problems. Leveraging their qualities, we propose a continuous space optimisation approach that offers a novel combination of encoding and evolution of the chromosomes. The qubits in the quantum individual are encoded with the phase parameters and are based on Bloch representation. The phase angle-encoded qubit simplifies the expression and evolution of an individual. The proposed algorithm can search the optimised solution simultaneously on three coordinate axes of the Bloch sphere, to possibly achieve better convergence. The performance of the proposed algorithm is examined vis-a-vis the standard MRFO algorithm for optimising the value of 20 benchmark functions. While both algorithms compete well in finding the best fitness values, the proposed approach shows better convergence for 16 out of 20 functions.