Author
Listed:
- Tassa Thaksakronwong
- Koichi Miyamoto
Abstract
Quantum computing may speed up numerical problems involving large matrices that are demanding for classical computers, and active research on this possibility is ongoing. In this work, we propose quantum algorithms for the exact simulation of a normalised correlated Gaussian random vector $|x\rangle=\vec{x}/\lVert\vec{x}\rVert$, $\vec{x}\sim\mathcal{N}(0,\Sigma)$, and its exponentiation $|e^{\vec{x}} \rangle= e^{\vec{x}}/\lVert e^{\vec{x}}\rVert$. When an $O(\mathrm{polylog} N)$-gate-depth quantum data loader for the covariance matrix $\Sigma\in\mathbb{R}^{N\times N}$ is available, preparing $|x\rangle$ and $|e^{\vec{x}}\rangle$ require $\widetilde{O}\left(\frac{\lVert\Sigma\rVert_F}{\lambda_{\max}}\kappa^{1.5}\right)$ and $\widetilde{O}\left(\lVert\vec{x}\rVert\frac{\lVert\Sigma\rVert_F}{\lambda_{\max}}\kappa^{1.5}\right)$ elementary gate depth respectively, where $\lVert\Sigma\rVert_F$, $\lambda_{\max}$, $\kappa$ denote the Frobenius norm, maximal eigenvalue, and condition number of $\Sigma$. Motivated by financial applications, we provide an end-to-end resource analysis when $\vec{x}$ represents a sample path of a Riemann-Liouville or standard fractional Brownian motion, or of a stationary fractional Ornstein-Uhlenbeck process. As a concrete example, we construct the quantum state encoding the rough Bergomi variance process and analyse the extraction of the integrated variance via quantum amplitude estimation. Under specific conditions, the dependence of $\lVert\Sigma\rVert_F/\lambda_{\max}$ and $\kappa$ on $N$ is small, and subcubic complexity in $N$ is achieved, indicating a quantum advantage over classical Cholesky-based sampling methods. To our knowledge, this constitutes the first quantum algorithmic framework for the amplitude encoding of exponentiated Gaussian processes, providing foundational primitives for quantum-enhanced financial modelling.
Suggested Citation
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2604.22463. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.