Higher-Order Portfolio Optimization with Quantum Approximate Optimization Algorithm

Abstract

Portfolio optimization is one of the most studied optimization problems at the intersection of quantum computing and finance. In this work, we develop the first quantum formulation for a portfolio optimization problem with higher-order moments, skewness and kurtosis. Including higher-order moments leads to more detailed modeling of portfolio return distributions. Portfolio optimization with higher-order moments has been studied in classical portfolio optimization approaches but with limited exploration within quantum formulations. In the context of quantum optimization, higher-order moments generate higher-order terms in the cost Hamiltonian. Thus, instead of obtaining a quadratic unconstrained binary optimization problem, we obtain a higher-order unconstrained binary optimization (HUBO) problem, which has a natural formulation as a parametrized circuit. Additionally, we employ realistic integer variable encoding and a capital-based budget constraint. We consider the classical continuous variable solution with integer programming-based discretization to be the computationally efficient classical baseline for the problem. Our extensive experimental evaluation of 100 portfolio optimization problems shows that the solutions to the HUBO formulation often correspond to better portfolio allocations than the classical baseline. This is a promising result for those who want to perform computationally challenging portfolio optimization on quantum hardware, as portfolio optimization with higher moments is classically complex. Moreover, the experimental evaluation studies QAOA's performance with higher-order terms in this practically relevant problem.

12 pages, 6 figures, presented at IEEE International Conference on Quantum Computing and Engineering (QCE) 2025

References in corpus (16)

• Ising formulations of many NP problems
• Quantum computing for finance: overview and prospects
• Quantum Computing for Finance: State of the Art and Future Prospects
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• Combinatorial Optimization with Physics-Inspired Graph Neural Networks
• Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
• Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks
• Benchmarking the performance of portfolio optimization with QAOA
• Benchmarking Quantum Annealing Controls with Portfolio Optimization
• Portfolio Optimization with Digitized-Counterdiabatic Quantum Algorithms
• Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
• Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computing
• Testing Option Pricing with the Edgeworth Expansion
• Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
• Bias-field digitized counterdiabatic quantum optimization
• Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms