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

Soft Computing

A quantum multi-objective optimization algorithm based on harmony search method

Alireza Sadeghi Hesar, Seyed Reza Kamel, Mahboobeh Houshmand

Published Apr 25, 2021• 25 citations
Publisher
DOI
10.1007/s00500-021-05799-x

Related papers

A hybrid quantum inspired harmony search algorithm for 0–1 optimization problems

Abdesslem Layeb

Journal of Computational and Applied Mathematics•Apr 8, 2013•105 citations

Distributed Multi-objective Quantum Search Algorithm

Hao Li, Daowen Qiu

Lecture notes in computer science•Jan 1, 2025•2 citations

Quantum multi-object search algorithm

Wan‐Su Bao

Computer Engineering and Applications Journal•Jan 1, 2008•0 citations

Multi-objective Quantum Optimization based on Bayesian Approach for Computing Resource Assignment Problems

Toyoki Kosuda, Morikazu Nakamura, Shiroma Tadashi +1 more

In quantum optimization approaches, such as Quantum Approximate Optimization Algorithms (QAOA) and quantum annealing, the optimal solution is obtained by minimizing an energy function that encapsulates the optimization problem. In the case of multi-objective optimization problems, the trade-offs between competing objective functions are managed by adjusting a set of weight parameters. This paper investigates two parameter-tuning techniques, a grid search and Bayesian optimization, applied to a computational resource allocation problem with multiple objective functions. We compare the performance of these methods by evaluating the efficiency, diversity, and uniformity of the Pareto solutions derived from the optimization results.

International Symposium on Computing and Networking Workshops (CANDARW)•Nov 26, 2024•2 citations

Multiobjective Optimization and Network Routing With Near-Term Quantum Computers

Shao-Hen Chiew, Kilian Poirier, Rajesh Mishra +6 more

Multi-objective optimization is a ubiquitous problem that arises naturally in many scientific and industrial areas. Network routing optimization with multi-objective performance demands falls into this problem class, and finding good quality solutions at large scales is generally challenging. In this work, we develop a scheme with which near-term quantum computers can be applied to solve multi-objective combinatorial optimization problems. We study the application of this scheme to the network routing problem in detail, by first mapping it to the multi-objective shortest path problem. Focusing on an implementation based on the quantum approximate optimization algorithm (QAOA) – the go-to approach for tackling optimization problems on near-term quantum computers – we examine the Pareto plot that results from the scheme, and qualitatively analyze its ability to produce Pareto-optimal solutions. We further provide theoretical and numerical scaling analyses of the resource requirements and performance of QAOA, and identify key challenges associated with this approach. Finally, through Amazon Braket we execute small-scale implementations of our scheme on the IonQ Harmony 11-qubit quantum computer.

arXiv:2308.08245•IEEE Transactions on Quantum Engineering•Jan 1, 2024•16 citations

Circuit Simulation and Optimization of Quantum Search Algorithm

Xiaonan Liu, Chenyan Zhao, Haoshan Xie +1 more

At present, the scale of quantum computers in the real sense is still small, and quantum simulation has become one of the important ways of quantum theory research, grover quantum search algorithm is suitable for the search problem of disordered database. Firstly, according to the implementation principle of Grover algorithm and Boolean logic relationship, the design idea of multi-objective Oracle is analyzed, based on IBMQ quantum cloud platform, the quantum circuit of Grover algorithm with multi-objective items is simulated. Based on the characteristics of Grover algorithm and the simulation process of quantum gate, the action of multiple identical quantum gates is combined to reduce the update times of probability amplitude and improve the simulation efficiency. The libquantum quantum simulator is used for experiments and the target item is successfully searched, which proves the feasibility of the optimization method and provides reference for the simulation and optimization of other quantum algorithms.

International Conference on Electronic Information Technology and Computer Engineering (EITCE)•Oct 21, 2022•1 citation
In quantum optimization approaches, such as Quantum Approximate Optimization Algorithms (QAOA) and quantum annealing, the optimal solution is obtained by minimizing an energy function that encapsulates the optimization problem. In the case of multi-objective optimization problems, the trade-offs between competing objective functions are managed by adjusting a set of weight parameters. This paper investigates two parameter-tuning techniques, a grid search and Bayesian optimization, applied to a computational resource allocation problem with multiple objective functions. We compare the performance of these methods by evaluating the efficiency, diversity, and uniformity of the Pareto solutions derived from the optimization results.
Multi-objective optimization is a ubiquitous problem that arises naturally in many scientific and industrial areas. Network routing optimization with multi-objective performance demands falls into this problem class, and finding good quality solutions at large scales is generally challenging. In this work, we develop a scheme with which near-term quantum computers can be applied to solve multi-objective combinatorial optimization problems. We study the application of this scheme to the network routing problem in detail, by first mapping it to the multi-objective shortest path problem. Focusing on an implementation based on the quantum approximate optimization algorithm (QAOA) – the go-to approach for tackling optimization problems on near-term quantum computers – we examine the Pareto plot that results from the scheme, and qualitatively analyze its ability to produce Pareto-optimal solutions. We further provide theoretical and numerical scaling analyses of the resource requirements and performance of QAOA, and identify key challenges associated with this approach. Finally, through Amazon Braket we execute small-scale implementations of our scheme on the IonQ Harmony 11-qubit quantum computer.
At present, the scale of quantum computers in the real sense is still small, and quantum simulation has become one of the important ways of quantum theory research, grover quantum search algorithm is suitable for the search problem of disordered database. Firstly, according to the implementation principle of Grover algorithm and Boolean logic relationship, the design idea of multi-objective Oracle is analyzed, based on IBMQ quantum cloud platform, the quantum circuit of Grover algorithm with multi-objective items is simulated. Based on the characteristics of Grover algorithm and the simulation process of quantum gate, the action of multiple identical quantum gates is combined to reduce the update times of probability amplitude and improve the simulation efficiency. The libquantum quantum simulator is used for experiments and the target item is successfully searched, which proves the feasibility of the optimization method and provides reference for the simulation and optimization of other quantum algorithms.