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

arXiv:2506.22159 · Quantum Information Processing

Enhancing variational quantum algorithms for multicriteria optimization

Ivica Turkalj, Tom Ewen, Pascal Halffmann, Janik Maciejewski, Michael Trebing, Zakaria Abdelmoiz Dahi

Published Jun 9, 2026• 1 citation
arXivHTMLPDF

Abstract

Abstract This paper presents methodological improvements to variational quantum algorithms (VQAs) for solving multicriteria optimization problems. We introduce two key contributions. First, we reformulate the parameter optimization task of VQAs as a multicriteria problem, enabling the direct use of classical algorithms from various multicriteria metaheuristics. This hybrid framework outperforms the corresponding single-criteria VQAs in both average and worst-case performance across diverse benchmark problems. Second, we propose a method that augments the hypervolume-based cost function with coverage-oriented indicators, allowing explicit control over the diversity of the resulting Pareto front approximations. Experimental results show that our method can improve coverage by up to 40% with minimal loss in hypervolume. Our findings highlight the potential of combining quantum variational methods with classical population-based search to advance practical quantum optimization.

DOI
10.1007/s11128-026-05232-y

Related papers

Variational quantum multiobjective optimization

Linus Ekstrøm, Hao Wang, Sebastian Schmitt

Solving combinatorial optimization problems on near-term quantum devices has gained a lot of attention in recent years. Currently, most studies have focused on single-objective problems, whereas many real-world applications need to consider multiple, mostly conflicting objectives, such as cost and quality. We present a variational quantum optimization algorithm to solve discrete multiobjective optimization problems on quantum computers. The proposed quantum multiobjective optimization (QMOO) algorithm incorporates all cost Hamiltonians representing the classical objective functions in the quantum circuit and produces a quantum state consisting of Pareto-optimal solutions in superposition. From this state, we retrieve a set of solutions and utilize the widely applied hypervolume indicator to determine its quality as an approximation to the Pareto front. The variational parameters of the QMOO circuit are tuned by maximizing the hypervolume indicator in a quantum-classical hybrid fashion. We show the effectiveness of the proposed algorithm on several benchmark problems with up to five objectives. We investigate the influence of the classical optimizer and the circuit depth, and compare them to results from classical optimization algorithms. We find that the algorithm is robust to shot noise and produces good results with as few as 128 measurement shots in each iteration. These promising results open the possibility to run the algorithm on near-term quantum hardware.

arXiv:2312.14151•Physical Review Research•May 12, 2025•13 citations

A framework to evaluate the performance of Variational Quantum Algorithms

Ernesto Mamedaliev, Vladyslav Libov, Albert Nieto-Morales +2 more

Variational Quantum Algorithms (VQAs) are promising methods for solving combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) devices. However, benchmarking VQAs is difficult due to their stochastic behavior and the lack of standardized performance criteria. This work introduces a general framework for evaluating VQAs applied to Quadratic Unconstrained Binary Optimization (QUBO) problems. The framework uses three complementary metrics: feasibility, quality, and reproducibility. It also introduces a quality diagram that visualizes trade-offs between success probability and computational resources. Reproducibility is formalized using Shannon entropy, and a decision rule is defined for selecting algorithms under resource constraints. As a demonstration, the framework is applied to several VQAs using Conditional Value at Risk (CVaR) cost functions and different shot counts on a 16-qubit QUBO instance. The results show how the framework supports systematic benchmarking and provides a foundation for adaptive algorithm selection in hybrid quantum-classical workflows.

quant-pharXiv:2601.18812•Jan 22, 2026•0 citations

Quantum Optimization with Variational Algorithms

Claudia Zendejas-Morales

The rapid evolution of quantum computing has introduced groundbreaking approaches to solving complex optimization problems, traditionally limited by classical methods. This talk explores the principles and applications of quantum optimization, with a focus on Variational Quantum Algorithms (VQAs). These algorithms, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA), leverage hybrid quantum-classical systems to address challenges in diverse fields such as combinatorial optimization, quantum chemistry, and material design. Attendees will gain insights into the theoretical foundations of quantum computing, the operational mechanics of quantum circuits, and the integration of quantum programming tools like Qiskit. Practical examples and demonstrations will highlight how VQAs outperform classical methods in specific scenarios, offering a transformative perspective on optimization in the quantum era.

Journal of Physics & Optics Sciences•Apr 25, 2025•0 citations

Quantum parametric circuit optimization with estimation of distribution algorithms

Vicente P. Soloviev, Pedro Larrañaga, Concha Bielza

Variational quantum algorithms (VQAs) offer some promising characteristics for carrying out optimization tasks in noisy intermediate-scale quantum devices. These algorithms aim to minimize a cost function by optimizing the parameters of a quantum parametric circuit. Thus, the overall performance of these algorithms, heavily depends on the classical optimizer which sets the parameters. In the last years, some gradient-based and gradient-free approaches have been applied to optimize the parameters of the quantum circuit. In this work, we follow the second approach and propose the use of estimation of distribution algorithms for the parameter optimization in a specific case of VQAs, the quantum approximate optimization algorithm. Our results show an statistically significant improvement of the cost function minimization compared to traditional optimizers.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 9, 2022•9 citations

Performance comparison of optimization methods on variational quantum algorithms

Xavier Bonet-Monroig, Hao Wang, Diederick Vermetten +5 more

Variational quantum algorithms (VQAs) offer a promising path toward using near-term quantum hardware for applications in academic and industrial research. These algorithms aim to find approximate solutions to quantum problems by optimizing a parametrized quantum circuit using a classical optimization algorithm. A successful VQA requires fast and reliable classical optimization algorithms. Understanding and optimizing how off-the-shelf optimization methods perform in this context is important for the future of the field. In this work, we study the performance of four commonly used gradient-free optimization methods [sequential least-squares quadratic programming, constrained optimization by linear approximations, the covariance matrix adaptation evolutionary strategy (CMA-ES), and the simultaneous perturbation stochastic approximation (SPSA)] to find ground-state energies of a range of small chemistry and material science problems. We test a telescoping sampling scheme (where the accuracy of the cost-function estimate provided to the optimizer is increased as the optimization converges) for all methods, demonstrating mixed results across our range of optimizers and problems chosen. We further hyperparameter tune two of the four optimizers (CMA-ES and SPSA) across a large range of models and demonstrate that with appropriate hyperparameter tuning, CMA-ES is competitive with and sometimes outperforms SPSA (which is not observed in the absence of hyperparameter tuning). Finally, we investigate the ability of an optimizer to beat the ``sampling-noise floor'' given by the sampling noise of each cost-function estimate provided to the optimizer. Our results demonstrate the necessity for tailoring and hyperparameter tuning known optimization techniques for inherently noisy variational quantum algorithms and that the variational landscape that one finds in a VQA is highly problem and system dependent. This provides guidance for future implementations of these algorithms in experiments.

arXiv:2111.13454•Physical Review A•Mar 7, 2023•114 citations

Pulse-based variational quantum algorithms

Han-Xiao Tao, Re-Bing Wu

Variational quantum algorithms (VQAs) are the leading candidates for practical applications of noisy intermediate-scale quantum (NISQ) devices. Recently, pulse-based variational quantum algorithms (p-VQAs) have emerged as a compelling alternative to traditional gate-based VQAs. By optimizing continuous control fields directly on hardware-native Hamiltonians, pulse-based methods are easy to implement and can significantly reduce quantum resource overhead, thereby enhancing the overall performance of quantum algorithms on NISQ devices. In this review, we present a comprehensive survey over recent advances in p-VQAs, covering theory, algorithms, and hardware deployments across various quantum computing platforms. We also review applications of p-VQAs to variational quantum eigensolver in quantum chemistry, quantum approximate optimization algorithm for combinatorial optimization, and quantum machine learning tasks.

Quantum Review Letters•Jan 1, 2026•0 citations
Abstract This paper presents methodological improvements to variational quantum algorithms (VQAs) for solving multicriteria optimization problems. We introduce two key contributions. First, we reformulate the parameter optimization task of VQAs as a multicriteria problem, enabling the direct use of classical algorithms from various multicriteria metaheuristics. This hybrid framework outperforms the corresponding single-criteria VQAs in both average and worst-case performance across diverse benchmark problems. Second, we propose a method that augments the hypervolume-based cost function with coverage-oriented indicators, allowing explicit control over the diversity of the resulting Pareto front approximations. Experimental results show that our method can improve coverage by up to 40% with minimal loss in hypervolume. Our findings highlight the potential of combining quantum variational methods with classical population-based search to advance practical quantum optimization.
Solving combinatorial optimization problems on near-term quantum devices has gained a lot of attention in recent years. Currently, most studies have focused on single-objective problems, whereas many real-world applications need to consider multiple, mostly conflicting objectives, such as cost and quality. We present a variational quantum optimization algorithm to solve discrete multiobjective optimization problems on quantum computers. The proposed quantum multiobjective optimization (QMOO) algorithm incorporates all cost Hamiltonians representing the classical objective functions in the quantum circuit and produces a quantum state consisting of Pareto-optimal solutions in superposition. From this state, we retrieve a set of solutions and utilize the widely applied hypervolume indicator to determine its quality as an approximation to the Pareto front. The variational parameters of the QMOO circuit are tuned by maximizing the hypervolume indicator in a quantum-classical hybrid fashion. We show the effectiveness of the proposed algorithm on several benchmark problems with up to five objectives. We investigate the influence of the classical optimizer and the circuit depth, and compare them to results from classical optimization algorithms. We find that the algorithm is robust to shot noise and produces good results with as few as 128 measurement shots in each iteration. These promising results open the possibility to run the algorithm on near-term quantum hardware.
Variational Quantum Algorithms (VQAs) are promising methods for solving combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) devices. However, benchmarking VQAs is difficult due to their stochastic behavior and the lack of standardized performance criteria. This work introduces a general framework for evaluating VQAs applied to Quadratic Unconstrained Binary Optimization (QUBO) problems. The framework uses three complementary metrics: feasibility, quality, and reproducibility. It also introduces a quality diagram that visualizes trade-offs between success probability and computational resources. Reproducibility is formalized using Shannon entropy, and a decision rule is defined for selecting algorithms under resource constraints. As a demonstration, the framework is applied to several VQAs using Conditional Value at Risk (CVaR) cost functions and different shot counts on a 16-qubit QUBO instance. The results show how the framework supports systematic benchmarking and provides a foundation for adaptive algorithm selection in hybrid quantum-classical workflows.
The rapid evolution of quantum computing has introduced groundbreaking approaches to solving complex optimization problems, traditionally limited by classical methods. This talk explores the principles and applications of quantum optimization, with a focus on Variational Quantum Algorithms (VQAs). These algorithms, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA), leverage hybrid quantum-classical systems to address challenges in diverse fields such as combinatorial optimization, quantum chemistry, and material design. Attendees will gain insights into the theoretical foundations of quantum computing, the operational mechanics of quantum circuits, and the integration of quantum programming tools like Qiskit. Practical examples and demonstrations will highlight how VQAs outperform classical methods in specific scenarios, offering a transformative perspective on optimization in the quantum era.
Variational quantum algorithms (VQAs) offer some promising characteristics for carrying out optimization tasks in noisy intermediate-scale quantum devices. These algorithms aim to minimize a cost function by optimizing the parameters of a quantum parametric circuit. Thus, the overall performance of these algorithms, heavily depends on the classical optimizer which sets the parameters. In the last years, some gradient-based and gradient-free approaches have been applied to optimize the parameters of the quantum circuit. In this work, we follow the second approach and propose the use of estimation of distribution algorithms for the parameter optimization in a specific case of VQAs, the quantum approximate optimization algorithm. Our results show an statistically significant improvement of the cost function minimization compared to traditional optimizers.
Variational quantum algorithms (VQAs) offer a promising path toward using near-term quantum hardware for applications in academic and industrial research. These algorithms aim to find approximate solutions to quantum problems by optimizing a parametrized quantum circuit using a classical optimization algorithm. A successful VQA requires fast and reliable classical optimization algorithms. Understanding and optimizing how off-the-shelf optimization methods perform in this context is important for the future of the field. In this work, we study the performance of four commonly used gradient-free optimization methods [sequential least-squares quadratic programming, constrained optimization by linear approximations, the covariance matrix adaptation evolutionary strategy (CMA-ES), and the simultaneous perturbation stochastic approximation (SPSA)] to find ground-state energies of a range of small chemistry and material science problems. We test a telescoping sampling scheme (where the accuracy of the cost-function estimate provided to the optimizer is increased as the optimization converges) for all methods, demonstrating mixed results across our range of optimizers and problems chosen. We further hyperparameter tune two of the four optimizers (CMA-ES and SPSA) across a large range of models and demonstrate that with appropriate hyperparameter tuning, CMA-ES is competitive with and sometimes outperforms SPSA (which is not observed in the absence of hyperparameter tuning). Finally, we investigate the ability of an optimizer to beat the ``sampling-noise floor'' given by the sampling noise of each cost-function estimate provided to the optimizer. Our results demonstrate the necessity for tailoring and hyperparameter tuning known optimization techniques for inherently noisy variational quantum algorithms and that the variational landscape that one finds in a VQA is highly problem and system dependent. This provides guidance for future implementations of these algorithms in experiments.
Variational quantum algorithms (VQAs) are the leading candidates for practical applications of noisy intermediate-scale quantum (NISQ) devices. Recently, pulse-based variational quantum algorithms (p-VQAs) have emerged as a compelling alternative to traditional gate-based VQAs. By optimizing continuous control fields directly on hardware-native Hamiltonians, pulse-based methods are easy to implement and can significantly reduce quantum resource overhead, thereby enhancing the overall performance of quantum algorithms on NISQ devices. In this review, we present a comprehensive survey over recent advances in p-VQAs, covering theory, algorithms, and hardware deployments across various quantum computing platforms. We also review applications of p-VQAs to variational quantum eigensolver in quantum chemistry, quantum approximate optimization algorithm for combinatorial optimization, and quantum machine learning tasks.