WorksPhysics and Astronomy
Long-term yields of short-rate models as Feynman-Kac ground states: a variational quantum eigensolver with single-setting energy estimation on two NISQ platforms
Abstract
We show that the long-term yield of a short-rate model is the ground-state energy of a Schrodinger operator obtained from the Feynman-Kac bond-pricing equation, so that it can be computed by a variational quantum eigensolver (VQE). We treat the Vasicek, Cox-Ingersoll-Ross and Black-Karasinski models; the last has no closed form. Calibrated monthly to the U.S. Treasury curve from 1985 to 2026, the long-term yield follows the 30-year yield with an in-sample correlation of 0.98. The Hamiltonian is stoquastic, so its ground state is positive and the energy can be estimated from computational-basis samples with a single measurement setting. On ibm_cleveland, gate noise appears mainly as bit flips of the high-order qubits. A bit-flip deconvolution with a tail set fixed by a WKB criterion, combined with readout mitigation and zero-noise extrapolation, gives four-qubit estimates within 33-125 bp of the grid ground-state energies for all three models, and within 23-67 bp for Treasury-calibrated parameters. On IonQ Forte Enterprise the same analysis reduces the error in the same proportions. On the same circuits, a Pauli-measurement VQE deviates by 791-1,129 bp, so the single-setting estimator gives about ten times smaller errors with one setting instead of nine. An on-device VQE converges from 4,939 bp to 130 bp.
Introduction
Most proposals for quantum computing in finance address option pricing. Two approaches dominate. The first uses quantum amplitude estimation to accelerate Monte Carlo integration [1, 2]. The second maps the pricing partial differential equation onto a Schrödinger equation in imaginary time and evolves a variational state [3]. In this variational imaginary-time evolution, every time step requires the metric tensor and the energy gradient of the ansatz, which are measured with ancilla-controlled Hadamard tests [3, 26]. In both approaches the price is obtained from the time evolution of a specific initial state. On the other hand, the variational quantum eigensolver (VQE) [4] targets the ground state of a Hermitian operator. The ground state of the Black–Scholes operator carries no information on the option price. Therefore the VQE has found little use in derivative pricing.
In this work we identify a financial quantity that is a ground-state energy. For a short-rate model, the zero-coupon bond price satisfies a Feynman–Kac equation with the short rate as a potential. After a Lamperti transform and a similarity transform, the generator becomes a Schrödinger operator . For large maturity the bond price decays as . Hence the long-term yield equals the ground-state energy of . The variational imaginary-time evolution is a gradient flow that decreases the energy monotonically, and its limit is the ground state [26]. The long-term yield therefore needs only the endpoint of this flow, which the VQE targets directly, and none of the intermediate states. This spectral view of the term structure is well established in mathematical finance [5, 6, 7], and it is closely related to the path-integral formulation of interest-rate models in quantum finance [19, 20, 24]. It has not been used, to the author’s knowledge, as a target for quantum ground-state algorithms.
The Feynman–Kac Hamiltonian has a second useful property. All its off-diagonal elements are non-positive, that is, it is stoquastic [8]. By the Perron–Frobenius theorem (Theorem 1 in Section 4.1) its ground state can be chosen positive, . As a result, the energy can be estimated from computational-basis samples alone. Only one measurement setting is needed. This matches the time-based pricing of current superconducting processors, in which shots are inexpensive.
The contributions of this paper are as follows.
We formulate the long-term yield of one-factor short-rate models as the ground-state energy of a qubit Hamiltonian. We give the Lamperti and similarity transforms for the Vasicek, CIR and Black–Karasinski models and verify the CIR result against its closed form within bp.
We show that a shallow real-amplitude ansatz reproduces the grid ground state. In noiseless simulation the six-qubit error is 0.06 bp with 30 CNOT gates.
We introduce a single-setting energy estimator for stoquastic Hamiltonians. We diagnose that hardware gate noise appears mainly as bit flips of high-order qubits. We propose a tail constraint whose tail set follows from a WKB criterion without the exact solution, and we use it in a bit-flip deconvolution. Synthetic tests and an ablation show that the tail set carries most of the correction.
We demonstrate the method on the IBM processor ibm_cleveland for all three models. The four-qubit estimates agree with the grid ground-state energies within 33–125 bp in ten runs over two sessions. On the same circuits and under the conditions of § 5.3, their errors are about ten times smaller than those of a standard Pauli-measurement VQE. Following Kandala et al. [16], we also train the ansatz on the device, with the estimator as the cost function.
We calibrate the Vasicek and CIR models to the U.S. Treasury zero curve from 1985 to 2026. In sample, the long-term yield follows the 30-year market yield with a correlation of 0.98. With the parameters calibrated to the curve of October 2026, the hardware estimates agree with the grid ground-state energies within 23–67 bp, which demonstrates the complete chain from market data to a hardware estimate.
The paper is organized as follows. Section 2 derives the Feynman–Kac Hamiltonian and calibrates it to the U.S. Treasury curve. Section 3 describes the ansatz and the classical benchmarks. Section 4 develops the single-setting estimator and the error mitigation. Section 5 reports the hardware experiments. Sections 6–8 give the discussion, the limitations and the conclusion.
Feynman–Kac Hamiltonian and the long-term yield
Bond price as imaginary-time evolution
We assume a one-factor short-rate model under the risk-neutral measure,
Here is the short rate at time , is the drift, is the diffusion coefficient and is a standard Brownian motion. The zero-coupon bond price with maturity is . By the Feynman–Kac theorem, it satisfies
Here is the time to maturity, is the generator of the process (1) with the discount term , and the initial condition is the unit payoff at maturity.
Lamperti and similarity transforms
In order to obtain a constant diffusion coefficient , we introduce the Lamperti coordinate . By Itô’s lemma, has the drift and the diffusion . We then write with . By substituting this into (2), the first-derivative term cancels and we obtain with
Here is the effective potential, is the short rate expressed in the Lamperti coordinate, and . The operator is Hermitian with respect to the flat measure . Expanding in its eigenstates , we obtain
Here and are the eigenvalues and the normalized eigenfunctions of , with , and . Therefore the long-term yield equals the ground-state energy . The instantaneous forward rate [26] converges to the same limit. By (4), decays as , whereas the yield approaches as because of the constant prefactor in (4). Hence the spectral gap sets the rate at which the forward curve flattens, and fixes the long end of both the yield curve and the forward curve. This is the operator view of long-term risk of Hansen and Scheinkman [5] and the spectral expansion of Linetsky [6].
The same result follows from the path-integral form of the Feynman–Kac formula. Kac [18] showed that Feynman’s path integral [17] becomes a well-defined Wiener integral in imaginary time. The bond price is then a sum over short-rate paths,
Here denotes the measure over paths that start at , is the Euclidean action and . By expanding the square, the term gives the kinetic operator and the term enters the potential. The cross term is a total derivative. It gives the boundary factors of the similarity transform. The term is the Itô correction that arises when the path integral is discretized with the pre-point rule [19, 21]. The derivation is given in Appendix § 12. Hence the short rate acts as a potential accumulated along each path. In probabilistic terms, it is the killing rate of the diffusion, and is the asymptotic decay rate of the discounted weight. The long-term yield plays the role of the mass that is extracted from the decay of a Euclidean correlation function in lattice field theory. Path integrals and Hamiltonians for interest-rate models have been developed extensively by Baaquie and co-workers in quantum finance [19, 20, 24]. In this work we use the Hamiltonian as the target of a quantum ground-state algorithm.
Models
Vasicek [9]. Here and , so and . The potential
is a shifted harmonic oscillator with frequency . Here is the speed of mean reversion, is the long-run mean of the short rate and is the volatility. It can be shown that , which is the known long-term Vasicek yield.
Cox–Ingersoll–Ross [10]. Here and . The Lamperti coordinate is with and , where . We obtain
Here and have the same meaning as in the Vasicek model, is the volatility coefficient of , and is the parameter that appears in the closed-form CIR bond price. The first term is a centrifugal term. It is repulsive when , that is, when . This condition is slightly stronger than the Feller condition .
Black–Karasinski [11]. Here . With and , the potential is
Here is the long-run mean of , and and are the speed of mean reversion and the volatility of . The exponential term makes the problem non-affine, and no closed form for is known.
Throughout we use and a mean level of 5%. The volatilities are (Vasicek), (CIR, ) and (Black–Karasinski, ).
Calibration to the U.S. Treasury curve
In order to relate to market data, we calibrated the Vasicek and CIR models to the zero-coupon U.S. Treasury curve of Gürkaynak, Sack and Wright [28], which the Federal Reserve Board publishes daily. For each month from November 1985 to October 2026 (492 months), we fitted the parameters to the continuously compounded zero yields for maturities of 1 to 30 years, with the mean-reversion speed bounded by . The ground-state energy and the gap then follow from the Hamiltonian of Eq. (3). The details and the robustness checks are given in Appendix § 16.
Figure 1 shows the result. The curves are fitted with a median error of 7.5 bp for Vasicek and 8.3 bp for CIR. Over 41 years, follows the 30-year zero yield with a correlation of 0.98, and it lies above it by about 50 bp. This correlation reflects the in-sample consistency of the model-implied long-term yield with the calibrated curves; it is not an out-of-sample forecast of future yields. The gap has a median of 0.23 per year for Vasicek and 0.25 per year for CIR. This corresponds to a time scale of about 4 years for the flattening of the forward curve. The calibrated long-term yields range from about 2% to 11%. Hence the parameters used in the rest of this work, and a mean level of 5%, lie within the range observed in the market. The value of depends on the admissible range of and on the extrapolation of the model beyond 30 years, and the Black–Karasinski fit is unreliable at near-zero short rates (Appendix § 16). In § 5.6 we also evaluate the four-qubit circuits with the parameters calibrated to the curve of 16 October 2026 on quantum hardware.

Figure 1. Long-term yield of the Vasicek and CIR models calibrated monthly to the U.S. Treasury zero curve [28], November 1985 to October 2026, with . (a) together with the 30-year zero yield and the 30-year instantaneous forward rate. (b) versus the 30-year zero yield; the line is the diagonal.
Discretization and qubit encoding
We discretize on equally spaced points with spacing and Dirichlet boundaries. The second-order finite-difference Hamiltonian is
where () are the grid points, and are the diagonal and off-diagonal elements, and is the lower shift matrix with . Since , the operator is the generator of a continuous-time random walk on the grid, which hops to each neighbor at the rate , combined with the potential . Equation (9) is therefore the lattice counterpart of the continuum limit that leads from a random walk to the diffusion equation [25]. The grid index is encoded in binary on qubits, with qubit 0 as the most significant bit. The grid windows are (Vasicek) and (Black–Karasinski) about the potential minimum, with . For CIR the hardware grid is a window of standard deviations about the ground state, away from the wall; its truncation error is 0.1 bp.
The Pauli decomposition of at contains 79 strings for Vasicek. Of these, 16 are diagonal (the identity and 15 terms, since is quadratic in ) and 63 are off-diagonal. For CIR and Black–Karasinski the non-polynomial potentials give 64 diagonal strings. In general the kinetic term contributes off-diagonal strings. This growth motivates the single-setting estimator of Section 4.
Variational algorithm and classical benchmarks
Ansatz and optimization
The ground state of is real and positive. Hence we use a real-amplitude ansatz. Each of layers applies to every qubit and then a ladder of CNOT gates on the pairs . A final layer follows. The ansatz has parameters and CNOT gates, and it maps directly onto a linear chain of physical qubits. The four-qubit circuit with is shown in Appendix § 17. For the classical benchmarks we minimize the exact energy with L-BFGS. The gradient is obtained by adjoint differentiation, and we take the best of several random initializations.
Results
Figure 2 summarizes the Vasicek benchmark at . The VQE state coincides with the continuum ground state (Figure 2a). The energy error with respect to the grid ground state falls from 220 bp at to 3.3 bp at , 0.058 bp at (fidelity 0.99999963, 30 CNOT gates) and 0.0002 bp at (Figure 2b). At the VQE error is already below the discretization error of the grid, −2.4 bp. The discretization error converges as and reaches −0.14 bp at and −0.009 bp at (Figure 2c).

Figure 2. Vasicek benchmark (, , ) in noiseless simulation. (a) Ground-state amplitude from the six-qubit VQE with (dots) and the continuum Gaussian ground state (dashed). (b) VQE energy error with respect to the grid ground state versus the number of ansatz layers ; the dotted line marks the grid discretization error at six qubits. (c) Discretization error versus the number of qubits, with an reference slope.
Table 1 lists the results for the three models. The same code reproduces the closed-form CIR yield, which confirms the Lamperti and similarity transforms for a state-dependent diffusion. For Black–Karasinski the fine-grid value 5.17200% serves as the reference. At four qubits, three layers (9 CNOT gates) reproduce the grid ground state exactly for all three models. These four-qubit circuits are used on hardware in § 5.
| Model | Reference | , fine grid ( points) | 6 qubits: VQE () − grid | 6 qubits: grid − reference | 4 qubits: grid | 4 qubits: grid − reference |
| Vasicek | 4.77778% (closed form) | 4.77778% | +0.058 | −2.37 | 4.34843% | −42.9 |
| CIR | 4.93242% (closed form) | 4.93242% | +0.92 | −2.37 | 4.70775% | −22.5 |
| Black–Karasinski | none | 5.17200% | +0.12 | −3.53 | 4.52259% | −64.9 |
Table 1. Long-term yields in noiseless simulation. Errors are in basis points. The six-qubit CIR entries use a grid that starts at ; the four-qubit CIR entries use the windowed hardware grid of § 2.5.
Single-setting energy estimation for stoquastic Hamiltonians
The estimator
The off-diagonal element of is negative, so that is stoquastic. Moreover, is irreducible, since every grid point is coupled to its neighbors. We then use the following theorem [27].
Theorem 1 (Perron–Frobenius). Let be a real symmetric matrix whose off-diagonal elements are non-positive, and let be irreducible. Then the lowest eigenvalue of is nondegenerate, and its eigenvector can be chosen with strictly positive components.
The proof is given in Appendix § 14. By Theorem 1, the ground state is with for all , and the gap is strictly positive. For a measured distribution over the grid we define
Here is the measured probability of grid point , and the second sum runs over . This estimator needs only computational-basis samples, that is, one measurement setting. It is exact when . Moreover, is a normalized state for any distribution . By the variational principle, for every , including a finite-shot histogram. Therefore noise and sampling errors can only raise the estimate. We note that is the energy of the state with non-negative amplitudes. It is not, in general, the expectation value of in the prepared state , whose amplitudes may have arbitrary signs. For a stoquastic and , the first step of Appendix § 14 gives . Hence the estimator is a variational bound on for any prepared state, and it equals the energy of the prepared state when its amplitudes are non-negative. For a Hamiltonian that is not stoquastic, Eq. (10) does not apply.
The estimator is sensitive to probability that leaks into the tails. If a small weight appears where vanishes, the energy rises to first order by approximately . Since grows with the potential, leakage into the grid edges is the most harmful.
Readout mitigation
We prepare and on the same physical qubits and estimate, for each qubit, the probabilities and . For the tensored confusion matrix is inverted exactly. The resulting quasi-probabilities are projected onto the probability simplex.
Tail-constrained bit-flip deconvolution
In the binary encoding a flip of qubit moves the grid index by . The ground state is concentrated near the middle of the grid, at and . A single flip of the most significant qubit therefore sends this weight to and , where is largest. We model the residual gate noise as independent effective bit flips,
Here is the distribution before the effective bit flips, is the measured distribution, both in bit order, and is the flip matrix of qubit with flip probability . The rates are not known. We fix them by the requirement that the deconvolved distribution vanishes on a tail set , where the true ground-state weight is negligible. We obtain without the exact solution, from a WKB criterion,
where is the WKB action from the potential minimum to the grid point , , and is an energy estimate from the same run. We use the estimate after a uniform noise-floor subtraction. An overestimated shrinks , so the criterion is conservative. For all configurations of this work contains at least bins and its true weight is below . We then solve
where the sum runs over the tail set and the upper bound on keeps the inverse well conditioned. Finally we project the deconvolved vector onto the simplex. As a simpler baseline we also report a uniform floor subtraction. It estimates the floor from the smallest bins and subtracts it.
The threshold in Eq. (12) was fixed for all runs before the hardware data were analyzed. Both the deconvolution and the floor subtraction return a probability distribution, so that the bound of Section 4.1 is preserved. Appendix § 15 separates the contributions of the flip model and of the tail set. On synthetic data with known flip rates, the deconvolution recovers the flip rates of the two most significant qubits within 0.12 percentage points and reduces the energy error from 760–2,150 bp to 10–36 bp. Applied to the exact ground state, it changes the energy by less than 8 bp. On the hardware data, a plain truncation of the tail set followed by renormalization gives errors comparable to, or smaller than, those of the deconvolution. Hence most of the correction comes from the tail set, that is, from locating without the exact solution the bins where the true weight is negligible. The flip model does not consistently outperform a direct truncation of the tail set. The deconvolution uses the same tail set within a physical noise model. It returns flip rates that can be compared across runs and platforms, and it moves the removed weight back to the bins from which it leaked.
Zero-noise extrapolation
We amplify the two-qubit noise by CNOT folding, with [12, 13]. Barriers between the folded gates prevent cancellation by the transpiler, and all folded circuits use the same physical qubits. The main result is the linear extrapolation through and . The quadratic extrapolation through , and is reported as a check.
Hardware experiments
Setup
The experiments were performed on the IBM superconducting processor ibm_cleveland in two sessions on 17 October 2026 (KST), using the Qiskit Runtime Sampler (qiskit 2.5.2, qiskit-ibm-runtime 0.50.0). Gate twirling and XpXm dynamical decoupling were enabled. Measurement twirling was disabled to keep the readout calibration consistent. The ansatz parameters were trained classically (§ 3). The four-qubit circuits ran on the linear chain of physical qubits (24, 23, 22, 21) and the six-qubit circuit on (24, 23, 16, 3, 2, 1). After transpilation the circuits contained 9, 27 and 45 two-qubit gates for at , 3 and 5; 6, 18 and 30 for ; and 30, 90 and 150 for the six-qubit circuit. The measured readout errors were 0.1–1.0% per qubit for the four-qubit chain and at most 1.3% for the six-qubit chain.
The first session had three stages. Stage A evaluated the four-qubit circuits for Vasicek ( and ), CIR and Black–Karasinski with shots per circuit. Stage B repeated the four-qubit Vasicek circuit and evaluated the six-qubit Vasicek circuit with shots per circuit. Stage C trained the four-qubit Vasicek ansatz on the device (§ 5.4). Each readout calibration used shots per circuit. The total QPU time was 69.8 min (A 6.2 min, B 27.6 min, C 35.9 min), which corresponds to about 274 per shot.
The second session started about 15 hours after the first. Stage D repeated the four-qubit circuits on the same physical qubits, together with two alternative encodings (§ 6). Stage E measured the same trained circuits with a standard Pauli-measurement estimator. Stage F repeated the binary circuits once more with automatic qubit selection. The second session used 34.0 min of QPU time (D 13.9 min, E 10.8 min, F 9.3 min). A third session on 25 October 2026 evaluated circuits with parameters calibrated to the U.S. Treasury curve (§ 5.6).
Trained-circuit evaluation
Table 2 lists the energy errors after each step of the analysis. Readout mitigation alone leaves errors of 566–1,139 bp at four qubits. Since the readout errors are small, the remaining error is due mainly to gate noise. The uniform floor subtraction combined with zero-noise extrapolation reduces the error to 125–330 bp. The bit-flip deconvolution combined with zero-noise extrapolation reduces it further to 33–115 bp, which is a relative error of 0.7–2.5%. At the same time the distribution fidelity increases from 0.962–0.980 to 0.987–0.996.
| Configuration | Shots per circuit | Readout-mitigated | Floor subtracted | Floor + ZNE | Deconvolved | Deconvolved + ZNE | Fidelity (mitigated → deconvolved) |
| CIR, , | +686 | +273 | +125 | +56 | +33 | 0.980 → 0.996 |
Table 2. Hardware results on ibm_cleveland, session 1. Energy errors are in basis points; fidelity is the Bhattacharyya overlap with at . ZNE is linear through and 3.
| Configuration | Shots per circuit | Readout-mitigated | Floor subtracted | Floor + ZNE | Deconvolved | Deconvolved + ZNE | Fidelity (mitigated deconvolved) |
| Vasicek, , | +566 | +285 | +200 | +89 | +43 | 0.977 0.993 | |
| Vasicek, , | +788 | +328 | +214 | +133 | +89 | 0.966 0.990 | |
| Vasicek, , | +704 | +293 | +179 | +144 | +101 | 0.967 0.989 | |
| Black–Karasinski, , | +1,139 | +449 | +330 | +118 | +115 | 0.962 0.987 | |
| Vasicek, , | +1,388 | +1,080 | +403 | +971 | +518 | 0.962 0.987 |
Table 7 (PDF p. 10).
Figure 3a shows the origin of the residual error for the Vasicek circuit with shots. The leaked probability is not uniform. It is concentrated on single-bit-flip neighbors of the peak states (0111) and (1000), in particular on and , which are reached by a flip of the most significant qubit. The fitted flip rates are from the most to the least significant qubit. The deconvolution removes the edge weight while it leaves the central bins unchanged. The fidelity extrapolated to is 0.982 before deconvolution. This indicates a noise component that does not scale with CNOT folding, which explains why zero-noise extrapolation alone cannot remove the bias.

Figure 3. Figure 3. Hardware results on ibm_cleveland. (a) Vasicek, four qubits, shots, : exact (line), readout-mitigated distribution (filled circles) and bit-flip-deconvolved distribution (open squares), on a logarithmic scale. Arrows mark the leakage 7 15 and 8 0 by a flip of the most significant qubit. (b) Deconvolved energy error versus the CNOT folding factor for the four-qubit circuits; open diamonds are the linear extrapolations to . (c) On-device SPSA training of the four-qubit Vasicek ansatz: hardware objective and noiseless energy of the current parameters.
Figure 3b shows the deconvolved energy versus . For Black–Karasinski the dependence on is weak (118, 123 and 133 bp), whereas for the other circuits it is close to linear between and 3. For the six-qubit circuit the deconvolution reduces the error only from 1,080 to 971 bp at . At the kinetic coefficient is 18 times larger than at . Hence local roughness of between neighboring bins is strongly amplified, and this roughness is not of the bit-flip form. On the other hand, a plain truncation of the WKB tail set, which assumes no noise model, reduces the error to 216 bp at and to 77 bp after extrapolation (Appendix § 15). The true ground-state weight in this tail set is .
Reproducibility and comparison with Pauli-measurement VQE
Table 3 collects the deconvolved and extrapolated errors of the binary-encoded four-qubit circuits from all runs. Over ten runs in two sessions the errors range from 33 to 125 bp, with a mean of 90 bp. The Black–Karasinski result is the most stable (111–125 bp). The CIR result varies most (33–120 bp).
In stage E we measured the same trained circuits, on the same physical qubits and in the same session, with the Qiskit Runtime Estimator. The Hamiltonian was decomposed into Pauli strings and grouped into nine qubit-wise commuting groups for each model. Each group was measured with shots, with TREX readout mitigation, and in a second run with TREX and zero-noise extrapolation (noise factors 1, 3 and 5, linear extrapolation). Table 4 compares the results.
| Model | Pauli, TREX | Pauli, TREX + ZNE | , readout-mitigated | , deconvolved + ZNE |
| Vasicek | +1,290 ± 55 | +791 ± 164 | +759 | +96 |
| CIR | +1,525 ± 158 | +1,129 ± 475 | +663 | +69 |
| Black–Karasinski | +1,499 ± 75 | +959 ± 233 | +1,124 | +111 |
Table 4. Pauli-measurement VQE versus the estimator on the same circuits (session 2, ibm_cleveland). Energy errors in bp; ± values are the standard errors reported by the Estimator. The two pipelines used different shot budgets and mitigation protocols (see text), and the comparison refers to these conditions.
The readout-mitigated estimator alone is already closer to than the Pauli estimator with TREX. With deconvolution and extrapolation, the error of the pipeline is about ten times smaller than that of the Pauli estimator with TREX and ZNE. The two pipelines do not use identical resources. The Estimator runs used shots each with the built-in TREX and ZNE of Qiskit Runtime, whereas the values use shots per folding factor and the analysis of Section 4. The statistical errors of the Estimator (55–475 bp) are much smaller than its bias, so the difference is not a sampling effect. The factor of ten therefore refers to these experimental conditions. It also costs less: one measurement setting per circuit instead of nine, and 1.5 min of QPU time per model including folding and readout calibration, against 3.6 min for the two Estimator runs. The advantage follows from Section 4.1. The Pauli estimator sums many terms with large and partly cancelling coefficients, whereas the estimator uses one distribution, and its errors can be traced to leakage into identifiable bins.
On-device VQE
Following the hardware-efficient VQE of Kandala et al. [16], we trained the four-qubit Vasicek ansatz on the device in stage C, using SPSA [14] with the estimator as the cost function. Specifically, the cost was the floor-subtracted energy of the readout-mitigated distribution at . Each SPSA iteration evaluated the two perturbed parameter sets in one job with shots each. We used the standard gain sequences with exponents 0.602 and 0.101, a perturbation size of 0.15 rad and a first step calibrated to 0.15 rad. The readout was recalibrated every 50 iterations. The initial parameters were the classically trained values plus Gaussian perturbations with a standard deviation of 0.3 rad, which gives a noiseless energy error of 4,939 bp and a fidelity of 0.722.
After 150 iterations (172 jobs, 35.9 min of QPU time) the noiseless energy error of the trained parameters is 130 bp and the fidelity is 0.987 (Figure 3c). The hardware objective decreases from 3,632 bp to 303 bp. The difference between the two curves is the noise bias of the hardware cost function. The bias does not prevent convergence, since it changes slowly with the parameters. The logical and compiled circuits and the parameters before and after training are given in Appendix § 17.
Cross-platform check on a trapped-ion processor
In order to test whether the results depend on the hardware platform, we evaluated the trained four-qubit Vasicek circuit on the IonQ trapped-ion processor Forte Enterprise (qpu.forte-enterprise-1) on 18 October 2026 (KST). The circuit was the same binary-encoded circuit used on ibm_cleveland, with nine CNOT gates. It was compiled to the IonQ QIS gate set without optimization (qiskit-ionq 1.1.1) and submitted through the IonQ Cloud API with debiasing disabled, as on IBM. We did not use zero-noise extrapolation, since the IonQ compiler may cancel folded gate pairs. The comparison is therefore made at . We performed two runs, with 500 and 5,000 shots for the circuit. Each run had its own readout calibration with and circuits of 500 shots each.
The analysis used the raw shot histograms returned by the IonQ API. For the calibration circuits, the probability vectors returned by the same API omitted the low-weight outcomes, and their sums were 0.990 and 0.968 in the two runs. The histograms contain all shots. A histogram gives the number of shots of each outcome, keyed by the integer value of the bit string with qubit 0 as the least significant bit. We converted it to the bit order of § 2.5 before the analysis. The calibration showed no error in either run. For the per-qubit readout errors were 0.2–0.4% in the first run and 0.4–1.0% in the second run, comparable to 0.1–1.0% on ibm_cleveland. A test of homogeneity on the 16 outcome counts of the two runs (15 degrees of freedom) gives and . Hence the test detects no difference between the two runs; this does not establish that the underlying distributions are equal. The bit-flip rates fitted by the deconvolution in the second run are 2.2% and 1.4% for the two most significant qubits, against 1.7% and 1.3% on ibm_cleveland.
| Platform, run, shots | Floor-subtracted | Deconvolved | Fidelity | |
| IonQ Forte Enterprise, run 1, 500 | +935 ± 243 | +444 ± 184 | +246 ± 107 | 0.954 |
| IonQ Forte Enterprise, run 2, 5,000 | +1,021 ± 117 | +420 ± 95 | +254 ± 53 | 0.956 |
| ibm_cleveland, session 1, | +704 | +293 | +144 | 0.967 |
| ibm_cleveland, session 1, | +788 | +328 | +133 | 0.966 |
Table 5. Vasicek four-qubit circuit on IonQ Forte Enterprise and ibm_cleveland at , after readout mitigation. Energy errors in bp. For IonQ, the ± values are standard deviations over 400 bootstrap replicates, in which the circuit histogram and the calibration histogram are resampled multinomially.
On both processors the analysis reduces the error in the same proportions. The floor subtraction removes about 60% of the readout-mitigated error on both platforms. The deconvolution leaves 25% of it on IonQ and 17–20% on ibm_cleveland. The readout-mitigated IonQ error of run 2 is larger by about 250 bp, which is about two standard deviations. The deconvolved errors differ by about 115 bp, also about two standard deviations. Hence the bias structure of § 5.2, which is leakage by effective flips of the high-order qubits, appears on both platforms with similar flip rates. We do not attribute the residual difference to the hardware. The IonQ runs used 500 and 5,000 shots with 500-shot readout calibrations, whereas the IBM runs used – shots with -shot calibrations. A difference of two standard deviations at these sample sizes is not sufficient to rank the two processors.
Treasury-calibrated circuits
In order to connect the hardware pipeline with market data, we repeated the evaluation of § 5.2 with parameters calibrated to the U.S. Treasury curve of 16 October 2026 (§ 2.4 and Table E1). The mean-reversion speed was bounded by . The volatility of the Vasicek model was fixed at the realized volatility of the 1-year yield over the preceding year, 53 bp per year, and the CIR and Black–Karasinski volatilities were chosen to give the same absolute volatility at the mean short rate of that year (3.86%). The calibrated parameters are , and for Vasicek; , and for CIR; and , and for Black–Karasinski. All three models fit the 1–30 year yields with an error of 6 bp and give a continuum long-term yield of 5.90–5.91%, against a 30-year zero yield of 5.46%. The four-qubit circuits (, nine CNOT gates) were trained classically and reproduce the grid ground states with a fidelity of 1.0000. They were evaluated in a third session on 25 October 2026 (KST), on the same physical qubits (24, 23, 22, 21) and with the same settings as stage A (qiskit 2.6.1, qiskit-ibm-runtime 0.51.0). The three models used 4.7 min of QPU time.
| Date | 1-y yield | 30-y yield | 30-y forward | Vasicek | CIR | Black–Karasinski | RMSE |
| 1985-11-29 | 7.79 | 10.65 | 11.36 | 11.01 | 10.98 | 10.97 | 5 / 5 / 6 |
| 1994-12-30 | 7.25 | 7.88 | 7.92 | 7.90 | 7.90 | 7.86 | 1 / 1 / 4 |
| 2000-01-31 | 6.29 | 6.26 | 5.41 | 5.51 | 6.21 | 5.82 | 3 / 7 / 4 |
| 2007-06-29 | 4.92 | 4.81 | 3.28 | 4.63 | 5.02 | 5.10 | 10 / 11 / 12 |
| 2012-07-31 | 0.18 | 2.67 | 2.47 | 3.83 | 4.10 | 2.79 | 12 / 16 / 108 |
| 2020-08-31 | 0.15 | 1.67 | 2.44 | 2.49 | 2.30 | 1.76 | 6 / 10 / 45 |
| 2023-10-31 | 5.32 | 5.06 | 4.40 | 5.29 | 5.29 | 5.18 | 12 / 12 / 13 |
| 2026-10-16 | 4.49 | 5.46 | 4.66 | 5.91 | 5.91 | 5.91 | 6 / 6 / 6 |
Table E1. Calibration to the U.S. Treasury zero curve on selected dates (). Rates in %; RMSE is the root-mean-square fitting error over the 1–30 year yields, in bp, for Vasicek / CIR / Black–Karasinski.
Table 6 lists the results. As in the rest of § 5, the errors refer to the four-qubit grid ground-state energies, not to market yields or to the continuum long-term yields. The analysis reduces the error from 86–657 bp after readout mitigation to 23–67 bp after deconvolution and extrapolation. These values lie at the lower end of the range of Table 3 (33–125 bp). Part of the improvement is due to the parameters. The calibrated volatilities are smaller than those of § 3, and the energy shift caused by a 1% flip of the most significant qubit is reduced from 358–557 bp to 110–297 bp. The CIR circuit is the least sensitive (110 bp), and its readout-mitigated error is accordingly small (86 bp). For Vasicek the fitted flip rates of the two most significant qubits are 2.1% and 3.2%, compared with 1.7% and 1.3% in session 1. The bias therefore has the same structure as in § 5.2.
| Model | Session 1 | Session 2, same qubits | Session 2, automatic qubit selection | Range |
| Vasicek | +101; +89 ( shots) | +96 | +44 | 44–101 |
| CIR | +33 | +69 | +120 | 33–120 |
| Black–Karasinski | +115 | +111 | +125 | 111–125 |
Table 3. Reproducibility of the deconvolved and extrapolated energy error (bp) for the binary-encoded four-qubit circuits. Shots per circuit are unless noted.
| Model | (%) | (%) | Readout-mitigated | Floor + ZNE | Deconvolved | Deconvolved + ZNE | Fidelity (mitigated → deconvolved) |
| Vasicek | 5.692 | 5.911 | +657 | +45 | +134 | +67 | 0.942 → 0.987 |
| CIR | 5.801 | 5.911 | +86 | 0 | +46 | +23 | 0.989 → 0.993 |
| Black–Karasinski | 5.550 | 5.898 | +448 | +152 | +67 | +63 | 0.960 → 0.986 |
Table 6. Treasury-calibrated four-qubit circuits on ibm_cleveland (session 3, 25 October 2026, shots per circuit). and are the grid and continuum ground-state energies. Energy errors in bp; fidelity at . ZNE is linear through and 3.
The hardware estimates of the long-term yield are 6.37%, 6.03% and 6.18% for the three models. The grid error at is −11 to −35 bp and has the opposite sign to the hardware bias. Hence the hardware estimates differ from the continuum values by only 12–45 bp. We do not rely on this partial cancellation, since the two errors have different origins. On the other hand, the hardware error is of the same order as the spread of among the three models on the dates of Table E1 and as the calibration uncertainty discussed in Appendix § 16. The complete chain from the market curve to a hardware estimate of the long-term yield thus works with the present four-qubit circuits.
Discussion
The long-term yield is a natural target for ground-state algorithms for three reasons. First, it is exactly a ground-state energy, not a property of a time-evolved state. Second, the Feynman–Kac Hamiltonian is stoquastic, so that a single computational-basis measurement setting suffices. Third, the estimator is a variational upper bound for any measured distribution. Readout mitigation with simplex projection and the bit-flip deconvolution both return distributions, and therefore they preserve this bound. Only the zero-noise extrapolation can cross below .
The hardware data show that the structure of the noise matters more than its magnitude. For the binary-encoded circuits, the leaked weight is described by effective bit flips of the high-order qubits. The fitted flip rates reproduce the measured bias: 727, 613 and 1,090 bp predicted against 759, 663 and 1,124 bp measured for Vasicek, CIR and Black–Karasinski in session 2.
We tested in stage D whether this structure can be removed at the level of the encoding. In a Gray encoding, a flip of the most significant qubit reflects the grid about its center and maps the peak onto itself. We also optimized the grid-to-bitstring permutation to minimize the first-order bias for a uniform flip rate , where is the energy sensitivity of qubit derived from the exact identity
Here is the deviation of the measured amplitude from the exact ground-state amplitude. Since is positive semidefinite, Eq. (14) also shows directly that . The sensitivity follows by expanding to first order in the flip rate of qubit . Both encodings keep stoquastic, and the three-layer ansatz with nine CNOT gates still prepares their ground states exactly. On hardware, the Gray encoding improved the floor-subtracted and extrapolated errors for Vasicek (+100 versus +195 bp) and CIR (−30 versus +130 bp), but not for Black–Karasinski (+244 versus +183 bp). The optimized encoding was worse than the binary one for all three models. The total leaked weight did not decrease, and the flip model fitted to one encoding did not predict the bias of the others. We conclude that the effective flip structure belongs to the trained circuit rather than to the device alone. A noise-aware encoding therefore requires a circuit-level noise model, which we leave for future work. A higher-order or spectral kinetic operator would reduce the number of qubits for a given discretization error, but it introduces positive off-diagonal elements and breaks the stoquastic structure.
The spectrum of carries more information than . The gap sets the rate at which the forward curve approaches , and the low-lying states give the spectral expansion of the term structure [6]. These states can be obtained with excited-state extensions of the VQE. The same Hamiltonian also governs long-dated path-dependent quantities. For a functional with , such as the occupation time of a range of rates, the Laplace-transformed price leads to the operator [19, 21]. This operator is stoquastic for , and therefore the estimator of § 4 applies without change (Appendix § 13). In contrast, the direct partial differential equation for the arithmetic Asian option has a time-dependent and non-Hermitian generator. Its solution is then not a projection onto a ground state [3, 26].
For one-factor models a classical eigensolver on a fine grid is inexpensive, and we use it as the reference. Calibrated to the U.S. Treasury zero curve from 1985 to 2026, the ground-state energy follows the 30-year yield with an in-sample correlation of 0.98 and lies above it by about 50 bp (§ 2.4). The motivation for the quantum formulation is the multi-factor case. A -factor model requires qubits, while a classical grid requires points. In dimensions the diffusion term is with the metric [21]. A global Lamperti transform to a constant diffusion requires, in particular, that this metric be flat [22]. Otherwise the kinetic operator becomes a Laplace–Beltrami operator with curvature corrections. Market data also show fat tails and jumps that a one-factor diffusion does not capture [25]. A jump component adds a non-local term to the generator. Since jump rates are non-negative, the corresponding off-diagonal elements of are non-positive, and remains stoquastic. It is Hermitian after the similarity transform when the jump kernel satisfies detailed balance. In that case the Hamiltonian is no longer tridiagonal, but the estimator of Section 4 still applies with the additional off-diagonal terms. Non-affine multi-factor models, such as shadow-rate models with a zero lower bound, have no closed form. When the drift is reversible, their generators are symmetrizable in the same way as in Section 2, and the Hamiltonian remains stoquastic. In that regime the ground state is concentrated on a small part of the grid. Sample-based quantum diagonalization [15], which diagonalizes in the sampled support, then becomes a natural complement to the estimator of Section 4.
Limitations
All models in this work are one-factor models, for which classical solvers are inexpensive. The hardware results demonstrate the method; they do not claim a computational advantage.
The hardware errors are measured with respect to the ground state of the same grid. At four qubits the discretization error with respect to the continuum ( to bp) is comparable to the hardware error. A quantitative continuum result requires more qubits or a higher-order discretization.
At six qubits the bit-flip deconvolution gives 518 bp after extrapolation, since the leaked weight is not of the bit-flip form. A plain truncation of the tail set gives 77 bp after zero-noise extrapolation (216 bp at ), but it rests on no noise model, and its accuracy at larger remains to be established.
The tail set relies on the design condition that the grid is wide enough for the ground state to vanish near its edges. The WKB criterion verifies this condition from the potential, but it is approximate. The corrected energy depends on the threshold of Eq. (12); thresholds of and give larger errors than (Appendix § 15).
The bit-flip model is phenomenological. It captures the dominant leakage of the binary-encoded circuits, but it is specific to the trained circuit and does not transfer to other encodings (§ 6). It does not describe coherent or correlated errors. The linear zero-noise extrapolation assumes that the bias is linear in the folding factor between and 3.
The superconducting data come from one processor in three sessions, including the Treasury-calibrated evaluation. The trapped-ion check covers one model at without zero-noise extrapolation, with readout calibrations of 500 shots.
The extension to multi-factor models requires a symmetrizable, that is reversible, drift. This condition must be checked for each calibrated model.
The Treasury calibration is in sample. The calibrated long-term yield depends on the one-factor model, on the bound on and on the extrapolation beyond 30 years, and the Black–Karasinski fit is unreliable on some near-zero-rate dates (Appendix § 16).
Conclusion
We have shown that the long-term yield of a short-rate model is the ground-state energy of a stoquastic Schrödinger operator obtained from the Feynman–Kac equation. This makes the long-term yield a natural target for the VQE. In noiseless simulation, a six-qubit real-amplitude ansatz reproduces the grid ground state within 0.06 bp for the Vasicek model, and the same formulation reproduces the closed-form CIR yield and gives the Black–Karasinski yield, for which no closed form exists. Since the Hamiltonian is stoquastic, the energy can be estimated from computational-basis samples alone. On ibm_cleveland we identified bit flips of high-order qubits as the dominant source of bias and removed most of it by a tail-constrained bit-flip deconvolution. The four-qubit hardware estimates agree with the grid ground-state energies within 33–125 bp for all three models in ten runs over two sessions. On a trapped-ion processor the same pipeline reduces the error of the Vasicek circuit from 1,021 to 254 bp at , in the same proportions as on ibm_cleveland, which shows that the bias structure is not specific to one platform. On the same circuits and under the conditions of § 5.3, its error is about ten times smaller than that of a Pauli-measurement VQE with readout mitigation and zero-noise extrapolation, at a lower measurement cost. At six qubits a truncation of the WKB tail set gives 77 bp after zero-noise extrapolation. An on-device VQE converges from 4,939 bp to 130 bp. Calibrated to the U.S. Treasury curve over 41 years, the long-term yield follows the 30-year market yield closely. With the parameters calibrated to the curve of October 2026, the hardware estimates agree with the grid values within 23–67 bp, so that the complete chain from the market curve to a hardware estimate of the long-term yield has been demonstrated. The extension to multi-factor and non-affine models, together with sample-based quantum diagonalization, is the subject of future work.
Acknowledgments
This work was supported by Korea National Research Foundation (NRF) grant No. NRF-2026-25612745, ICT R&D program of IITP-2023-2021-0-01810, RS-2023-00225385, AFOSR grant FA2386-22-1-4052. The work was partly supported by the Cleveland Clinic Quantum Start-up Catalyzer Program and Amazon Web Services. The author acknowledges the use of IBM Quantum services for this work through the Cleveland Clinic’s Quantum Start-up Catalyzer Program. The views expressed are those of the author, and do not reflect the official policy or position of IBM or the IBM Quantum team. This work was also supported by the National Quantum Laboratory at Maryland (QLab). The author acknowledges QLab for providing quantum computing resources on IonQ devices for this work. The views expressed are those of the author, and do not reflect the official policy or position of IonQ. D. Ahn is a co-founder of Singularity Quantum Inc. and holds an equity interest in the company.
Data availability
Raw IBM counts of all three sessions, raw IonQ shot histograms, job identifiers, trained parameters and the analysis code will be made publicly available in Figshare with a DOI upon publication. The repository will also contain the compiled circuit of every IBM job of sessions 1 and 2 and the submitted circuit of every IonQ job, together with scripts that reproduce the hardware tables.
Declaration of generative AI and AI-assisted technologies in the manuscript preparation process
During the preparation of this work, the author used Claude (Anthropic) and ChatGPT (OpenAI) to assist in writing the analysis and job-submission code, in the data analysis, and in drafting and editing the text. After using these tools, the author reviewed and edited the content as needed and takes full responsibility for the content of the published article.
Path-integral derivation of the Feynman–Kac Hamiltonian
In this appendix we derive Eq. (3) from the discretized path integral, following the constructions of Baaquie [19] and Linetsky [21]. In the Lamperti coordinate the short rate follows . We divide the interval into steps of length and write with . In the pre-point (Itô) discretization the short-time transition density is Gaussian. The bond price is then the limit of a finite-dimensional integral,
where . In the limit the sum becomes the Euclidean action of Eq. (5). By expanding the square, we obtain
The last sum is a stochastic integral in the pre-point form. In order to evaluate it, we expand to second order and use the Itô rule . Then
and the last sum equals . As a result,
where is the potential of Eq. (3). Here the term appears as the Itô correction of the pre-point rule. A mid-point (Stratonovich) discretization gives the same Hamiltonian. In that case the stochastic integral has no correction term, and the same term arises from the normalization of the short-time propagator [21]. The remaining path integral is the Euclidean propagator of the operator of Eq. (3). Therefore
which is Eq. (4) after the expansion of in the eigenstates of .
Two remarks connect this result with familiar cases. First, the kinetic term is the action of a free particle with mass (with ). Hence is the Schrödinger operator of a particle of mass in the potential . Baaquie made this identification for the Black–Scholes equation, with mass [23]. Second, for a constant drift and a constant rate , we have and . The action then separates into the free action, the boundary term and the constant . This is the decomposition of the Black–Scholes action given in Ref. [21]. The similarity transform of § 2.2 is the generalization of this decomposition to a state-dependent drift.
Long-dated path-dependent functionals
We consider a functional with . Examples are the occupation time of a range of rates, , and the time-averaged rate. For the Laplace transform
is a bond price in which the short rate is replaced by [19, 21]. Prices of claims that depend on are obtained from by an inverse Laplace transform. By the derivation of § 2, is governed by the operator , and
where is the ground-state energy of . The function determines the long-maturity behavior of the functional. In particular, , and by the Hellmann–Feynman theorem is the long-run mean of under the measure defined by the ground state.
The perturbation is diagonal and real. Hence has the same off-diagonal elements as , and it remains stoquastic for every . The ground state of is positive, and can be estimated from computational-basis samples by Eq. (10) with replaced by . On the other hand, the Fourier representation used for functionals that are not positive leads to an imaginary potential. The resulting operator is not Hermitian, and it lies outside the scope of the present method.
Proof of Theorem 1
Let be a normalized eigenvector of with the eigenvalue , and let denote the vector with the components . Since for , we have . Therefore
Since is normalized, the variational principle gives . Hence the equality holds, and is also an eigenvector with the eigenvalue .
Next we show that has no zero component. Suppose that . The -th component of gives
Each term is non-positive. Therefore for every with . By repeating this argument and using the irreducibility of , we reach every grid point, and we obtain . This contradicts the normalization. Hence for all . The same argument applies to any eigenvector with the eigenvalue that has non-negative components.
Finally, we consider . It is a linear combination of eigenvectors with the eigenvalue , and for all . If , then is strictly positive. If , then is an eigenvector with non-negative components, and therefore for all . In this case , that is, for all . As a result, every eigenvector with the eigenvalue has the same sign in all its components. Two such eigenvectors cannot be orthogonal, since their inner product is a sum of terms of one sign. Therefore is nondegenerate, and its eigenvector can be chosen with strictly positive components. This completes the proof.
For the tridiagonal Hamiltonian of Eq. (9), for all , and therefore is irreducible. The Gray and optimized encodings of § 6 only permute the basis states. They preserve both the sign structure and the irreducibility, so that Theorem 1 applies to them as well.
Validation and ablation of the tail-constrained deconvolution
In this appendix we separate the contributions of the bit-flip model and of the tail set. All energies are errors in bp, and all tail sets use the threshold of Eq. (12) unless stated otherwise.
Synthetic data. We apply independent bit flips with known rates to the exact grid ground state, add a uniform floor of 0.5%, and analyze the result as in § 4. Table D1 lists the results for two sets of rates. The deconvolution recovers the flip rates of the two most significant qubits within 0.12 percentage points, and it reduces the energy error to 10–36 bp. For CIR it also assigns spurious rates of 0.6–3% to the low-order qubits, but these have little effect on the energy. Applied to the exact ground state without noise, the deconvolution changes the energy by 1.7, 2.9 and 7.8 bp for Vasicek, CIR and Black–Karasinski.
| Model | (true) | Noisy | Floor-subtracted | Deconvolved | (fitted) |
| Vasicek | (1.65, 1.25, 0, 0) | +811 | +381 | +15 | (1.75, 1.37, 0, 0) |
| Vasicek | (3, 2, 1, 0) | +1,377 | +666 | +24 | (3.10, 2.12, 0, 0) |
| CIR | (1.65, 1.25, 0, 0) | +760 | +107 | +10 | (1.76, 1.42, 2.07, 0.61) |
| CIR | (3, 2, 1, 0) | +1,318 | +245 | +13 | (3.10, 2.16, 3.16, 1.64) |
| Black–Karasinski | (1.65, 1.25, 0, 0) | +1,264 | +726 | +36 | (1.74, 1.34, 0.53, 0) |
| Black–Karasinski | (3, 2, 1, 0) | +2,154 | +1,258 | +36 | (3.09, 2.09, 1.52, 0) |
Table D1. Deconvolution of synthetic data. Rates in %, from the most to the least significant qubit.
Hardware data. Table D2 compares, for the readout-mitigated distributions at , the floor subtraction, a plain truncation of the tail set followed by renormalization, and the deconvolution with three thresholds. For the four-qubit circuits the truncation gives errors of 33–149 bp, comparable to or smaller than the deconvolution with the threshold (56–144 bp). For the six-qubit circuit the difference is larger: the truncation gives 216 bp at and 77 bp after extrapolation, against 971 and 518 bp for the deconvolution. Hence the tail set carries most of the correction. The deconvolution is sensitive to the threshold. With the tail set is too small, and for CIR it is empty, so that no correction is applied. With the tail set contains bins with true weight, and the error rises to 87–381 bp at four qubits and 1,137 bp at six qubits. Combined with zero-noise extrapolation, the truncation gives −42 to +114 bp; for Black–Karasinski the extrapolated value falls below , which is possible only through the extrapolation. We report the deconvolution as the main result because it rests on a noise model that is validated on synthetic data, it gives flip rates that can be compared across runs and platforms, and its extrapolated values remain above in all runs.
| Session, configuration | Readout-mitigated | Floor-subtracted | Tail truncation | Deconvolved () | Deconvolved () | Deconvolved () |
| 1, Vasicek | +704 | +293 | +149 | +200 | +144 | +375 |
| 1, Vasicek () | +566 | +285 | +91 | +142 | +89 | +381 |
| 1, CIR | +686 | +273 | +61 | +686 | +56 | +87 |
| 1, Black–Karasinski | +1,139 | +449 | +39 | +318 | +117 | +302 |
| 2, Vasicek | +759 | +309 | +125 | +196 | +138 | +373 |
| 2, CIR | +663 | +282 | +63 | +663 | +97 | +115 |
| 2, Black–Karasinski | +1,124 | +358 | +33 | +367 | +117 | +371 |
| 1, Vasicek (, shots) | +1,388 | +1,080 | +216 | +738 | +971 | +1,137 |
Table D2. Ablation on the hardware data (ibm_cleveland, binary encoding, , readout-mitigated). Energy errors in bp.
Details of the Treasury calibration
This appendix gives the details of the calibration of Section 2.4. We used the zero yields of the Gürkaynak–Sack–Wright curve [28], downloaded from the Federal Reserve Board on 24 October 2026. Days without a complete set of 1–30 year yields were removed, and for each month we used the last remaining business day, starting in November 1985, when the 30-year maturity becomes available. The last month is represented by 16 October 2026, the latest date available at download. The Vasicek and CIR parameters were fitted by least squares with the closed-form bond prices. The Black–Karasinski model was calibrated on eight selected dates, with the bond prices computed from the spectral expansion of Eq. (4).
A 30-year curve does not determine the mean-reversion speed well. Without a constraint, the fit drives toward zero in about 16% of the months, and the Vasicek value then loses its meaning. We therefore bounded the mean-reversion speed by , that is, a half-life of at most 7 years.
With this bound, follows the 30-year yield with a correlation of 0.98 for both models (Figure 1). It lies above the 30-year yield by 46 38 bp for Vasicek and 49 39 bp for CIR (mean and standard deviation). Lower bounds and give mean offsets of 38–50 bp and correlations of 0.94–0.99. An offset of this size is expected, since the 30-year yield has not converged to and still contains the term of Eq. (4). The 30-year forward rate fluctuates more strongly, and exceeds it by 70 92 bp (Vasicek). The gap has a median of 0.23 per year for Vasicek and 0.25 per year for CIR. This corresponds to a time scale of about 4 years for the flattening of the forward curve.
Table E1 lists eight dates with different rate levels. The three models give values of within 50 bp of each other at most dates. At the near-zero short rates of 2012 and 2020, the Black–Karasinski model fits the curve poorly, with errors of 108 and 45 bp. In that case its value of is not reliable.
These values are the risk-neutral long-term yields implied by the curve and a one-factor model. They are not forecasts, and they depend on the extrapolation of the model beyond 30 years. On the other hand, the discount curves used in insurance regulation are extrapolated beyond the last liquid maturity toward a fixed ultimate forward rate. The ground-state energy of a calibrated model provides a model-consistent value for this quantity. The accuracy of the hardware estimates in Section 5 (33–125 bp, and 23–67 bp for the parameters calibrated to the curve of 16 October 2026 in Section 5.6) is of the same order as the model and calibration uncertainties found here.
Quantum circuit of the on-device VQE
This appendix gives the circuit used in the on-device VQE of § 5.4. The same circuit, with the classically trained parameters, was used for the four-qubit Vasicek evaluations of § 5.2, § 5.3 and § 5.5.
Figure F1 shows the logical circuit. It is the real-amplitude ansatz of § 3.1 with and . Each layer applies to every qubit and then the CNOT ladder on the pairs , and . A final layer follows. The circuit has 16 parameters and 9 CNOT gates. Qubit is the most significant bit of the grid index . For zero-noise extrapolation each CNOT is replaced by CNOT gates in sequence, with , 3 and 5. Since , the folded circuit implements the same unitary.

Figure F1. Logical circuit of the four-qubit ansatz (, ) used in the on-device VQE. The barriers separate the layers. Qubit is the most significant bit of the grid index.
Figure F2 shows the circuit after transpilation for ibm_cleveland with optimization level 3 and the fixed layout . The native gates are , and CZ. Each becomes up to fixed rotations, and each CNOT becomes a CZ gate between Hadamard-type single-qubit rotations. The compiled circuit has 9 CZ gates, 38 gates and 50 gates, and a depth of 38. The parameters enter only through the angles. Hence the circuit was compiled once, and each SPSA iteration only bound new parameter values. Gate twirling and dynamical decoupling were added by the Runtime Sampler at execution and are not shown.

Figure F2. The circuit of Figure F1 transpiled for ibm_cleveland on the physical qubits . The labels give the physical qubit; denotes .
Table F1 lists the parameters. The classically trained values reproduce the grid ground state with a fidelity of 1.0000. The initial values of the on-device VQE were obtained by adding Gaussian perturbations with a standard deviation of 0.3 rad (random seed 0), which gives a noiseless energy error of 4,939 bp. After 150 SPSA iterations the noiseless energy error is 130 bp. The final parameters do not return exactly to the trained values. The parameters , and of the most significant qubit differ from them by 0.6–0.9 rad, whereas the final-layer parameters – differ by less than 0.1 rad.
| Parameter | Layer | Qubit | Trained | Initial | After on-device VQE |
| 1 | -3.142 | -3.104 | -4.007 | ||
| 1 | +4.192 | +4.152 | +3.779 | ||
| 1 | -1.949 | -1.757 | -1.825 | ||
| 1 | +1.595 | +1.626 | +1.663 | ||
| 2 | +0.000 | -0.161 | -0.600 | ||
| 2 | -1.236 | -1.127 | -0.942 | ||
| 2 | +1.110 | +1.502 | +1.116 | ||
| 2 | +0.547 | +0.831 | +0.955 | ||
| 3 | -4.712 | -4.924 | -5.356 | ||
| 3 | +0.388 | +0.008 | +0.252 | ||
| 3 | +2.274 | +2.087 | +2.305 | ||
| 3 | +0.886 | +0.899 | +1.137 | ||
| final | +3.142 | +2.444 | +3.193 | ||
| final | -3.142 | -3.207 | -3.186 | ||
| final | -3.142 | -3.515 | -3.218 | ||
| final | -0.000 | -0.220 | -0.083 |
Table F1. Parameters (rad) of the four-qubit Vasicek ansatz: classically trained values, initial values of the on-device VQE, and values after 150 SPSA iterations on ibm_cleveland.
References
- [1]N. Stamatopoulos, D. J. Egger, Y. Sun, C. Zoufal, R. Iten, N. Shen and S. Woerner, “Option pricing using quantum computers,” Quantum 4, 291 (2020).
- [2]S. Woerner and D. J. Egger, “Quantum risk analysis,” npj Quantum Inf. 5, 15 (2019).DOI
- [3]F. Fontanela, A. Jacquier and M. Oumgari, “A quantum algorithm for linear PDEs arising in finance,” SIAM J. Financ. Math. 12, SC98 (2021).
- [4]A. Peruzzo et al., “A variational eigenvalue solver on a photonic quantum processor,” Nat. Commun. 5, 4213 (2014).DOI
- [5]L. P. Hansen and J. A. Scheinkman, “Long-term risk: An operator approach,” Econometrica 77, 177 (2009).
- [6]V. Linetsky, “Spectral methods in derivatives pricing,” in Financial Engineering, Handbooks in Operations Research and Management Science, Vol. 15 (Elsevier, 2007), pp. 223–299.
- [7]S. Ross, “The recovery theorem,” J. Finance 70, 615 (2015).
- [8]S. Bravyi, D. P. DiVincenzo, R. Oliveira and B. M. Terhal, “The complexity of stochastic local Hamiltonian problems,” Quantum Inf. Comput. 8, 361 (2008).
- [9]O. Vasicek, “An equilibrium characterization of the term structure,” J. Financ. Econ. 5, 177 (1977).
- [10]J. C. Cox, J. E. Ingersoll and S. A. Ross, “A theory of the term structure of interest rates,” Econometrica 53, 385 (1985).
- [11]F. Black and P. Karasinski, “Bond and option pricing when short rates are lognormal,” Financ. Anal. J. 47(4), 52 (1991).DOI
- [12]K. Temme, S. Bravyi and J. M. Gambetta, “Error mitigation for short-depth quantum circuits,” Phys. Rev. Lett. 119, 180509 (2017).DOI
- [13]T. Giurgica-Tiron, Y. Hindy, R. LaRose, A. Mari and W. J. Zeng, “Digital zero noise extrapolation for quantum error mitigation,” in Proceedings of the IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 306–316 (2020), doi:10.1109/QCE49297.2020.00045.
- [14]J. C. Spall, “Multivariate stochastic approximation using a simultaneous perturbation gradient approximation,” IEEE Trans. Autom. Control 37, 332 (1992).DOI
- [15]J. Robledo-Moreno et al., “Chemistry beyond exact solutions on a quantum-centric supercomputer,” arXiv:2405.05068 (2024).
- [16]A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow and J. M. Gambetta, “Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,” Nature 549, 242 (2017).DOI
- [17]R. P. Feynman, “Space-time approach to non-relativistic quantum mechanics,” Rev. Mod. Phys. 20, 367 (1948).
- [18]M. Kac, “On distributions of certain Wiener functionals,” Trans. Am. Math. Soc. 65, 1 (1949).DOI
- [19]B. E. Baaquie, Quantum Finance: Path Integrals and Hamiltonians for Options and Interest Rates (Cambridge University Press, Cambridge, 2004).
- [20]B. E. Baaquie, M. Srikant and M. Warachka, “A quantum field theory term structure model applied to hedging,” Int. J. Theor. Appl. Finance 6(5), 443–467 (2003), doi:10.1142/S0219024903001980.DOI
- [21]V. Linetsky, “The path integral approach to financial modeling and options pricing,” Comput. Econ. 11, 129–163 (1998).DOI
- [22]Y. Aït-Sahalia, “Closed-form likelihood expansions for multivariate diffusions,” Ann. Stat. 36(2), 906–937 (2008), doi:10.1214/009053607000000622.DOI
- [23]B. E. Baaquie, “A path integral approach to option pricing with stochastic volatility: Some exact results,” J. Phys. I France 7(12), 1733–1753 (1997), doi:10.1051/jp1:1997167.DOI
- [24]B. E. Baaquie, Interest Rates and Coupon Bonds in Quantum Finance (Cambridge University Press, Cambridge, 2010).
- [25]N. F. Johnson, P. Jefferies and P. M. Hui, Financial Market Complexity (Oxford University Press, Oxford, 2003).
- [26]D. Ahn, unpublished lecture notes, University of Seoul (2022).
- [27]R. A. Horn and C. R. Johnson, Matrix Analysis, 2nd ed. (Cambridge University Press, Cambridge, 2013).
- [28]R. S. Gürkaynak, B. Sack and J. H. Wright, “The U.S. Treasury yield curve: 1961 to the present,” J. Monetary Econ. 54, 2291–2304 (2007).