{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T05:17:11Z","timestamp":1775193431521,"version":"3.50.1"},"reference-count":28,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>We introduce a quantum algorithm to compute the market risk of financial derivatives. Previous work has shown that quantum amplitude estimation can accelerate derivative pricing quadratically in the target error and we extend this to a quadratic error scaling advantage in market risk computation. We show that employing quantum gradient estimation algorithms can deliver a further quadratic advantage in the number of the associated market sensitivities, usually called <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>g<\/mml:mi><mml:mi>r<\/mml:mi><mml:mi>e<\/mml:mi><mml:mi>e<\/mml:mi><mml:mi>k<\/mml:mi><mml:mi>s<\/mml:mi><\/mml:math>. By numerically simulating the quantum gradient estimation algorithms on financial derivatives of practical interest, we demonstrate that not only can we successfully estimate the greeks in the examples studied, but that the resource requirements can be significantly lower in practice than what is expected by theoretical complexity bounds. This additional advantage in the computation of financial market risk lowers the estimated logical clock rate required for financial quantum advantage from Chakrabarti et al. [Quantum 5, 463 (2021)] by a factor of ~7, from 50MHz to 7MHz, even for a modest number of greeks by industry standards (four). Moreover, we show that if we have access to enough resources, the quantum algorithm can be parallelized across 60 QPUs, in which case the logical clock rate of each device required to achieve the same overall runtime as the serial execution would be ~100kHz. Throughout this work, we summarize and compare several different combinations of quantum and classical approaches that could be used for computing the market risk of financial derivatives.<\/jats:p>","DOI":"10.22331\/q-2022-07-20-770","type":"journal-article","created":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T16:48:58Z","timestamp":1658335738000},"page":"770","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":31,"title":["Towards Quantum Advantage in Financial Market Risk using Quantum Gradient Algorithms"],"prefix":"10.22331","volume":"6","author":[{"given":"Nikitas","family":"Stamatopoulos","sequence":"first","affiliation":[{"name":"Goldman, Sachs & Co., New York, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guglielmo","family":"Mazzola","sequence":"additional","affiliation":[{"name":"IBM Quantum, IBM Research \u2013 Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woerner","sequence":"additional","affiliation":[{"name":"IBM Quantum, IBM Research \u2013 Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William J.","family":"Zeng","sequence":"additional","affiliation":[{"name":"Goldman, Sachs & Co., New York, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9598","published-online":{"date-parts":[[2022,7,20]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"P. Rebentrost, B. Gupt, and T. R. Bromley, ``Quantum computational finance: Monte carlo pricing of financial derivatives,&apos;&apos; Phys. Rev. A 98, 022321 (2018).","DOI":"10.1103\/PhysRevA.98.022321"},{"key":"1","doi-asserted-by":"publisher","unstructured":"S. Woerner and D. J. Egger, ``Quantum risk analysis,&apos;&apos; npj Quantum Information 5 (2019), 10.1038\/s41534-019-0130-6.","DOI":"10.1038\/s41534-019-0130-6"},{"key":"2","doi-asserted-by":"publisher","unstructured":"D. J. Egger, R. G. Gutierrez, J. C. Mestre, and S. Woerner, ``Credit risk analysis using quantum computers,&apos;&apos; IEEE Transactions on Computers (2020), 10.1109\/TC.2020.3038063.","DOI":"10.1109\/TC.2020.3038063"},{"key":"3","doi-asserted-by":"publisher","unstructured":"N. Stamatopoulos, D. J. Egger, Y. Sun, C. Zoufal, R. Iten, N. Shen, and S. Woerner, ``Option pricing using quantum computers,&apos;&apos; Quantum 4, 291 (2020).","DOI":"10.22331\/q-2020-07-06-291"},{"key":"4","doi-asserted-by":"publisher","unstructured":"S. Chakrabarti, R. Krishnakumar, G. Mazzola, N. Stamatopoulos, S. Woerner, and W. J. Zeng, ``A threshold for quantum advantage in derivative pricing,&apos;&apos; Quantum 5, 463 (2021).","DOI":"10.22331\/q-2021-06-01-463"},{"key":"5","doi-asserted-by":"publisher","unstructured":"A. Montanaro, ``Quantum speedup of monte carlo methods,&apos;&apos; Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences 471 (2015), 10.1098\/rspa.2015.0301.","DOI":"10.1098\/rspa.2015.0301"},{"key":"6","doi-asserted-by":"publisher","unstructured":"J. Hull, Options, futures, and other derivatives, 6th ed. (Pearson Prentice Hall, Upper Saddle River, NJ [u.a.], 2006).","DOI":"10.1007\/978-1-4419-9230-7_2"},{"key":"7","doi-asserted-by":"publisher","unstructured":"A. Gily\u00e9n, S. Arunachalam, and N. Wiebe, ``Optimizing quantum optimization algorithms via faster quantum gradient computation,&apos;&apos; Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , 1425\u20131444 (2019).","DOI":"10.1137\/1.9781611975482.87"},{"key":"8","doi-asserted-by":"publisher","unstructured":"S. P. Jordan, ``Fast quantum algorithm for numerical gradient estimation,&apos;&apos; Physical Review Letters 95 (2005), 10.1103\/physrevlett.95.050501.","DOI":"10.1103\/physrevlett.95.050501"},{"key":"9","doi-asserted-by":"publisher","unstructured":"S. Chakrabarti, A. M. Childs, T. Li, and X. Wu, ``Quantum algorithms and lower bounds for convex optimization,&apos;&apos; Quantum 4, 221 (2020).","DOI":"10.22331\/q-2020-01-13-221"},{"key":"10","doi-asserted-by":"publisher","unstructured":"G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, ``Quantum Amplitude Amplification and Estimation,&apos;&apos; Contemporary Mathematics 305 (2002), 10.1090\/conm\/305\/05215.","DOI":"10.1090\/conm\/305\/05215"},{"key":"11","doi-asserted-by":"publisher","unstructured":"P. Glasserman and D. Yao, ``Some guidelines and guarantees for common random numbers,&apos;&apos; Management Science 38, 884 (1992).","DOI":"10.1287\/mnsc.38.6.884"},{"key":"12","doi-asserted-by":"publisher","unstructured":"B. Fornberg, ``Generation of finite difference formulas on arbitrarily spaced grids,&apos;&apos; Mathematics of Computation 51, 699 (1988).","DOI":"10.1090\/S0025-5718-1988-0935077-0"},{"key":"13","doi-asserted-by":"publisher","unstructured":"M. Gevrey, ``Sur la nature analytique des solutions des \u00e9quations aux d\u00e9riv\u00e9es partielles. premier m\u00e9moire,&apos;&apos; Annales scientifiques de l&apos;\u00c9cole Normale Sup\u00e9rieure 3e s\u00e9rie, 35, 129 (1918).","DOI":"10.24033\/asens.706"},{"key":"14","doi-asserted-by":"publisher","unstructured":"G. H. Low and I. L. Chuang, ``Hamiltonian simulation by qubitization,&apos;&apos; Quantum 3, 163 (2019).","DOI":"10.22331\/q-2019-07-12-163"},{"key":"15","doi-asserted-by":"publisher","unstructured":"A. Gily\u00e9n, Y. Su, G. H. Low, and N. Wiebe, ``Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics,&apos;&apos; in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (2019) pp. 193\u2013204.","DOI":"10.1145\/3313276.3316366"},{"key":"16","doi-asserted-by":"publisher","unstructured":"J. M. Martyn, Y. Liu, Z. E. Chin, and I. L. Chuang, ``Efficient fully-coherent hamiltonian simulation,&apos;&apos; (2021), 10.48550\/arXiv.2110.11327.","DOI":"10.48550\/arXiv.2110.11327"},{"key":"17","doi-asserted-by":"publisher","unstructured":"F. Black and M. Scholes, ``The pricing of options and corporate liabilities,&apos;&apos; Journal of Political Economy 81, 637 (1973).","DOI":"10.1086\/260062"},{"key":"18","doi-asserted-by":"publisher","unstructured":"Y. Suzuki, S. Uno, R. Raymond, T. Tanaka, T. Onodera, and N. Yamamoto, ``Amplitude estimation without phase estimation,&apos;&apos; Quantum Information Processing 19, 75 (2020).","DOI":"10.1007\/s11128-019-2565-2"},{"key":"19","doi-asserted-by":"publisher","unstructured":"T. Tanaka, Y. Suzuki, S. Uno, R. Raymond, T. Onodera, and N. Yamamoto, ``Amplitude estimation via maximum likelihood on noisy quantum computer,&apos;&apos; Quantum Information Processing 20, 293 (2021).","DOI":"10.1007\/s11128-021-03215-9"},{"key":"20","doi-asserted-by":"publisher","unstructured":"D. Grinko, J. Gacon, C. Zoufal, and S. Woerner, ``Iterative quantum amplitude estimation,&apos;&apos; npj Quantum Information 7 (2021), 10.1038\/s41534-021-00379-1.","DOI":"10.1038\/s41534-021-00379-1"},{"key":"21","doi-asserted-by":"publisher","unstructured":"K.-R. Koch, Parameter Estimation and Hypothesis Testing in Linear Models (Springer-Verlag Berlin Heidelberg, 1999).","DOI":"10.1007\/978-3-662-03976-2"},{"key":"22","doi-asserted-by":"publisher","unstructured":"A. G. Fowler and C. Gidney, ``Low overhead quantum computation using lattice surgery,&apos;&apos; (2019), 10.48550\/arXiv.1808.06709.","DOI":"10.48550\/arXiv.1808.06709"},{"key":"23","doi-asserted-by":"publisher","unstructured":"C. Homescu, ``Adjoints and automatic (algorithmic) differentiation in computational finance,&apos;&apos; Risk Management eJournal (2011), 10.2139\/ssrn.1828503.","DOI":"10.2139\/ssrn.1828503"},{"key":"24","doi-asserted-by":"publisher","unstructured":"G. Pages, O. Pironneau, and G. Sall, ``Vibrato and automatic differentiation for high order derivatives and sensitivities of financial options,&apos;&apos; Journal of Computational Finance 22 (2016), 10.21314\/JCF.2018.350.","DOI":"10.21314\/JCF.2018.350"},{"key":"25","doi-asserted-by":"publisher","unstructured":"L. Capriotti, ``Fast greeks by algorithmic differentiation,&apos;&apos; J. Comput. Financ. 14 (2010), 10.2139\/ssrn.1619626.","DOI":"10.2139\/ssrn.1619626"},{"key":"26","doi-asserted-by":"publisher","unstructured":"L. Capriotti and M. Giles, ``Fast correlation greeks by adjoint algorithmic differentiation,&apos;&apos; ERN: Simulation Methods (Topic) (2010), 10.2139\/ssrn.1587822.","DOI":"10.2139\/ssrn.1587822"},{"key":"27","doi-asserted-by":"publisher","unstructured":"C. H. Bennett, ``Logical reversibility of computation,&apos;&apos; IBM Journal of Research and Development 17 (1973), 10.1147\/rd.176.0525.","DOI":"10.1147\/rd.176.0525"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2022-07-20-770\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T16:49:03Z","timestamp":1658335743000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2022-07-20-770\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":28,"URL":"https:\/\/doi.org\/10.22331\/q-2022-07-20-770","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,20]]},"article-number":"770"}}