REVIEW 2 cited by
Prospects and challenges of quantum finance
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Quantum computers are expected to have substantial impact on the finance industry, as they will be able to solve certain problems considerably faster than the best known classical algorithms. In this article we describe such potential applications of quantum computing to finance, starting with the state-of-the-art and focusing in particular on recent works by the QC Ware team. We consider quantum speedups for Monte Carlo methods, portfolio optimization, and machine learning. For each application we describe the extent of quantum speedup possible and estimate the quantum resources required to achieve a practical speedup. The near-term relevance of these quantum finance algorithms varies widely across applications - some of them are heuristic algorithms designed to be amenable to near-term prototype quantum computers, while others are proven speedups which require larger-scale quantum computers to implement. We also describe powerful ways to bring these speedups closer to experimental feasibility - in particular describing lower depth algorithms for Monte Carlo methods and quantum machine learning, as well as quantum annealing heuristics for portfolio optimization. This article is targeted at financial professionals and no particular background in quantum computation is assumed.
Forward citations
Cited by 2 Pith papers
-
Fast-forwardability of Jordan-Wigner-transformed Fermion models based on Cartan decomposition
The dimension of the Hamiltonian algebra of Jordan-Wigner-transformed interacting fermion models grows exponentially with the number of sites, making Cartan-based fast-forwarding inefficient for the Hubbard and Anders...
-
GPU-Accelerated Host-Aware Dead-Measurement Detection in Hybrid Quantum--Classical Programs: Full Version
Semantics-aware abstract interpretation of classical host code finds non-contributory measurements, enabling ~38% gate removal standalone and >30% after SOTA circuit optimizers, with GPU speedups via levelized SSA.
Discussion (0). Continue with ORCID to comment.