Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer

Citations Over TimeTop 1% of 2016 papers

Abstract

We solve a multi-period portfolio optimization problem using D-Wave Systems' quantum annealer. We derive a formulation of the problem, discuss several possible integer encoding schemes, and present numerical examples that show high success rates. The formulation incorporates transaction costs (including permanent and temporary market impact), and, significantly, the solution does not require the inversion of a covariance matrix. The discrete multi-period portfolio optimization problem we solve is significantly harder than the continuous variable problem. We present insight into how results may be improved using suitable software enhancements and why current quantum annealing technology limits the size of problem that can be successfully solved today. The formulation presented is specifically designed to be scalable, with the expectation that as quantum annealing technology improves, larger problems will be solvable using the same techniques.

Related Papers

• → Towards an Optimal Hybrid Algorithm for EV Charging Stations Placement using Quantum Annealing and Genetic Algorithms(2022)8 cited
• → Performance Evaluation of Tsunami Evacuation Route Planning on Multiple Annealing Machines(2023)2 cited
• → Nonadiabatic Quantum Annealing for One-Dimensional Trasverse-Field Ising Model(2013)3 cited
• → Statistical Analysis of Quantum Annealing(2021)