Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Formalism and Quantum Computing: What Can They Actually Solve in Economics and Finance?

Yulin Liu

Published Oct 28, 2026• 0 citations
Publisher

Abstract

This note separates two things often labelled “quantum finance”: the quantum formalism, which applies quantum-mechanical mathematics on classical computers and is judged by empirical fit, and quantum computers, which are judged by whether they complete tasks classical machines cannot. Classifying the evidence into four types (unconditional; beyond-classical under complexity assumptions; empirical claims on specific problems; asymptotic speedups requiring fault tolerance), it finds that, among the public evidence identified and verified here (cut-off 17 October 2026), no economic or financial task has demonstrated broadly accepted practical quantum advantage against strong classical baselines and end-to-end costs. The strongest unconditional results concern information resources rather than computational speed; the formalism has already produced methods usable on classical hardware and testable empirical results; the most mature provable speedup directly relevant to finance is the quadratic speedup of amplitude estimation, which requires fault-tolerant hardware; and because published estimates place the logical-qubit threshold for elliptic-curve discrete logarithms below that for derivative-pricing advantage, cryptographic infrastructure is a channel through which material impact may arrive earlier — a scenario, not a timing prediction, since the two workloads differ in gate counts, runtimes and fault-tolerance assumptions. The note is a structured synthesis of published evidence and reports no new experiments or measurements.

DOI
10.5281/zenodo.23697758

Related papers

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

Hui Gong, Akash Sedai, Thomas Schroeder +1 more

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.

arXiv:2604.08180•Apr 9, 2026•2 citations

Quantum Algorithms for Computational Economics: A Critical Review of Simulation, Optimization, and Near-Term Evidence

Diego A. Díaz

Abstract Quantum computing is increasingly discussed as a possible source of new computational methods for economics, but its relevance depends on whether economic bottlenecks match quantum algorithmic primitives. This critical review evaluates that match for computational economics. It synthesizes work on quantum amplitude estimation and quantum Monte Carlo for simulation and risk measurement; quadratic unconstrained binary optimization (QUBO), Ising formulations, quantum annealing, and the quantum approximate optimization algorithm for discrete optimization; and quantum linear-algebra and machine-learning primitives for econometrics and model solution. The review argues that there is no general-purpose quantum algorithm for economics analogous to Shor's algorithm for factoring. Credible claims are problem-class specific and depend on state preparation, output requirements, conditioning, hardware noise, embedding overhead, and comparison with strong classical and quantum-inspired baselines. The most mature economic applications are derivative pricing and financial risk, payment-system liquidity optimization, quantum Monte Carlo for stress testing, and early quantum-annealing formulations of dynamic programming. Transportation and infrastructure applications are relevant mainly as networked economic optimization problems. The article proposes an evidence ladder for quantum computational economics and a research agenda centered on reproducible benchmarks, economically meaningful objective functions, end-to-end resource accounting, and evaluation by economic value rather than hardware novelty. JEL Classification: C02; C15; C61; C63; C88; E37; G11; G17; R41

•Oct 23, 2026•0 citations

Quantum Algorithms for Trading: A Survey of Speedups, Thresholds, and Dequantization

Luigi Laura, Marco Parrillo, Alessio Pascucci +2 more

Quantum algorithms for trading span computational tasks with different input models and standards of evidence. This structured critical review describes its search scope, selection criteria and limitations, and distinguishes reported findings from author assessments. Amplitude estimation estimates bounded expectations to additive error ϵ with O(ϵ−1) oracle queries rather than the O(ϵ−2) samples of plain classical Monte Carlo at fixed confidence. This query advantage does not establish an end-to-end runtime advantage: state preparation, arithmetic, error correction and classical competitors must also be costed. Published resource estimates for benchmark exotics require thousands of logical qubits and demanding logical operation rates. An illustrative sensitivity analysis shows how the crossover depends on classical throughput, oracle depth and the comparison window; its numbers are scenarios, not calibrated hardware forecasts. Portfolio and trading-trajectory formulations have device demonstrations, but a 250-instance benchmark of discretized minimum-variance allocation finds classical mixed-integer programming and a tailored heuristic superior on the tested formulation. Specific low-rank quantum machine learning algorithms have been dequantized under analogous sampling-access assumptions. Separately, a controlled study of quantum kernels for Chinese equity returns finds no significant advantage and demonstrates sensitivity to evaluation design; this does not settle other learning tasks. Entanglement-assisted coordination offers advantages in specified nonlocal games without computational-complexity assumptions, while its financial implementation and economics remain open. We distinguish computational performance from economic value and identify input/output costs, structured algorithms, reproducible benchmarking and explicit financial evaluation as priorities.

Information•Sep 17, 2026•0 citations

From Quantum Speedup to Practical Advantage

Craig Wright

Quantum computing is often described as evaluating many answers simultaneously. That metaphor confuses a large mathematical state space with accessible classical output and encourages a second mistake: treating an asymptotic speedup as an engineered or economic result. This commentary revisits Wright (2025) against experimental and resource-estimation evidence through 2026. The central criticism survives, but two claims require revision. Fault tolerance is no longer merely hypothetical after below-threshold logical-memory experiments, and cryptanalytic resource estimates have fallen substantially under specified hardware assumptions. The defensible position therefore rests on four distinctions: computability, algorithmic complexity, fault-tolerant execution, and practical value. A credible claim of quantum advantage must identify the task, compare against the strongest current classical method, include the complete system cost, and explain verification. This framework supports continued research and post-quantum migration while rejecting claims that outrun demonstrated performance.

Innovative Journal of Applied Science•Jan 1, 2026•0 citations

Quantum Computing in Economics. Promises and Barriers

George Chirita, Mioara Chiriţă

Quantum computing represents one of the most disruptive technological paradigms of the 21st century, with profound implications for economic modelling, financial optimization, and computational decision-making. Unlike classical computing, quantum systems leverage superposition, entanglement, and interference to solve problems of exponentially higher complexity, a capability with transformative potential for economics and finance. This study examines the intersection of quantum computing and economics, systematically evaluating both the promises and the barriers defining this emerging field. Regarding opportunities, quantum algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA) and Grover's algorithm, demonstrate significant theoretical advantages in portfolio optimization, risk assessment, option pricing, and the resolution of large-scale combinatorial problems that are intractable for classical machines. Quantum machine learning extends these prospects, offering accelerated capabilities for pattern recognition and predictive modelling relevant to financial markets. However, substantial barriers temper these expectations. Current quantum hardware operates in the NISQ (Noisy Intermediate-Scale Quantum) era, where decoherence, gate errors, and a limited number of qubits constrain practical applicability. The gap between theoretical quantum advantage and real-world economic implementation remains significant, compounded by a shortage of specialists, high infrastructure costs, and the absence of standardized programming frameworks tailored to economic applications. Through a bibliometric analysis of existing literature and a critical review of recent experimental results, the study maps the current state of quantum computing adoption in economics, identifies the most active research frontiers—quantum game theory and quantum portfolio optimization—and outlines the conditions under which quantum advantage could become economically relevant. The findings suggest that, although quantum computing will not transform economic practice in the short term, its long-term disruptive potential warrants proactive engagement from economists, financial institutions, and policymakers.

Annals of Dunarea de Jos University of Galati Fascicle I Economics and Applied Informatics•Aug 31, 2026•0 citations

Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits

Madelyn Cain, Qian Xu, Robbie King +6 more

Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance and practical relevance to cryptography. However, due to the high overhead of quantum error correction, optimized resource estimates for cryptographically relevant instances of Shor's algorithm require millions of physical qubits. Here, by leveraging advances in high-rate quantum error-correcting codes, efficient logical instruction sets, and circuit design, we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits. Increasing the number of physical qubits improves time efficiency by enabling greater parallelism; under plausible assumptions, the runtime for discrete logarithms on the P-256 elliptic curve could be just a few days for a system with 26,000 physical qubits, while the runtime for factoring RSA-2048 integers is one to two orders of magnitude longer. Recent neutral-atom experiments have demonstrated universal fault-tolerant operations below the error-correction threshold, computation on arrays of hundreds of qubits, and trapping arrays with more than 6,000 highly coherent qubits. Although substantial engineering challenges remain, our theoretical analysis indicates that an appropriately designed neutral-atom architecture could support quantum computation at cryptographically relevant scales. More broadly, these results highlight the capability of neutral atoms for fault-tolerant quantum computing with wide-ranging scientific and technological applications.

quant-pharXiv:2603.28627•Mar 31, 2026•160 citations
This note separates two things often labelled “quantum finance”: the quantum formalism, which applies quantum-mechanical mathematics on classical computers and is judged by empirical fit, and quantum computers, which are judged by whether they complete tasks classical machines cannot. Classifying the evidence into four types (unconditional; beyond-classical under complexity assumptions; empirical claims on specific problems; asymptotic speedups requiring fault tolerance), it finds that, among the public evidence identified and verified here (cut-off 17 October 2026), no economic or financial task has demonstrated broadly accepted practical quantum advantage against strong classical baselines and end-to-end costs. The strongest unconditional results concern information resources rather than computational speed; the formalism has already produced methods usable on classical hardware and testable empirical results; the most mature provable speedup directly relevant to finance is the quadratic speedup of amplitude estimation, which requires fault-tolerant hardware; and because published estimates place the logical-qubit threshold for elliptic-curve discrete logarithms below that for derivative-pricing advantage, cryptographic infrastructure is a channel through which material impact may arrive earlier — a scenario, not a timing prediction, since the two workloads differ in gate counts, runtimes and fault-tolerance assumptions. The note is a structured synthesis of published evidence and reports no new experiments or measurements.
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.
Abstract Quantum computing is increasingly discussed as a possible source of new computational methods for economics, but its relevance depends on whether economic bottlenecks match quantum algorithmic primitives. This critical review evaluates that match for computational economics. It synthesizes work on quantum amplitude estimation and quantum Monte Carlo for simulation and risk measurement; quadratic unconstrained binary optimization (QUBO), Ising formulations, quantum annealing, and the quantum approximate optimization algorithm for discrete optimization; and quantum linear-algebra and machine-learning primitives for econometrics and model solution. The review argues that there is no general-purpose quantum algorithm for economics analogous to Shor's algorithm for factoring. Credible claims are problem-class specific and depend on state preparation, output requirements, conditioning, hardware noise, embedding overhead, and comparison with strong classical and quantum-inspired baselines. The most mature economic applications are derivative pricing and financial risk, payment-system liquidity optimization, quantum Monte Carlo for stress testing, and early quantum-annealing formulations of dynamic programming. Transportation and infrastructure applications are relevant mainly as networked economic optimization problems. The article proposes an evidence ladder for quantum computational economics and a research agenda centered on reproducible benchmarks, economically meaningful objective functions, end-to-end resource accounting, and evaluation by economic value rather than hardware novelty. JEL Classification: C02; C15; C61; C63; C88; E37; G11; G17; R41
Quantum algorithms for trading span computational tasks with different input models and standards of evidence. This structured critical review describes its search scope, selection criteria and limitations, and distinguishes reported findings from author assessments. Amplitude estimation estimates bounded expectations to additive error ϵ with O(ϵ−1) oracle queries rather than the O(ϵ−2) samples of plain classical Monte Carlo at fixed confidence. This query advantage does not establish an end-to-end runtime advantage: state preparation, arithmetic, error correction and classical competitors must also be costed. Published resource estimates for benchmark exotics require thousands of logical qubits and demanding logical operation rates. An illustrative sensitivity analysis shows how the crossover depends on classical throughput, oracle depth and the comparison window; its numbers are scenarios, not calibrated hardware forecasts. Portfolio and trading-trajectory formulations have device demonstrations, but a 250-instance benchmark of discretized minimum-variance allocation finds classical mixed-integer programming and a tailored heuristic superior on the tested formulation. Specific low-rank quantum machine learning algorithms have been dequantized under analogous sampling-access assumptions. Separately, a controlled study of quantum kernels for Chinese equity returns finds no significant advantage and demonstrates sensitivity to evaluation design; this does not settle other learning tasks. Entanglement-assisted coordination offers advantages in specified nonlocal games without computational-complexity assumptions, while its financial implementation and economics remain open. We distinguish computational performance from economic value and identify input/output costs, structured algorithms, reproducible benchmarking and explicit financial evaluation as priorities.
Quantum computing is often described as evaluating many answers simultaneously. That metaphor confuses a large mathematical state space with accessible classical output and encourages a second mistake: treating an asymptotic speedup as an engineered or economic result. This commentary revisits Wright (2025) against experimental and resource-estimation evidence through 2026. The central criticism survives, but two claims require revision. Fault tolerance is no longer merely hypothetical after below-threshold logical-memory experiments, and cryptanalytic resource estimates have fallen substantially under specified hardware assumptions. The defensible position therefore rests on four distinctions: computability, algorithmic complexity, fault-tolerant execution, and practical value. A credible claim of quantum advantage must identify the task, compare against the strongest current classical method, include the complete system cost, and explain verification. This framework supports continued research and post-quantum migration while rejecting claims that outrun demonstrated performance.
Quantum computing represents one of the most disruptive technological paradigms of the 21st century, with profound implications for economic modelling, financial optimization, and computational decision-making. Unlike classical computing, quantum systems leverage superposition, entanglement, and interference to solve problems of exponentially higher complexity, a capability with transformative potential for economics and finance. This study examines the intersection of quantum computing and economics, systematically evaluating both the promises and the barriers defining this emerging field. Regarding opportunities, quantum algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA) and Grover's algorithm, demonstrate significant theoretical advantages in portfolio optimization, risk assessment, option pricing, and the resolution of large-scale combinatorial problems that are intractable for classical machines. Quantum machine learning extends these prospects, offering accelerated capabilities for pattern recognition and predictive modelling relevant to financial markets. However, substantial barriers temper these expectations. Current quantum hardware operates in the NISQ (Noisy Intermediate-Scale Quantum) era, where decoherence, gate errors, and a limited number of qubits constrain practical applicability. The gap between theoretical quantum advantage and real-world economic implementation remains significant, compounded by a shortage of specialists, high infrastructure costs, and the absence of standardized programming frameworks tailored to economic applications. Through a bibliometric analysis of existing literature and a critical review of recent experimental results, the study maps the current state of quantum computing adoption in economics, identifies the most active research frontiers—quantum game theory and quantum portfolio optimization—and outlines the conditions under which quantum advantage could become economically relevant. The findings suggest that, although quantum computing will not transform economic practice in the short term, its long-term disruptive potential warrants proactive engagement from economists, financial institutions, and policymakers.
Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance and practical relevance to cryptography. However, due to the high overhead of quantum error correction, optimized resource estimates for cryptographically relevant instances of Shor's algorithm require millions of physical qubits. Here, by leveraging advances in high-rate quantum error-correcting codes, efficient logical instruction sets, and circuit design, we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits. Increasing the number of physical qubits improves time efficiency by enabling greater parallelism; under plausible assumptions, the runtime for discrete logarithms on the P-256 elliptic curve could be just a few days for a system with 26,000 physical qubits, while the runtime for factoring RSA-2048 integers is one to two orders of magnitude longer. Recent neutral-atom experiments have demonstrated universal fault-tolerant operations below the error-correction threshold, computation on arrays of hundreds of qubits, and trapping arrays with more than 6,000 highly coherent qubits. Although substantial engineering challenges remain, our theoretical analysis indicates that an appropriately designed neutral-atom architecture could support quantum computation at cryptographically relevant scales. More broadly, these results highlight the capability of neutral atoms for fault-tolerant quantum computing with wide-ranging scientific and technological applications.