Portfolio Optimisation Using the D-Wave Quantum Annealer

Frank Phillipson*, Harshil Singh Bhatia

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Abstract

The first quantum computers are expected to perform well on quadratic optimisation problems. In this paper a quadratic problem in finance is taken, the Portfolio Optimisation problem. Here, a set of assets is chosen for investment, such that the total risk is minimised, a minimum return is realised and a budget constraint is met. This problem is solved for several instances in two main indices, the Nikkei225 and the S&P500 index, using the state-of-the-art implementation of D-Wave’s quantum annealer and its hybrid solvers. The results are benchmarked against conventional, state-of-the-art, commercially available tooling. Results show that for problems of the size of the used instances, the D-Wave solution, in its current, still limited size, comes already close to the performance of commercial solvers.
Original languageEnglish
Title of host publicationComputational Science – ICCS 2021
Subtitle of host publication21st International Conference, Krakow, Poland, June 16–18, 2021, Proceedings, Part VI
EditorsMaciej Paszynski, Dieter Kranzlmüller, Valeria V. Krzhizhanovskaya, Jack J. Dongarra, Peter M.A. Sloot
PublisherSpringer, Cham
Pages45-59
ISBN (Electronic)978-3-030-77980-1
ISBN (Print)978-3-030-77979-5
DOIs
Publication statusPublished - 2021

Publication series

SeriesLecture Notes in Computer Science
Volume12747
ISSN0302-9743

Keywords

  • quantum portfolio optimisation
  • quadratic unconstrained binary optimisation
  • quantum annealing
  • genetic algorithm

Cite this