Quantum Sampling and Moment Estimation for Transformed Gaussian Random Fields

• URL: http://arxiv.org/abs/2508.13879v1
• Date: Tue, 19 Aug 2025 14:42:52 GMT
• Title: Quantum Sampling and Moment Estimation for Transformed Gaussian Random Fields
• Authors: Matthias Deiml, Daniel Peterseim,
• Abstract summary: We present a quantum algorithm for efficiently sampling transformed Gaussian random fields on $d$-dimensional domains.<n>Pointwise transformations enforcing boundedness are essential for using Gaussian random fields in quantum computation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Are Randomized Quantum Linear Systems Solvers Practical? [0.0]
  randomized quantum algorithms have been proposed in the context of quantum simulation and quantum linear algebra.<n>We provide explicit bounds on all relevant parameters that control the total error for a randomized quantum linear systems solver.<n>Our work serves as a bridge between theoretical algorithmic proposals and efficient hardware implementations.
  arXiv  Detail & Related papers  (2025-10-15T17:12:55Z)
• FFT-Accelerated Auxiliary Variable MCMC for Fermionic Lattice Models: A Determinant-Free Approach with $O(N\log N)$ Complexity [52.3171766248012]
  We introduce a Markov Chain Monte Carlo (MCMC) algorithm that dramatically accelerates the simulation of quantum many-body systems.<n>We validate our algorithm on benchmark quantum physics problems, accurately reproducing known theoretical results.<n>Our work provides a powerful tool for large-scale probabilistic inference and opens avenues for physics-inspired generative models.
  arXiv  Detail & Related papers  (2025-10-13T07:57:21Z)
• Quantum-assisted Gaussian process regression using random Fourier features [8.271361104403802]
  We introduce a quantum-assisted algorithm for Gaussian process regression based on the random Fourier feature kernel approximation.<n>We achieve a sparse-order computational speedup relative to the classical method.
  arXiv  Detail & Related papers  (2025-07-30T12:49:53Z)
• Efficient Gaussian State Preparation in Quantum Circuits [4.930778301847907]
  We propose and analyze a circuit-based approach that starts with single-qubit rotations to form an exponential amplitude profile.<n>We demonstrate that this procedure achieves high fidelity with the target Gaussian state.<n>We conclude that the proposed technique is a promising route to make Gaussian states accessible on noisy quantum hardware.
  arXiv  Detail & Related papers  (2025-07-27T15:15:20Z)
• Matrix phase-space representations in quantum optics [44.99833362998488]
  We introduce matrix quantum phase-space distributions.<n>These extend the idea of a quantum phase-space representation via projections onto a density matrix of global symmetry variables.<n>We demonstrate improvements in sampling error by a factor of 1000 or more compared to unprojected methods, which are infeasible for such cases.
  arXiv  Detail & Related papers  (2025-03-17T02:33:14Z)
• Phase estimation with partially randomized time evolution [36.989845156791525]
  Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers.<n>In this paper we use randomization to speed up product formulas, one of the standard approaches to Hamiltonian simulation.<n>We perform a detailed resource estimate for single-ancilla phase estimation using partially randomized product formulas for benchmark systems in quantum chemistry.
  arXiv  Detail & Related papers  (2025-03-07T18:09:32Z)
• Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach [29.662683446339194]
  We propose quantum algorithms for linear differential equations.<n>The gate complexity of our algorithms exhibits an $mathcalO(dlog(Nd))$ dependence on the dimensions.<n>The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, Brownian motions, and one-dimensional L'evy flights.
  arXiv  Detail & Related papers  (2024-12-19T14:04:11Z)
• Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
  We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons. This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
  arXiv  Detail & Related papers  (2024-09-05T17:58:20Z)
• Classically estimating observables of noiseless quantum circuits [36.688706661620905]
  We present a classical algorithm for estimating expectation values of arbitrary observables on random unstructured quantum circuits.<n>Our results show that estimating observables of quantum circuits exhibiting chaotic and locally scrambling behavior is classically tractable across all geometries.
  arXiv  Detail & Related papers  (2024-09-03T08:44:33Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer.<n>Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model.<n>We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• Stochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functions [13.16814860487575]
  We present quantum algorithms for sampling from nonlogconcave probability distributions. $f$ can be written as a finite sum $f(x):= frac1Nsum_k=1N f_k(x)$.
  arXiv  Detail & Related papers  (2023-10-17T17:55:32Z)
• Robust Dequantization of the Quantum Singular value Transformation and Quantum Machine Learning Algorithms [0.39886149789339326]
  We show how many techniques from randomized linear algebra can be adapted to work under this weaker assumption.<n>We also apply these results to obtain a robust dequantization of many quantum machine learning algorithms.
  arXiv  Detail & Related papers  (2023-04-11T02:09:13Z)
• A quantum spectral method for simulating stochastic processes, with applications to Monte Carlo [4.134846879110833]
  We introduce a new analog'' quantum representation of processes, in which the value of the process at time t is stored in the amplitude of the quantum state. We show that we can simulate $T$ timesteps of fractional Brownian motion using a quantum circuit with gate complexity $textpolylog(T)$, which coherently prepares the superposition over Brownian paths. We then show this can be combined with quantum mean estimation to create end to end algorithms for estimating certain time averages over processes in time $O(textpolylog(Tepsilon
  arXiv  Detail & Related papers  (2023-03-12T17:54:38Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.