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

Benchmarking Constraint-Preserving QAOA for Renewable-Energy Portfolio Selection

Ishanth Guntko

Published Nov 9, 2026• 0 citations
Publisher

Abstract

We study renewable-energy portfolio selection using quantum approximate optimization algorithms (QAOA) with penalty-based X, cardinality-preserving XY, and sector-preserving XY mixers, benchmarked against exact and mixed-integer classical solvers. On 18 small primary problems, the mixers recovered optimal portfolios in 6, 13, and 15 cases, respectively; classical methods solved all 18 faster. The penalty-X baseline sampled almost uniformly among feasible portfolios, and a 72-run penalty sweep offered no reliable improvement. A second exploratory study used eight listed issuers across three dated problems; corrected 64-shot readouts recovered optima in 5 of 18 X settings and 16 of 18 XY settings. Financial backtests remained retrospective. Between May and October 2026, the baseline strategy returned −3.41%, while renewable/SPY blends returned +2.50% and +5.46%, below SPY’s +8.41%. Improved quantum sampling did not establish a speed advantage, independent validation, or investment alpha.

DOI
10.33774/coe-2026-62czd

Related papers

Quantum Approximate Optimization Algorithm for Large-Scale Portfolio Selection with Multi-Factor Constraints

Deni Teminyan

Large-scale portfolio optimization is hard because investors must balance risk, return, diversification, and liquidity across many assets with complex constraints. Classical methods, such as quadratic programming or metaheuristics, often become slow or less effective as the number of assets and factors grows. In this project, I explore the use of the Quantum Approximate Optimization Algorithm (QAOA) as a hybrid quantum–classical approach to portfolio selection. The framework encodes portfolio decisions as qubits and represents financial objectives—such as mean–variance trade-offs or risk-adjusted return—inside a parameterized quantum circuit. Classical optimization is then used to tune the circuit parameters so that the quantum system converges toward low-risk, high-return portfolios. Multi-factor constraints, including sector limits, liquidity rules, ESG scores, and macroeconomic risk factors, are integrated into the Hamiltonian as penalty terms. A qualitative comparison with classical solvers (e.g., mixed-integer programming and simulated annealing) suggests that QAOA can scale more gracefully in high-dimensional settings and handle complex constraint structures. Overall, the project shows how quantum hybrid optimization could support future portfolio management, linking theoretical quantum algorithms with practical, sustainability-aware investment strategies.

Next generation.•Nov 16, 2025•0 citations

Constrained Portfolio Optimization via Quantum Approximate Optimization Algorithm (QAOA) with XY-Mixers and Trotterized Initialization: A Hybrid Approach for Direct Indexing

Javier Mancilla, Theodoros D. Bouloumis, Frederic Goguikian

Portfolio optimization under strict cardinality constraints is a combinatorial challenge that defies classical convex optimization techniques, particularly in the context of "Direct Indexing" and ESG-constrained mandates. In the Noisy Intermediate-Scale Quantum (NISQ) era, the Quantum Approximate Optimization Algorithm (QAOA) offers a promising hybrid approach. However, standard QAOA implementations utilizing transverse field mixers often fail to strictly enforce hard constraints, necessitating soft penalties that distort the energy landscape. This paper presents a comprehensive analysis of a constraint-preserving QAOA formulation against Simulated Annealing (SA) and Hierarchical Risk Parity (HRP). We implement a specific QAOA ansatz utilizing a Dicke state initialization and an XY-mixer Hamiltonian that strictly preserves the Hamming weight of the solution, ensuring only valid portfolios of size K are explored. Furthermore, we introduce a Trotterized parameter initialization schedule inspired by adiabatic quantum computing to mitigate the "Barren Plateau" problem. Backtesting on a basket of 10 US equities over 2025 reveals that our QAOA approach achieves a Sharpe Ratio of 1.81, significantly outperforming Simulated Annealing (1.31) and HRP (0.98). We further analyze the operational implications of the algorithm's high turnover (76.8%), discussing the trade-offs between theoretical optimality and implementation costs in institutional settings.

quant-pharXiv:2602.14827•Feb 17, 2026•3 citations

Constrained Counterdiabatic Quantum Approximate Optimization Algorithm for Portfolio Optimization

Jose Falla, Ilya Safro

We introduce a counterdiabatic (CD) extension of the Quantum Approximate Optimization Algorithm (QAOA) for constrained portfolio optimization. By incorporating approximate adiabatic gauge potentials generated from nested commutators of the Ising-type portfolio problem Hamiltonian and the Hamming weight-preserving XY mixer Hamiltonian into our variational ansatz, the resulting Constrained Counterdiabatic QAOA (CCD-QAOA) achieves improved optimization performance under realistic budget and risk constraints. Benchmarking against standard XY-mixer QAOA, Grover-mixer QAOA, and penalty-based QAOA formulations, our numerical simulations demonstrate that, for a fixed QAOA depth, our CCD-QAOA approach consistently results in better approximation ratios.

quant-pharXiv:2605.06858•May 11, 2026•1 citation

Reproducible QUBO-QAOA Benchmark for Cardinality-Constrained Mean-Variance Portfolio Selection

Ata Sani Kılıç, Ercan Erkalkan

Cardinality-constrained mean-variance portfolio selection is a practical decision-support problem in finance and business analytics and a compact benchmark for combinatorial optimization. A Quadratic Unconstrained Binary Optimization (QUBO) model is derived using an equal-weight utility proxy and an instance-adaptive quadratic penalty that enforces a fixed number of selected assets. A depth-one Quantum Approximate Optimization Algorithm (QAOA) solver is evaluated on a classical statevector simulator and compared against an exact feasibleenumeration baseline on small problem sizes. A fully reproducible Python implementation is described, including QUBO construction, penalty calibration, and a$(\gamma, \beta)$grid-search protocol that minimizes expected energy, followed by a top-$M$post-processing rule for returning a feasible portfolio. Across 10 synthetic instances per problem size, feasibility is achieved in all runs for$N \in\{8,10,12\}$with$K=3$under the default setting$(\alpha=10$,$M=256$). An ablation quantifies that top-$M$post-processing is critical for maintaining feasibility under a standard mixer, while penalty scaling exhibits an explicit feasibility-quality trade-off at$N=12$. A simple classical greedy and random-$K$baseline is also reported to contextualize depth-one QAOA performance.

International Conference on Electrical, Computer and Energy Technologies (ICECET)•Jul 1, 2026•0 citations

Performance Comparison of QAOA Mixers for Ternary Portfolio Optimization

Shintaro Yamamura, Satoshi Watanabe, Masaya Kunimi +2 more

The Quantum Approximate Optimization Algorithm (QAOA) is a quantum algorithm proposed for Noisy Intermediate-Scale Quantum (NISQ) devices and is regarded as a promising approach to combinatorial optimization problems, with potential applications in the financial sector. In this study, we apply QAOA to the portfolio optimization problem, which is one of the central challenges in financial engineering. A portfolio consists of a combination of multiple assets, and the portfolio optimization problem aims to determine the optimal asset allocation by balancing expected return and risk. In the context of quantum optimization, portfolio optimization is often formulated using discrete variables. Unlike conventional binary formulations, we consider a ternary portfolio optimization problem that accounts for three states-holding, not holding, and short selling-and compare its performance using different mixer operators. Specifically, we implement QAOA with the standard mixer and several XY Mixers (XY Ring, XY Parity Ring, XY Full, and QAMPA), and conducted simulations using real data based on the German stock index (DAX 30) for portfolios consisting of 5 and 8 assets. Furthermore, we introduce noise based on a depolarizing channel to investigate the behavior of the algorithm in realistic environments. The results show that while XY Mixers exhibit superiority in noiseless settings, their advantage degrades in noisy environments, and the optimal choice of mixer depends on both the number of QAOA depths and the noise strength.

quant-pharXiv:2602.21562•Feb 26, 2026•1 citation

Performance Comparison of QAOA Mixers for Ternary Portfolio Optimization

Shintaro Yamamura, Satoshi Watanabe, Masaya Kunimi +2 more

Abstract The Quantum Approximate Optimization Algorithm (QAOA) is a quantum algorithm proposed for Noisy Intermediate-Scale Quantum (NISQ) devices and is regarded as a promising approach to combinatorial optimization problems, with potential applications in the financial sector. In this study, we apply QAOA to the portfolio optimization problem, which is one of the central challenges in financial engineering. A portfolio consists of a combination of multiple assets, and the portfolio optimization problem aims to determine the optimal asset allocation by balancing expected return and risk. In the context of quantum optimization, portfolio optimization is often formulated using discrete variables. Unlike conventional binary formulations, we consider a ternary portfolio optimization problem that accounts for three states—holding, not holding, and short selling—and compare its performance using different mixer operators. Specifically, we implement QAOA with the standard mixer and several XY Mixers (XY Ring, XY Parity Ring, XY Full, and QAMPA), and conducted simulations using real data based on the German stock index (DAX 30) for portfolios consisting of 5 and 8 assets. Furthermore, we introduce noise based on a depolarizing channel to investigate the behavior of the algorithm in realistic environments. The results show that while XY Mixers exhibit superiority in noiseless settings, their advantage degrades in noisy environments, and the optimal choice of mixer depends on both the number of QAOA depths and the noise strength.

•May 7, 2026•0 citations
We study renewable-energy portfolio selection using quantum approximate optimization algorithms (QAOA) with penalty-based X, cardinality-preserving XY, and sector-preserving XY mixers, benchmarked against exact and mixed-integer classical solvers. On 18 small primary problems, the mixers recovered optimal portfolios in 6, 13, and 15 cases, respectively; classical methods solved all 18 faster. The penalty-X baseline sampled almost uniformly among feasible portfolios, and a 72-run penalty sweep offered no reliable improvement. A second exploratory study used eight listed issuers across three dated problems; corrected 64-shot readouts recovered optima in 5 of 18 X settings and 16 of 18 XY settings. Financial backtests remained retrospective. Between May and October 2026, the baseline strategy returned −3.41%, while renewable/SPY blends returned +2.50% and +5.46%, below SPY’s +8.41%. Improved quantum sampling did not establish a speed advantage, independent validation, or investment alpha.
Large-scale portfolio optimization is hard because investors must balance risk, return, diversification, and liquidity across many assets with complex constraints. Classical methods, such as quadratic programming or metaheuristics, often become slow or less effective as the number of assets and factors grows. In this project, I explore the use of the Quantum Approximate Optimization Algorithm (QAOA) as a hybrid quantum–classical approach to portfolio selection. The framework encodes portfolio decisions as qubits and represents financial objectives—such as mean–variance trade-offs or risk-adjusted return—inside a parameterized quantum circuit. Classical optimization is then used to tune the circuit parameters so that the quantum system converges toward low-risk, high-return portfolios. Multi-factor constraints, including sector limits, liquidity rules, ESG scores, and macroeconomic risk factors, are integrated into the Hamiltonian as penalty terms. A qualitative comparison with classical solvers (e.g., mixed-integer programming and simulated annealing) suggests that QAOA can scale more gracefully in high-dimensional settings and handle complex constraint structures. Overall, the project shows how quantum hybrid optimization could support future portfolio management, linking theoretical quantum algorithms with practical, sustainability-aware investment strategies.
Portfolio optimization under strict cardinality constraints is a combinatorial challenge that defies classical convex optimization techniques, particularly in the context of "Direct Indexing" and ESG-constrained mandates. In the Noisy Intermediate-Scale Quantum (NISQ) era, the Quantum Approximate Optimization Algorithm (QAOA) offers a promising hybrid approach. However, standard QAOA implementations utilizing transverse field mixers often fail to strictly enforce hard constraints, necessitating soft penalties that distort the energy landscape. This paper presents a comprehensive analysis of a constraint-preserving QAOA formulation against Simulated Annealing (SA) and Hierarchical Risk Parity (HRP). We implement a specific QAOA ansatz utilizing a Dicke state initialization and an XY-mixer Hamiltonian that strictly preserves the Hamming weight of the solution, ensuring only valid portfolios of size K are explored. Furthermore, we introduce a Trotterized parameter initialization schedule inspired by adiabatic quantum computing to mitigate the "Barren Plateau" problem. Backtesting on a basket of 10 US equities over 2025 reveals that our QAOA approach achieves a Sharpe Ratio of 1.81, significantly outperforming Simulated Annealing (1.31) and HRP (0.98). We further analyze the operational implications of the algorithm's high turnover (76.8%), discussing the trade-offs between theoretical optimality and implementation costs in institutional settings.
We introduce a counterdiabatic (CD) extension of the Quantum Approximate Optimization Algorithm (QAOA) for constrained portfolio optimization. By incorporating approximate adiabatic gauge potentials generated from nested commutators of the Ising-type portfolio problem Hamiltonian and the Hamming weight-preserving XY mixer Hamiltonian into our variational ansatz, the resulting Constrained Counterdiabatic QAOA (CCD-QAOA) achieves improved optimization performance under realistic budget and risk constraints. Benchmarking against standard XY-mixer QAOA, Grover-mixer QAOA, and penalty-based QAOA formulations, our numerical simulations demonstrate that, for a fixed QAOA depth, our CCD-QAOA approach consistently results in better approximation ratios.
Cardinality-constrained mean-variance portfolio selection is a practical decision-support problem in finance and business analytics and a compact benchmark for combinatorial optimization. A Quadratic Unconstrained Binary Optimization (QUBO) model is derived using an equal-weight utility proxy and an instance-adaptive quadratic penalty that enforces a fixed number of selected assets. A depth-one Quantum Approximate Optimization Algorithm (QAOA) solver is evaluated on a classical statevector simulator and compared against an exact feasibleenumeration baseline on small problem sizes. A fully reproducible Python implementation is described, including QUBO construction, penalty calibration, and a(γ,β)(\gamma, \beta)(γ,β)grid-search protocol that minimizes expected energy, followed by a top-MMMpost-processing rule for returning a feasible portfolio. Across 10 synthetic instances per problem size, feasibility is achieved in all runs forN∈{8,10,12}N \in\{8,10,12\}N∈{8,10,12}withK=3K=3K=3under the default setting(α=10(\alpha=10(α=10,M=256M=256M=256). An ablation quantifies that top-MMMpost-processing is critical for maintaining feasibility under a standard mixer, while penalty scaling exhibits an explicit feasibility-quality trade-off atN=12N=12N=12. A simple classical greedy and random-KKKbaseline is also reported to contextualize depth-one QAOA performance.
The Quantum Approximate Optimization Algorithm (QAOA) is a quantum algorithm proposed for Noisy Intermediate-Scale Quantum (NISQ) devices and is regarded as a promising approach to combinatorial optimization problems, with potential applications in the financial sector. In this study, we apply QAOA to the portfolio optimization problem, which is one of the central challenges in financial engineering. A portfolio consists of a combination of multiple assets, and the portfolio optimization problem aims to determine the optimal asset allocation by balancing expected return and risk. In the context of quantum optimization, portfolio optimization is often formulated using discrete variables. Unlike conventional binary formulations, we consider a ternary portfolio optimization problem that accounts for three states-holding, not holding, and short selling-and compare its performance using different mixer operators. Specifically, we implement QAOA with the standard mixer and several XY Mixers (XY Ring, XY Parity Ring, XY Full, and QAMPA), and conducted simulations using real data based on the German stock index (DAX 30) for portfolios consisting of 5 and 8 assets. Furthermore, we introduce noise based on a depolarizing channel to investigate the behavior of the algorithm in realistic environments. The results show that while XY Mixers exhibit superiority in noiseless settings, their advantage degrades in noisy environments, and the optimal choice of mixer depends on both the number of QAOA depths and the noise strength.
Abstract The Quantum Approximate Optimization Algorithm (QAOA) is a quantum algorithm proposed for Noisy Intermediate-Scale Quantum (NISQ) devices and is regarded as a promising approach to combinatorial optimization problems, with potential applications in the financial sector. In this study, we apply QAOA to the portfolio optimization problem, which is one of the central challenges in financial engineering. A portfolio consists of a combination of multiple assets, and the portfolio optimization problem aims to determine the optimal asset allocation by balancing expected return and risk. In the context of quantum optimization, portfolio optimization is often formulated using discrete variables. Unlike conventional binary formulations, we consider a ternary portfolio optimization problem that accounts for three states—holding, not holding, and short selling—and compare its performance using different mixer operators. Specifically, we implement QAOA with the standard mixer and several XY Mixers (XY Ring, XY Parity Ring, XY Full, and QAMPA), and conducted simulations using real data based on the German stock index (DAX 30) for portfolios consisting of 5 and 8 assets. Furthermore, we introduce noise based on a depolarizing channel to investigate the behavior of the algorithm in realistic environments. The results show that while XY Mixers exhibit superiority in noiseless settings, their advantage degrades in noisy environments, and the optimal choice of mixer depends on both the number of QAOA depths and the noise strength.