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

International Conference on Electrical, Computer and Energy Technologies (ICECET)

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

Ata Sani Kılıç, Ercan Erkalkan

Published Jul 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/icecet65726.2026.11632298

Related papers

Benchmarking Constraint-Preserving QAOA for Renewable-Energy Portfolio Selection

Ishanth Guntko

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.

•Nov 9, 2026•0 citations

Quantum Approximate Optimisation Algorithm for Shariah-Constrained Portfolio Selection: A QUBO Formulation with Islamic Finance Penalty Terms

Monsur Bolaji Olowoyo, Wahab Abiona

This paper presents an application of the Quantum Approximate Optimisation Algorithm (QAOA) to Islamic portfolio optimisation, formulating the Shariah-constrained asset allocation problem as a Quadratic Unconstrained Binary Optimisation (QUBO) with explicit Islamic finance penalty terms. When augmented with AAOIFI Standard 21 constraints and IFSB capital adequacy guidelines, the portfolio allocation problem becomes NP-hard for large portfolios. Encoding these constraints as penalty terms in the QUBO Hamiltonian, the rare formulation in any domain incorporating religious law constraints, with penalty weights λShariah = 5.0 and λbudget = 2.0. Simulated on IBM Qiskit with a p=2 variational circuit using a high-fidelity synthetic dataset, the model demonstrates a simulated 55× speedup over classical enumeration on a 20-asset Shariah-constrained allocation problem. Quantum amplitude estimation further provides O(1/ε) speedup over classical Monte Carlo O(1/ε2 ) for Islamic portfolio risk estimation. The Shariah-adjusted sukuk-equity correlation (ρ = 0.18) is embedded in the quantum objective function.

International Journal of Quantum Technologies•Sep 9, 2026•0 citations

A Coupled Newsvendor Benchmark for QAOA: Budget-Constrained Multi-Item Formulations, Depth Effects, Scaling, and Optimizer Sensitivity

Zefree Lazarus Mayaluri, Sasmita Mishra

This study develops a budget-constrained multi-item newsvendor benchmark for analysing the Quantum Approximate Optimization Algorithm (QAOA) on an inventory problem with explicit combinatorial coupling. The single-item closed-form newsvendor model is used only as a calibration benchmark, whereas the main formulation links multiple order decisions through a shared resource constraint. After binary expansion, the problem is expressed as a quadratic unconstrained binary optimization model and mapped to an Ising Hamiltonian with non-trivial pairwise interactions. QAOA is implemented in Qiskit 0.46.0 using COBYLA and SPSA under a reproducible multi-start protocol, and evaluated across depths p ∈ {1, 2, 3, 4, 6} and instance sizes from 4 to 16 qubits. Performance is assessed against exact enumeration or mixed-integer linear programming baselines using objective gap, feasible-sample mass, optimizer variability, and runtime. On the calibration benchmark, the QAOA mode recovers the classical optimum. On a representative 12-qubit coupled benchmark, increasing depth reduces the objective gap from 23.58% at p = 1 to 1.63% at p = 6. The study provides a reproducible benchmark for evaluating low-depth QAOA on coupled inventory optimization problems with direct economic interpretation.

Quantum Economics and Finance•Jul 22, 2026•1 citation

Loan Portfolio Optimization with Variational Quantum Algorithms

Balaganchi A. Bhargava, Kamlesh Kumar, Gouranga Dinda +4 more

Loan portfolio optimization (LPO) seeks portfolios that minimize credit risk while satisfying practical selection constraints. Accounting for portfolio-level risk requires modeling not only expected losses but also loss variability and borrower-default correlations, leading to a large-scale combinatorial optimization problem whose complexity grows rapidly with portfolio size. In this work, we formulate LPO as a Quadratic Constrained Binary Optimization (QCBO) problem that jointly captures expected and unexpected losses and transform the resulting formulation into a Quadratic Unconstrained Binary Optimization (QUBO) model suitable for variational quantum optimization. To address the limited qubit resources of current quantum hardware, we employ Pauli Correlation Encoding (PCE), which enables a large number of portfolio-selection variables to be represented using comparatively few qubits. The proposed framework is evaluated on a real-world microfinance dataset comprising 2012 borrowers. For problem instances with up to 1000 portfolio-selection variables, we benchmark classical simulations of a variational quantum algorithm (VQA) against Google OR-Tools under matched time budgets, obtaining feasible portfolios with an objective-value gap of about 40% across all sizes. We further implement the framework on superconducting quantum hardware for instances containing up to 1500 variables. Across these instances, the experimentally obtained objective values are within 10% of the corresponding simulation results. These findings demonstrate the feasibility of applying PCE-based variational quantum optimization to large-scale loan portfolio optimization under current quantum hardware limitations.

quant-pharXiv:2609.30195•Sep 25, 2026•1 citation

Quantum Portfolio Optimization Under Realistic Frictions: A Rigorous Comparison with Classical Baselines

Ekow Tawiah Andoh

We test whether quantum-inspired optimization, specifically Quadratic Unconstrained Binary Optimization (QUBO) solved via simulated annealing, can improve implementable portfolio performance compared to classical baselines when realistic frictions are included. Our experimental design uses daily returns from the Center for Research in Security Prices (CRSP) for S&P500 constituents spanning 2014–2025, with monthly rebalancing, explicit transaction costs, and turnover accounting. We compare QUBO portfolios against equal-weight and convex mean–variance portfolios across multiple universe sizes (20, 50, 67 assets), lookback windows, and transaction-cost levels. Statistical significance is assessed via paired moving-block bootstrap on out-of-sample net returns. A hyperparameter sweep over encoding depth, penalty coefficients, and turnover reveals 19 of 81 QUBO configurations beat the equal-weight baseline, with the best achieving a Sharpe of 1.59 versus 1.42. However, under a fair walk forward model-selection protocol that eliminates look-ahead bias, the QUBO strategy does not achieve statistically significant superiority over either classical benchmark (∆Sharpe vs. equal weight: −0.13, 95% CI [−0.46,0.16]; vs. mean–variance: −0.29, 95% CI [−0.63,0.06]). Excessive turnover (averaging ∼1.0 per rebalance) is identified as the primary bottleneck. We conclude that current QUBO formulations with simulated annealing do not yet deliver a robust, implementable edge over well-tuned convex optimizers, though the framework remains a promising research direction as quantum hardware and hybrid solvers mature.

•Mar 24, 2026•0 citations

Evaluating the Quantum Approximate Optimization Algorithms for QUBO problems Across Quantum Hardware Platforms: Performance Analysis, Challenges, and Strategies

Teemu Pihkakoski, Aravind Plathanam Babu, Pauli Taipale +2 more

Quantum computers are expected to offer advantages in solving optimization problems challenging for classical computers. Quadratic Unconstrained Binary Optimization (QUBO) problems represent an important class of problems with relevance in finance and logistics. The Quantum Approximate Optimization Algorithm (QAOA) is a prominent candidate for solving QUBO problems on near-term quantum devices. In this paper, we evaluate the performance of both the standard QAOA and the adaptive derivative assembled problem tailored QAOA (ADAPT-QAOA) to solve QUBO problems of varying sizes and hardnesses for financial feature selection problems. Our main observation is that ADAPT-QAOA achieves substantially higher approximation ratios than standard QAOA for harder feature-selection problems (α = 0.6) with statistically significant improvements observed for problem sizes n = 6 and 14. However, the standard QAOA remains competitive for simpler problems. Additionally, we evaluate the practical feasibility and limitations of QAOA through a hardware-aware scaling analysis based on the real-device calibration data for various hardware platforms. We estimate that standard QAOA implementation on superconducting quantum computers provides a shorter time-to-solution compared to trapped-ion devices, while trapped-ion devices yield more favorable error rates. Our findings provide a comprehensive overview of the challenges, trade-offs, and strategies for deploying QAOA-based methods on near-term quantum hardware.

arXiv:2510.12336•Oct 14, 2025•2 citations
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.
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.
This paper presents an application of the Quantum Approximate Optimisation Algorithm (QAOA) to Islamic portfolio optimisation, formulating the Shariah-constrained asset allocation problem as a Quadratic Unconstrained Binary Optimisation (QUBO) with explicit Islamic finance penalty terms. When augmented with AAOIFI Standard 21 constraints and IFSB capital adequacy guidelines, the portfolio allocation problem becomes NP-hard for large portfolios. Encoding these constraints as penalty terms in the QUBO Hamiltonian, the rare formulation in any domain incorporating religious law constraints, with penalty weights λShariah = 5.0 and λbudget = 2.0. Simulated on IBM Qiskit with a p=2 variational circuit using a high-fidelity synthetic dataset, the model demonstrates a simulated 55× speedup over classical enumeration on a 20-asset Shariah-constrained allocation problem. Quantum amplitude estimation further provides O(1/ε) speedup over classical Monte Carlo O(1/ε2 ) for Islamic portfolio risk estimation. The Shariah-adjusted sukuk-equity correlation (ρ = 0.18) is embedded in the quantum objective function.
This study develops a budget-constrained multi-item newsvendor benchmark for analysing the Quantum Approximate Optimization Algorithm (QAOA) on an inventory problem with explicit combinatorial coupling. The single-item closed-form newsvendor model is used only as a calibration benchmark, whereas the main formulation links multiple order decisions through a shared resource constraint. After binary expansion, the problem is expressed as a quadratic unconstrained binary optimization model and mapped to an Ising Hamiltonian with non-trivial pairwise interactions. QAOA is implemented in Qiskit 0.46.0 using COBYLA and SPSA under a reproducible multi-start protocol, and evaluated across depths p ∈ {1, 2, 3, 4, 6} and instance sizes from 4 to 16 qubits. Performance is assessed against exact enumeration or mixed-integer linear programming baselines using objective gap, feasible-sample mass, optimizer variability, and runtime. On the calibration benchmark, the QAOA mode recovers the classical optimum. On a representative 12-qubit coupled benchmark, increasing depth reduces the objective gap from 23.58% at p = 1 to 1.63% at p = 6. The study provides a reproducible benchmark for evaluating low-depth QAOA on coupled inventory optimization problems with direct economic interpretation.
Loan portfolio optimization (LPO) seeks portfolios that minimize credit risk while satisfying practical selection constraints. Accounting for portfolio-level risk requires modeling not only expected losses but also loss variability and borrower-default correlations, leading to a large-scale combinatorial optimization problem whose complexity grows rapidly with portfolio size. In this work, we formulate LPO as a Quadratic Constrained Binary Optimization (QCBO) problem that jointly captures expected and unexpected losses and transform the resulting formulation into a Quadratic Unconstrained Binary Optimization (QUBO) model suitable for variational quantum optimization. To address the limited qubit resources of current quantum hardware, we employ Pauli Correlation Encoding (PCE), which enables a large number of portfolio-selection variables to be represented using comparatively few qubits. The proposed framework is evaluated on a real-world microfinance dataset comprising 2012 borrowers. For problem instances with up to 1000 portfolio-selection variables, we benchmark classical simulations of a variational quantum algorithm (VQA) against Google OR-Tools under matched time budgets, obtaining feasible portfolios with an objective-value gap of about 40% across all sizes. We further implement the framework on superconducting quantum hardware for instances containing up to 1500 variables. Across these instances, the experimentally obtained objective values are within 10% of the corresponding simulation results. These findings demonstrate the feasibility of applying PCE-based variational quantum optimization to large-scale loan portfolio optimization under current quantum hardware limitations.
We test whether quantum-inspired optimization, specifically Quadratic Unconstrained Binary Optimization (QUBO) solved via simulated annealing, can improve implementable portfolio performance compared to classical baselines when realistic frictions are included. Our experimental design uses daily returns from the Center for Research in Security Prices (CRSP) for S&P500 constituents spanning 2014–2025, with monthly rebalancing, explicit transaction costs, and turnover accounting. We compare QUBO portfolios against equal-weight and convex mean–variance portfolios across multiple universe sizes (20, 50, 67 assets), lookback windows, and transaction-cost levels. Statistical significance is assessed via paired moving-block bootstrap on out-of-sample net returns. A hyperparameter sweep over encoding depth, penalty coefficients, and turnover reveals 19 of 81 QUBO configurations beat the equal-weight baseline, with the best achieving a Sharpe of 1.59 versus 1.42. However, under a fair walk forward model-selection protocol that eliminates look-ahead bias, the QUBO strategy does not achieve statistically significant superiority over either classical benchmark (∆Sharpe vs. equal weight: −0.13, 95% CI [−0.46,0.16]; vs. mean–variance: −0.29, 95% CI [−0.63,0.06]). Excessive turnover (averaging ∼1.0 per rebalance) is identified as the primary bottleneck. We conclude that current QUBO formulations with simulated annealing do not yet deliver a robust, implementable edge over well-tuned convex optimizers, though the framework remains a promising research direction as quantum hardware and hybrid solvers mature.
Quantum computers are expected to offer advantages in solving optimization problems challenging for classical computers. Quadratic Unconstrained Binary Optimization (QUBO) problems represent an important class of problems with relevance in finance and logistics. The Quantum Approximate Optimization Algorithm (QAOA) is a prominent candidate for solving QUBO problems on near-term quantum devices. In this paper, we evaluate the performance of both the standard QAOA and the adaptive derivative assembled problem tailored QAOA (ADAPT-QAOA) to solve QUBO problems of varying sizes and hardnesses for financial feature selection problems. Our main observation is that ADAPT-QAOA achieves substantially higher approximation ratios than standard QAOA for harder feature-selection problems (α = 0.6) with statistically significant improvements observed for problem sizes n = 6 and 14. However, the standard QAOA remains competitive for simpler problems. Additionally, we evaluate the practical feasibility and limitations of QAOA through a hardware-aware scaling analysis based on the real-device calibration data for various hardware platforms. We estimate that standard QAOA implementation on superconducting quantum computers provides a shorter time-to-solution compared to trapped-ion devices, while trapped-ion devices yield more favorable error rates. Our findings provide a comprehensive overview of the challenges, trade-offs, and strategies for deploying QAOA-based methods on near-term quantum hardware.