Quantum Sampling and Moment Estimation for Transformed Gaussian Random Fields
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909743522512896 |
|---|---|
| author | Deiml, Matthias Peterseim, Daniel |
| author_facet | Deiml, Matthias Peterseim, Daniel |
| contents | We present a quantum algorithm for efficiently sampling transformed Gaussian random fields on $d$-dimensional domains, based on an enhanced version of the classical moving average method. Pointwise transformations enforcing boundedness are essential for using Gaussian random fields in quantum computation and arise naturally, for example, in modeling coefficient fields representing microstructures in partial differential equations. Generating this microstructure from its few statistical parameters directly on the quantum device bypasses the input bottleneck. Our method enables an efficient quantum representation of the resulting random field and prepares a quantum state approximating it to accuracy $\mathtt{tol} > 0$ in time $\mathcal{O}(\operatorname{polylog} \mathtt{tol}^{-1})$. Combined with amplitude estimation and a quantum pseudorandom number generator, this leads to algorithms for estimating linear and nonlinear observables, including mixed and higher-order moments, with total complexity $\mathcal{O}(\mathtt{tol}^{-1} \operatorname{polylog} \mathtt{tol}^{-1})$. We illustrate the theoretical findings through numerical experiments on simulated quantum hardware. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_13879 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Sampling and Moment Estimation for Transformed Gaussian Random Fields Deiml, Matthias Peterseim, Daniel Quantum Physics Numerical Analysis Probability 68Q12, 81P68, 60G15, 65C30, 35R60 We present a quantum algorithm for efficiently sampling transformed Gaussian random fields on $d$-dimensional domains, based on an enhanced version of the classical moving average method. Pointwise transformations enforcing boundedness are essential for using Gaussian random fields in quantum computation and arise naturally, for example, in modeling coefficient fields representing microstructures in partial differential equations. Generating this microstructure from its few statistical parameters directly on the quantum device bypasses the input bottleneck. Our method enables an efficient quantum representation of the resulting random field and prepares a quantum state approximating it to accuracy $\mathtt{tol} > 0$ in time $\mathcal{O}(\operatorname{polylog} \mathtt{tol}^{-1})$. Combined with amplitude estimation and a quantum pseudorandom number generator, this leads to algorithms for estimating linear and nonlinear observables, including mixed and higher-order moments, with total complexity $\mathcal{O}(\mathtt{tol}^{-1} \operatorname{polylog} \mathtt{tol}^{-1})$. We illustrate the theoretical findings through numerical experiments on simulated quantum hardware. |
| title | Quantum Sampling and Moment Estimation for Transformed Gaussian Random Fields |
| topic | Quantum Physics Numerical Analysis Probability 68Q12, 81P68, 60G15, 65C30, 35R60 |
| url | https://arxiv.org/abs/2508.13879 |