Pith. sign in

REVIEW 3 major objections 5 minor 9 references

Quantum Leap in Finance: Economic Advantages, Security, and Post-Quantum Readiness

T0 review · 3 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper proposes a four-step business checklist for quantum computing in finance and, applying it to optimization, machine learning, and Monte Carlo simulation, concludes that no application currently passes all four tests.

desk verdict A readable, useful survey with a sensible four-question checklist, but the abstract overclaims that the framework identifies domains of quantum advantage when every application in Section 4 leaves the business case open. read the letter →

arxiv 2508.21548 v1 pith:SXBQGKT2 submitted 2025-08-29 quant-ph

Gerhard Hellstern , Esra Yeniaras This is my paper · ORCID
classification quant-ph
keywords quantumcomputingfinancefour-stepframeworkoptimizationmachinelearningMonteCarlopost-quantumcryptographyblockchain
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This review argues that a quantum application in finance is worth pursuing only if it passes four consecutive tests: a real computational problem exists, a usable quantum algorithm exists, a demonstrable advantage over classical methods has been shown, and a profitable business case follows. Applying this checklist to portfolio optimization, quantum machine learning, and quantum Monte Carlo simulation, the paper finds that none currently passes all four stages. The theoretical quadratic speedup of quantum Monte Carlo is real, but it requires thousands of error-free qubits that are years away, while variational algorithms and quantum machine learning lack any proven advantage. On the security side, the paper argues the threat is more immediate: Shor's and Grover's algorithms endanger digital signatures, hashes, and randomness, so financial blockchains should begin migrating to post-quantum cryptography now.

What carries the argument

The central object is a four-stage decision framework, the authors' 'four-step criteria catalog', which filters candidate quantum applications through problem existence, algorithm availability, performance advantage, and business case profitability. In the security half, the load-bearing mechanism is the pair of Shor's algorithm, which breaks factoring and discrete-logarithm based signatures, and Grover's algorithm, which halves the effective security of hash functions and symmetric keys; these algorithms define both the threat model and the urgency of post-quantum migration.

What would settle it

Take a use case the framework treats as promising, such as Monte Carlo derivative pricing, and compare the best available classical implementation against a fault-tolerant quantum implementation once one is available; if classical runtime and cost continue to improve at the same rate as quantum hardware, the framework's implicit promise of a future business case fails. A simpler in-principle test is to re-run the four-stage analysis for any application using a classical baseline from ten years ago rather than today's baseline; if the Stage 3 or Stage 4 answer changes, the framework's conclusions are baseline-dependent.

Watch

Extended reading notes

Core claim

The paper's central claim is that a genuine quantum advantage for finance emerges only when four questions are answered yes: is there an unsolved computational problem, is there an applicable quantum algorithm, does that algorithm provide a measurable advantage, and does the overall economic case beat the classical alternative? Applying these questions to optimization, machine learning, and Monte Carlo simulation, the paper concludes that the first two use cases have no proven advantage and the third, though theoretically sound, is not practically deployable for years. In parallel, the paper claims that the security risks from quantum computers are more urgent than the computational opportunities, because blockchains and digital finance rely on cryptographic primitives that Shor's and Grover's algorithms can break or weaken, and because transactions recorded today may be decrypted later once large quantum computers exist.

Load-bearing premise

The framework holds that four qualitative questions suffice to decide whether a quantum solution makes sense, and that the cited speedup values remain fixed while classical algorithms also improve; if classical methods progress as fast as quantum hardware, the conclusions about where quantum computing can surpass classical techniques would be wrong.

Editorial extensions

If this is right

  • For portfolio optimization and machine learning, financial institutions should not expect a near-term quantum advantage; the paper finds current evidence inconclusive and no proven business case.
  • For Monte Carlo simulation, the quadratic speedup implies a real payoff only after fault-tolerant hardware with thousands of error-free qubits is available, likely beyond the next decade.
  • Blockchain networks should begin testing and deploying post-quantum signatures such as Dilithium, Falcon, and XMSS to address the 'store now, decrypt later' threat.
  • Quantum random number generators and longer-output hash functions are low-cost hardening measures that can be adopted immediately to strengthen randomness and hash-based security.
  • Hybrid classical-quantum architectures and quantum key distribution offer a practical migration path for quantum-secure blockchain communications.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the framework is right, the near-term policy implication is to invest in classical algorithmic improvements and post-quantum migration rather than quantum hardware pilots for most financial use cases.
  • The framework's sequential logic implicitly favors large institutions that can afford to wait for a proven advantage; smaller firms might reasonably build quantum skills now as an option value, a trade-off the paper leaves unexamined.
  • The 'harvest now, decrypt later' argument, applied consistently, extends beyond blockchains to all long-lived signed and encrypted financial records, including TLS-protected banking traffic and stored legal documents.
  • The checklist's static treatment of speedups could be stress-tested by re-running its stages against past classical improvements; such a test would show whether its conclusions survive classical algorithmic progress.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper is a survey of quantum computing in finance and financial security. It proposes a four-stage evaluation framework (§3.1) comprising problem existence, algorithmic availability, computational advantage, and business-case viability, and applies it in §4 to quantum optimization, quantum machine learning, and quantum Monte Carlo simulation. The remainder of the paper surveys quantum blockchain, post-quantum cryptography, quantum key distribution, and quantum-resistant cryptocurrencies. The stated contribution is that the framework, when applied to representative scenarios, 'identifies domains where quantum approaches can surpass classical techniques.'

Significance. If the framework were validated and its application produced concrete positive cases, the paper would provide a useful decision aid for financial institutions evaluating quantum projects. The security-related survey is broad and mostly accurate: it covers Shor and Grover attacks, NIST post-quantum standardization, quantum-resistant cryptocurrencies, and the distinction between quantum-resistant and quantum-secure blockchains. However, the paper's own application of the framework yields no positive instance: every Stage 4 analysis in §4.1–4.3 is explicitly open or conditional. The review is therefore a useful compilation, but its headline claim is not established by its own evidence. The checklist itself is a reasonable proposal, and the breadth of the security discussion is a genuine strength; no machine-checked proofs or reproducible code are claimed, which is appropriate for a survey.

major comments (3)
  1. [Abstract and §4.1–4.3] The abstract and §1 claim that the framework is applied 'to identify domains where quantum approaches can surpass classical techniques.' The supporting sections do not deliver this. §4.1 Stage 3 says the number of qubits considered is too small for a conclusive answer and Stage 4 says the business case is 'currently open'; §4.2 Stage 3 subjects any advantage to a no-free-lunch constraint and Stage 4 conditions benefit on unestimated costs; §4.3 Stage 3 requires several thousand error-free qubits not available for a decade and Stage 4 says it will be necessary to examine very closely where quantum replacement makes sense. No domain receives positive answers at all four stages. This is an internal support failure, not a disagreement with external consensus. The abstract's identifying claim must be withdrawn or reframed as a framework for assessment that leaves the advantage question open.
  2. [§3.1 and §4] The framework compares quantum methods against a static classical baseline. Speedups such as Grover's quadratic speedup and the quantum Monte Carlo quadratic speedup are treated as fixed inputs, with no treatment of classical algorithmic progress. Classical optimization heuristics, Monte Carlo variance-reduction techniques, and machine-learning methods improve over time, so the conclusion about where quantum 'can surpass' classical techniques is time-dependent. The paper should either explicitly caveat that all Stage 3/4 conclusions are relative to the 2025 classical state of the art or add an explicit component to the framework that accounts for classical baseline evolution.
  3. [§5.1] The statement that quantum mining could offer 'up to 1,000-fold reductions in energy consumption' is presented without any citation or source. In a review, an unsupported quantitative benefit claim of this magnitude is not acceptable. Either provide a specific source for the estimate or delete the number and retain only the qualitative claim that quantum-based mining may improve energy efficiency.
minor comments (5)
  1. [Abstract] The phrase 'his review presents a more holistic perspective' should read 'this review presents a more holistic perspective.'
  2. [§4.2, Stage 2] The term 'Quantum Support Machines' should be 'Quantum Support Vector Machines' (QSVM), which is the standard name for the approach referenced.
  3. [§6.4 and Table 1] Table 1 would benefit from using the standardized names ML-KEM, ML-DSA, SLH-DSA, and FN-DSA, and from explaining the status of 'HQC (backup)' so that the reader can distinguish finalized standards from candidates.
  4. [References] Several references contain errors: the Egger et al. 2020 credit-risk entry duplicates 'Gutierrez' and 'Mestre' author names, and the Shor 2002 entry duplicates a paper already listed as Shor 1994. A careful reference cleanup is needed.
  5. [§6.5 and Table 2] Table 2 lists specific quantum-resistant signature schemes for several cryptocurrencies without citation columns; for a survey, claims such as 'Algorand (ALGO) FALCON' should be accompanied by the cited source for each row.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the four-stage framework is a qualitative checklist applied to cited literature, and every application stage concludes the advantage case is open rather than predicting a fitted result.

full rationale

This is a review and position paper, not a derivation. The four-stage checklist in §3.1 defines what would count as a real advantage ('A real quantum advantage for users in companies will only arise when there is a positive answer to all of these questions'), and §4 applies it to optimization, quantum machine learning, and quantum Monte Carlo using external literature. No parameter is fitted and then renamed as a prediction; there are no equations whose outputs are equal to their inputs by construction. The paper's own application concludes that all Stage 4 business cases are 'currently open' or conditional (§4.1–4.3), and §3.1 states that the question of whether a quantum advantage exists 'is an open question', so the framework does not manufacture a positive result. Self-citations (Naik et al. 2025, Hellstern 2021, Dehn et al. 2025) support background or null-result statements, but each is accompanied by independent standard references (Shor, Grover, Preskill, NIST) or is a non-load-bearing 'cf.' example; none forces the central claim. The abstract's phrase 'identify domains where quantum approaches can surpass classical techniques' overstates the paper's own open conclusions, but that is an internal support or correctness issue, not circularity.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No free parameters or invented entities appear. The paper's central framework relies on the unvalidated validity of its four-question checklist and on the accuracy of cited quantum speedups, which are taken as background.

assumptions (3)
  • ad hoc to paper The four-stage checklist (problem, algorithm, advantage, business case) is a sufficient and valid decision model for quantum adoption.
    Proposed in section 3.1 without empirical or theoretical validation; the paper applies it but draws no firm conclusions.
  • domain assumption The speedup and resource claims cited from the literature (e.g., Grover quadratic speedup, QMC requiring thousands of error-free qubits) remain accurate and are not offset by future classical algorithmic progress.
    Sections 4.1-4.3 use these claims to assess Stage 3; the comparison is static.
  • domain assumption Quantum computers of the size needed will eventually be realized.
    The future business-case discussion in sections 3.2 and 7 assumes scalable fault-tolerant hardware will arrive.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum Leap in Finance: Economic Advantages, Security, and Post-Quantum Readiness." pith.science (2026). https://pith.science/paper/SXBQGKT2

@misc{pith2026250821548,
  author       = {Pith},
  title        = {Pith review of: Quantum Leap in Finance: Economic Advantages, Security, and Post-Quantum Readiness},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SXBQGKT2}},
  note         = {Machine review of arXiv:2508.21548}
}
read the original abstract

This paper provides an in-depth review of the evolving role of quantum computing in the financial sector, emphasizing both its computational potential and cybersecurity implications. Distinguishing itself from existing surveys, this work integrates classical quantum computing applications - such as portfolio optimization, risk analysis, derivative pricing, and Monte Carlo simulations with a thorough examination of blockchain technologies and post-quantum cryptography (PQC), which are crucial for maintaining secure financial operations in the emerging quantum era. We propose a structured four-step framework to assess the feasibility and expected benefits of implementing quantum solutions in finance, considering factors such as computational scalability, error tolerance, data complexity, and practical implementability. This framework is applied to a series of representative financial scenarios to identify domains where quantum approaches can surpass classical techniques. Furthermore, the paper explores the vulnerabilities quantum computing introduces to digital finance-related applications and blockchain security, including risks to digital signatures, hash functions, and randomness generation, and discusses mitigation strategies through PQC and quantum-resilient alternatives of classical digital finance tools and blockchain architectures. By addressing both quantum blockchain, quantum key distribution (QKD) as well as quantum communication networks, his review presents a more holistic perspective than prior studies, offering actionable insights for researchers, financial practitioners, and policymakers navigating the intersection of quantum computing, blockchain, and secure financial systems.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

9 extracted references · 5 canonical work pages

  1. [1]

    Quantum-resistance in blockchain networks

    Algorand Foundation (n.d.), ‘Algorand’s post-quantum readiness via falcon signa- tures’, https://algorand.co/technology/post-quantum. Allende, M., Le´ on, D. L., Cer´ on, S., Leal, A., Pareja, A., Silva, M. D., Pardo, A., Jones, D., Worrall, D., Merriman, B., Gilmore, J., Kitchener, N. and Venegas-Andraca, S. E. (2021), ‘Quantum-resistance in blockchain n...

    work page Pith review arXiv 2021

  2. [2]

    URL: http://dx.doi.org/10.3389/frqst.2023.1164428 Fern´ andez-Caram` es, T. M. and Fraga-Lamas, P. (2020), ‘Towards post-quantum blockchain: A review on blockchain cryptography resistant to quantum computing attacks’, IEEE Access 8, 21091–21116. Gottesman, D. and Chuang, I. (2001), ‘Quantum digital signatures’. URL: https://arxiv.org/abs/quant-ph/0105032 ...

    arXiv 2020

  3. [79]

    Quantinuum (2025), ‘Quantum error correction and fault-tolerant quantum comput- ing’, https://www.quantinuum.com/resources/quantum-error-correction

    URL: http://dx.doi.org/10.22331/q-2018-08-06-79 QANplatform (n.d.), ‘Qanplatform: A quantum-resistant hybrid blockchain platform’, https://www.qanplatform.com/. Quantinuum (2025), ‘Quantum error correction and fault-tolerant quantum comput- ing’, https://www.quantinuum.com/resources/quantum-error-correction. Quantum Blockchain Technologies Plc (2025), ‘Ai...

    arXiv 2025

  4. [291]

    and Kulicki, P

    URL: https://doi.org/10.22331/q-2020-07-06-291 Sun, X., Sopek, M., Wang, Q. and Kulicki, P. (2019), ‘Towards quantum-secured permissioned blockchain: Signature, consensus, and logic’, Entropy 21(9),

    doi:10.22331/q-2020-07-06-291 2019

  5. [463]

    (2020), Quantum relay blockchain and its applications in key service, ICCSP 2020, Association for Computing Machinery, New York, NY, USA, p

    URL: https://doi.org/10.22331/q-2021-06-01-463 Chen, H. (2020), Quantum relay blockchain and its applications in key service, ICCSP 2020, Association for Computing Machinery, New York, NY, USA, p. 95–99. URL: https://doi.org/10.1145/3377644.3377657 Cohen, J., Khan, A. and Alexander, C. (2020), ‘Portfolio optimization of 60 stocks using classical and quant...

    arXiv 2020

  6. [887]

    and Korolkova, N

    URL: https://doi.org/10.3390/e21090887 Thornton, M., Scott, H., Croal, C. and Korolkova, N. (2019), ‘Continuous-variable quantum digital signatures over insecure channels’, Physical Review A 99(3). URL: http://dx.doi.org/10.1103/PhysRevA.99.032341 Tokunaga, Y., Suzuki, Y., Endo, S. and Asaoka, R. (2021), ‘Fault-tolerant technol- ogy for quantum informatio...

    work page doi:10.3390/e21090887 2019

  7. [1509]

    Shor, P. W. (2002), Algorithms for quantum computation: discrete logarithms and factoring, in ‘Proceedings 35th Annual Symposium on Foundations of Computer Science’, IEEE Comput. Soc. Press. Stamatopoulos, N., Egger, D. J., Sun, Y., Zoufal, C., Iten, R., Shen, N. and Woerner, S. (2020), ‘Option Pricing using Quantum Computers’, Quantum 4,

    work page 2002

  8. [2022]

    and Du, L

    URL: https://doi.org/10.1155/2022/1431967 Wang, W., Yu, Y. and Du, L. (2022), ‘Quantum blockchain based on asymmet- ric quantum encryption and a stake vote consensus algorithm’, Scientific Reports 12(1),

    work page doi:10.1155/2022/1431967 2022

Show all 9 references
  1. [8606]

    and Fang, J.-B

    URL: https://doi.org/10.1038/s41598-022-12412-0 Wen, X.-J., Chen, Y.-Z., Fan, X.-C., Zhang, W., Yi, Z.-Z. and Fang, J.-B. (2022), ‘Blockchain consensus mechanism based on quantum zero-knowledge proof’, Optics & Laser Technology 147, 107693. Wolpert, D. and Macready, W. (1997),...

    2022 arXiv

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.