arxiv: 2604.08180 · v1 · submitted 2026-04-09 · 💱 q-fin.CP

Recognition: no theorem link

Quantum Computing for Financial Transformation: A Review of Optimisation, Pricing, Risk, Machine Learning, and Post-Quantum Security

Akash Sedai, Francesca Medda, Hui Gong, Thomas Schroeder

Authors on Pith no claims yet

Pith reviewed 2026-05-10 17:40 UTC · model grok-4.3

classification 💱 q-fin.CP

keywords quantum computingportfolio optimisationderivative pricingrisk estimationquantum machine learningpost-quantum cryptographyhybrid algorithmscombinatorial search

0 comments

The pith

The strongest near-term case for quantum finance lies in carefully designed hybrid workflows rather than blanket claims of universal advantage.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This review maps five financial domains—constrained portfolio optimisation, derivative pricing, tail-risk estimation, quantum machine learning, and post-quantum security—onto a shared computational stack. For each domain it isolates the core bottleneck, names the matching quantum primitive, runs an explicit comparison against a classical baseline, and checks the outcome against hardware noise, scalability, and governance limits. The measured conclusion is that hybrid classical-quantum pipelines deliver credible gains precisely where the problem is dominated by combinatorial search or repeated expectation estimation, while broader superiority claims do not yet hold. A reader cares because these bottlenecks already dominate large-scale trading, risk, and compliance systems, so even partial speed-ups or security upgrades translate directly into operational and regulatory value.

Core claim

The paper establishes that quantum computing enters finance most effectively through hybrid workflows that pair classical solvers with targeted quantum subroutines. Quantum optimisation is credible when the task reduces to constrained combinatorial search; amplitude estimation becomes relevant when the dominant cost is repeated Monte-Carlo-style expectation calculations; quantum machine learning remains task-specific; and post-quantum cryptographic migration is already required to protect long-horizon financial infrastructure. The argument is built by applying one consistent evaluative sequence—bottleneck identification, primitive selection, classical benchmark, and realistic-constraint test

What carries the argument

The common evaluative logic applied across all five domains: identify the financial bottleneck, specify the relevant quantum primitive, compare it with an explicit classical benchmark, and assess the result under realistic implementation and governance constraints.

If this is right

Quantum optimisation is most credible when constrained combinatorial search is the dominant cost.
Amplitude-estimation routines matter most when repeated expectation evaluation drives the computational budget.
Quantum machine learning gains stay task-dependent rather than universal.
Post-quantum cryptography migration is already strategically necessary because financial systems must be upgraded before fault-tolerant attacks become feasible.
Small-scale reproducible simulations on simulated qubit registers can serve as practical entry points for institutions beginning hybrid experimentation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same bottleneck-to-primitive mapping could be tested in adjacent domains such as supply-chain scheduling or energy-grid dispatch where combinatorial constraints also dominate.
Institutions may need separate roadmaps: one for immediate post-quantum cryptographic upgrades and another for gradual insertion of optimisation or pricing hybrids as hardware improves.
The review's emphasis on governance constraints suggests that regulatory stress tests could become a useful falsification arena for hybrid claims.
If hybrid workflows prove stable, the next natural extension is to embed them inside live trading or risk engines rather than offline batch calculations.

Load-bearing premise

Financial bottlenecks can be cleanly mapped onto specific quantum primitives and the stated classical benchmarks remain fair once hardware noise, error correction overhead, and regulatory constraints are included.

What would settle it

A controlled experiment on a realistic-sized portfolio-optimisation instance that shows a hybrid quantum-classical solver failing to beat the best classical solver once realistic qubit noise and gate-error rates are modelled would falsify the near-term hybrid-advantage claim.

Figures

Figures reproduced from arXiv: 2604.08180 by Akash Sedai, Francesca Medda, Hui Gong, Thomas Schroeder.

**Figure 1.1.** Figure 1.1: provides a visual summary of the local benchmark. 0.16 0.18 0.20 0.22 0.24 0.26 0.28 0.30 Annualised volatility 0.15 0.20 0.25 0.30 0.35 Annualised return Feasible portfolios in risk-return space Classical exact optimum QAOA solution 0.0 2.5 5.0 7.5 10.0 12.5 15.0 17.5 20.0 Portfolio rank 0 1 2 3 4 5 Objective value Objective ranking across all feasible portfolios Classical optimum rank QAOA rank 1.5 2.0… view at source ↗

**Figure 2.1.** Figure 2.1: Asian option pricing via QAE (hybrid pipeline). 41 [PITH_FULL_IMAGE:figures/full_fig_p041_2_1.png] view at source ↗

**Figure 2.2.** Figure 2.2: Hybrid quantum–classical QAE pipeline for derivative pricing. Classical precomputation provides a discretised histogram of average prices S¯, which is encoded as quantum amplitudes for amplitude estimation and iterative inference. Workflow interpretation [PITH_FULL_IMAGE:figures/full_fig_p044_2_2.png] view at source ↗

**Figure 3.1.** Figure 3.1: Hybrid workflow combining classical risk engines with quantum scenario-refinement modules. The staged split clarifies that quantum resources are reserved for the tail-focused estimation block rather than for the full end-to-end risk engine. challenging tail regions, institutions can obtain meaningful performance improvements without requiring full-scale fault-tolerant hardware. • Reduced depth and hardwa… view at source ↗

**Figure 3.2.** Figure 3.2: Empirical loss distribution of the single-asset portfolio with historical and quantum-inspired VaR/CVaR thresholds. 73 [PITH_FULL_IMAGE:figures/full_fig_p073_3_2.png] view at source ↗

**Figure 3.3.** Figure 3.3: Multi-asset portfolio loss distribution with historical, normal, and quantum-inspired (PCA-based) VaR/CVaR estimates. the part of the distribution that drives supervisory interpretation. That is the relevant signal for the review: the quantum-inspired correlated representation does not need to reproduce every central histogram bar perfectly in order to preserve the tail ranking used for risk management d… view at source ↗

read the original abstract

Quantum computing is becoming strategically relevant to finance because several core financial bottlenecks are already defined by combinatorial search, expectation estimation, rare-event analysis, representation learning, and long-horizon cryptographic resilience. This review examines that landscape across five connected domains: constrained portfolio optimisation, derivative pricing, tail-risk and scenario estimation, quantum machine learning, and post-quantum security. Rather than treating these topics as isolated demonstrations, the article studies them as linked layers of a financial-computation stack. Across all five domains, the review applies a common evaluative logic: identify the financial bottleneck, specify the relevant quantum primitive, compare it with an explicit classical benchmark, and assess the result under realistic implementation and governance constraints. The main conclusion is measured but consequential. The strongest near-term case for quantum finance lies in carefully designed hybrid workflows rather than blanket claims of universal advantage. Quantum optimisation is most credible when constrained search dominates; amplitude-estimation methods matter most when repeated expectation evaluation is the binding cost; quantum machine learning remains task dependent; and post-quantum cryptography is already strategically necessary because financial infrastructures must migrate before fault-tolerant attacks arrive. By combining system-level synthesis with locally reproducible small-scale case studies on simulated qubit registers, the article is intended both as a review of the field and as a handbook-style entry point for future work.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This review organizes quantum finance around one evaluation template and lands on a measured hybrid-workflow conclusion, but it introduces no new results.

read the letter

The paper's main contribution is pulling five domains—portfolio optimization, derivative pricing, risk estimation, quantum ML, and post-quantum security—into a single stack and running the same four-step check on each: name the financial bottleneck, pick the quantum primitive, compare it to a classical benchmark, and flag real constraints. That structure makes the connections visible and keeps the claims local rather than universal. The small simulated case studies give readers something concrete to look at even though they stay on ideal qubits. The conclusion stays proportionate: quantum looks useful only where the problem actually matches the primitive and the classical alternative is expensive enough to justify the overhead. That caution is the part that feels useful right now. The post-quantum security section is especially direct about migration timelines that financial systems already face. On the downside, everything rests on existing literature. No new derivations or larger-scale runs appear, so any weaknesses in the cited benchmarks or missing noise models travel straight through. The simulations are too small to test scaling or decoherence in a way that would change allocation decisions. The paper is aimed at two groups: practitioners who need a map before deciding where to spend resources, and researchers who want a consistent way to evaluate new claims. A reader already deep in one subfield will mostly skim the sections outside their area. It deserves a serious referee because the synthesis is coherent, the evaluative logic is applied evenly, and the central claim does not overreach the evidence supplied. A review journal or a methods-oriented finance venue could use it as a reference point. I would send it out for review with the expectation that referees will press on hardware realism and citation freshness, but the core framing holds up.

Referee Report

0 major / 4 minor

Summary. The manuscript is a review examining quantum computing applications in finance across five domains: constrained portfolio optimisation, derivative pricing, tail-risk and scenario estimation, quantum machine learning, and post-quantum security. It treats these as linked layers of a financial-computation stack and applies a uniform evaluative logic to each domain: identify the financial bottleneck, specify the relevant quantum primitive, compare against an explicit classical benchmark, and assess under realistic implementation and governance constraints. The central conclusion is that the strongest near-term case for quantum finance lies in carefully designed hybrid workflows rather than blanket claims of universal advantage, supported by small-scale simulated case studies on simulated qubit registers.

Significance. If the synthesis holds, the paper is significant for providing a structured, system-level assessment that links domains and prioritizes hybrid approaches with explicit classical comparisons and constraint evaluations. It earns credit for including locally reproducible small-scale case studies and for its measured tone that avoids universal speedup claims. This positions the work as both a field review and a handbook-style entry point, which is useful given the field's tendency toward over-optimism.

minor comments (4)

The abstract and introduction reference 'locally reproducible small-scale case studies on simulated qubit registers,' but the manuscript should add explicit details on qubit counts, noise models, and simulation software in each domain's case-study subsection to strengthen reproducibility claims.
In the sections on derivative pricing and risk estimation, the classical benchmarks are described as 'explicit,' but the manuscript would benefit from a consolidated table comparing runtime, accuracy, and resource metrics across quantum and classical methods for direct reader comparison.
The post-quantum security section discusses migration timelines but could clarify the mapping from financial infrastructure constraints to specific NIST post-quantum standards with a brief timeline table.
Notation for quantum primitives (e.g., amplitude estimation, QAOA) is generally clear, but a short glossary or consistent acronym list at the end would aid readers from finance backgrounds.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and constructive review of our manuscript. We appreciate the recognition of the paper's system-level synthesis across the five domains, its emphasis on hybrid workflows with explicit classical benchmarks, and the measured tone that avoids over-optimistic claims. The recommendation for minor revision is noted, and we are pleased that the work is viewed as both a field review and a practical entry point. Since the report lists no specific major comments, we have no point-by-point responses to provide at this stage.

Circularity Check

0 steps flagged

No significant circularity: review synthesizes external sources without self-referential derivations

full rationale

This is a review paper that applies a consistent evaluative logic (identify bottleneck, map to quantum primitive, compare to classical benchmark, assess constraints) across domains but presents no original equations, predictions, or fitted parameters. The central conclusion favoring hybrid workflows is a measured synthesis drawn from cited external literature rather than any reduction to the paper's own inputs or self-citations. No load-bearing steps reduce by construction to definitions or prior author work within the manuscript.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The review rests on the domain assumption that quantum primitives map usefully to financial bottlenecks and that classical benchmarks can be stated explicitly. No free parameters are fitted, no new entities are postulated, and no ad-hoc axioms beyond standard quantum computing and finance literature are introduced.

axioms (1)

domain assumption Core financial bottlenecks are defined by combinatorial search, expectation estimation, rare-event analysis, representation learning, and cryptographic resilience.
Invoked in the opening paragraph to justify the five-domain structure.

pith-pipeline@v0.9.0 · 5545 in / 1235 out tokens · 101359 ms · 2026-05-10T17:40:18.368252+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

32 extracted references · 5 canonical work pages · 1 internal anchor

[1]

and Brierley, S

Acharya, A., Yamamoto, K., Kumar, A. and Brierley, S. (2024). Decomposition pipeline for large-scale portfolio optimisation with applications to near-term quantum computing. arXiv preprint arXiv:2409.10301

work page arXiv 2024
[2]

An, D., Lin, L., Lu, J., and Ying, L. (2025). Variational quantum simulation of non-equilibrium and relaxation dynamics. arXiv preprint arXiv:2111.05176

work page arXiv 2025
[3]

K., Nannicini, G., Robert, A., Woerner, S

Barkoutsos, P. K., Nannicini, G., Robert, A., Woerner, S. and Gambetta, J. M. (2020). Applications of quantum computing in finance: from Monte Carlo to optimisation. npj Quantum Information, 6(1), 8

2020
[4]

and Perdomo-Ortiz, A

Benedetti, M., Garcia-Pintos, D., Perdomo, O., Leyton-Ortega, V., Nam, Y. and Perdomo-Ortiz, A. (2019). Parameterized quantum circuits as machine learning models. Quantum Science and Technology, 4(4), 043001

2019
[5]

Bergholm, V., Izaac, J., Schuld, M., Gogolin, C., Ahmed, S., Ajith, V., Alam, M.\ S., Alonso-Linaje, G., AkashNarayanan, B., Asadi, A., et al. (2018). PennyLane: Automatic differentiation of hybrid quantum-classical computations. arXiv preprint arXiv:1811.04968

work page internal anchor Pith review Pith/arXiv arXiv 2018
[6]

Bernstein, D. J. (2009). Understanding brute force. Workshop Record of SHARCS, 1--19

2009
[7]

Bharti, K., Cervera-Lierta, A., Kyaw, T.\ H., Haug, T., Alperin-Lea, S., Anand, A., \ Aspuru-Guzik, A. (2022). Noisy intermediate-scale quantum algorithms. Reviews of Modern Physics, 94(1), 015004

2022
[8]

and Lloyd, S

Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N. and Lloyd, S. (2017). Quantum machine learning. Nature, 549(7671), 195--202

2017
[9]

and Kaya, \"O

Broadie, M. and Kaya, \"O. (2006). Exact simulation of stochastic volatility and other affine jump diffusion processes. Operations Research, 54(2), 217--231

2006
[10]

and Su, Y

Childs, A.\ M. and Su, Y. (2019). Nearly optimal lattice simulation by product formulas. Physical Review Letters, 126(10), 100604

2019
[11]

and Ostrander, A

Childs, A.\ M., Liu, J.-P. and Ostrander, A. (2021). High-precision quantum algorithms for partial differential equations. Quantum, 5, 574

2021
[12]

The UK's Modern Industrial Strategy

Department for Business and Trade (2025). The UK's Modern Industrial Strategy. Presented to Parliament by the Secretary of State for Business and Trade, November 2025

2025
[13]

J., Gambella, C., Mare c ek, J., McFaddin, S., Mevissen, M., Raymond, R

Egger, D. J., Gambella, C., Mare c ek, J., McFaddin, S., Mevissen, M., Raymond, R. and Woerner, S. (2021). Quantum computing for finance: state-of-the-art and future prospects. IEEE Transactions on Quantum Engineering, 2, 1--24

2021
[14]

Research Note: Quantum Computing Applications in Financial Services

Financial Conduct Authority (2025). Research Note: Quantum Computing Applications in Financial Services. Research note dated 3 October 2025. Local reference copy held in the project library

2025
[15]

Q., Cruz, C

Galv\ a o, L. Q., Cruz, C. S., do Prado Rosa Junior, A. C. and Moret, M. A. (2025). Variational quantum simulation of nonadditive relaxation dynamics in open quantum systems. arXiv preprint arXiv:2505.12013

work page arXiv 2025
[16]

and Perdomo-Ortiz, A

Gili, K., Hibat-Allah, M., Mauri, M., Ballance, C. and Perdomo-Ortiz, A. (2023). Do quantum circuit Born machines generalize? Quantum Science and Technology, 8(3), 035021

2023
[17]

Glasserman, P. (2004). Monte Carlo Methods in Financial Engineering. Springer, New York

2004
[18]

and Sufana, R

Gourieroux, C., Jasiak, J. and Sufana, R. (2009). The Wishart autoregressive process of multivariate stochastic volatility. Journal of Econometrics, 150(2), 167--181

2009
[19]

Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), 212--219

1996
[20]

and Gambetta, J.\ M

Havlíček, V., Córcoles, A.\ D., Temme, K., Harrow, A.\ W., Kandala, A., Chow, J.\ M. and Gambetta, J.\ M. (2019). Supervised learning with quantum-enhanced feature spaces. Nature, 567, 209--212

2019
[21]

and Kondratyev, O

Jacquier, A. and Kondratyev, O. (2022). Quantum Machine Learning and Optimisation in Finance. Packt Publishing

2022
[22]

and Chuang, I

Low, G.\ H. and Chuang, I. (2019). Hamiltonian simulation by polynomial expansion. Quantum, 3, 163

2019
[23]

Montanaro, A. (2015). Quantum speedup of Monte Carlo methods. Proceedings of the Royal Society A, 471(2181), 20150301

2015
[24]

Report on post-quantum cryptography

NIST (2016). Report on post-quantum cryptography. NISTIR 8105

2016
[25]

and Lizaso, E

Or\'us, R., Mugel, S. and Lizaso, E. (2019). Quantum computing in finance: overview and outlook. Reviews in Physics, 4, 100028

2019
[26]

https://doi.org/10.5281/zenodo.2573505

Qiskit Contributors (2021). Qiskit: An open-source framework for quantum computing. Zenodo. doi:10.5281/zenodo.2573505

work page doi:10.5281/zenodo.2573505 2021
[27]

and Killoran, N

Schuld, M. and Killoran, N. (2019). Quantum machine learning in feature Hilbert spaces. Physical Review Letters, 122(4), 040504

2019
[28]

and Petruccione, F

Schuld, M. and Petruccione, F. (2021). Machine Learning with Quantum Computers. Springer

2021
[29]

and Petruccione, F

Schuld, M., Sinayskiy, I. and Petruccione, F. (2015). An introduction to quantum machine learning. Contemporary Physics, 56(2), 172--185

2015
[30]

Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), 124--134

1994
[31]

and Egger, D

Woerner, S. and Egger, D. J. (2019). Quantum risk analysis. npj Quantum Information, 5(1), 15

2019
[32]

and Woerner, S

Zoufal, C., Lucchi, A. and Woerner, S. (2019). Quantum generative adversarial networks for learning and loading random distributions. npj Quantum Information, 5(1), 103

2019