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:2112.09719 · Physical Review X

Testing Quantum Theory by Generalizing Noncontextuality

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

Published Oct 2, 2023• 12 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/physrevx.13.041001

Related papers

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

Alexander M. Dalzell, B. D. Clader, Grant Salton +8 more

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.

PRX Quantum•Nov 13, 2023•17 citations

Convex Analysis in Quantum Information

Mark Girard

Convexity arises naturally in the study of quantum information. As a result, many useful tools from convex analysis can be used to give important results regarding aspects of quantum information. This thesis builds up methods using core concepts from convex analysis, including convex optimization problems, convex roof constructions, and conic programming, to study mathematical problems related to quantum entanglement. In this thesis, I develop a method for solving convex optimization problems that arise in quantum information theory by analyzing the corresponding converse problem. That is, given an element in a convex set, I determine a family of convex functions that are minimized at this point. This method is used find explicit formulas for the relative entropy of entanglement, as well as other important quantities used to quantify entanglement, and allows one to show important relationships between them. I also construct a practical algorithm that can be used to compute these quantities. This thesis also presents a method to compute convex roofs of arbitrary entanglement measures evaluated on highly symmetric bipartite states. I also establish a framework for completely characterizing quantum resource theories that are convex. For resource theories with a simple mathematical structure, this gives rise to a complete set of resource monotones that can be computed in practice using semidefinite programs. This has applications to the study of entanglement transformations.

•Jan 1, 2017•3 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

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•2 citations

Use Cases of Quantum Optimization for Finance

Samuel Mugel, Enrique Lizaso, Román Orús

arXiv:2010.01312•Studies in systems, decision and control•Jan 1, 2022•12 citations

Quantum Algorithms --- Toward Applications in Economics and Finance

Tatsuru Kikuchi

•Jan 1, 2025•0 citations
Convexity arises naturally in the study of quantum information. As a result, many useful tools from convex analysis can be used to give important results regarding aspects of quantum information. This thesis builds up methods using core concepts from convex analysis, including convex optimization problems, convex roof constructions, and conic programming, to study mathematical problems related to quantum entanglement. In this thesis, I develop a method for solving convex optimization problems that arise in quantum information theory by analyzing the corresponding converse problem. That is, given an element in a convex set, I determine a family of convex functions that are minimized at this point. This method is used find explicit formulas for the relative entropy of entanglement, as well as other important quantities used to quantify entanglement, and allows one to show important relationships between them. I also construct a practical algorithm that can be used to compute these quantities. This thesis also presents a method to compute convex roofs of arbitrary entanglement measures evaluated on highly symmetric bipartite states. I also establish a framework for completely characterizing quantum resource theories that are convex. For resource theories with a simple mathematical structure, this gives rise to a complete set of resource monotones that can be computed in practice using semidefinite programs. This has applications to the study of entanglement transformations.
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.