{"id":"28033d35-8e56-4873-81fd-7fd8b6c27c2c","arxiv_id":"2508.21548","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":2.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A survey of quantum computing in finance and blockchain security, proposing a qualitative four-stage feasibility framework that is not validated.","lead":"This preprint is a review of quantum computing in finance, covering both applications like portfolio optimization and Monte Carlo pricing and security risks to blockchains. It proposes a four-step checklist for deciding when quantum solutions make business sense and applies it to three use cases.","discovery_kind":"review","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Abstract claims the framework identifies domains where quantum surpasses classical, but §4.1–4.3 conclude every Stage 4 business case is open; the central claim lacks a positive instance.","rationale":"The reader's verdict of CONDITIONAL is appropriate, and my stress-test does not move it. The reader's weakest assumption identifies the checklist's sufficiency and the static treatment of speedups. My concern is more direct and internal: the paper's own application of the checklist in §4.1–4.3 ends with open or conditional Stage 4 verdicts for every use case, so the abstract's claim that the framework identifies domains where quantum surpasses classical is unsupported by the presented evidence. This is not a claim about external consensus; it is a failure of the paper's central claim to be backed by its own analysis. The framework could still be valuable as a proposed decision heuristic, but it is not a validated method and no positive domain is actually identified. The concrete test is a simple logical audit that would settle whether the overclaim exists. Since the reader already conditioned acceptance on removing the overclaim, my analysis reinforces that condition rather than changing the verdict.","tokens_in":15714,"tokens_out":2503,"duration_ms":23999,"concrete_test":"Construct a verdict matrix for the three scenarios in §4.1–4.3 by assigning each stage (1–4) a label from {yes, no, open} using only the paper's own statements. If no row has all four labels 'yes', then the abstract's claim of identified domains is unsupported and the verdict requires the conditional accept with that claim removed. As a sanity check, apply the same matrix to a fourth scenario, e.g., credit valuation adjustment using the QMC algorithm cited in §4.3; if the framework cannot produce a decision without external cost data, its stated ability to 'identify domains' remains unvalidated.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim is that applying the four-stage framework (§3.1) to representative financial scenarios 'identifies domains where quantum approaches can surpass classical techniques.' The supporting sections do not deliver this. For optimization, §4.1 Stage 3 says no conclusive advantage is proven because 'the number of qubits considered is still too small for a conclusive answer,' and Stage 4 says the business case is 'currently open.' For quantum machine learning, §4.2 Stage 3 says performance is data-dependent and subject to a no-free-lunch constraint, and Stage 4 conditions any benefit on costs that are not estimated. For quantum Monte Carlo, §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 it makes sense to replace classical processes.' Every Stage 4 outcome is open or conditional; the paper identifies no domain with all four stages answered positively. Consequently the abstract's claim that the framework 'identify[s] domains where quantum approaches can surpass classical techniques' is not established by the framework's own application. This is an internal support failure, not a disagreement with external consensus. The framework may be a reasonable proposal, but the claim that it has identified surpassing domains must be withdrawn or reframed as an assessment that leaves the advantage question open.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","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.'","tokens_in":15986,"tokens_out":3009,"duration_ms":29230,"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":[{"comment":"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.","section":"Abstract and §4.1–4.3"},{"comment":"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.","section":"§3.1 and §4"},{"comment":"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.","section":"§5.1"}],"minor_comments":[{"comment":"The phrase 'his review presents a more holistic perspective' should read 'this review presents a more holistic perspective.'","section":"Abstract"},{"comment":"The term 'Quantum Support Machines' should be 'Quantum Support Vector Machines' (QSVM), which is the standard name for the approach referenced.","section":"§4.2, Stage 2"},{"comment":"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.","section":"§6.4 and Table 1"},{"comment":"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.","section":"References"},{"comment":"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.","section":"§6.5 and Table 2"}],"recommendation":"major_revision","confidential_remarks":"The manuscript leans heavily on Naik et al. 2025, a co-authored prior review, for many supporting statements; while self-citation is not improper, the paper would be stronger if it independently sourced some of the most load-bearing claims. The manuscript is better framed as a practitioner-oriented survey than as a research contribution with a novel validated framework; the editorial decision should ask the authors to soften the novelty claims accordingly. No other concerns."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Bottom line: this is a competent, readable survey with a genuinely useful decision checklist for business readers, but the abstract overclaims what the framework achieves. The paper's own application of the framework in Section 4 concludes that every Stage 4 business case is open or conditional, so the abstract's claim that the framework 'identifies domains where quantum approaches can surpass classical techniques' is not backed by the paper itself.\n\nWhat is actually new is modest: the four-step framework (problem, algorithm, advantage, business case) is a sensible organizational device, but it reduces to standard technology-adoption heuristics. Its value is as a framing device for practitioners, not as a technical contribution. The survey material on post-quantum cryptography, quantum-resistant blockchains, QKD, and the tables of quantum-resistant cryptocurrencies is up-to-date and mostly accurate. The paper is well written and does a fair job of summarizing a large literature, including the authors' own prior work, which is used appropriately.\n\nThe soft spots are real but contained. First, the central claim is internally unsupported. In Sections 4.1–4.3, the authors themselves state that no conclusive quantum advantage is proven for optimization, that QML advantage is data-dependent and subject to no-free-lunch, and that QMC requires thousands of error-free qubits not available for a decade. They conclude each Stage 4 as 'open' or conditional. There is no positive example of the framework identifying a surpassing domain. That needs to be fixed—either by finding at least one instance where all four stages are positive, or more realistically, by reframing the abstract and conclusion as proposing a framework and reporting that the advantage question remains open. Second, the '1,000-fold reductions in energy consumption' claim in Section 5.1 appears without a citation or derivation; it should be removed or sourced. Third, the paper treats speedup values as static and does not account for classical algorithm improvements, which weakens the framework's predictive value if it is meant to guide investment decisions. These are not fatal to the review's usefulness, but they are the difference between a paper that supports its abstract and one that doesn't.\n\nWho is this for? Anyone writing or reading in the quantum-finance space, especially business-side readers who want a structured way to think about quantum adoption, and organizers of surveys. It is not a research contribution with new algorithms or data. It deserves a serious referee—not because it is groundbreaking, but because it is a competent survey that, with revision, would be a useful reference. I'd send it to peer review and require the abstract and conclusion to be aligned with the actual findings.","headline":"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.","tokens_in":16463,"tokens_out":2185,"would_cite":false,"duration_ms":19807,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"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.","keywords":["quantum computing","finance","four-step framework","quantum optimization","quantum machine learning","quantum Monte Carlo","post-quantum cryptography","quantum blockchain"],"falsifier":"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.","tokens_in":15505,"feed_emoji":"⚛️","tokens_out":4424,"duration_ms":43807,"temperature":0.7,"pith_summary":"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.","feed_headline":"Quantum in finance: four-step test says not yet","feed_subtitle":"A new framework checks problem, algorithm, speedup, and business case — and finds no proven economic advantage yet.","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"Supplies the systematic review baseline and definitions of quantum blockchain and cryptographic primitives used throughout.","marker":"Naik et al., 2025"},{"why":"Provides the status quo compilation of quantum benefits in finance that the four-step framework is positioned against.","marker":"Auer et al., 2024"},{"why":"Supplies the quantum Monte Carlo algorithm for financial derivative pricing used in Stage 2 of the optimization analysis.","marker":"Rebentrost et al., 2018"},{"why":"Provides quantum amplitude estimation, the theoretical foundation for the Monte Carlo speedup.","marker":"Brassard et al., 2000"},{"why":"Establishes the quadratic speedup of quantum Monte Carlo methods that the paper relies on in Stage 3.","marker":"Montanaro, 2015"},{"why":"Defines the quadratic search speedup that the paper uses to estimate reduced hash and symmetric-key security.","marker":"Grover, 1996"},{"why":"Provides the factoring and discrete-logarithm algorithm that breaks the public-key signatures under attack.","marker":"Shor, 1994"},{"why":"Defines the NISQ constraints of noise and limited qubit count that the paper cites as barriers to practical deployment.","marker":"Preskill, 2018"},{"why":"Supplies the economic model of quantum advantage, including first-mover benefits and market efficiency, used in the broader economic discussion.","marker":"Bova et al., 2023"},{"why":"Provides the post-quantum cryptography standardization process that grounds the mitigation strategies.","marker":"National Institute of Standards and Technology (NIST), n.d. b"}],"fun_headline_variants":["Quantum finance: four hurdles, no advantage yet","Finance's quantum leap delayed by four-step reality check","Quantum finance: security risk beats opportunity","Four-step test: no quantum edge for finance yet"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Quantum finance: four hurdles, no advantage yet","Finance's quantum leap delayed by four-step reality check","Quantum finance: security risk beats opportunity","Four-step test: no quantum edge for finance yet"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000649,"raw_usage":{"total_tokens":2973,"prompt_tokens":935,"completion_tokens":2038,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":551,"completion_tokens_details":{"reasoning_tokens":1979}},"tokens_in":551,"tokens_out":2038,"duration_ms":12979,"temperature":1.0,"reasoning_tokens":1979,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T16:39:30.814535+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[],"review_version":2}