Quantum computer method for pricing rainbow options efficiently.
problem Pricing rainbow options with quantum computers.
method Iterative Quantum Amplitude Estimation and amplitude loading techniques.
result Validation of quantum pricing model on IBM QASM simulator.
Quantum algorithm speeds up pricing of financial derivatives.
problem Pricing autocallable options efficiently.
method Integration-based exponential amplitude loading technique.
result 50x reduction in circuit depth for payoff component.
Photonic chip speeds up option pricing with GAN for financial efficiency.
problem Bottleneck in classical computing limits financial industry development.
method Unary approach, photonic chip, quantum amplitude estimation, GAN for asset distribution.
result Quadratic speedup over classical Monte Carlo methods.
Quantum state preparation framework speeds up basket option pricing.
problem Limited practical benefit of quantum amplitude estimation due to state-preparation depth.
method Structure-aware tensor-train rank-based variational state preparation.
result State-preparation depth scaling replaced with linear scaling, maintaining low basket-pricing errors.
Quantum computing speeds up CDO pricing models.
problem Efficiently pricing complex financial products like CDOs.
method Implemented quantum circuits for Gaussian and Normal Inverse Gaussian copula models, using quantum amplitude estimation.
result Quantum computing can significantly speed up CDO pricing compared to Monte Carlo simulations.
Quantum walk algorithm optimizes quantum state preparation for financial simulations.
problem Efficiently loading classical data into quantum states for quantum computers.
method Split-step quantum walks (SSQW) to design parameterized quantum circuits (PQC).
result SSQW facilitates generating desired probability amplitude distributions for quantum simulations.
Improved formulation of spinfoam quantum gravity with cosmological constant, ensuring all amplitudes are finite and providing semiclassical asymptotics.
problem Ensuring the finiteness of spinfoam amplitudes and providing semiclassical asymptotics for quantum gravity.
method Using state-integral model of PSL(2, C) Chern-Simons theory and implementing simplicity constraint. result All spinfoam amplitudes are finite and provide semiclassical asymptotics with oscillatory terms related to the Regge action.
Quantum tech speeds up financial risk assessment.
problem Improving credit valuation adjustments using quantum mechanics.
method Developed a quantum algorithm using Bayesian quantum amplitude estimation and engineered likelihood functions.
result Significant speedup in quantum computations for CVA over classical methods.
Enhances quantum sensing by eliminating multiple oscillations in field amplitude estimation.
problem Multiple oscillations in field amplitude estimation due to inter-qubit interactions at high qubit densities.
method Adopting a quantum circuit learning framework to approximate a target function by optimizing gate parameters.
result Elimination of multiple oscillations, leading to enhanced dynamic range of quantum sensing.
Alternative method for derivatives pricing using quantum computers.
problem Derivatives pricing using quantum computers.
method Combination of direct encoding and modified Real Quantum Amplitude Estimation (mRQAE) algorithm.
result Experimental comparison shows that the proposed method retains speedups.
We define a topological quantum membrane theory on a seven dimensional manifold of G2 holonomy. We describe in detail the path integral evaluation for membrane geometries given by circle bundles over Riemann surfaces. We show that when the target space is CY3×S1 quantum amplitudes of non-local observables …
Quantum method improves CVaR evaluation under correlated fields.
problem Accurately evaluating CVaR in high-dimensional, correlated material uncertainty.
method Quantum-enhanced inference framework using stabilized IQAE.
result Quantum method achieves lower oracle complexity than classical methods.
Quantum computing speeds up Bermudan option pricing.
problem Efficient pricing of financial derivatives, especially Bermudan options.
method Quantum amplitude estimation combined with Chebyshev interpolation.
result Quadratic speed-up over classical methods.
Quantum model improves safety in machine learning.
problem Improving safety and robustness in machine learning models.
method Variational quantum classifier with amplitude encoding and SAFE-AI metrics.
result Quantum model provides competitive performance and improved robustness.
Hybrid QML model improves recovery rate prediction accuracy.
problem Complex nonlinear dependencies, high-dimensional feature spaces, and limited sample sizes in recovery rate forecasting.
method Hybrid Quantum Machine Learning (QML) with Amplitude Encoding, leveraging PQC and qubit data compression.
result Significantly lower RMSE (0.228) compared to classical models.
Quantum SVT reduces credit risk analysis costs.
problem Efficiently estimating credit risk metrics using quantum computing.
method Quantum Singular Value Transformation (QSVT) to reduce state preparation costs.
result Significant reduction in implementation costs for quantum credit risk analysis.
Quantum method speeds up risk estimation for insurance tail risks.
problem Sample-sparsity in classical Monte Carlo methods for tail risk pricing.
method Quantum Amplitude Estimation (QAE) with Grover amplification.
result Quantum method achieves convergence approaching order reciprocal N, enabling high-resolution tail estimation within practical budgets.
Quantum walks blend patterns into splines when averaged.
problem Understanding the asymptotic patterns of quantum random walks.
method Averaging over quantum coins using the Haar measure.
result Patterns blend into splines, showing a unified behavior.
Quantum computing promises faster insurance contract valuation.
problem Computational intensity of insurance contract valuation.
method Investigation of quantum computing's applicability for insurance contracts using Amplitude Estimation.
result Quantum computing can significantly speed up insurance contract valuation.
Quantum algorithm reduces CVA risk-neutral expectation estimation costs.
problem Reducing Monte Carlo sampling cost for CVA on real quantum hardware.
method Noise-aware quantum workflow combining market calibration, discretisation, and oracle construction.
result CABIQAE achieves lower classical post-processing runtime and more effective error exploitation.
Quantum computing speeds up option pricing for multiple assets.
problem High-dimensional integration bottleneck in option pricing.
method Calibrated marginal distributions, Gaussian copula, QAMC with QAE.
result QAMC reduces integration queries by 10-100 times for similar precision.
Quantum algorithms speed up financial portfolio valuation.
problem Efficiently pricing and valuing complex financial portfolios.
method Quantum Monte Carlo (QMC) algorithms enhanced with quantum amplitude estimation.
result Quantum algorithms significantly accelerate CVA and portfolio pricing.
We consider the quantum version of the bandit problem known as {\em best arm identification} (BAI). We first propose a quantum modeling of the BAI problem, which assumes that both the learning agent and the environment are quantum; we then propose an algorithm based on quantum amplitude amplification to solve BAI. We f…
Quantum algorithm speeds up Gibbs partition function estimation.
problem Estimating partition functions in sublinear time.
method Sublinear-time quantum algorithm using quantum phase and amplitude estimation.
result First sublinear-time speed-up for partition function estimation.
Quantum MC simulations generate financial risk distributions efficiently.
problem High computational cost in traditional Monte Carlo simulations.
method Integrates quantum amplitude estimation with stochastic models for equity, rate, and credit risk factors.
result Quantum advantage in scenario generation for financial risk analytics.
Quantum computing techniques applied to Monte Carlo simulations in finance.
problem Efficiently simulating quantum algorithms for financial modeling.
method Introduces quantum computing basics, amplitude estimation, and Grover's algorithm for unstructured search.
result Demonstrates quantum approaches to Monte Carlo integration and counting in finance.
We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits quantum information processing to determine a separating hyperplane using a number …
QRNN uses quantum neurons to learn sequences efficiently.
problem Efficiently learning sequences with quantum computing.
method Parametrized quantum neurons and amplitude amplification.
result QRNN outperforms classical RNNs on sequence learning tasks.
Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural net…
Quantum algorithm estimates multivariate mean with near-optimal efficiency.
problem Estimating the mean of multivariate random variables efficiently in quantum computing.
method Combines amplitude amplification, quantum singular value transformation, and Bernstein-Vazirani algorithm.
result Quantum estimator outperforms classical estimators outside low-precision regime.
Quantum algorithms simulate and exponentiate correlated Gaussian vectors for financial modeling.
problem Efficiently simulate and exponentiate correlated Gaussian vectors for financial applications.
method Proposes quantum algorithms for preparing and exponentiating normalised correlated Gaussian random vectors.
result Achieves subcubic complexity in N for quantum state preparation, providing a quantum advantage over classical methods. PolarBM models complex-valued audio signals in polar coordinates, improving over conventional methods.
problem Discarding structural information in complex-valued problems simplifies models but loses important amplitude-phase relationships.
method Proposes PolarBM, a novel Boltzmann machine for complex-valued variables in polar coordinates, and LogPolarBM for logarithmic amplitude.
result PolarBM and LogPolarBM achieve superior modeling accuracy compared to conventional models, including deep neural networks.
We provide a method to prepare covariance matrices for quantum datasets.
problem No concrete protocol for preparing covariance matrices for quantum datasets.
method Amplitude encoding of data, exploiting global phase symmetry to center the dataset.
result Covariance matrix can be prepared for arbitrary quantum datasets or centered classical datasets.
Quantum circuit optimization speeds up financial derivatives pricing.
problem Efficiently pricing financial derivatives on quantum computers.
method Pretraining conditional parameterized circuits for state-dependent functions.
result Quantum circuit implementation of derivatives' payoff function is more efficient.
Finiteness predicts dualities in quantum gravity.
problem Finiteness of quantum gravity amplitudes in fully compactified theories.
method Relating moduli space compactifiability to duality group representations.
result Finiteness requires compact moduli spaces and semisimple duality group representations.
Quantum algorithm for pricing European call options.
problem Accurate valuation of financial derivatives, especially for complex models and options.
method Transforms classical FFT into quantum QFT for pricing European call options.
result Quantum algorithm outperforms classical Monte Carlo simulation in NISQ era.
New method uses quantum computing to process classical data efficiently.
problem Inefficient quantum machine learning due to data loading and trainability issues.
method Linear Hamiltonian-based machine learning with ground state problems for k-local Hamiltonians.
result Demonstrated the effectiveness and scalability of the method on up to 50 qubits.
Quantum Signal Processing reduces derivative pricing quantum resource requirements.
problem Efficiently pricing financial derivatives on quantum computers.
method Quantum Signal Processing (QSP) to encode payoffs directly into quantum amplitudes.
result Significantly reduces quantum resources (T-gates and qubits) for practical derivative contracts.
New method prepares 3-qubit states using local gates and controlled-Z gates.
problem Preparation of 3-qubit states using quantum gates.
method Uses Ry(θ) gates and controlled-Z gates, with an optimal number of controlled-Z gates. result Optimal number of controlled-Z gates for preparing 3-qubit states is four. Machine learning has recently emerged as a fruitful area for finding potential quantum computational advantage. Many of the quantum enhanced machine learning algorithms critically hinge upon the ability to efficiently produce states proportional to high-dimensional data points stored in a quantum accessible memory. Eve…
We study a quantum system in a Riemannian manifold M on which a Lie group G acts isometrically. The path integral on M is decomposed into a family of path integrals on a quotient space Q=M/G and the reduced path integrals are completely classified by irreducible unitary representations of G. It is not necessary to assu…
Quantum kernel improves solar irradiance forecasting.
problem Improving short-term solar irradiance forecasting accuracy.
method Quantum Fourier Transform kernel in KRR with feature mixing.
result Consistently improves R2 and nRMSE over classical kernels.
A simple quantum model explains the Levy-unstable distributions for individual stock returns observed by ref.[1]. The probability density function of the returns is written as the squared modulus of an amplitude. For short time intervals this amplitude is proportional to a Cauchy-distribution and satisfies the Schroedi…
To formulate the universal constraints of quantum statistics data of generic long-range entangled quantum systems, we introduce the geometric-topology surgery theory on spacetime manifolds where quantum systems reside, cutting and gluing the associated quantum amplitudes, specifically in 2+1 and 3+1 spacetime dimension…
Novel quantum algorithm for financial market modeling.
problem Accurate quantum state preparation for financial simulation.
method Multi-Split-Steps Quantum Walk (multi-SSQW) with PQC and variational solver.
result Highly accurate modeling of complex financial distributions.
In the paper, we focus on complexity of C5.0 algorithm for constructing decision tree classifier that is the models for the classification problem from machine learning. In classical case the decision tree is constructed in O(hd(NM+NlogN)) running time, where M is a number of classes, N is the size of a traini…
Quantum algorithms accelerate financial risk computation.
problem Accelerating the computation of financial market risk.
method Quantum gradient estimation algorithms for market sensitivities.
result Significant reduction in resource requirements for financial quantum advantage.
Quantum computing offers new solutions for financial optimization, pricing, risk, and security.
problem Core financial bottlenecks in combinatorial search, expectation estimation, and rare-event analysis.
method Identify bottlenecks, specify quantum primitives, compare with classical benchmarks, assess under constraints.
result Strongest near-term case for quantum finance in hybrid workflows, constrained search, and amplitude-estimation.