Quantifying the advantages of applying quantum approximate algorithms to portfolio optimisation

Abstract:We present a quantum algorithm for portfolio optimisation. Specifically, We present san end-to-end quantum approximate optimisation algorithm to solve the discrete global minimum variance portfolio model. This model finds a portfolio of risky assets with the lowest possible risk contingent on the number of traded assets being discrete. We provide a complete pipeline for this model and analyse its viability for noisy intermediate-scale quantum computers. We design initial states, a cost operator, and ansätze within a binary encoding. Further, we perform numerical simulations to analyse several optimisation routines, including layerwise optimisation, utilising constrained optimisation by linear approximation and dual annealing. Finally, we consider the impacts of thermal relaxation and stochastic measurement noise. We find dual annealing with a layerwise optimisation routine provides the most robust performance. We observe that realistic thermal relaxation noise levels preclude quantum advantage. However, stochastic measurement noise will dominate when hardware sufficiently improves. Within this regime, we numerically demonstrate a favourable scaling in the number of shots required to obtain the global minimum -- an indication of quantum advantage in portfolio optimisation.

arXiv:2410.16265 [quant-ph]

(or arXiv:2410.16265v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2410.16265 Focus to learn more arXiv-issued DOI via DataCite

Quantum Sci. Technol. 11 (2026) 025034

https://doi.org/10.1088/2058-9565/ae4a48 Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.