physics.comp-phMay 29, 2026

Physically Constrained Ensemble Gaussian Process Modelling for Expensive Quantum Systems with Heteroskedastic Noise

Authors: Arpan Biswas, Sutirtha Paul, Joseph Agada, Matthias Thamm, Adrian Del Maestro

Organizations: University of Tennessee-Oak Ridge Innovation Institute, University of Tennessee, Knoxville, TN 37996, USA · Institute for Advanced Materials and Manufacturing, University of Tennessee, Knoxville, Tennessee 37996, USA · Department of Physics and Astronomy, University of Tennessee, Knoxville, TN 37996, USA. · Bredesen Center for Interdisciplinary Research, University of Tennessee, Knoxville, USA, 37996 · Institut für Theoretische Physik, Universität Leipzig, 04103 Leipzig, Germany

Abstract

Accurate modeling of quantum many-body systems often requires computationally expensive simulations such as Density Matrix Renormalization Group (DMRG) or Quantum Monte Carlo (QMC) calculations. These methods, while precise, impose significant time and resource constraints, limiting their use in exhaustive parameter exploration. Moreover, these expensive simulations can contain variable errors over the large unknown parameter space, which needs to be quantified and propagated. Thus, predictive modelling is required to estimate the functional space accurately over scarcely sampled data with heteroskedastic noise, while preserving the physical relevance of the estimation. Therefore, we present a Physically Constrained Ensemble Gaussian Process (pc-EGP) framework designed to efficiently model complex and noisy quantum systems under physical consistency constraints. The proposed method first enforces physical constraints as a user controlled weighted penalty to the data-driven loss function of the Gaussian Process (GP) surrogates. Then an ensemble of such GP models is trained with variable noisy simulations via numerical quadrature method where these multiple GP(s) at different nodes is integrated as a quadrature weighted average. We first demonstrate the framework on synthetically generated data before applying to quantum systems. In the first case study, we leverage DMRG simulations of the Bose-Hubbard Model to predict the critical interaction parameter Uc governing the superfluid-to-Mott-insulator transition. In the second case study, we demonstrate our method on QMC simulations, of a quantum liquid confined inside a nanoporous silicate with the goal of optimizing a chemical environment to realize a one-dimensional superfluid. Compared to conventional GP, pc-EGP achieves a better balance of accuracy and physically meaningful predictions.

Explore similar work

CardsList
Apr 30, 2026quant-ph

Provable and scalable quantum Gaussian processes for quantum learning

Despite rapid recent advances in quantum machine learning, the field is in many ways stuck. Existing approaches can exhibit serious limitations, and we still lack learning frameworks that are simple, interpretable, scalable, and naturally suited to quantum data. To address this, here we introduce quantum Gaussian processes, a Bayesian framework for learning from quantum systems through priors over unknown quantum transformations. We show that, under suitable conditions, unitary quantum stochastic processes define Gaussian processes, thereby enabling regression, classification, and Bayesian optimization directly on quantum data. The key ingredient in this framework is sufficient knowledge of a quantum process's structure and symmetries to define an informative prior through its corresponding quantum kernel, effectively injecting a strong, physics-informed inductive bias into the learning model. We then prove that matchgate, or free-fermionic, evolutions give rise to provable and scalable quantum Gaussian processes, providing the first family in our framework where the unknown unitary acts non-trivially on all qubits. Finally, we demonstrate accurate long-range extrapolation, phase-diagram learning in many-body systems, and sample-efficient Bayesian optimization in a quantum sensing task. Our results identify quantum Gaussian processes as a promising route toward simpler and more structured forms of quantum learning.
Jonas Jäger, Paolo Braccia, Pablo Bermejo +3
Quantum LearningGaussian Process
AskPDF
May 29, 2026cs.LG

Spectral Anatomy of Quantum Gaussian Process Kernels

Two recent results have reshaped quantum Gaussian processes (QGPs). On the one hand, \citet{lowe2025assessing} rule out the exponential speedups claimed by HHL-based QGP regression in the typical, well-conditioned regime; on the other, an independent line of work shows that highly expressive quantum kernels suffer posterior pathologies that break Bayesian optimization. We show that these seemingly unrelated phenomena are governed by the same quantity: the normalized spectral entropy S(K)/log⁡nS(K)/\log n of the kernel Gram matrix. We prove a Cauchy--Schwarz tail bound on Nyström approximation error, a finite-sample variance-contraction identity in terms of Bach's degrees of freedom dσ(K)d_σ(K), and a characterization of the \emph{target-dependent} optimal entropy via the intrinsic dimension of the target in the kernel eigenbasis. Empirically, the diagnostic is kernel-agnostic: hardware-efficient, matchgate, IQP \emph{and} RBF/Matérn/RFF/deep-kernel families all collapse onto identical S/log⁡nS/\log n curves on dequantization, ECE, and variance-contraction panels. The NLL sweet spot lives at high entropy for smooth targets and at low entropy for band-limited quantum-data targets. The diagnostic transfers from simulator to IBM Heron hardware with median absolute error 3.2%3.2\% and mean 5.2%5.2\% in S/log⁡nS/\log n across 2424 configurations at nq=4n_q = 4, with matchgate and IQP within 5%5\% mean and a single HE configuration returning a 30%30\% outlier that drops to 0.5%0.5\% on rerun (attributed to calibration drift); the same diagnostic transfers to a second Heron backend (mean error 2.7%2.7\%) and to a nq=6n_q = 6 scale-up on the original backend (mean error 1.7%1.7\%). No error mitigation is applied throughout.
Jian Xu, Chao Li, Guang Lin +4
Quantum KernelsGaussian ProcessLargest Eigenvalue3D Gaussian Splatting
AskPDF
May 1, 2026cs.LG

Conformalized Quantum DeepONet Ensembles: Towards Scalable Operator Learning with Distribution-Free Guarantees

Operator learning enables fast surrogate modelling of high-dimensional dynamical systems, but existing approaches face two fundamental limitations: the quadratic cost of dense neural layers and unreliable uncertainty quantification in safety-critical settings. We propose Conformalized Quantum DeepONet Ensembles, a framework that addresses both challenges simultaneously. Using Quantum Orthogonal Neural Networks (QOrthoNNs), we characterize the resource regime in which their established O~(n)\widetilde{\mathcal{O}}(n) hidden-layer running-time scaling improves on the O(n2)\mathcal{O}(n^2) cost of a classical dense layer. To quantify uncertainty, we combine ensemble predictions with split conformal calibration. For a new input-output function pair jointly exchangeable with the calibration pairs, we prove a finite-sample, distribution-free lower bound on the expected fraction of covered query locations. As a secondary proof-of-concept, we explore hybrid classical-quantum architectures and superposed execution to manage ensemble runtime and hardware requirements. Experiments on synthetic operator benchmarks and real-world power-system dynamics show accurate predictions under ideal simulation and empirical coverage near the target under both ideal conditions and selected compact-circuit simulations with depolarizing or device-calibrated composite noise. Together, these results connect resource-aware scalability analysis with finite-sample uncertainty guarantees for quantum operator learning.
Purav Matlia, Christian Moya, Guang Lin
Quantum LearningProbabilistic Operator LearningQuantum CircuitsUncertainty QuantificationEnsembleConformal Selection
AskPDF