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 Journal of Hybrid Information Technology

Study on an Improved Quantum PSO Algorithm for Solving Complex Optimization Problem

Mengxing Li, Zhuo Wan

Published Aug 31, 2016• 1 citation
Publisher
DOI
10.14257/ijhit.2016.9.8.17

Related papers

An improved Quantum Particle Swarm Optimization and its application

Xuan Jiao, Ming Huang

IEEE Conference Proceedings•Jan 1, 2017•1 citation

Optimization Techniques on Quantum and Classical Systems: A Comprehensive Comparative Study

Hussain Shaik, Morampudi Rajitha, K. Priyamvada +1 more

Quantum optimization is a promising field revolutionizing problem-solving across domains. This study compares Particle Swarm Optimization (PSO), Moth Flame Optimization (MFO), and Genetic Algorithm (GA) on three platforms : a local computer, a local computer with quantum integration, and an IBM quantum machine. Results indicate PSO’s consistent performance across all setups, with the IBM quantum machine having a longer elapsed time. For MFO, the optimal solution is found using the IBM quantum machine, despite its longer execution time. Similarly, GA achieves the best results on the IBM quantum machine. These findings suggest that while quantum computers excel in solving complex problems, their execution time for simpler tasks remains higher than classical setups. Future research should address challenges like noise, limited qubits, and high material costs to improve quantum computers’ efficiency and availability.

E3S Web of Conferences•Jan 1, 2025•0 citations

Quantum alternating operator ansatz with PSO optimizer for portfolio optimization problem

Wenjie Liu, Yue Ma, Yuchen Gu +2 more

Recently, Quantum Approximate Optimization Algorithm (QAOA) and Quantum Alternating Operator ansatz (QAOAz) are utilized to solve the Mean Variance (MV) model for the portfolio optimization problem (QAOAz-MV), which shows performance advantages over classical algorithms on this huge search space. For the more complex and comprehensive risk parity (RP) model, a novel QAOAz solution (QAOAz-RP) is proposed. We begin by defining the RP model for the portfolio optimization problem. Next, we detail the QAOAz algorithm process, where the problem Hamiltonian with the ZZZZ term is derived, the corresponding quantum circuit is ingeniously constructed using the parity check method, and the whole quantum circuit containing the ring XY-mixer is given. Finally, to improve the optimization performance of QAOAz, a Particle Swarm Optimization (PSO) optimizer is introduced to tune the parameters of the quantum circuits, which is applicable to both QAOAz-MV and QAOAz-RP. The experiment conducted on multiple financial markets (e.g. Chinese, U.S., and European) demonstrate that PSO-QAOAz-RP is significantly better for portfolio optimization than ABC-LP, GWO, GA and QAOAz-RP on eight portfolios in all metrics. PSO-QAOAz-MV also has advantage for MV model over the quantum algorithms, including QAOA (improves approximate ratio by 54.79% on average) and QAOAz (improves approximate ratio by 15.38% on average). This study not only provides a breakthrough quantum solution for portfolio optimization, but also provides a reusable technology paradigm for the deep integration of quantum computing and financial engineering. • It is the first QAOAz solution for the RP model of portfolio optimization problem. • The problem Hamiltonian and quantum circuit are derived and ingeniously constructed. • A PSO optimizer is proposed to optimize the parameters of QAOAz’s quantum circuit. • Our QAOAz-RP and PSO-QAOAz-RP outperform state-of-the-art classical algorithms. • Our PSO optimizer is effective on both MV and RP models.

Applied Soft Computing•Jun 14, 2025•1 citation

Hybrid quantum particle swarm optimization algorithm and its application

Yukun Wang, Xuebo Chen

Science China Information Sciences•Sep 10, 2019•28 citations

Particle Swarm Optimization for Quantum Circuit Synthesis: Performance Analysis and Insights

Mirza Hizriyan Nubli Hidayat, Tan Chye Cheah

This paper discusses how particle swarm optimization (PSO) can be used to generate quantum circuits to solve an instance of the MaxOne problem. It then analyzes previous studies on evolutionary algorithms for circuit synthesis. With a brief introduction to PSO, including its parameters and algorithm flow, the paper focuses on a method of quantum circuit encoding and representation as PSO parameters. The fitness evaluation used in this paper is the MaxOne problem. The paper presents experimental results that compare different learning abilities and inertia weight variations in the PSO algorithm. A comparison is further made between the PSO algorithm and a genetic algorithm for quantum circuit synthesis. The results suggest PSO converges more quickly to the optimal solution.

arXiv:2507.02898•Jun 22, 2025•0 citations

An Improved Quantum Particle Swarm Optimization Algorithm Based on Real Coding Method

Yin Guofu -

International Journal of Advancements in Computing Technology•Feb 29, 2012•8 citations
Quantum optimization is a promising field revolutionizing problem-solving across domains. This study compares Particle Swarm Optimization (PSO), Moth Flame Optimization (MFO), and Genetic Algorithm (GA) on three platforms : a local computer, a local computer with quantum integration, and an IBM quantum machine. Results indicate PSO’s consistent performance across all setups, with the IBM quantum machine having a longer elapsed time. For MFO, the optimal solution is found using the IBM quantum machine, despite its longer execution time. Similarly, GA achieves the best results on the IBM quantum machine. These findings suggest that while quantum computers excel in solving complex problems, their execution time for simpler tasks remains higher than classical setups. Future research should address challenges like noise, limited qubits, and high material costs to improve quantum computers’ efficiency and availability.
Recently, Quantum Approximate Optimization Algorithm (QAOA) and Quantum Alternating Operator ansatz (QAOAz) are utilized to solve the Mean Variance (MV) model for the portfolio optimization problem (QAOAz-MV), which shows performance advantages over classical algorithms on this huge search space. For the more complex and comprehensive risk parity (RP) model, a novel QAOAz solution (QAOAz-RP) is proposed. We begin by defining the RP model for the portfolio optimization problem. Next, we detail the QAOAz algorithm process, where the problem Hamiltonian with the ZZZZ term is derived, the corresponding quantum circuit is ingeniously constructed using the parity check method, and the whole quantum circuit containing the ring XY-mixer is given. Finally, to improve the optimization performance of QAOAz, a Particle Swarm Optimization (PSO) optimizer is introduced to tune the parameters of the quantum circuits, which is applicable to both QAOAz-MV and QAOAz-RP. The experiment conducted on multiple financial markets (e.g. Chinese, U.S., and European) demonstrate that PSO-QAOAz-RP is significantly better for portfolio optimization than ABC-LP, GWO, GA and QAOAz-RP on eight portfolios in all metrics. PSO-QAOAz-MV also has advantage for MV model over the quantum algorithms, including QAOA (improves approximate ratio by 54.79% on average) and QAOAz (improves approximate ratio by 15.38% on average). This study not only provides a breakthrough quantum solution for portfolio optimization, but also provides a reusable technology paradigm for the deep integration of quantum computing and financial engineering. • It is the first QAOAz solution for the RP model of portfolio optimization problem. • The problem Hamiltonian and quantum circuit are derived and ingeniously constructed. • A PSO optimizer is proposed to optimize the parameters of QAOAz’s quantum circuit. • Our QAOAz-RP and PSO-QAOAz-RP outperform state-of-the-art classical algorithms. • Our PSO optimizer is effective on both MV and RP models.
This paper discusses how particle swarm optimization (PSO) can be used to generate quantum circuits to solve an instance of the MaxOne problem. It then analyzes previous studies on evolutionary algorithms for circuit synthesis. With a brief introduction to PSO, including its parameters and algorithm flow, the paper focuses on a method of quantum circuit encoding and representation as PSO parameters. The fitness evaluation used in this paper is the MaxOne problem. The paper presents experimental results that compare different learning abilities and inertia weight variations in the PSO algorithm. A comparison is further made between the PSO algorithm and a genetic algorithm for quantum circuit synthesis. The results suggest PSO converges more quickly to the optimal solution.