Applications of Quantum Computing

Chapter 9
Finance, Risk and Insurance Applications

Diploma in Quantum Computing
Applications of Quantum Computing   •   Diploma

Finance, Risk and Insurance Applications

Introduction

Financial services are attractive domains for quantum-computing research because many decisions involve optimisation under uncertainty. Portfolio construction, derivative valuation, credit assessment, fraud detection and insurance reserving all require the analysis of very large combinations of possible outcomes. Classical computers remain highly effective for most production workloads, but quantum algorithms may eventually improve selected subroutines, especially sampling, optimisation and amplitude estimation.

The central practical lesson is that quantum computing is not a universal replacement for financial information systems. A useful quantum application must demonstrate an advantage after data preparation, error correction, circuit execution, measurement, validation and integration with existing controls. Financial institutions must therefore evaluate quantum methods against classical benchmarks, regulatory requirements and model-risk standards rather than judging them only by theoretical speed-up.

Learning Objectives

By the end of this chapter, a learner should be able to:

  1. Explain how quantum optimisation can be applied to portfolio selection.
  2. Describe quantum approaches to derivative pricing and Monte Carlo acceleration.
  3. Distinguish applications in credit risk, fraud analytics and insurance scenario modelling.
  4. Formulate basic financial objectives mathematically and identify their assumptions.
  5. Evaluate data, implementation, governance, regulatory and model-risk issues.
  6. Design a responsible proof-of-concept using classical baselines and measurable performance criteria.

1. Why Finance and Insurance Are Relevant to Quantum Computing

Financial and insurance problems commonly have four characteristics:

  • Combinatorial choice: selecting assets, trades, facilities or claims from a large set of alternatives.
  • Uncertainty: prices, interest rates, defaults, losses and customer behaviour are random or only partially known.
  • Repeated simulation: risk measures often require thousands or millions of scenarios.
  • Constraints: capital, liquidity, concentration, regulatory and operational restrictions limit feasible decisions.

A quantum algorithm may be relevant when a problem can be encoded into qubits and when the resulting circuit is sufficiently small and accurate. Three broad mechanisms are especially important:

  1. Quantum optimisation, including quantum approximate optimisation approaches, for discrete decisions.
  2. Quantum amplitude estimation, for estimating probabilities or expected values with a theoretically favourable sampling complexity.
  3. Quantum machine learning and quantum-enhanced sampling, for selected classification, generative-modelling or anomaly-detection tasks.

These mechanisms do not remove the need for financial modelling. A poorly specified objective, biased data or unrealistic probability model remains poor when implemented quantum mechanically.

2. Portfolio Optimisation

2.1 Classical formulation

Suppose a portfolio contains n assets. Let wᵢ be the proportion invested in asset i, μᵢ its expected return, and Σ the covariance matrix of returns. A standard mean–variance objective is:

maxw μᵀw − (λ/2)wᵀΣw

Here, μ is an n-dimensional vector of expected returns, w is the vector of portfolio weights, Σ is an n × n covariance matrix, and λ ≥ 0 is the investor’s risk-aversion parameter. The first term is expected portfolio return and the second is a risk penalty based on variance. The formulation assumes that expected returns and covariances are sufficiently stable and that variance is an acceptable measure of risk.

Typical constraints include:

∑ᵢ wᵢ = 1, wᵢ ≥ 0

The first condition represents full investment and the second prohibits short selling. Additional constraints may limit asset or sector exposure.

A practical portfolio may involve binary decisions: whether to include asset i. Let xᵢ ∈ {0,1}. A simplified cardinality-constrained objective can be expressed as:

minx −∑ᵢ μᵢxᵢ + γ∑ᵢ∑ⱼ Σᵢⱼxᵢxⱼ + A(∑ᵢxᵢ − K)²

Here γ controls the risk-return trade-off, K is the required number of selected assets, and A is a penalty coefficient. The quadratic penalty is zero when exactly K assets are selected. This type of quadratic unconstrained binary optimisation, or QUBO, is suitable for mapping to an Ising Hamiltonian or a quantum optimisation circuit.

2.2 Quantum encoding

A binary variable can be represented by a qubit measurement. The computational basis states |0⟩ and |1⟩ represent exclusion and inclusion. A QUBO objective is transformed into an operator whose low-energy states correspond to good solutions. A quantum optimiser seeks a state with a high probability of producing such a solution.

For continuous weights, discretisation is usually required. For example, a weight may be represented as:

wᵢ = ∑b=0m−1 2ᵇqᵢb / (2ᵐ − 1)

where qᵢb ∈ {0,1} are binary variables and m is the number of bits used for asset i. Discretisation increases the number of qubits and may introduce approximation error. Encoding must therefore balance financial precision against hardware feasibility.

2.3 Practical interpretation

Quantum optimisation is most plausible when the decision problem is discrete and highly constrained. Examples include selecting a limited number of securities, allocating trades under transaction costs, scheduling rebalancing actions or choosing insurance reinsurance structures. Continuous convex portfolio problems may already be solved efficiently by classical optimisation, so quantum methods should not be assumed superior merely because the problem contains a covariance matrix.

Transaction costs can be included by adding a turnover term. If w⁰ is the current portfolio, a simplified objective may include:

C(w) = κ∑ᵢ |wᵢ − wᵢ⁰|

where κ is a non-negative cost per unit of traded weight. The absolute value often requires additional binary variables or a suitable reformulation.

3. Derivative Pricing and Monte Carlo Acceleration

3.1 Risk-neutral valuation

Under a risk-neutral pricing framework, the value of a derivative is the discounted expected payoff:

V₀ = e^(−rT) EQ[H(ST)]

V₀ is the value at time zero, r is the continuously compounded risk-free rate, T is time to maturity, Q is the risk-neutral probability measure, S_T is the underlying price at maturity, and H is the payoff function. The equation assumes an appropriate arbitrage-free model and a correctly specified discounting convention.

For a European call in the basic Black–Scholes model, the payoff is:

H(ST) = max(ST − K, 0)

where K is the strike price. Real institutions often require models with stochastic volatility, jumps, multiple risk factors, early exercise or credit effects. These features make closed-form valuation difficult and increase the importance of simulation.

3.2 Classical Monte Carlo

If X₁,…,X_N are independent simulated discounted payoffs with mean V₀ and variance σ²_X, the estimator is:

V̂N = (1/N)∑j=1N Xⱼ

Its standard error is approximately:

SE(V̂N) = σX / √N

Thus, reducing the sampling error by a factor of 10 generally requires 100 times as many independent samples. This square-root convergence is the motivation for quantum amplitude estimation.

3.3 Quantum amplitude estimation

A payoff can be scaled into a bounded quantity Y ∈ [0,1], represented as a probability amplitude. If a quantum procedure prepares a state in which a “good” measurement occurs with probability a, amplitude estimation estimates a. In idealised settings, iterative amplitude-estimation methods can achieve error ε with query complexity that scales approximately as O(1/ε), compared with classical Monte Carlo’s O(1/ε²), subject to important assumptions.

The theoretical comparison concerns oracle calls, not total business cost. A real implementation must construct a state-preparation circuit for the probability distribution, encode the payoff, manage approximation error and perform readout. State preparation may dominate the workload. Noise and finite hardware may eliminate the asymptotic benefit.

3.4 Worked numerical example

Assume a discounted payoff has standard deviation σ_X = 0.20 in currency units and N = 10,000 independent classical simulations. The standard error is:

SE = 0.20 / √10,000 = 0.20 / 100 = 0.002

The estimate therefore has a sampling standard error of 0.002 currency units, excluding model and numerical error. A quantum method with a comparable oracle and total implementation accuracy might require substantially fewer idealised queries, but this cannot be concluded from the formula alone. State preparation, hardware noise and verification must be measured experimentally.

4. Credit Risk and Capital Modelling

Credit risk concerns the possibility that a borrower or counterparty will fail to meet contractual obligations. A simple expected-loss identity is:

EL = PD × LGD × EAD

PD is probability of default, LGD is loss given default as a fraction of exposure, and EAD is exposure at default in currency units. The formula assumes these quantities are defined consistently and, in its simplest form, treats them as point estimates. More advanced models allow dependence between them and include time horizons and discounting.

For a portfolio of obligors, loss is often represented as:

L = ∑ᵢ EADᵢ LGDᵢ Dᵢ

where Dᵢ is a default indicator: Dᵢ = 1 if obligor i defaults and 0 otherwise. Portfolio capital may depend on a high percentile of the loss distribution rather than its mean. A risk measure such as value at risk at confidence level α is:

VaR_α(L) = inf{l : P(L ≤ l) ≥ α}

Quantum simulation could support estimation of default-loss distributions, especially where correlated defaults and many economic scenarios create a large sampling burden. Quantum optimisation could also assist loan selection, collateral allocation or recovery strategy. However, the quality of PD, LGD, EAD and dependence assumptions remains central.

5. Fraud Analytics

Fraud detection is generally a supervised, unsupervised or hybrid classification problem. A transaction may be represented by features such as amount, time, merchant, location, device, account history and network relationships.

A binary classifier estimates p(x) = P(Y = 1 | X = x), where Y = 1 denotes fraud and X is the feature vector. A threshold τ creates an alert when:

p(x) ≥ τ

The threshold should reflect the asymmetric costs of false positives and false negatives. Quantum kernel methods, variational classifiers and quantum-enhanced feature maps have been investigated for such tasks. At diploma level, the correct evaluation procedure is more important than the label “quantum.” The model should be compared with logistic regression, tree ensembles or neural networks using time-ordered validation and operational metrics.

Fraud data are usually highly imbalanced. Accuracy can therefore be misleading. Precision and recall are:

Precision = TP / (TP + FP)
Recall = TP / (TP + FN)

TP, FP and FN denote true positives, false positives and false negatives. A production evaluation should also examine alert volume, investigation cost, detection delay, calibration, fairness and performance under adversarial adaptation.

6. Insurance and Scenario Modelling

Insurers model claim frequency, claim severity, catastrophe exposure, lapse behaviour and investment risk. A compound aggregate-loss model is:

S = ∑i=1N Xᵢ

N is the random number of claims and Xᵢ is the severity of claim i. If frequency and severities are independent, then:

E[S] = E[N]E[X]

This identity requires identical severity expectations and independence between N and the Xᵢ values. Dependence, inflation, reinsurance and policy limits require extensions.

Scenario modelling generates joint outcomes for variables such as interest rates, inflation, mortality, catastrophe losses and asset returns. Quantum techniques may be explored for sampling correlated distributions, estimating tail probabilities or optimising reinsurance layers. A reinsurance decision can be framed as minimising expected cost plus a risk penalty, subject to solvency and coverage constraints.

Insurance applications require particular care because rare events are often precisely the events of greatest interest. A model that performs well on average may estimate the tail poorly. Quantum sampling claims must therefore be tested on tail accuracy, not only on average error.

7. An Integrated Illustrative Case

Background

The following is a fictional illustrative case. Meridian Mutual is a medium-sized insurer with an investment portfolio, motor and property claims, consumer payment activity and a requirement to assess one-year capital adequacy.

Problem

The organisation wishes to select a 20-asset investment portfolio, estimate a high-percentile aggregate loss and improve fraud triage. Its existing classical systems are reliable but computationally expensive when thousands of correlated economic and catastrophe scenarios are combined.

Analysis

The data science team first identifies three different problem classes rather than forcing one quantum solution onto all tasks:

  • portfolio selection is a constrained binary optimisation problem;
  • capital estimation is a scenario and tail-estimation problem;
  • fraud triage is a classification problem with severe class imbalance.

The team establishes classical baselines: mixed-integer optimisation for portfolio selection, quasi-Monte Carlo for capital estimation, and gradient-boosted trees for fraud. Historical data are divided chronologically to avoid leakage. Missing values, outliers and changes in claims coding are documented.

Approach and solution

For portfolio selection, the team constructs a QUBO with return, covariance, cardinality and sector penalties. It tests a quantum approximate optimisation prototype on reduced instances and compares solution quality, runtime and constraint violations with a classical solver.

For capital estimation, the team designs a small amplitude-estimation experiment using a simplified two-factor loss model. It reports oracle depth, state-preparation cost, statistical error and noise sensitivity rather than claiming production advantage.

For fraud, a small quantum-kernel experiment is evaluated against the tree baseline. The decision threshold is selected using the monetary cost of investigation and missed fraud. Human investigators retain authority over account restrictions.

Outcome

The prototype produces feasible portfolio candidates but does not outperform the classical optimiser on the full business instance. The quantum sampling experiment confirms the theoretical sampling concept but is too noisy and costly after state preparation. The quantum fraud model performs similarly to the classical model but is less interpretable and harder to validate.

Meridian therefore adopts a hybrid conclusion: classical production systems remain in operation, while quantum work continues as a controlled research programme focused on reduced optimisation subproblems and future fault-tolerant hardware.

Learning points

  1. Different financial tasks require different algorithmic families.
  2. A quantum speed-up must include encoding and data-loading costs.
  3. Feasibility, accuracy and governance matter as much as runtime.
  4. Classical baselines are essential.
  5. A pilot may generate strategic knowledge even when it does not yet create operational advantage.

8. Data, Model and Operational Risk

Data risk

Financial data may be incomplete, delayed, non-stationary, duplicated or biased toward previously detected events. Quantum encoding can amplify practical problems because numerical variables must be scaled, discretised and loaded into quantum states. Data lineage should record source, time period, transformations, units, missing-value treatment and access rights.

Model risk

Model risk is the possibility that a model is unsuitable, incorrectly implemented or misused. Quantum models add risks involving circuit compilation, approximation, noise, measurement error, random seeds, hardware drift and software-version changes. Validation should test:

  • conceptual soundness;
  • implementation correctness;
  • sensitivity to assumptions;
  • stability across samples and hardware runs;
  • comparison with challenger models;
  • explainability and limitations;
  • monitoring and escalation thresholds.

Cybersecurity and concentration risk

Quantum computing may eventually threaten some public-key cryptography, although this is distinct from using quantum algorithms for finance. Institutions should maintain cryptographic-agility programmes and assess migration to post-quantum cryptography. They should also avoid excessive dependence on one cloud provider, hardware vendor or proprietary quantum SDK.

9. Regulation, Ethics and Governance

Financial and insurance models operate within prudential, consumer-protection, privacy, anti-money-laundering and record-keeping requirements. Specific obligations vary by jurisdiction, but several governance principles are broadly applicable:

  • decisions must be traceable and reproducible;
  • customer data must be processed lawfully and securely;
  • material models require independent validation;
  • automated decisions need appropriate human oversight;
  • discriminatory outcomes must be tested and mitigated;
  • records must explain data, model version, parameters and decision logic;
  • performance claims must distinguish laboratory results from production evidence.

Quantum complexity is not a justification for opaque decision-making. If a quantum classifier cannot provide adequate evidence for an adverse credit, insurance or fraud decision, it may be unsuitable even if its predictive score is high. Governance committees should require a clear use case, risk assessment, validation plan, fallback process and exit criteria.

10. Best-Practice Implementation Roadmap

A responsible quantum-finance project can follow these stages:

  1. Select a material problem: identify a bottleneck with a measurable business value.
  2. Define the objective and constraints: express units, penalties, feasibility and risk tolerances explicitly.
  3. Build a classical baseline: use a strong, tuned method rather than a weak comparator.
  4. Reduce and encode the problem: document discretisation, scaling and qubit requirements.
  5. Prototype on simulators and hardware: measure noise, depth, shots, runtime and reproducibility.
  6. Validate economically: include data loading, cloud access, engineering and governance costs.
  7. Conduct independent review: assess assumptions, code, security, fairness and regulatory impact.
  8. Deploy only with controls: use monitoring, human review, fallback models and change management.

A useful scorecard includes solution quality, constraint satisfaction, confidence intervals, total cost, latency, interpretability, energy use and operational resilience. “Quantum advantage” should be defined in advance and measured against a relevant classical alternative.

11. Contemporary Developments and Future Direction

Near-term devices are noisy and have limited qubit counts, so hybrid algorithms and small problem instances dominate practical experimentation. Error mitigation may improve estimates but does not provide the same assurance as full error correction. Fault-tolerant quantum computers could make amplitude estimation and more complex simulation substantially more credible, but the timing and economic value remain uncertain.

The most realistic professional expectation is coexistence. Classical high-performance computing, machine learning, optimisation software and quantum processors may operate as components in a larger workflow. Quantum literacy will therefore include the ability to identify suitable subproblems, challenge exaggerated claims, communicate uncertainty and integrate experimental algorithms with established risk controls.

Chapter Summary

Finance and insurance contain optimisation, simulation and classification problems that are potentially relevant to quantum computing. Portfolio selection can be formulated as a QUBO, while derivative valuation and capital modelling depend on estimating expectations and tail probabilities. Amplitude estimation offers a theoretical improvement in sampling complexity, but state preparation, noise and measurement costs are critical. Credit risk uses concepts such as PD, LGD, EAD and aggregate loss; fraud analytics requires imbalance-aware evaluation; insurance modelling requires careful treatment of frequency, severity, dependence and rare events.

Quantum applications must be compared with strong classical baselines. Data quality, model assumptions, encoding choices, explainability, privacy, fairness, cybersecurity and regulatory validation are not secondary concerns. The most defensible strategy is a controlled hybrid approach with explicit business value, reproducible experiments, independent validation and human governance.

Key Terms

Quantum optimisation: Use of quantum states and measurements to search for solutions to optimisation problems.

QUBO: Quadratic unconstrained binary optimisation formulation using binary decision variables.

Ising model: Spin-based mathematical representation often used to encode binary optimisation.

Portfolio: Collection of financial assets held by an investor or institution.

Covariance matrix: Matrix describing pairwise variation and dependence among asset returns.

Risk aversion: Preference for lower risk, represented in a model by a risk penalty.

Monte Carlo simulation: Repeated random sampling used to estimate an expected value or distribution.

Amplitude estimation: Quantum method for estimating a probability amplitude or bounded expectation.

State preparation: Construction of a quantum state representing input data or a probability distribution.

Risk-neutral measure: Probability measure used in arbitrage-free derivative valuation.

Derivative: Financial contract whose value depends on an underlying asset or variable.

Probability of default: Estimated likelihood that an obligor defaults over a specified horizon.

Loss given default: Fraction of exposure lost when default occurs.

Exposure at default: Amount exposed to loss when default occurs.

Value at risk: Quantile-based measure of a loss distribution at a stated confidence level.

Fraud analytics: Use of data and models to identify potentially fraudulent activity.

Precision: Fraction of positive alerts that are true positives.

Recall: Fraction of actual positive cases that are detected.

Model risk: Risk of loss or poor decisions arising from incorrect or inappropriate models.

Quantum advantage: Demonstrated benefit of a quantum method over a relevant classical alternative for a defined task.

Review Questions

Short Answer Questions

  1. What is the role of the risk-aversion parameter in mean–variance portfolio optimisation?
  2. Why does classical Monte Carlo have square-root convergence?
  3. Define PD, LGD and EAD in credit risk.
  4. Why can accuracy be misleading in fraud detection?
  5. What is state preparation, and why can it limit quantum-finance applications?

Long Answer Questions

  1. Explain how a cardinality-constrained portfolio problem can be transformed into a QUBO. Discuss penalties, discretisation and feasibility.
  2. Compare classical Monte Carlo with amplitude estimation for derivative pricing, including theoretical complexity and practical limitations.
  3. Explain how quantum methods might support credit-risk and insurance scenario modelling.
  4. Discuss data risk, model risk and governance requirements for a quantum fraud-detection system.
  5. Design a responsible roadmap for evaluating a proposed quantum application in an insurance company.

Analytical / Application Questions

  1. A portfolio team must choose exactly four assets from ten while limiting sector exposure. Formulate the principal objective, constraints and penalty terms required for a QUBO, and explain how the result would be validated.
  2. An insurer claims that a quantum sampler reduces capital-estimation error tenfold. Identify the evidence required to test this claim, including classical benchmarks, state-preparation cost, confidence intervals and tail accuracy.
  3. A fraud model detects 95% of fraud but generates a very large number of false alerts. Explain how threshold selection, precision, recall, investigation cost, fairness and human review should be incorporated into the deployment decision.

Multiple Choice Questions with Answers

Question 1

In the mean–variance objective, what does λ primarily represent?

A. The number of assets

B. The investor’s risk-aversion parameter

C. The risk-free interest rate

D. The probability of default

Correct Answer: B. The investor’s risk-aversion parameter

Question 2

If a classical Monte Carlo estimator has standard error σ/√N, what happens approximately when N is multiplied by 100?

A. The standard error is multiplied by 100

B. The standard error is multiplied by 10

C. The standard error is divided by 10

D. The standard error becomes zero

Correct Answer: C. The standard error is divided by 10

Question 3

Which expression represents simple expected credit loss?

A. PD + LGD + EAD

B. PD × LGD × EAD

C. PD ÷ LGD × EAD

D. EAD − PD − LGD

Correct Answer: B. PD × LGD × EAD

Question 4

In a binary portfolio encoding, what does xᵢ = 1 usually indicate?

A. Asset i is excluded

B. Asset i is included

C. Asset i has zero variance

D. Asset i has defaulted

Correct Answer: B. Asset i is included

Question 5

Which metric is the fraction of positive alerts that are actually positive cases?

A. Recall

B. Specificity

C. Precision

D. Variance

Correct Answer: C. Precision

Question 6

What is a major practical limitation of quantum amplitude estimation?

A. It cannot represent expectations

B. It eliminates the need for probability models

C. State preparation and circuit implementation may be costly

D. It works only for deterministic payoffs

Correct Answer: C. State preparation and circuit implementation may be costly

Question 7

In the aggregate-loss model S = ∑Xᵢ, what does N normally represent?

A. The random number of claims

B. The discount rate

C. The number of assets in a portfolio

D. The confidence level

Correct Answer: A. The random number of claims

Question 8

Why are classical baselines essential in quantum-finance experiments?

A. They guarantee quantum advantage

B. They provide a relevant performance comparison

C. They remove all model risk

D. They replace data validation

Correct Answer: B. They provide a relevant performance comparison

Question 9

Which issue is especially important when evaluating a model for rare insurance events?

A. Only average-case accuracy

B. Tail accuracy and dependence assumptions

C. Eliminating all scenario variation

D. Using fewer observations automatically

Correct Answer: B. Tail accuracy and dependence assumptions

Question 10

Which governance practice is most appropriate for a material quantum financial model?

A. Deploying it without documentation because it is experimental

B. Removing human review to reduce latency

C. Independent validation, monitoring and a fallback process

D. Evaluating it only by the number of qubits

Correct Answer: C. Independent validation, monitoring and a fallback process

Applications of Quantum Computing
Chapter 9 of 15