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

Swarm and Evolutionary Computation

Quantum-enhanced multiobjective large-scale optimization via parallelism

Bin Cao, Shanshan Fan, Jianwei Zhao, Po Yang, Khan Muhammad, M. Tanveer

Published May 7, 2020• 126 citations
Publisher
DOI
10.1016/j.swevo.2020.100697

Related papers

Challenges in Multiobjective Optimization using a Quantum Adiabatic Computer

Benjamı́n Barán

Journal of Lasers Optics & Photonics•Nov 10, 2017•0 citations

Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective

Daniel Ruffinelli, Benjamı́n Barán

Quantum Information Processing•Jul 26, 2017•17 citations

Comparison of two types of Quantum Oracles based on Grover’s Adaptative Search Algorithm for Multiobjective Optimization Problems

Gerardo G. Fogel, Benjamı́n Barán, Marcos Villagra

Quantum Computing is a field of study in computer science based on the laws of quantum physics.Quantum computing is an attractive subject considering that quantum algorithms proved to be more efficient than classical algorithms and the advent of large-scale quantum computation.In particular, Grover's search algorithm is a quantum algorithm that is asymptotically faster than any classical search algorithm and it is relevant for the design of fast optimization algorithms.This article proposes two algorithms based on Grover's adaptative search for biobjective optimization problems where access to the objective functions is given via two different quantum oracles.The proposed algorithms, considering both types of oracles, are compared against NSGA-II, a highly cited multiobjective optimization evolutionary algorithm.Experimental evidence suggests that the quantum optimization methods proposed in this work are at least as effective as NSGA-II in average, considering an equal number of executions.Experimental results showed which oracle required less iterations for similar effectiveness.

Annals of Computer Science and Information Systems•Sep 24, 2017•4 citations

Improving the balance of trade-offs in multi-objective optimization with quantum computing

V. Akshay, Mile Gu

Nature Computational Science•Dec 16, 2025•0 citations

A Gradient‐Cost Multiobjective Alternate Framework for Variational Quantum Eigensolver with Variable Ansatz

Ze‐Tong Li, Fan‐Xu Meng, Han Zeng +3 more

Abstract Variational quantum eigensolver (VQE), aiming at determining the ground state energy of a quantum system described by a Hamiltonian on noisy intermediate scale quantum (NISQ) devices. However, the accuracy and trainability of the current VQE algorithm are significantly influenced due to the barren plateau (BP), the non‐negligible gate error and limited coherence time in NISQ devices. To tackle these issues, a gradient‐cost multiobjective alternate framework with variable ansatz is proposed. A theoretical framework is first proposed for VQE with variable ansatz (VA‐VQE) via alternately solving a multiobjective optimization problem defined by cost function values and gradient magnitudes and the original VQE problem. Then, a novel implementation method based on the double ε‐greedy strategy with the candidate tree and modified multiobjective genetic algorithm is proposed. As a result, the local optima are avoided both in ansatz and parameter perspectives, the BP phenomenon is alleviated, and the stability of output ansatz is enhanced. The experimental results indicate that this framework shows considerably average improvement of the error and stability by 59.6% and 78.8% compared with the state‐of‐the‐art cost‐criterion‐based VA‐VQE implementation, and 54.1% and 73.5% compared with the gradient‐criterion‐based counterpart, respectively, with lower quantum costs.

arXiv:2205.03031•Advanced Quantum Technologies•Apr 7, 2023•2 citations

Parallel Improved Quantum Evolutionary Algorithm for Complex Optimization Problems

Yapeng Sun

Lecture notes in computer science•Jan 1, 2022•1 citation
Quantum Computing is a field of study in computer science based on the laws of quantum physics.Quantum computing is an attractive subject considering that quantum algorithms proved to be more efficient than classical algorithms and the advent of large-scale quantum computation.In particular, Grover's search algorithm is a quantum algorithm that is asymptotically faster than any classical search algorithm and it is relevant for the design of fast optimization algorithms.This article proposes two algorithms based on Grover's adaptative search for biobjective optimization problems where access to the objective functions is given via two different quantum oracles.The proposed algorithms, considering both types of oracles, are compared against NSGA-II, a highly cited multiobjective optimization evolutionary algorithm.Experimental evidence suggests that the quantum optimization methods proposed in this work are at least as effective as NSGA-II in average, considering an equal number of executions.Experimental results showed which oracle required less iterations for similar effectiveness.
Abstract Variational quantum eigensolver (VQE), aiming at determining the ground state energy of a quantum system described by a Hamiltonian on noisy intermediate scale quantum (NISQ) devices. However, the accuracy and trainability of the current VQE algorithm are significantly influenced due to the barren plateau (BP), the non‐negligible gate error and limited coherence time in NISQ devices. To tackle these issues, a gradient‐cost multiobjective alternate framework with variable ansatz is proposed. A theoretical framework is first proposed for VQE with variable ansatz (VA‐VQE) via alternately solving a multiobjective optimization problem defined by cost function values and gradient magnitudes and the original VQE problem. Then, a novel implementation method based on the double ε‐greedy strategy with the candidate tree and modified multiobjective genetic algorithm is proposed. As a result, the local optima are avoided both in ansatz and parameter perspectives, the BP phenomenon is alleviated, and the stability of output ansatz is enhanced. The experimental results indicate that this framework shows considerably average improvement of the error and stability by 59.6% and 78.8% compared with the state‐of‐the‐art cost‐criterion‐based VA‐VQE implementation, and 54.1% and 73.5% compared with the gradient‐criterion‐based counterpart, respectively, with lower quantum costs.