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:2105.11766 · Physical Review Research

Evolving objective function for improved variational quantum optimization

Ioannis Kolotouros, Petros Wallden

Published Jun 21, 2022• 27 citations
arXivHTMLPDF

Abstract

A promising approach to useful computational quantum advantage is to use variational quantum algorithms for optimization problems. Crucial for the performance of these algorithms is to ensure that the algorithm converges with high probability to a near-optimal solution in a small time. In Barkoutsos et al. [Quantum 4, 256 (2020)], an alternative class of objective functions, called conditional value at risk (CVaR), was introduced and it was shown that they perform better than standard objective functions. Here we extend that work by introducing an evolving objective function, which we call ascending-CVaR and that can be used for any optimization problem. We test our proposed objective function in an emulation environment, using as case studies three different optimization problems: MaxCut, number partitioning, and portfolio optimization. We examine multiple instances of different sizes and analyze the performance using the variational quantum eigensolver with hardware-efficient ansatz and the quantum approximate optimization algorithm. We show that ascending-CVaR in all cases performs better than standard objective functions or the constant CVaR of Barkoutsos et al. [Quantum 4, 256 (2020)] and that it can be used as a heuristic for avoiding suboptimal minima. Our proposal achieves higher overlap with the ideal state in all problems, whether we consider easy or hard instances---on average, it gives up to ten times greater overlap at portfolio optimization and number partitioning, while it gives an 80% improvement at MaxCut. In the hard instances we consider, for the number partitioning problem, standard objective functions fail to find the correct solution in almost all cases, CVaR finds the correct solution at 60% of the cases, while ascending-CVaR finds the correct solution in 95% of the cases.

DOI
10.1103/physrevresearch.4.023225

Related papers

Improved Quantum Approximate Optimization Algorithm Based on Conditional Value-at-Risk for Portfolio Optimization

Qingqing Yu, Rong JIN

This paper presents an improved Quantum Approximate Optimization Algorithm variant based on Conditional Value-at-Risk for addressing portfolio optimization problems. Portfolio optimization is a NP-hard combinatorial problem that aims to select an optimal set of assets and their quantities to balance risk against expected return. The proposed approach uses the QAOA to find the optimal asset combination that maximizes returns while minimizing risk, with a focus on the tail end of the loss distribution. An enhanced QAOA ansatz introduced that offers a balance between optimization quality and circuit depth, leading to faster convergence and higher probabilities of obtaining optimal solutions. Experiments are conducted using historical stock data from Nasdaq, optimizing portfolios with varying numbers of stocks. Our method outperforms original QAOA and CVaR-QAOA, particularly as the size of the problem increases. Regardless of the scenario, whether it involves 10, 12, 14, or 16 stocks, the improved CVaR-QAOA consistently converges within 100 iterations or less, whereas the standard QAOA consistently requires 450 iterations or more.

IEICE Transactions on Information and Systems•Jan 14, 2025•7 citations

Enhancing quantum approximate optimization with CNN-CVaR integration

Pengnian Cai, Kang Shen, Tao Yang +12 more

Abstract The Quantum Approximate Optimization Algorithm (QAOA) represents a promising approach for tackling combinatorial optimization challenges on near-term quantum devices. Central to QAOA optimization is the minimization of the expectation of the problem Hamiltonian for parameterized trial quantum states, which motivates the exploration of advanced optimization techniques. In this study, we propose a novel combinatorial optimization strategy, CNN-CVaR-QAOA, which integrates a Convolutional Neural Network (CNN) with Conditional Value at Risk (CVaR) to optimize QAOA circuits. By replacing the traditional loss function with CVaR and leveraging CNN for variational quantum parameter optimization, we demonstrate the superior efficacy of CNN-CVaR-QAOA through experimental validation on Erdos-Renyi random graphs. Our results show enhanced approximation ratios across various graph configurations. Furthermore, we investigate the influence of the CVaR parameter ($\alpha$) on algorithm performance, revealing that lower $\alpha$ values lead to smoother objective functions and improved approximation ratios. CNN-CVaR-QAOA offers significant advantages in optimizing QAOA parameters, particularly in the context of small-scale quantum devices, highlighting its potential to enhance QAOA optimization efforts across diverse optimization domains.

Quantum Information Processing•Jan 24, 2025•5 citations

CVaR-Assisted Custom Penalty Function for Constrained Optimization

Xin Wei Lee, Hoong Chuin Lau

We propose a slack-free penalty formulation for constrained binary optimization that eliminates auxiliary slack variables and preserves the feasibility structure of the original problem. The proposed approach introduces a nonlinear custom penalty function to enforce inequality constraints directly in the objective function. To address the computational challenges associated with evaluating nonlinear penalties in variational quantum algorithms, we employ the finite-sampling method that avoids the exponential complexity required by exact expectation computation. Furthermore, we integrate the Conditional Value-at-Risk (CVaR) objective to improve optimization robustness and guide the search toward high-quality solutions. The proposed framework is evaluated on instances of the multi-dimensional knapsack problem, a classical benchmark in combinatorial optimization. We showcase that the proposed custom-penalty formulation combined with CVaR sampling achieves improved optimality gaps and more consistent performance compared with conventional slack-based QUBO formulations. We also tested our method on the Quantinuum H2 quantum hardware, demonstrating the possibilities of training small-sized VQE on noisy trapped-ion quantum computers. The results suggest that careful penalty design can play a critical role in enabling quantum and hybrid quantum-classical algorithms for constrained optimization problems that arise in operations research.

quant-pharXiv:2604.20088•Apr 23, 2026•3 citations

Improving Variational Quantum Optimization using CVaR

Panagiotis Kl. Barkoutsos, Giacomo Nannicini, Anton Robert +2 more

Hybrid quantum/classical variational algorithms can be implemented on noisy intermediate-scale quantum computers and can be used to find solutions for combinatorial optimization problems. Approaches discussed in the literature minimize the expectation of the problem Hamiltonian for a parameterized trial quantum state. The expectation is estimated as the sample mean of a set of measurement outcomes, while the parameters of the trial state are optimized classically. This procedure is fully justified for quantum mechanical observables such as molecular energies. In the case of classical optimization problems, which yield diagonal Hamiltonians, we argue that aggregating the samples in a different way than the expected value is more natural. In this paper we propose the Conditional Value-at-Risk as an aggregation function. We empirically show -- using classical simulation as well as quantum hardware -- that this leads to faster convergence to better solutions for all combinatorial optimization problems tested in our study. We also provide analytical results to explain the observed difference in performance between different variational algorithms.

arXiv:1907.04769•Quantum•Apr 20, 2020•304 citations

Best practices for portfolio optimization by quantum computing, experimented on real quantum devices

Giuseppe Buonaiuto, Francesco Gargiulo, Giuseppe De Pietro +2 more

In finance, portfolio optimization aims at finding optimal investments maximizing a trade-off between return and risks, given some constraints. Classical formulations of this quadratic optimization problem have exact or heuristic solutions, but the complexity scales up as the market dimension increases. Recently, researchers are evaluating the possibility of facing the complexity scaling issue by employing quantum computing. In this paper, the problem is solved using the Variational Quantum Eigensolver (VQE), which in principle is very efficient. The main outcome of this work consists of the definition of the best hyperparameters to set, in order to perform Portfolio Optimization by VQE on real quantum computers. In particular, a quite general formulation of the constrained quadratic problem is considered, which is translated into Quadratic Unconstrained Binary Optimization by the binary encoding of variables and by including constraints in the objective function. This is converted into a set of quantum operators (Ising Hamiltonian), whose minimum eigenvalue is found by VQE and corresponds to the optimal solution. In this work, different hyperparameters of the procedure are analyzed, including different ansatzes and optimization methods by means of experiments on both simulators and real quantum computers. Experiments show that there is a strong dependence of solutions quality on the sufficiently sized quantum computer and correct hyperparameters, and with the best choices, the quantum algorithm run on real quantum devices reaches solutions very close to the exact one, with a strong convergence rate towards the classical solution, even without error-mitigation techniques. Moreover, results obtained on different real quantum devices, for a small-sized example, show the relation between the quality of the solution and the dimension of the quantum processor. Evidences allow concluding which are the best ways to solve real Portfolio Optimization problems by VQE on quantum devices, and confirm the possibility to solve them with higher efficiency, with respect to existing methods, as soon as the size of quantum hardware will be sufficiently high.

Scientific Reports•Nov 8, 2023•91 citations

Quantum algorithms for combinatorial optimization

Vanessa Minouche Dehn

Combinatorial Optimization problems play an important role in various domains such as logis- tics, life science or the financial sector. As their complexity in general grows exponentially with their problem size, finding the optimal solution classically becomes infeasible very fast. This raises the central question of whether quantum computers are in principle suitable for solving combinatorial optimization problems better and faster than classical computers. In order to find answers to that question, one needs to study quantum algorithms designed for those problems under ideal conditions (i.e., simulations, which are however limited due to exponential scaling) to investigate their potential, but one also needs real quantum hardware to test its viability and evaluate whether practical advantages are reasonable. In this regard, we consider variational quantum algorithms, especially the Quantum Approximate Optimization Algorithm (QAOA) consisting of a problem and a mixer Hamiltonian with freely selectable parameters, originally proposed as variational hybrid ansatz with classical optimization. This algorithm structure of- fers flexible and relatively shallow circuits, which makes it suitable for current NISQ hardware. However, optimizing the variational circuit parameters can be an NP-hard problem at worst. In this thesis, we study different versions of QAOA, especially with a focus on limitations, perfor- mance and potential advantages opposite classical methods. The first part of the thesis concerns the investigation of various aspects regarding the imple- mentation of the variational QAOA protocol such as: the incorporation of a problem constraint either by adding a suitable penalty term of by choosing a suitable mixer (that restricts the search space), the scaling of the problem Hamiltonian in comparison to the mixer Hamiltonian, the choice of the initial values for the classical optimization of the circuit parameters, and finally the choice of the function to be minimized (i.e., CVaR vs. expectation value). We apply this proto- col to both the portfolio optimization and the feature selection and evaluate the performance. In order to improve QAOA, we consider the warm-start QAOA for different problem instances and analyze its improved performance with regard to involved quantum effects. For this purpose, we propose a classical pre-processing method and demonstrate that the warm-start results can be reproduced or even exceeded by this method. The second part addresses the issue that the standard variational form requires a high number of circuit parameters that have to be optimized at a sufficiently large depth, which is a major limitationforachievingpotentialscalingadvantagescomparedtoclassicalmethods. Toovercome this limitation, we investigate and further develop fixed schedules for QAOA, which only rely on two free parameters. We start with introducing the continuous adiabatic theorem as it motivates the form of QAOA and show its limitations, which we address by applying a discrete version of the theorem. With our findings, a new version of QAOA based on linear-ramps (LR-QAOA) is introduced and further developed. In order to derive suitable parameter values for this schedule, we propose a method based on extrapolation from smaller towards larger problem sizes. With our results obtained on a noiseless emulator, we evaluate the quantum runtime scaling and discuss whether a scaling advantage can be achieved compared to classical methods.

•Jan 1, 2026•0 citations
A promising approach to useful computational quantum advantage is to use variational quantum algorithms for optimization problems. Crucial for the performance of these algorithms is to ensure that the algorithm converges with high probability to a near-optimal solution in a small time. In Barkoutsos et al. [Quantum 4, 256 (2020)], an alternative class of objective functions, called conditional value at risk (CVaR), was introduced and it was shown that they perform better than standard objective functions. Here we extend that work by introducing an evolving objective function, which we call ascending-CVaR and that can be used for any optimization problem. We test our proposed objective function in an emulation environment, using as case studies three different optimization problems: MaxCut, number partitioning, and portfolio optimization. We examine multiple instances of different sizes and analyze the performance using the variational quantum eigensolver with hardware-efficient ansatz and the quantum approximate optimization algorithm. We show that ascending-CVaR in all cases performs better than standard objective functions or the constant CVaR of Barkoutsos et al. [Quantum 4, 256 (2020)] and that it can be used as a heuristic for avoiding suboptimal minima. Our proposal achieves higher overlap with the ideal state in all problems, whether we consider easy or hard instances---on average, it gives up to ten times greater overlap at portfolio optimization and number partitioning, while it gives an 80% improvement at MaxCut. In the hard instances we consider, for the number partitioning problem, standard objective functions fail to find the correct solution in almost all cases, CVaR finds the correct solution at 60% of the cases, while ascending-CVaR finds the correct solution in 95% of the cases.
This paper presents an improved Quantum Approximate Optimization Algorithm variant based on Conditional Value-at-Risk for addressing portfolio optimization problems. Portfolio optimization is a NP-hard combinatorial problem that aims to select an optimal set of assets and their quantities to balance risk against expected return. The proposed approach uses the QAOA to find the optimal asset combination that maximizes returns while minimizing risk, with a focus on the tail end of the loss distribution. An enhanced QAOA ansatz introduced that offers a balance between optimization quality and circuit depth, leading to faster convergence and higher probabilities of obtaining optimal solutions. Experiments are conducted using historical stock data from Nasdaq, optimizing portfolios with varying numbers of stocks. Our method outperforms original QAOA and CVaR-QAOA, particularly as the size of the problem increases. Regardless of the scenario, whether it involves 10, 12, 14, or 16 stocks, the improved CVaR-QAOA consistently converges within 100 iterations or less, whereas the standard QAOA consistently requires 450 iterations or more.
Abstract The Quantum Approximate Optimization Algorithm (QAOA) represents a promising approach for tackling combinatorial optimization challenges on near-term quantum devices. Central to QAOA optimization is the minimization of the expectation of the problem Hamiltonian for parameterized trial quantum states, which motivates the exploration of advanced optimization techniques. In this study, we propose a novel combinatorial optimization strategy, CNN-CVaR-QAOA, which integrates a Convolutional Neural Network (CNN) with Conditional Value at Risk (CVaR) to optimize QAOA circuits. By replacing the traditional loss function with CVaR and leveraging CNN for variational quantum parameter optimization, we demonstrate the superior efficacy of CNN-CVaR-QAOA through experimental validation on Erdos-Renyi random graphs. Our results show enhanced approximation ratios across various graph configurations. Furthermore, we investigate the influence of the CVaR parameter (α\alphaα) on algorithm performance, revealing that lower α\alphaα values lead to smoother objective functions and improved approximation ratios. CNN-CVaR-QAOA offers significant advantages in optimizing QAOA parameters, particularly in the context of small-scale quantum devices, highlighting its potential to enhance QAOA optimization efforts across diverse optimization domains.
We propose a slack-free penalty formulation for constrained binary optimization that eliminates auxiliary slack variables and preserves the feasibility structure of the original problem. The proposed approach introduces a nonlinear custom penalty function to enforce inequality constraints directly in the objective function. To address the computational challenges associated with evaluating nonlinear penalties in variational quantum algorithms, we employ the finite-sampling method that avoids the exponential complexity required by exact expectation computation. Furthermore, we integrate the Conditional Value-at-Risk (CVaR) objective to improve optimization robustness and guide the search toward high-quality solutions. The proposed framework is evaluated on instances of the multi-dimensional knapsack problem, a classical benchmark in combinatorial optimization. We showcase that the proposed custom-penalty formulation combined with CVaR sampling achieves improved optimality gaps and more consistent performance compared with conventional slack-based QUBO formulations. We also tested our method on the Quantinuum H2 quantum hardware, demonstrating the possibilities of training small-sized VQE on noisy trapped-ion quantum computers. The results suggest that careful penalty design can play a critical role in enabling quantum and hybrid quantum-classical algorithms for constrained optimization problems that arise in operations research.
Hybrid quantum/classical variational algorithms can be implemented on noisy intermediate-scale quantum computers and can be used to find solutions for combinatorial optimization problems. Approaches discussed in the literature minimize the expectation of the problem Hamiltonian for a parameterized trial quantum state. The expectation is estimated as the sample mean of a set of measurement outcomes, while the parameters of the trial state are optimized classically. This procedure is fully justified for quantum mechanical observables such as molecular energies. In the case of classical optimization problems, which yield diagonal Hamiltonians, we argue that aggregating the samples in a different way than the expected value is more natural. In this paper we propose the Conditional Value-at-Risk as an aggregation function. We empirically show -- using classical simulation as well as quantum hardware -- that this leads to faster convergence to better solutions for all combinatorial optimization problems tested in our study. We also provide analytical results to explain the observed difference in performance between different variational algorithms.
In finance, portfolio optimization aims at finding optimal investments maximizing a trade-off between return and risks, given some constraints. Classical formulations of this quadratic optimization problem have exact or heuristic solutions, but the complexity scales up as the market dimension increases. Recently, researchers are evaluating the possibility of facing the complexity scaling issue by employing quantum computing. In this paper, the problem is solved using the Variational Quantum Eigensolver (VQE), which in principle is very efficient. The main outcome of this work consists of the definition of the best hyperparameters to set, in order to perform Portfolio Optimization by VQE on real quantum computers. In particular, a quite general formulation of the constrained quadratic problem is considered, which is translated into Quadratic Unconstrained Binary Optimization by the binary encoding of variables and by including constraints in the objective function. This is converted into a set of quantum operators (Ising Hamiltonian), whose minimum eigenvalue is found by VQE and corresponds to the optimal solution. In this work, different hyperparameters of the procedure are analyzed, including different ansatzes and optimization methods by means of experiments on both simulators and real quantum computers. Experiments show that there is a strong dependence of solutions quality on the sufficiently sized quantum computer and correct hyperparameters, and with the best choices, the quantum algorithm run on real quantum devices reaches solutions very close to the exact one, with a strong convergence rate towards the classical solution, even without error-mitigation techniques. Moreover, results obtained on different real quantum devices, for a small-sized example, show the relation between the quality of the solution and the dimension of the quantum processor. Evidences allow concluding which are the best ways to solve real Portfolio Optimization problems by VQE on quantum devices, and confirm the possibility to solve them with higher efficiency, with respect to existing methods, as soon as the size of quantum hardware will be sufficiently high.
Combinatorial Optimization problems play an important role in various domains such as logis- tics, life science or the financial sector. As their complexity in general grows exponentially with their problem size, finding the optimal solution classically becomes infeasible very fast. This raises the central question of whether quantum computers are in principle suitable for solving combinatorial optimization problems better and faster than classical computers. In order to find answers to that question, one needs to study quantum algorithms designed for those problems under ideal conditions (i.e., simulations, which are however limited due to exponential scaling) to investigate their potential, but one also needs real quantum hardware to test its viability and evaluate whether practical advantages are reasonable. In this regard, we consider variational quantum algorithms, especially the Quantum Approximate Optimization Algorithm (QAOA) consisting of a problem and a mixer Hamiltonian with freely selectable parameters, originally proposed as variational hybrid ansatz with classical optimization. This algorithm structure of- fers flexible and relatively shallow circuits, which makes it suitable for current NISQ hardware. However, optimizing the variational circuit parameters can be an NP-hard problem at worst. In this thesis, we study different versions of QAOA, especially with a focus on limitations, perfor- mance and potential advantages opposite classical methods. The first part of the thesis concerns the investigation of various aspects regarding the imple- mentation of the variational QAOA protocol such as: the incorporation of a problem constraint either by adding a suitable penalty term of by choosing a suitable mixer (that restricts the search space), the scaling of the problem Hamiltonian in comparison to the mixer Hamiltonian, the choice of the initial values for the classical optimization of the circuit parameters, and finally the choice of the function to be minimized (i.e., CVaR vs. expectation value). We apply this proto- col to both the portfolio optimization and the feature selection and evaluate the performance. In order to improve QAOA, we consider the warm-start QAOA for different problem instances and analyze its improved performance with regard to involved quantum effects. For this purpose, we propose a classical pre-processing method and demonstrate that the warm-start results can be reproduced or even exceeded by this method. The second part addresses the issue that the standard variational form requires a high number of circuit parameters that have to be optimized at a sufficiently large depth, which is a major limitationforachievingpotentialscalingadvantagescomparedtoclassicalmethods. Toovercome this limitation, we investigate and further develop fixed schedules for QAOA, which only rely on two free parameters. We start with introducing the continuous adiabatic theorem as it motivates the form of QAOA and show its limitations, which we address by applying a discrete version of the theorem. With our findings, a new version of QAOA based on linear-ramps (LR-QAOA) is introduced and further developed. In order to derive suitable parameter values for this schedule, we propose a method based on extrapolation from smaller towards larger problem sizes. With our results obtained on a noiseless emulator, we evaluate the quantum runtime scaling and discuss whether a scaling advantage can be achieved compared to classical methods.