The DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
Quantum Computing for Finance: State-of-the-Art and Future Prospects
Open accessAbstract
This article outlines our point of view regarding the applicability, state-of-the-art, and potential of quantum computing for problems in finance. We provide an introduction to quantum computing as well as a survey on problem classes in finance that are computationally challenging classically and for which quantum computing algorithms are promising. In the main part, we describe in detail quantum algorithms for specific applications arising in financial services, such as those involving simulation, optimization, and machine learning problems. In addition, we include demonstrations of quantum algorithms on IBM Quantum back-ends and discuss the potential benefits of quantum algorithms for problems in financial services. We conclude with a summary of technical challenges and future prospects.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
The pricing of options and corporate liabilities
Black, F., & Scholes, M. (1973) · Journal of Political Economy · doi:10.1086/260062 · Cited by 29,074
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Monte Carlo Methods in Financial Engineering
Glasserman, P. (2003) · Stochastic Modelling and Applied Probability · doi:10.1007/978-0-387-21617-1 · Cited by 3,782
Supervised learning with quantum-enhanced feature spaces
Havlíček, V., Córcoles, A. D., Temme, K., Harrow, A. W., Kandala, A., Chow, J. M., & Gambetta, J. M. (2019) · Nature · doi:10.1038/s41586-019-0980-2 · Cited by 2,572
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Quantum Machine Learning in Feature Hilbert Spaces
Schuld, M., & Killoran, N. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.040504 · Cited by 1,840
Quantum 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
Mitarai, K., Negoro, M., Kitagawa, M., & Fujii, K. (2018) · Physical Review A · doi:10.1103/physreva.98.032309 · Cited by 1,639 · cited 1×
“in continuous quantum systems [105] that guarantees linear separability or amplitude encoding [106] that can exploit tensorial feature map or density-operator encoding [107].”
BackgroundQiskit: An Open-source Framework for Quantum Computing
Aleksandrowicz, G., Alexander, T., Barkoutsos, P. K., Bello, L., Ben-Haim, Y., Bucher, D., Cabrera-Hernández, F. J., Carballo-Franquis, J., Chen, A., Chen, C.-F., et al. (2019) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.2562110 · Cited by 1,434
Options: A Monte Carlo approach
Boyle, P. P. (1977) · Journal of Financial Economics · doi:10.1016/0304-405x(77)90005-8 · Cited by 1,336
Cleve, R., Ekert, A., Macchiavello, C., & Mosca, M. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0164 · Cited by 1,299
Benchmarking state-of-the-art classification algorithms for credit scoring: an update of research
Lessmann, S., Baesens, B., Seow, H.-V., & Thomas, L. C. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.05.030 · Cited by 1,284
Circuit-centric quantum classifiers
Schuld, M., Bocharov, A., Svore, K. M., & Wiebe, N. (2020) · Physical Review A · doi:10.1103/physreva.101.032308 · Cited by 1,057
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
Quantum optimization using variational algorithms on near-term quantum devices
Moll, N., Barkoutsos, P., Bishop, L. S., Chow, J. M., Cross, A., Egger, D. J., Filipp, S., Fuhrer, A., Gambetta, J. M., Ganzhorn, M., et al. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab822 · Cited by 744
Self-citationValidating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019) · Physical Review A · doi:10.1103/physreva.100.032328 · Cited by 704
Quantum computing for finance: Overview and prospects
Orús, R., Mugel, S., & Lizaso, E. (2019) · Reviews in Physics · doi:10.1016/j.revip.2019.100028 · Cited by 668
Quantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM · doi:10.1145/502090.502097 · Cited by 639
Survey on categorical data for neural networks
Hancock, J. T., & Khoshgoftaar, T. M. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00305-w · Cited by 611
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Identifying the signs of fraudulent accounts using data mining techniques
Li, S.-H., Yen, D. C., Lu, W.-H., & Wang, C. (2012) · Computers in Human Behavior · doi:10.1016/j.chb.2012.01.002 · Cited by 505
Quantum Generative Adversarial Networks for learning and loading random distributions
Zoufal, C., Lucchi, A., & Woerner, S. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0223-2 · Cited by 480
Self-citationNonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971316 · Cited by 470
Quantum advantage with shallow circuits
Bravyi, S., Gosset, D., & König, R. (2018) · Science · doi:10.1126/science.aar3106 · Cited by 406
Quantum Computing since Democritus
Aaronson, S. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9780511979309 · Cited by 352
A new quantum ripple-carry addition circuit
Cuccaro, S. A., Draper, T. G., Kutin, S. A., & Moulton, D. P. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0410184 · Cited by 344
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
Guerreschi, G. G., & Matsuura, A. Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-43176-9 · Cited by 337
Quantum-state preparation with universal gate decompositions
Plesch, M., & Brukner, Č. (2011) · Physical Review A · doi:10.1103/physreva.83.032302 · Cited by 335
Advances in Optimization and Numerical Analysis
(1994) · Springer eBooks · doi:10.1007/978-94-015-8330-5 · Cited by 324
Importance Sampling for Portfolio Credit Risk
Glasserman, P., & Li, J. (2005) · Management Science · doi:10.1287/mnsc.1050.0415 · Cited by 322
Woerner, S., & Egger, D. J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0130-6 · Cited by 286
Self-citationQuantum computational finance: Monte Carlo pricing of financial derivatives
Rebentrost, P., Gupt, B., & Bromley, T. R. (2018) · Physical Review A · doi:10.1103/physreva.98.022321 · Cited by 265
Improving Variational Quantum Optimization using CVaR
Barkoutsos, P. K., Nannicini, G., Robert, A., Tavernelli, I., & Woerner, S. (2020) · Quantum · doi:10.22331/q-2020-04-20-256 · Cited by 263
Self-citationQuasi-Monte Carlo Methods in Numerical Finance
Joy, C., Boyle, P. P., & Tan, K. S. (1996) · Management Science · doi:10.1287/mnsc.42.6.926 · Cited by 243
Amplitude estimation without phase estimation
Suzuki, Y., Uno, S., Raymond, R., Tanaka, T., Onodera, T., & Yamamoto, N. (2020) · Quantum Information Processing · doi:10.1007/s11128-019-2565-2 · Cited by 241
Self-citationOption Pricing using Quantum Computers
Stamatopoulos, N., Egger, D. J., Sun, Y., Zoufal, C., Iten, R., Shen, N., & Woerner, S. (2020) · Quantum · doi:10.22331/q-2020-07-06-291 · Cited by 226
Self-citationQuantum SDP-Solvers: Better upper and lower bounds
van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2020) · Quantum · doi:10.22331/q-2020-02-14-230 · Cited by 225
Quantum embeddings for machine learning
Lloyd, S., Schuld, M., Ijaz, A., Izaac, J., & Killoran, N. (2020) · arXiv · doi:10.48550/arxiv.2001.03622 · Cited by 198 · cited 1×
“A recent paper studies the embedding in the context of metric learning [108].”
BackgroundOverview and Comparison of Gate Level Quantum Software Platforms
LaRose, R. (2019) · Quantum · doi:10.22331/q-2019-03-25-130 · Cited by 179
Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem
Crooks, G. E. (2018) · arXiv · doi:10.48550/arxiv.1811.08419 · Cited by 158
Quantum Approximate Counting, Simplified
Aaronson, S., & Rall, P. (2019) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976014.5 · Cited by 155
Grover Adaptive Search for Constrained Polynomial Binary Optimization
Gilliam, A., Woerner, S., & Gonciulea, C. (2021) · Quantum · doi:10.22331/q-2021-04-08-428 · Cited by 153
Self-citationReachability Deficits in Quantum Approximate Optimization
Akshay, V., Philathong, H., Morales, M. E. S., & Biamonte, J. D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090504 · Cited by 151 · cited 1×
“The probability to sample near-optimal states with QAOA are lower than for VQE (see Table 3), which may indicate that deeper QAOA variational forms are needed [90] or that the COBYLA optimizer we used was trapped in a local minimum [68], [91].”
BackgroundDense quantum coding and a lower bound for 1-way quantum automata
Ambainis, A., Nayak, A., Ta‐Shma, A., & Vazirani, U. V. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301347 · Cited by 149
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 3×
“As for quantum algorithms, the early papers of [46] and [48] and [49] quantized the so-called multiplicative-weight-update (MWU) algorithm of Arora and Kale and variants where P is linear in n in general [49] ˜ O (( √ mns ( PD /(cid:15) ) 4 ) where P is linear in n in general, and…”
BackgroundMethodInfluentialOn Learning Linear Functions from Subset and Its Applications in Quantum ComputingPreprint
Brandão, F. G. S. L., Kalev, A., Li, T., Lin, C. Y.-Y., Svore, K. M., & Wu, X. (2017) · arXiv (Cornell University) · doi:10.4230/lipics.esa.2018.66 · Cited by 140
Performance of hybrid quantum-classical variational heuristics for combinatorial optimization
Nannicini, G. (2019) · Physical Review E · doi:10.1103/physreve.99.013304 · Cited by 138 · cited 4×
“First, we will look at quadratic unconstrained binary optimization (QUBO), whereVQE/QAOAheuristic approaches have been advocated on noisy quantum devices [12], [24].”
BackgroundMethodInfluentialOptimal control, geometry, and quantum computing
Nielsen, M. A., Dowling, M. R., Gu, M., & Doherty, A. C. (2006) · Physical Review A · doi:10.1103/physreva.73.062323 · Cited by 136
Improvements in Quantum SDP-Solving with ApplicationsPreprint
van Apeldoorn, J., & Gilyén, A. (2018) · arXiv (Cornell University) · doi:10.4230/lipics.icalp.2019.99 · Cited by 125
A Quantum Interior Point Method for LPs and SDPs
Kerenidis, I., & Prakash, A. (2020) · ACM Transactions on Quantum Computing · doi:10.1145/3406306 · Cited by 115
Multistart Methods for Quantum Approximate optimization
Shaydulin, R., Safro, I., & Larson, J. (2019) · 2019 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec.2019.8916288 · Cited by 110
A logarithmic-depth quantum carry-lookahead adder
Draper, T. G., Kutin, S. A., Rains, E. M., & Svore, K. M. (2006) · Quantum Information and Computation · doi:10.26421/qic6.4-5-4 · Cited by 101
Variational Quantum Boltzmann Machines
Zoufal, C., Lucchi, A., & Woerner, S. (2020) · arXiv · doi:10.48550/arxiv.2006.06004 · Cited by 99
Self-citationQuantum Algorithms for Fixed Qubit Architectures
Farhi, E., Goldstone, J., Gutmann, S., & Neven, H. (2017) · arXiv · doi:10.48550/arxiv.1703.06199 · Cited by 93
Brandao, F. G. S. L., Broughton, M., Farhi, E., Gutmann, S., & Neven, H. (2018) · arXiv · doi:10.48550/arxiv.1812.04170 · Cited by 88
Convex optimization using quantum oracles
van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2020) · Quantum · doi:10.22331/q-2020-01-13-220 · Cited by 75
Experimental realization of 105-qubit random access quantum memory
Jiang, N., Pu, Y.-F., Chang, W., Li, C., Zhang, S., & Duan, L.-M. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0144-0 · Cited by 72
Optimization Methods in Finance
Cornuéjols, G., Peña, J., & Tütüncü, R. H. (2018) · Cambridge University Press eBooks · doi:10.1017/9781107297340 · Cited by 70
Low overhead quantum computation using lattice surgery
Fowler, A. G., & Gidney, C. (2018) · arXiv · doi:10.48550/arxiv.1808.06709 · Cited by 69
Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
Gambella, C., & Simonetto, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3033139 · Cited by 60
Self-citationEvaluating Quantum Approximate Optimization Algorithm: A Case Study
Shaydulin, R., & Alexeev, Y. (2019) · 2019 Tenth International Green and Sustainable Computing Conference (IGSC) · doi:10.1109/igsc48788.2019.8957201 · Cited by 55
Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
Braine, L., Egger, D. J., Glick, J., & Woerner, S. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3063635 · Cited by 51
Self-citationUnified theory of augmented Lagrangian methods for constrained global optimization
Wang, C., & Li, D. (2008) · Journal of Global Optimization · doi:10.1007/s10898-008-9347-1 · Cited by 36
REGULATORY CAPITAL MODELING FOR CREDIT RISK
Rutkowski, M., & TARCA, S. (2015) · International Journal of Theoretical and Applied Finance · doi:10.1142/s021902491550034x · Cited by 26
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
The potential and global outlook of integrated photonics for quantum technologies
Pelucchi, E., Fagas, G., Aharonovich, I., Englund, D., Figueroa, E., Gong, Q., Hannes, H., Liu, J., Lu, C.-Y., Matsuda, N., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00398-z · Cited by 533
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
Warm-starting quantum optimization
Egger, D. J., Mareček, J., & Woerner, S. (2021) · Quantum · doi:10.22331/q-2021-06-17-479 · Cited by 269
Self-citationQuantum computing for healthcare: a review
Ur Rasool, R., Ahmad, H. F., Rafique, W., Qayyum, A., Qadir, J., & Anwar, Z. (2023) · Future Internet · doi:10.3390/fi15030094 · Cited by 242
Metadata
- Authors
- Egger, D. J., Gambella, C., Marecek, J., McFaddin, S., Mevissen, M., Raymond, R., Simonetto, A., Woerner, S., & Yndurain, E.
- Venue
- IEEE Transactions on Quantum Engineering
- Published
- 2020
- Volume
- 1
- Pages
- 1-24
- ISSN
- 2689-1808 (ISSN-L)
- OpenAlex
- W3037022125
- Cited by
- 366
- References
- 70
- FWCI
- 11.08
- Type
- journal article
- Language
- en
- Open access
- gold
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.