This paper proposes a CVaR-based quantum portfolio optimization framework designed to address discrete market constraints. Unlike traditional models that often assume continuous asset allocation or normal return distributions, the proposed approach utilizes Conditional Value-at-Risk (CVaR) as the objective function within the hybrid optimization loop of a gate-based Quantum Approximate Optimization Algorithm (QAOA) to better manage extreme tail risk in realistic financial portfolios. We formulate the portfolio selection and discrete constraints as a Knapsack-style Quadratic Unconstrained Binary Optimization (QUBO) model, explicitly incorporating the “one-lot” (1,000 shares) trading convention common in the Taiwan Stock Exchange (TWSE). Experimental results on small-scale TWSE instances indicate that the proposed framework achieves lower CVaR values than standard expectation-based QAOA, albeit with a moderate reduction in expected return. These findings provide preliminary evidence that quantum optimization can support risk-aware portfolio selection under discrete trading constraints.
This paper proposes a CVaR-based quantum portfolio optimization framework designed to address discrete market constraints. Unlike traditional models that often assume continuous asset allocation or normal return distributions, the proposed approach utilizes Conditional Value-at-Risk (CVaR) as the objective function within the hybrid optimization loop of a gate-based Quantum Approximate Optimization Algorithm (QAOA) to better manage extreme tail risk in realistic financial portfolios. We formulate the portfolio selection and discrete constraints as a Knapsack-style Quadratic Unconstrained Binary Optimization (QUBO) model, explicitly incorporating the “one-lot” (1,000 shares) trading convention common in the Taiwan Stock Exchange (TWSE). Experimental results on small-scale TWSE instances indicate that the proposed framework achieves lower CVaR values than standard expectation-based QAOA, albeit with a moderate reduction in expected return. These findings provide preliminary evidence that quantum optimization can support risk-aware portfolio selection under discrete trading constraints.
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.
Quantum finance represents a pivotal and cutting-edge application domain within the burgeoning field of quantum computing. In this work, we propose a two-step quantum approximate optimization algorithm (two-step QAOA) for portfolio optimization and risk assessment. The algorithm initiates by formulating the stock selection problem as a quadratic unconstrained binary optimization (QUBO) problem and employs a classical-quantum hybrid method to find the ground state of the Hamiltonian. We then introduce an energy-based characteristic indicator U∈[0,1), which quantitatively evaluates portfolio performance under customizable investment preferences, effectively capturing the trade-off between expected return and risk. The number of qubits required scales with the number of stocks N in the pool, and the number of Hamiltonian terms is O(N2). Numerical simulations show that the algorithm provides consistent and reasonable assessment results on both training and test datasets under different investment preferences (aggressive or conservative), validating the capability of the characteristic indicator to extract intrinsic information from the portfolios. Additionally, by incorporating warm-starting and digitized counterdiabatic techniques, the algorithm achieves improved scalability and faster convergence. Our work presents a flexible and practical algorithmic framework for applying quantum computing in the financial domain.
This paper presents a hybrid quantum-classical portfolio optimization pipeline that integrates a Quantum Normalizing Flow (QNF) scenario generator with a Quantum Approximate Optimization Algorithm (QAOA) binary asset selector. The objective is to improve discrete stock selection under uncertainty by capturing nonlinear return dependencies with QNF and solving a Quadratic Unconstrained Binary Optimization (QUBO) formulation via QAOA. The methodology is validated on ten large-cap U.S. assets and compared against three classical baselines (Equal Weight, Minimum Variance, Maximum Sharpe), using risk-adjusted metrics (annualized return, volatility, Sharpe ratio) and Monte Carlo statistical testing. Key contributions: 1) A modular QNF-QAOA hybrid optimizer for robust asset selection. 2) A rigorously reproducible evaluation pipeline with quantitative performance and statistical significance analysis. 3) Empirical evidence of competitive riskadjusted returns and conservative drawdown behavior.
Portfolio optimization, a core combinatorial optimization problem in quantitative finance, requires balancing return maximization and risk minimization within discrete asset sets. Classical algorithms often struggle with scalability and local optima traps when handling large-scale asset pools, limiting their practicality in dynamic markets. This study proposes a complete Quantum Approximate Optimization Algorithm (QAOA) workflow for portfolio optimization, from problem formalization to experimental validation. We first transform the portfolio optimization problem into a Quadratic Unconstrained Binary Optimization (QUBO) framework, then design a parameterized QAOA circuit with adjustable layers to balance expressiveness and noise resilience. We propose a methodology using Qiskit for quantum simulation and classical optimizers for parameter tuning, we propose implementing the algorithm on real-world S&P 500 stock data. We could also analyze the impact of quantum hardware noise and propose mitigation strategies, providing actionable insights for Noisy intermediate-scale quantum computing (NISQ)-era implementations. This work bridges quantum algorithm design with real-world financial applications, offering a theoretical framework for quantum-driven portfolio optimization.
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). 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.
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.