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

A Formulation of Quantum Particle Swarm Optimization

Ichio Kikuchi, Akihito Kikuchi

Published Nov 12, 2018• 1 citation
Publisher

Abstract

In this article, we present our version of quantum particle swarm optimization. The objective function is the expectation value of the quantum mechanical Hamiltonian, as the sum of the kinetic term ($-h^2 \frac{d^2}{dx^2}$) and the polynomial objective function ($V(x)$). The quantum mechanical feature in the system is represented by the set of expectation values $(\phi|x^iu^j|\phi)$ for the possible combination of the kinetic momentum operator ($u=h\frac{d}{dx}$) and the positional operator ($x$). These elements should satisfy the semi-definite condition of a matrix which is the representation of the uncertainty principle. The Plank constant $h$ is a control parameter which would switch from the quantum mechanical case to the classical case, and vice versa. In order to get the optimum, these quantum mechanical expectation values are assumed to be the particle coordinates and propagated by the particle swarm optimization with the restriction. We present a simple example of the computational process.

DOI
10.31219/osf.io/m97g5

Related papers

Polynomial Optimization and Quantifier Elimination in Quantum Mechanics

Ichio Kikuchi, Akihito Kikuchi

In this short notes, we present the formulation of a kind of quantum algorithm, applicable to the polynomial optimization. The present algorithm introduces the quantum effect by means of the coordinate variables, the momentum variables, and the commutators, and the Plank constant, which shall establish the correspondence between the quantum and the classical cases. The formalism is an extension to the polynomial optimization in the ``classical'' sense; the relations among quantum mechanical values are represented by a semi-algebraic set ( by the set of polynomials and sign conditions), and the optimum is searched in this semi-algebraic set. In the context of this formalism, the optimization of the Ising model [QUBO model] will be a special case. However, the computational procedure proposed here is different from the quantum annealing which is now in vogue. We demonstrate the exemplary calculation through quantifier elimination (which is a kind of symbolic computation applicable to optimization and other problems).

•Sep 28, 2018•1 citation

Quantum particle swarm optimization based on Bloch coordinates of qubits

Yafei Huang

To improve the efficiency of Particle Swarm Optimization(PSO),a quantum particle swarm optimization algorithm combined with quantum theory on the basis of Bloch sphere was proposed.In Bloch spherical coordinates,the particle automatically updated rotation angle and particle position,without setting the rotation angle in the form of look-up table(or setting fixed value of the interval),making up for the deficiency of quantum evolutionary algorithm and quantum genetic algorithm on the basis of Bloch sphere,and the algorithm is more generalizable.Using quantum Hadamard gate to realize the variation of particle enhanced the diversity of population,and prompted particle jump out of local extreme value.The simulation results of the typical function optimization problem show that the algorithm is stable with high precision and fast convergence rate,and it is practical.

Journal of Computer Applications•Jan 1, 2013•0 citations

What could a Quantum PSO be?

Maurice Clerc

The quantum Particle Swarm Optimization algorithms that have been published so far are not particularly convincing. There is potential to explore a more quantum approach, albeit in a hybrid manner. The primary challenge lies in the fact that PSO relies on an implicit probability distribution rather than an explicit one. Therefore, it remains uncertain whether we can completely eliminate the use of classical computations, or if at least a few of them are indispensable.

•Jan 1, 2024•0 citations

Uncertainty Principles for Position- and Momentum-Like Operators

Lara Ortelli, Gael Silva

At the quantum scale, objects such as fundamental particles, atoms, and molecules are modeled as localized wavepackets rather than concrete objects. As such, some quantities that are well-defined at our human scale physics instead become uncertain. For instance, quantum objects do not have a precise position, and instead their position is understood probabilistically and we look to the expected, or average, value of the position. Another quirk of quantum mechanics is that quantities such as position and momentum become operators that act on functions, similar to matrices acting on vectors. As such, quantities that may have commuted classically may not at the quantum level. For instance, position (x) and momentum (p) commute in classical physics (xp = px), but they do not commute at the quantum level (xp ≠ px). For noncommuting operators A and B, the uncertainty principle qualitatively describes how well one can know A and B simultaneously: the more certain one is of the value of A, the less one knows the value B and vice versa. The standard example is that of position and momentum: the Heisenberg uncertainty principle states that the more certain one is of the position of a quantum object, the more uncertain one is about its momentum. The classic uncertainty principles between noncommuting operators are those of position and momentum, the z and x or y components of angular momentum, and number and phase operators. These operators are very rigid and do not provide easy generalization to more general operators. In this project, we used an infinite matrix representation to analyze the uncertainty principle underlying position and momentum which allows for broader generalization. The biggest component of this project was determining eigenvalues of infinite banded matrices which was aided by the use of the mathematical software Mathematica.

•Mar 27, 2026•0 citations

Quantum model of particle swarm optimization

Qin Yong-bo

As for the weak theoretical foundation of the Particle Swarm Optimization(PSO) algorithm and its analysis of the nature of the problem having not yet formed system,a new quantum model was established,which was based on quantum mechanics from the microscopic point of view.This model defined the search process as quantum state transition that in infinitely deep potential well.Through the model,the internal mechanism of executing process interpreted,and the experimental results show that the proposed algorithm has the optimization of quantum nature.

Journal of Computer Applications•Jan 1, 2011•0 citations

Quantum-behaved Particle Swarm Optimization Algorithm for Solving Nonlinear Equations

Xiaofeng Zhang, Guifang Sui

A quantum-behaved particle swarm optimization algorithm is presented in this paper for solving nonlinear equations.The positions of particle are coded by probability amplitudes of qubits that are updated by quantum rotation gates in this method.The corresponding real number solution at specified interval can be extracted by this algorithm for solving nonlinear equations.Compared to real traditional method, the simulation results show that this algorithm is more accurate and effective.

International Conference on Computer and Information Application•Jan 1, 2012•0 citations
In this article, we present our version of quantum particle swarm optimization. The objective function is the expectation value of the quantum mechanical Hamiltonian, as the sum of the kinetic term (−h2d2dx2-h^2 \frac{d^2}{dx^2}−h2dx2d2​) and the polynomial objective function (V(x)V(x)V(x)). The quantum mechanical feature in the system is represented by the set of expectation values (ϕ∣xiuj∣ϕ)(\phi|x^iu^j|\phi)(ϕ∣xiuj∣ϕ) for the possible combination of the kinetic momentum operator (u=hddxu=h\frac{d}{dx}u=hdxd​) and the positional operator (xxx). These elements should satisfy the semi-definite condition of a matrix which is the representation of the uncertainty principle. The Plank constant hhh is a control parameter which would switch from the quantum mechanical case to the classical case, and vice versa. In order to get the optimum, these quantum mechanical expectation values are assumed to be the particle coordinates and propagated by the particle swarm optimization with the restriction. We present a simple example of the computational process.
In this short notes, we present the formulation of a kind of quantum algorithm, applicable to the polynomial optimization. The present algorithm introduces the quantum effect by means of the coordinate variables, the momentum variables, and the commutators, and the Plank constant, which shall establish the correspondence between the quantum and the classical cases. The formalism is an extension to the polynomial optimization in the ``classical'' sense; the relations among quantum mechanical values are represented by a semi-algebraic set ( by the set of polynomials and sign conditions), and the optimum is searched in this semi-algebraic set. In the context of this formalism, the optimization of the Ising model [QUBO model] will be a special case. However, the computational procedure proposed here is different from the quantum annealing which is now in vogue. We demonstrate the exemplary calculation through quantifier elimination (which is a kind of symbolic computation applicable to optimization and other problems).
To improve the efficiency of Particle Swarm Optimization(PSO),a quantum particle swarm optimization algorithm combined with quantum theory on the basis of Bloch sphere was proposed.In Bloch spherical coordinates,the particle automatically updated rotation angle and particle position,without setting the rotation angle in the form of look-up table(or setting fixed value of the interval),making up for the deficiency of quantum evolutionary algorithm and quantum genetic algorithm on the basis of Bloch sphere,and the algorithm is more generalizable.Using quantum Hadamard gate to realize the variation of particle enhanced the diversity of population,and prompted particle jump out of local extreme value.The simulation results of the typical function optimization problem show that the algorithm is stable with high precision and fast convergence rate,and it is practical.
At the quantum scale, objects such as fundamental particles, atoms, and molecules are modeled as localized wavepackets rather than concrete objects. As such, some quantities that are well-defined at our human scale physics instead become uncertain. For instance, quantum objects do not have a precise position, and instead their position is understood probabilistically and we look to the expected, or average, value of the position. Another quirk of quantum mechanics is that quantities such as position and momentum become operators that act on functions, similar to matrices acting on vectors. As such, quantities that may have commuted classically may not at the quantum level. For instance, position (x) and momentum (p) commute in classical physics (xp = px), but they do not commute at the quantum level (xp ≠ px). For noncommuting operators A and B, the uncertainty principle qualitatively describes how well one can know A and B simultaneously: the more certain one is of the value of A, the less one knows the value B and vice versa. The standard example is that of position and momentum: the Heisenberg uncertainty principle states that the more certain one is of the position of a quantum object, the more uncertain one is about its momentum. The classic uncertainty principles between noncommuting operators are those of position and momentum, the z and x or y components of angular momentum, and number and phase operators. These operators are very rigid and do not provide easy generalization to more general operators. In this project, we used an infinite matrix representation to analyze the uncertainty principle underlying position and momentum which allows for broader generalization. The biggest component of this project was determining eigenvalues of infinite banded matrices which was aided by the use of the mathematical software Mathematica.
As for the weak theoretical foundation of the Particle Swarm Optimization(PSO) algorithm and its analysis of the nature of the problem having not yet formed system,a new quantum model was established,which was based on quantum mechanics from the microscopic point of view.This model defined the search process as quantum state transition that in infinitely deep potential well.Through the model,the internal mechanism of executing process interpreted,and the experimental results show that the proposed algorithm has the optimization of quantum nature.