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)

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

Büşra Özcan, Abdullah Ateş

Published Sep 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/idap71869.2026.11728080

Related papers

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

Büşra Özcan, Abdullah Ateş

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.

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

Quantum-inspired artificial fish swarm algorithm based on the Bloch sphere searching

Irjes, Jianping Li

To enhance the performance of the intelligent optimization algorithm, a new model of performing search on the Bloch sphere is proposed. Then, by integrating the model into the artificial fish swarm optimization, we present a quantum-inspired artificial fish swarm optimization algorithm. In proposed method, the fishes are encoded with the qubits described on the Bloch sphere. The vector product theory is adopted to establish the axis of rotation, and the Pauli matrices are used to construct the rotation matrices. The four fish behaviors, such as moving, tracking, capturing, aggregating, are achieved by rotating the current qubit about the rotation axis to the target qubit on the Bloch sphere. The Bloch coordinates of qubit can be obtained by measuring with the Pauli matrices, and the optimization solutions can be presented through the solution space transformation. The highlight advantages of this method are the ability to simultaneously adjust two parameters of a qubit and automatically achieve the best match between two adjustment quantities, which may accelerate the optimization process. The experimental results show that the proposed method obviously outperforms the classical one in convergence speed and achieves better levels for some benchmark functions.

•May 29, 2015•2 citations

Quantum-Inspired Bee Colony Algorithm

Guorui Li, Sun Mu, Panchi Li

To enhance the performance of the artificial bee colony optimization by integrating the quantum computing model into bee colony optimization, we present a quantum-inspired bee colony optimization algorithm. In our method, the bees are encoded with the qubits described on the Bloch sphere. The classical bee colony algorithm is used to compute the rotation axes and rotation angles. The Pauli matrices are used to construct the rotation matrices. The evolutionary search is achieved by rotating the qubit about the rotation axis to the target qubit on the Bloch sphere. By measuring with the Pauli matrices, the Bloch coordinates of qubit can be obtained, and the optimization solutions can be presented through the solution space transformation. The proposed method can simultaneously adjust two parameters of a qubit and automatically achieve the best match between two adjustment quantities, which may accelerate the optimization process. The experimental results show that the proposed method is obviously superior to the classical one for some benchmark functions.

Open Journal of Optimization•Jan 1, 2015•7 citations

New approach to implementation of quantum-inspired genetic algorithm for numerical optimization based on high-dimensional quantum states

Liliya Anatolievna Demidova, Владимир Владимирович Масленников

This article presents a new approach to the implementation of a quantum-inspired genetic algorithm for numerical optimization to find the global maximum of the objective function based on high-dimensional quantum states by simulating the performance of quantum calculations under the influence of the NISQ-era quantum decoherence process. In order to carry out quantum operations of rotation of states of multilevel quantum systems, a density matrix based on Heisenberg-Weil operators is presented as an analogue of the Bloch sphere for qudits. The simulation of quantum decoherence is considered as the influence of extraneous noise from the environment on the qudit and is presented in the form of the use of a normal random variable with zero mathematical expectation and unit variance in quantum gates. The paper also presents a detailed pseudocode for the functioning of the updated quantum-inspired genetic algorithm for numerical optimization and a description of its individual operations. Testing is carried out by conducting computational experiments with the implementation of an updated algorithm on two-dimensional and multidimensional functions of test optimization problems and when solving a practical problem of increasing the accuracy of prediction based on compact extreme learning machines. The results of the experiments demonstrate the superiority of the new algorithm over the usual quantum-inspired genetic algorithm and classical optimization algorithms in the accuracy of the solution and the execution time of the algorithm.

AIP conference proceedings•Jan 1, 2026•0 citations

Quantum Inspired Differential Evolution Algorithm

Binxu Li, Panchi Li

To enhance the optimization performance of differential evolution algorithm, by studying the implementation mechanism of differential evolution algorithm, a new idea of incorporating differential strategy and rotation of qubits in the Bloch sphere is proposed in this paper. In the proposed approach, the individuals are encoded by qubits described on Bloch sphere, and the rotation angles of qubits in current individual are obtained by differential strategy. The axis of rotation is designed by using vector product theory, and the rotation matrixes are constructed by using Pauli matrixes. Taking the corresponding qubits in current best individual as targets, the qubits in current individual are rotated to the target qubits about the rotation axis on the Bloch sphere. The Hadamard gates are used to mutate individuals. The simulation results of optimizing the minimum value of functions indicate that, for an iterative step, the average time of the proposed approach is 13 times as long as that of the classical differential evolution algorithm. When the same limited steps are applied in two approaches, the average optimization result of the proposed approach is 0.3 times as great as that of the classical differential evolution algorithm; when the same running time is applied in two approaches, the average optimization result of the proposed approach is 0.4 times as great as that of the classical differential evolution algorithm. These results suggest that the proposed approach is inefficient in computational ability; however, it is obviously efficient in optimization ability, and the overall optimization performance is better than that of the classical differential evolution algorithm.

Open Journal of Optimization•Jan 1, 2015•11 citations

QAOA Inside ADMM: Subproblem Wins Do Not Become Decomposition Wins at Matched Budgets

Mohammad Arif Hossain, Sanim Yousuf Fahim

We benchmark the quantum approximate optimization algorithm (QAOA) as the binary subproblem solver in a two-block alternating direction method of multipliers (ADMM) for mixed-binary problems against classical solvers under matched budgets. With 23 optimizer evaluations per subproblem, scoring determines the comparison: on its final readout, the optimized QAOA loses to random search at $n=12$ and 16 binary variables (inconclusive at 20; exploratory and post hoc tests). When credited with its best sample, it wins. In a noiseless 12-qubit simulation, transferred-angle depth-2 QAOA finds the exact optimum of 97.3\% of planted-family subproblems, against 50.6\%--67.4\% for the four strongest local heuristics (100\% against 90.4\%--94.4\% crediting the four best bitstrings) and a not significantly different 96.5\% for semidefinite rounding with local search (SDP+LS). Under our evaluation-counting convention, its time to solution there is a factor of three to five below the local heuristics' but grows with a larger exponent; it is ten times that of SDP+LS and, in seconds, 54 times that of tabu search with restarts. For the benchmark class, an unconstrained binary quadratic problem in disguise, ADMM's binary step is a proximal step on the reduced problem: at unit penalty ADMM re-solves it, and for larger penalties exact solutions increasingly stall. On two families that do not reduce to one, less accurate solvers found the problem optimum more often at unit and larger penalties. No family gave QAOA a better ADMM outcome than the best classical solver and penalty. The benchmark includes a correctness gate and a log of its hypothesis tests.

arXiv:2611.10527•Nov 7, 2026•0 citations
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.
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.
To enhance the performance of the intelligent optimization algorithm, a new model of performing search on the Bloch sphere is proposed. Then, by integrating the model into the artificial fish swarm optimization, we present a quantum-inspired artificial fish swarm optimization algorithm. In proposed method, the fishes are encoded with the qubits described on the Bloch sphere. The vector product theory is adopted to establish the axis of rotation, and the Pauli matrices are used to construct the rotation matrices. The four fish behaviors, such as moving, tracking, capturing, aggregating, are achieved by rotating the current qubit about the rotation axis to the target qubit on the Bloch sphere. The Bloch coordinates of qubit can be obtained by measuring with the Pauli matrices, and the optimization solutions can be presented through the solution space transformation. The highlight advantages of this method are the ability to simultaneously adjust two parameters of a qubit and automatically achieve the best match between two adjustment quantities, which may accelerate the optimization process. The experimental results show that the proposed method obviously outperforms the classical one in convergence speed and achieves better levels for some benchmark functions.
To enhance the performance of the artificial bee colony optimization by integrating the quantum computing model into bee colony optimization, we present a quantum-inspired bee colony optimization algorithm. In our method, the bees are encoded with the qubits described on the Bloch sphere. The classical bee colony algorithm is used to compute the rotation axes and rotation angles. The Pauli matrices are used to construct the rotation matrices. The evolutionary search is achieved by rotating the qubit about the rotation axis to the target qubit on the Bloch sphere. By measuring with the Pauli matrices, the Bloch coordinates of qubit can be obtained, and the optimization solutions can be presented through the solution space transformation. The proposed method can simultaneously adjust two parameters of a qubit and automatically achieve the best match between two adjustment quantities, which may accelerate the optimization process. The experimental results show that the proposed method is obviously superior to the classical one for some benchmark functions.
This article presents a new approach to the implementation of a quantum-inspired genetic algorithm for numerical optimization to find the global maximum of the objective function based on high-dimensional quantum states by simulating the performance of quantum calculations under the influence of the NISQ-era quantum decoherence process. In order to carry out quantum operations of rotation of states of multilevel quantum systems, a density matrix based on Heisenberg-Weil operators is presented as an analogue of the Bloch sphere for qudits. The simulation of quantum decoherence is considered as the influence of extraneous noise from the environment on the qudit and is presented in the form of the use of a normal random variable with zero mathematical expectation and unit variance in quantum gates. The paper also presents a detailed pseudocode for the functioning of the updated quantum-inspired genetic algorithm for numerical optimization and a description of its individual operations. Testing is carried out by conducting computational experiments with the implementation of an updated algorithm on two-dimensional and multidimensional functions of test optimization problems and when solving a practical problem of increasing the accuracy of prediction based on compact extreme learning machines. The results of the experiments demonstrate the superiority of the new algorithm over the usual quantum-inspired genetic algorithm and classical optimization algorithms in the accuracy of the solution and the execution time of the algorithm.
To enhance the optimization performance of differential evolution algorithm, by studying the implementation mechanism of differential evolution algorithm, a new idea of incorporating differential strategy and rotation of qubits in the Bloch sphere is proposed in this paper. In the proposed approach, the individuals are encoded by qubits described on Bloch sphere, and the rotation angles of qubits in current individual are obtained by differential strategy. The axis of rotation is designed by using vector product theory, and the rotation matrixes are constructed by using Pauli matrixes. Taking the corresponding qubits in current best individual as targets, the qubits in current individual are rotated to the target qubits about the rotation axis on the Bloch sphere. The Hadamard gates are used to mutate individuals. The simulation results of optimizing the minimum value of functions indicate that, for an iterative step, the average time of the proposed approach is 13 times as long as that of the classical differential evolution algorithm. When the same limited steps are applied in two approaches, the average optimization result of the proposed approach is 0.3 times as great as that of the classical differential evolution algorithm; when the same running time is applied in two approaches, the average optimization result of the proposed approach is 0.4 times as great as that of the classical differential evolution algorithm. These results suggest that the proposed approach is inefficient in computational ability; however, it is obviously efficient in optimization ability, and the overall optimization performance is better than that of the classical differential evolution algorithm.
We benchmark the quantum approximate optimization algorithm (QAOA) as the binary subproblem solver in a two-block alternating direction method of multipliers (ADMM) for mixed-binary problems against classical solvers under matched budgets. With 23 optimizer evaluations per subproblem, scoring determines the comparison: on its final readout, the optimized QAOA loses to random search at n=12n=12n=12 and 16 binary variables (inconclusive at 20; exploratory and post hoc tests). When credited with its best sample, it wins. In a noiseless 12-qubit simulation, transferred-angle depth-2 QAOA finds the exact optimum of 97.3\% of planted-family subproblems, against 50.6\%--67.4\% for the four strongest local heuristics (100\% against 90.4\%--94.4\% crediting the four best bitstrings) and a not significantly different 96.5\% for semidefinite rounding with local search (SDP+LS). Under our evaluation-counting convention, its time to solution there is a factor of three to five below the local heuristics' but grows with a larger exponent; it is ten times that of SDP+LS and, in seconds, 54 times that of tabu search with restarts. For the benchmark class, an unconstrained binary quadratic problem in disguise, ADMM's binary step is a proximal step on the reduced problem: at unit penalty ADMM re-solves it, and for larger penalties exact solutions increasingly stall. On two families that do not reduce to one, less accurate solvers found the problem optimum more often at unit and larger penalties. No family gave QAOA a better ADMM outcome than the best classical solver and penalty. The benchmark includes a correctness gate and a log of its hypothesis tests.