Quantum Computational Finance: Quantum Algorithm for Portfolio Optimization
Open accessThe DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
We present a quantum algorithm for portfolio optimization. We discuss the market data input of asset prices, the processing of such data via quantum operations, and the output of financially relevant results. Given quantum access to a historical record of asset returns, the algorithm determines the optimal risk-return tradeoff curve and allows one to sample from the optimal portfolio. The algorithm can in principle attain a run time of poly(log(N))\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textrm{poly}(\log (N))$$\end{document}, where N is the number of assets. Direct classical algorithms for determining the risk-return curve and other properties of the optimal portfolio take time poly(N)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textrm{poly}(N)$$\end{document} and we discuss potential quantum speedups in light of efficient classical sampling approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
Self-citationIsing formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
Self-citationQuantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
Quantum principal component analysis
Lloyd, S., Mohseni, M., & Rebentrost, P. (2014) · Nature Physics · doi:10.1038/nphys3029 · Cited by 1,385
Self-citationBuhrman, H., Cleve, R., Watrous, J., & de Wolf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.167902 · Cited by 1,190 · cited 1×
“(14), we can perform a swap test [16, 80] between that density matrix and w ≡ w ( 𝜇 , 𝜉 ) .”
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Childs, A. M., Kothari, R., & Somma, R. D. (2017) · SIAM Journal on Computing · doi:10.1137/16m1087072 · Cited by 646
(2004) · doi:10.1109/focs.2004.53 · Cited by 599
Aaronson, S. (2015) · Nature Physics · doi:10.1038/nphys3272 · Cited by 567
Quantum algorithms for supervised and unsupervised machine learning
Lloyd, S., Mohseni, M., & Rebentrost, P. (2013) · arXiv · doi:10.48550/arxiv.1307.0411 · Cited by 542
Self-citationQuantum Algorithm for Data Fitting
Wiebe, N., Braun, D., & Lloyd, S. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050505 · Cited by 528
Self-citationOn the Relationship Between Continuous- and Discrete-Time Quantum Walk
Childs, A. M. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0930-1 · Cited by 411
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters
Berry, D. W., Childs, A. M., & Kothari, R. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.54 · Cited by 372
A quantum-inspired classical algorithm for recommendation systems
Tang, E. (2019) · Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3313276.3316310 · Cited by 360
Architectures for a quantum random access memory
Giovannetti, V., Lloyd, S., & Maccone, L. (2008) · Physical Review A · doi:10.1103/physreva.78.052310 · Cited by 306
Self-citationReverse quantum annealing approach to portfolio optimization problems
Venturelli, D., & Kondratyev, A. (2019) · Quantum Machine Intelligence · doi:10.1007/s42484-019-00001-w · Cited by 233 · cited 1×
“In the annealing context, portfolio optimization was discussed in [45, 46].”
Quantum Speed-Ups for Solving Semidefinite Programs
Brandao, F. G. S. L., & Svore, K. M. (2017) · 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2017.45 · Cited by 142 · cited 1×
“While exponential speedups are the most compelling, quantum computing can provide polynomial speedups in rather generic settings, for example for search [86], Monte Carlo [29, 87], semi-definite programming [88, 89], and generalized convex optimization [90, 91].”
Tang, E. (2018) · arXiv · doi:10.48550/arxiv.1811.00414 · Cited by 141
Tang, E. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.060503 · Cited by 140
Benchmarking the performance of portfolio optimization with QAOA
Brandhofer, S., Braun, D., Dehn, V., Hellstern, G., Hüls, M., Ji, Y., Polian, I., Bhatia, A. S., & Wellens, T. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03766-5 · Cited by 106 · cited 1×
“[52] discusses sampling and device errors.”
Hamiltonian simulation with optimal sample complexity
Kimmel, S., Lin, C. Y.-Y., Low, G. H., Ozols, M., & Yoder, T. J. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0013-7 · Cited by 85 · cited 2×
“( ) A controlled simulation required for phase estimation can be implemented [20, 21].”
Experimental quantum private queries with linear optics
De Martini, F., Giovannetti, V., Lloyd, S., Maccone, L., Nagali, E., Sansoni, L., & Sciarrino, F. (2009) · Physical Review A · doi:10.1103/physreva.80.010302 · Cited by 81
Self-citationClassical versus quantum models in machine learning: insights from a finance application
Alcazar, J., Leyton-Ortega, V., & Perdomo-Ortiz, A. (2020) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/ab9009 · Cited by 69
Prospects and challenges of quantum finance
Bouland, A., van Dam, W., Joorati, H., Kerenidis, I., & Prakash, A. (2020) · arXiv · doi:10.48550/arxiv.2011.06492 · Cited by 46
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Woerner, S., & Egger, D. J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0130-6 · Cited by 286
Herman, D., Googin, C., Liu, X., Sun, Y., Galda, A., Safro, I., Pistoia, M., & Alexeev, Y. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00603-1 · Cited by 284
Reverse quantum annealing approach to portfolio optimization problems
Venturelli, D., & Kondratyev, A. (2019) · Quantum Machine Intelligence · doi:10.1007/s42484-019-00001-w · Cited by 233
Noisy intermediate-scale quantum (NISQ) algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2021) · arXiv · doi:10.48550/arxiv.2101.08448 · Cited by 166
Metadata
- Authors
- Rebentrost, P., & Lloyd, S.
- Venue
- KI - Künstliche Intelligenz
- Published
- 2024-08-12
- Volume
- 38
- Issue
- 4
- Pages
- 327-338
- ISSN
- 0933-1875 (ISSN-L)
- 1610-1987
- OpenAlex
- W2900045195
- Cited by
- 94
- References
- 26
- FWCI
- 7.89
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.