Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2211.12489 · PRX Quantum

End-To-End Resource Analysis for Quantum Interior-Point Methods and Portfolio Optimization

Alexander M. Dalzell, B. D. Clader, Grant Salton, Mario Berta, Cedric Yen-Yu Lin, David A. Bader, Nikitas Stamatopoulos, Martin J. A. Schuetz, Fernando G. S. L. Brandão, Helmut G. Katzgraber, William J. Zeng

Published Nov 13, 2023• 30 citations
arXivHTMLPDF

Abstract

A detailed resource analysis of an established quantum algorithm for convex optimization reveals that the practical run times implied by this quantum solution are impractical for problems of interest in finance.
DOI
10.1103/prxquantum.4.040325

Related papers

Testing Quantum Theory by Generalizing Noncontextuality

Markus P. Müller, Andrew J. P. Garner

A detailed resource analysis of an established quantum algorithm for convex optimization reveals that the practical run times implied by this quantum solution are impractical for problems of interest in finance.

arXiv:2112.09719•Physical Review X•Oct 2, 2023•19 citations

Portfolio optimization with discrete simulated annealing

Álvaro Rubio-García, Juan José García‐Ripoll, Diego Porras

Portfolio optimization is an important process in finance that consists in finding the optimal asset allocation that maximizes expected returns while minimizing risk. When assets are allocated in discrete units, this is a combinatorial optimization problem that can be addressed by quantum and quantum-inspired algorithms. In this work we present an integer simulated annealing method to find optimal portfolios in the presence of discretized convex and non-convex cost functions. Our algorithm can deal with large size portfolios with hundreds of assets. We introduce a performance metric, the time to target, based on a lower bound to the cost function obtained with the continuous relaxation of the combinatorial optimization problem. This metric allows us to quantify the time required to achieve a solution with a given quality. We carry out numerical experiments and we benchmark the algorithm in two situations: (i) Monte Carlo instances are started at random, and (ii) the algorithm is warm-started with an initial instance close to the continuous relaxation of the problem. We find that in the case of warm-starting with convex cost functions, the time to target does not grow with the size of the optimization problem, so discretized versions of convex portfolio optimization problems are not hard to solve using classical resources. We have applied our method to the problem of re-balancing in the presence of non-convex transaction costs, and we have found that our algorithm can efficiently minimize those terms.

arXiv:2210.00807•Oct 3, 2022•16 citations

An Empirical Study on the Use of Quantum Computing for Financial Portfolio Optimization

Cláudio Gomes, Gabriel Falcão, Luís Paquete +1 more

SN Computer Science•Jun 15, 2022•2 citations

Quantum Interior Point Methods for Semidefinite Optimization

Brandon Augustino, Giacomo Nannicini, Tamás Terlaky B +1 more

We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem n , but has worse dependence on other numerical parameters.

arXiv:2112.06025•Quantum•Sep 11, 2023•46 citations

Quantum Computational Finance: Quantum Algorithm for Portfolio Optimization

Patrick Rebentrost, Seth Lloyd

arXiv:1811.03975•Künstliche Intell.•Aug 12, 2024•174 citations

Design and Implementation of a Quantum Computing-Based Financial Portfolio Optimization System

Shruti Jose, Arun B Prasad, K Vinaya Laxmi +2 more

•Jan 1, 2025•1 citation
Portfolio optimization is an important process in finance that consists in finding the optimal asset allocation that maximizes expected returns while minimizing risk. When assets are allocated in discrete units, this is a combinatorial optimization problem that can be addressed by quantum and quantum-inspired algorithms. In this work we present an integer simulated annealing method to find optimal portfolios in the presence of discretized convex and non-convex cost functions. Our algorithm can deal with large size portfolios with hundreds of assets. We introduce a performance metric, the time to target, based on a lower bound to the cost function obtained with the continuous relaxation of the combinatorial optimization problem. This metric allows us to quantify the time required to achieve a solution with a given quality. We carry out numerical experiments and we benchmark the algorithm in two situations: (i) Monte Carlo instances are started at random, and (ii) the algorithm is warm-started with an initial instance close to the continuous relaxation of the problem. We find that in the case of warm-starting with convex cost functions, the time to target does not grow with the size of the optimization problem, so discretized versions of convex portfolio optimization problems are not hard to solve using classical resources. We have applied our method to the problem of re-balancing in the presence of non-convex transaction costs, and we have found that our algorithm can efficiently minimize those terms.
We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem n , but has worse dependence on other numerical parameters.