Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer

Gili Rosenberg, Poya Haghnegahdar, Phil Goddard, Peter Carr, Kesheng Wu, Marcos López de Prado

SSRN Electronic Journal · 2015 · 20 citations · 43 references

DOIFull text

Open access

Concepts

TL;DR

The discrete multi‑period portfolio optimization problem is significantly harder than its continuous counterpart, and the authors present a scalable formulation that should enable larger problems as quantum annealing technology improves. The study solves a multi‑period portfolio optimization problem using D‑Wave Systems' quantum annealer. The authors formulate the problem to include transaction costs, avoid covariance matrix inversion, and suggest software enhancements while noting current quantum annealing limits the problem size. They derive a formulation, explore integer encoding schemes, and provide numerical examples demonstrating high success rates.

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.

References

43