Quantum computational finance: quantum algorithm for portfolio optimization

Abstract

We present a quantum algorithm for portfolio optimization. We discuss the market data input, the processing of such data via quantum operations, and the output of financially relevant results. Given quantum access to the historical record of returns, the algorithm determines the optimal risk-return tradeoff curve and allows one to sample from the optimal portfolio. The algorithm can in principle attain a run time of $\mathrm{poly}(\log (N))$, where $N$ is the size of the historical return dataset. Direct classical algorithms for determining the risk-return curve and other properties of the optimal portfolio take time $\mathrm{poly}(N)$ and we discuss potential quantum speedups in light of the recent works on efficient classical sampling approaches.

arXiv comment18 pages

Cited by in corpus (13)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computing for finance
• Grover Adaptive Search for Constrained Polynomial Binary Optimization
• Quantum-inspired algorithms in practice
• Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
• Simulating realistic non-Gaussian state preparation
• Quantum classification of the MNIST dataset with Slow Feature Analysis
• Quantum unary approach to option pricing
• Quantum Monte Carlo Integration: The Full Advantage in Minimal Circuit Depth
• Hybrid quantum-classical optimization for financial index tracking
• The Problem with Grover-Rudolph State Preparation for Quantum Monte-Carlo
• The role of entanglement for enhancing the efficiency of quantum kernels towards classification
• Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing