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:2607.03218

Quantum Annealing for Dynamic Portfolio Optimization under Realistic Transaction Costs

Escolástico Sánchez-Martínez, Senaida Hernandez Santana, Ventura Sarasa Laborda, Pablo Serrano Molinero, Guillermo Botella Juan, Alberto del Barrio García

quant-phSubmitted Jul 3, 2026• Announced Jul 6, 2026• 0 citations
arXivHTMLPDF

Abstract

This paper investigates and compares quantum and classical investment strategies for portfolio construction under realistic trading and allocation constraints. The study considers a multi-period portfolio re-balancing setting in which asset weights are subject to lower and upper bounds, class-level exposure restrictions, and turnover limitations. On the quantum side, the portfolio selection problem is reformulated as a quadratic unconstrained binary optimization (QUBO) model through a finite binary encoding of asset weights, and subsequently embedded into a constrained quadratic model (CQM) solved by a hybrid quantum-classical optimization workflow. On the classical side, benchmark allocation strategies are introduced to provide an economically meaningful reference for performance assessment. The proposed framework jointly evaluates portfolio efficiency from two complementary perspectives: business performance, measured through return, volatility, and a measure of the trade-off between them, the Sharpe ratio; and computational performance, assessed through solver structure, constraint handling, and hardware execution characteristics. The resulting comparison provides a rigorous basis for understanding the practical role of quantum annealing in constrained portfolio optimization, while clarifying both its modeling advantages and its current implementation limitations relative to established classical approaches.

Comments
11 pages

Related papers

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

Exploring Quantum Annealing Techniques for Financial Portfolio Optimization

UMA RAMAN, Saif O. Husain, Venkata Siva Bathula +3 more

Quantum annealing has emerged as a promising computational paradigm for solving large-scale combinatorial optimization problems that are intractable for classical algorithms. Financial portfolio optimization, which involves balancing expected returns against risk under multiple practical constraints, represents one of the most challenging optimization tasks in quantitative finance. Traditional approaches based on mean-variance theory, heuristic meta-optimization, and classical quadratic programming often struggle to scale efficiently as the dimensionality of assets and constraints increases. This study explores the application of quantum annealing techniques to financial portfolio optimization by formulating the problem as a quadratic unconstrained binary optimization model suitable for quantum hardware. The paper provides a systematic mapping of portfolio objectives and constraints into the Ising Hamiltonian framework and analyzes how quantum tunneling and probabilistic state transitions can enhance convergence toward near-global optima. Comparative insights between classical solvers and quantum annealing-based approaches are discussed in terms of solution quality, computational efficiency, and scalability. Furthermore, the study highlights current hardware limitations, embedding challenges, and noise effects that influence optimization performance. The findings indicate that quantum annealing offers substantial potential for accelerating portfolio optimization in high-dimensional financial systems, particularly in scenarios involving complex constraints and dynamic market conditions, thereby establishing a foundation for future quantum-driven financial decision-support systems.

International Conference on Innovative Practices in Technology and Management (ICIPTM)•Feb 19, 2026•0 citations

Strategic Portfolio Optimization Using Simulated, Digital, and Quantum Annealing

Jonas B. Lang, Sebastian Zielinski, Sebastian Feld

In this work, we introduce a new workflow to solve portfolio optimization problems on annealing platforms. We combine a classical preprocessing step with a modified unconstrained binary optimization (QUBO) model and evaluate it using simulated annealing (classical computer), digital annealing (Fujitsu’s Digital Annealing Unit), and quantum annealing (D-Wave Advantage). Starting from Markowitz’s theory on portfolio optimization, our classical preprocessing step finds the most promising assets within a set of possible assets to choose from. We then modify existing QUBO models for portfolio optimization, such that there are no limitations on the number of assets that can be invested in. Furthermore, our QUBO model enables an investor to also place an arbitrary amount of money into each asset. We apply this modified QUBO to the set of promising asset candidates we generated previously via classical preprocessing. A solution to our QUBO model contains information about what percentage of the whole available capital should be invested into which asset. For the evaluation, we have used publicly available real-world data sets of stocks of the New York Stock Exchange as well as common ETFs. Finally, we have compared the respective annealing results with randomly generated portfolios by using the return, variance, and diversification of the created portfolios as measures. The results show that our QUBO formulation is capable of creating well-diversified portfolios that respect certain criteria given by an investor, such as maximizing return, minimizing risk, or sticking to a certain budget.

Applied Sciences•Dec 1, 2022•31 citations

Dynamic Asset Allocation with Expected Shortfall via Quantum Annealing

Hanjing Xu, Samudra Dasgupta, Alex Pothen +1 more

Recent advances in quantum hardware offer new approaches to solve various optimization problems that can be computationally expensive when classical algorithms are employed. We propose a hybrid quantum-classical algorithm to solve a dynamic asset allocation problem where a target return and a target risk metric (expected shortfall) are specified. We propose an iterative algorithm that treats the target return as a constraint in a Markowitz portfolio optimization model, and dynamically adjusts the target return to satisfy the targeted expected shortfall. The Markowitz optimization is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem. The use of the expected shortfall risk metric enables the modeling of extreme market events. We compare the results from D-Wave's 2000Q and Advantage quantum annealers using real-world financial data. Both quantum annealers are able to generate portfolios with more than 80% of the return of the classical optimal solutions, while satisfying the expected shortfall. We observe that experiments on assets with higher correlations tend to perform better, which may help to design practical quantum applications in the near term.

arXiv:2112.03188•Entropy•Mar 21, 2023•6 citations

End‐to‐End Portfolio Optimization with Hybrid Quantum Annealing

Sai Nandan Morapakula, Sangram Deshpande, Rakesh Yata +3 more

ABSTRACT Hybrid quantum‐classical optimization has emerged as a promising direction for addressing financial decision problems under current quantum hardware constraints. In this work we present a practical end‐to‐end portfolio optimization pipeline that combines (i) a continuous mean‐variance and Sharpe‐ratio formulation, (ii) a QUBO/CQM‐based discrete asset selection stage solved using D‐Wave's hybrid quantum annealing solver, (iii) classical convex optimization for computing optimal asset weights, and (iv) a quarterly rebalancing mechanism. Rather than claiming quantum advantage, our goal is to evaluate the feasibility and integration of these components within a deployable financial workflow. We empirically compare our hybrid pipeline against a fund manager in real time and indexes used in Indian stock market. The results indicate that the proposed framework can construct diversified portfolios and achieve competitive returns. We also report computational considerations and scalability observations drawn from the hybrid solver behavior. While the experiments are limited to moderate sized portfolios dictated by current annealing hardware and QUBO embedding constraints, the study illustrates how quantum assisted selection and classical allocation can be combined coherently in a real‐world setting. This work emphasizes methodological reproducibility and practical applicability, and aims to serve as a step toward larger‐scale financial optimization workflows as quantum annealers continue to mature.

arXiv:2504.08843•Advanced Quantum Technologies•Dec 26, 2025•6 citations

Bridging Quantum Algorithms and Classical Finance: Portfolio Optimization Using QAOA and QUBO Framework

Arnav Aggarwal, Pranav Shrivastava, Rajneesh Kler +1 more

This study explores the integration of quantum computing techniques, specifically the Quantum Approximate Optimization Algorithm (QAOA), with classical portfolio optimization frameworks through the Quadratic Unconstrained Binary Optimization (QUBO) approach. Using monthly turnover data from the National Stock Exchange of India (NSE), this paper demonstrates the construction of a QUBO matrix by encoding expected returns and covariance-based risk profiles. Binary asset inclusion constraints are introduced into portfolios and then optimised using both brute force enumeration and quantum inspired solvers. The analysis reveals those combinations including Index Futures and Index Options exhibit superior risk-adjusted performance (Sharpe Ratio$\approx 0.286$). The hybrid approach suggests the promise of quantum inspired models as means to improve financial decision making under uncertainty. The results also give a robust template for scalable asset selection models that operate within the constraints of quantum computing infrastructure.

IEEE Uttar Pradesh Section Women in Engineering International Conference on Electrical, Electronics and Computer Engineering (UPWIECON)•Oct 30, 2025•0 citations
This paper investigates and compares quantum and classical investment strategies for portfolio construction under realistic trading and allocation constraints. The study considers a multi-period portfolio re-balancing setting in which asset weights are subject to lower and upper bounds, class-level exposure restrictions, and turnover limitations. On the quantum side, the portfolio selection problem is reformulated as a quadratic unconstrained binary optimization (QUBO) model through a finite binary encoding of asset weights, and subsequently embedded into a constrained quadratic model (CQM) solved by a hybrid quantum-classical optimization workflow. On the classical side, benchmark allocation strategies are introduced to provide an economically meaningful reference for performance assessment. The proposed framework jointly evaluates portfolio efficiency from two complementary perspectives: business performance, measured through return, volatility, and a measure of the trade-off between them, the Sharpe ratio; and computational performance, assessed through solver structure, constraint handling, and hardware execution characteristics. The resulting comparison provides a rigorous basis for understanding the practical role of quantum annealing in constrained portfolio optimization, while clarifying both its modeling advantages and its current implementation limitations relative to established classical approaches.
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 annealing has emerged as a promising computational paradigm for solving large-scale combinatorial optimization problems that are intractable for classical algorithms. Financial portfolio optimization, which involves balancing expected returns against risk under multiple practical constraints, represents one of the most challenging optimization tasks in quantitative finance. Traditional approaches based on mean-variance theory, heuristic meta-optimization, and classical quadratic programming often struggle to scale efficiently as the dimensionality of assets and constraints increases. This study explores the application of quantum annealing techniques to financial portfolio optimization by formulating the problem as a quadratic unconstrained binary optimization model suitable for quantum hardware. The paper provides a systematic mapping of portfolio objectives and constraints into the Ising Hamiltonian framework and analyzes how quantum tunneling and probabilistic state transitions can enhance convergence toward near-global optima. Comparative insights between classical solvers and quantum annealing-based approaches are discussed in terms of solution quality, computational efficiency, and scalability. Furthermore, the study highlights current hardware limitations, embedding challenges, and noise effects that influence optimization performance. The findings indicate that quantum annealing offers substantial potential for accelerating portfolio optimization in high-dimensional financial systems, particularly in scenarios involving complex constraints and dynamic market conditions, thereby establishing a foundation for future quantum-driven financial decision-support systems.
In this work, we introduce a new workflow to solve portfolio optimization problems on annealing platforms. We combine a classical preprocessing step with a modified unconstrained binary optimization (QUBO) model and evaluate it using simulated annealing (classical computer), digital annealing (Fujitsu’s Digital Annealing Unit), and quantum annealing (D-Wave Advantage). Starting from Markowitz’s theory on portfolio optimization, our classical preprocessing step finds the most promising assets within a set of possible assets to choose from. We then modify existing QUBO models for portfolio optimization, such that there are no limitations on the number of assets that can be invested in. Furthermore, our QUBO model enables an investor to also place an arbitrary amount of money into each asset. We apply this modified QUBO to the set of promising asset candidates we generated previously via classical preprocessing. A solution to our QUBO model contains information about what percentage of the whole available capital should be invested into which asset. For the evaluation, we have used publicly available real-world data sets of stocks of the New York Stock Exchange as well as common ETFs. Finally, we have compared the respective annealing results with randomly generated portfolios by using the return, variance, and diversification of the created portfolios as measures. The results show that our QUBO formulation is capable of creating well-diversified portfolios that respect certain criteria given by an investor, such as maximizing return, minimizing risk, or sticking to a certain budget.
Recent advances in quantum hardware offer new approaches to solve various optimization problems that can be computationally expensive when classical algorithms are employed. We propose a hybrid quantum-classical algorithm to solve a dynamic asset allocation problem where a target return and a target risk metric (expected shortfall) are specified. We propose an iterative algorithm that treats the target return as a constraint in a Markowitz portfolio optimization model, and dynamically adjusts the target return to satisfy the targeted expected shortfall. The Markowitz optimization is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem. The use of the expected shortfall risk metric enables the modeling of extreme market events. We compare the results from D-Wave's 2000Q and Advantage quantum annealers using real-world financial data. Both quantum annealers are able to generate portfolios with more than 80% of the return of the classical optimal solutions, while satisfying the expected shortfall. We observe that experiments on assets with higher correlations tend to perform better, which may help to design practical quantum applications in the near term.
ABSTRACT Hybrid quantum‐classical optimization has emerged as a promising direction for addressing financial decision problems under current quantum hardware constraints. In this work we present a practical end‐to‐end portfolio optimization pipeline that combines (i) a continuous mean‐variance and Sharpe‐ratio formulation, (ii) a QUBO/CQM‐based discrete asset selection stage solved using D‐Wave's hybrid quantum annealing solver, (iii) classical convex optimization for computing optimal asset weights, and (iv) a quarterly rebalancing mechanism. Rather than claiming quantum advantage, our goal is to evaluate the feasibility and integration of these components within a deployable financial workflow. We empirically compare our hybrid pipeline against a fund manager in real time and indexes used in Indian stock market. The results indicate that the proposed framework can construct diversified portfolios and achieve competitive returns. We also report computational considerations and scalability observations drawn from the hybrid solver behavior. While the experiments are limited to moderate sized portfolios dictated by current annealing hardware and QUBO embedding constraints, the study illustrates how quantum assisted selection and classical allocation can be combined coherently in a real‐world setting. This work emphasizes methodological reproducibility and practical applicability, and aims to serve as a step toward larger‐scale financial optimization workflows as quantum annealers continue to mature.
This study explores the integration of quantum computing techniques, specifically the Quantum Approximate Optimization Algorithm (QAOA), with classical portfolio optimization frameworks through the Quadratic Unconstrained Binary Optimization (QUBO) approach. Using monthly turnover data from the National Stock Exchange of India (NSE), this paper demonstrates the construction of a QUBO matrix by encoding expected returns and covariance-based risk profiles. Binary asset inclusion constraints are introduced into portfolios and then optimised using both brute force enumeration and quantum inspired solvers. The analysis reveals those combinations including Index Futures and Index Options exhibit superior risk-adjusted performance (Sharpe Ratio≈0.286\approx 0.286≈0.286). The hybrid approach suggests the promise of quantum inspired models as means to improve financial decision making under uncertainty. The results also give a robust template for scalable asset selection models that operate within the constraints of quantum computing infrastructure.