Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2111.10353 · Physical Review Research

Quantum Gaussian process state: A kernel-inspired state with quantum support data

Yannic Rath, George H. Booth

Published May 16, 2022• 13 citations
arXivHTMLPDF

Abstract

We introduce the quantum Gaussian process state, motivated via a statistical inference for the wave function supported by a data set of unentangled product states. We show that this condenses down to a compact and expressive parametric form, with a variational flexibility shown to be competitive or surpassing established alternatives. The connections of the state to its roots as a Bayesian inference machine as well as matrix product states, also allow for efficient deterministic training of global states from small training data with enhanced generalization, including on application to frustrated spin physics.

DOI
10.1103/physrevresearch.4.023126

Related papers

A Bayesian inference framework for compression and prediction of quantum states

Yannic Rath, Aldo Glielmo, George H. Booth

The recently introduced Gaussian Process State (GPS) provides a highly flexible, compact, and physically insightful representation of quantum many-body states based on ideas from the zoo of machine learning approaches. In this work, we give a comprehensive description of how such a state can be learned from given samples of a potentially unknown target state and show how regression approaches based on Bayesian inference can be used to compress a target state into a highly compact and accurate GPS representation. By application of a type II maximum likelihood method based on relevance vector machines, we are able to extract many-body configurations from the underlying Hilbert space, which are particularly relevant for the description of the target state, as support points to define the GPS. Together with an introduced optimization scheme for the hyperparameters of the model characterizing the weighting of modeled correlation features, this makes it possible to easily extract physical characteristics of the state such as the relative importance of particular correlation properties. We apply the Bayesian learning scheme to the problem of modeling ground states of small Fermi-Hubbard chains and show that the found solutions represent a systematically improvable trade-off between sparsity and accuracy of the model. Moreover, we show how the learned hyperparameters and the extracted relevant configurations, characterizing the correlation of the wave function, depend on the interaction strength of the Hubbard model and the target accuracy of the representation.

arXiv:2008.03595•The Journal of Chemical Physics•Sep 24, 2020•13 citations

Quantum Statistical Inference

Zhikuan Zhao

In this thesis, I present several results on quantum statistical inference in the following two directions. Firstly, I demonstrate that quantum algorithms can be applied to enhance the computing and training of Gaussian processes (GPs), a powerful model widely used in classical statistical inference and supervised machine learning. A crucial component of the quantum GP algorithm is solving linear systems with quantum computers, for which I present a novel algorithm that achieves a provable advantage over previously known methods. I will also explicitly address the task of encoding the classical data into a quantum state for machine learning applications. I then apply the quantum enhanced GPs to Bayesian deep learning and present an experimental demonstration on contemporary hardware and simulators. Secondly, I look into the notion of quantum causality and apply it to inferring spatial and temporal quantum correlations, and present an analytical toolkit for causal inference in quantum data. I will also make the connection between causality and quantum communications, and present a general bound for the quantum capacity of noisy communication channels.

arXiv:1812.04877•Dec 12, 2018•1 citation

A Hybrid Quantum Solver for Gaussian Process Regression

Kerem Bükrü, Leger, Steffen, Hickmann, M. Lautaro +3 more

Gaussian processes are widely known for their ability to provide probabilistic predictions in supervised machine learning models. Their non-parametric nature and flexibility make them particularly effective for regression tasks. However, training a Gaussian process model using standard methods requires matrix inversions with a cubic time complexity, which poses significant computational challenges for inference on larger datasets. Quantum algorithms, such as the HHL algorithm, have been proposed as solutions that overcome the need for classical matrix inversions by efficiently solving linear systems of equations using quantum computers. However, to gain a computational advantage over classical algorithms, these algorithms require fault-tolerant quantum computers with a large number of qubits, which are not yet available. The Variational Quantum Linear Solver is a hybrid quantum-classical algorithm that solves linear systems of equations by optimizing the parameters of a variational quantum circuit using a classical computer. This method is especially suitable for noisy intermediate-scale quantum computers, as it does not require many qubits. It can be used to compute the posterior distribution of a Gaussian process by reformulating the matrix inversion into a set of linear systems of equations. We empirically demonstrate that using the Variational Quantum Linear Solver to perform inference for Gaussian process regression delivers regression quality comparable to that of classical methods.

arXiv:2510.15486•Oct 17, 2025•1 citation

Learning Gaussian Processes with Randomized Quantum Local Kernels

Abdallah Aaraba, Soumaya Cherkaoui, Ola Suleiman Ahmad +2 more

Gaussian processes (GPs) are flexible nonparametric Bayesian priors over functions and are widely used in regression, time-series modelling, and Bayesian optimisation. Yet their performance is often bottlenecked by the choice of covariance kernel, especially when the relevant correlations are unknown or inherently non-stationary. In this work, we put forward a NISQ-compatible framework that uses a quantum device as a generator of local quantum kernels for GP learning. At a high level, shallow, geometry-aware randomly parametrized circuits with area-law entanglement encode inputs into many-qubit states, and few-body Pauli measurements-estimated efficiently via classical shadows-produce quantum feature vectors that are subsequently wrapped into classical scalar kernels. A multiplekernel learning layer then fits a convex mixture of these quantum kernels by maximizing the GP marginal likelihood, so that all heavy optimisation remains on the classical side, while the quantum hardware is used solely for kernel estimation. On synthetic regression tasks, we find that the learned mixture can approximate both stationary and non-stationary covariances, achieving high kernel alignment and accurate predictions. Taken together, these results suggest that local quantum kernels can in principle form a family of flexible GP covariance learners within realistic NISQ resource budgets.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•0 citations

Quantum-Assisted Gaussian Process Regression Using Random Fourier Features

Cristian A. Galvis-Florez, Ahmad Farooq, Simo Särkkä

Probabilistic machine learning models are distinguished by their ability to integrate prior knowledge of noise statistics, smoothness parameters, and training data uncertainty. A common approach involves modeling data with Gaussian processes; however, their computational complexity quickly becomes intractable as the training dataset grows. To address this limitation, we introduce a quantum-assisted algorithm for sparse Gaussian process regression based on the random Fourier feature kernel approximation. We start by encoding the data matrix into a quantum state using a multi-controlled unitary operation, which encodes the classical representation of the random Fourier features matrix used for kernel approximation. We then employ a quantum principal component analysis along with a quantum phase estimation technique to extract the spectral decomposition of the kernel matrix. We apply a conditional rotation operator to the ancillary qubit based on the eigenvalue. We then use Hadamard and swap tests to compute the mean and variance of the posterior Gaussian distribution. We achieve a polynomialorder computational speedup relative to the classical method.

IEEE International Conference on Quantum Software (QSW)•Jul 7, 2025•0 citations

Benchmarking of quantum fidelity kernels for Gaussian process regression

Xuyang Guo, Jun Feng Dai, Roman V. Krems

Abstract Quantum computing algorithms have been shown to produce performant quantum kernels for machine-learning classification problems. Here, we examine the performance of quantum kernels for regression problems of practical interest. For an unbiased benchmarking of quantum kernels, it is necessary to construct the most optimal functional form of the classical kernels and the most optimal quantum kernels for each given data set. We develop an algorithm that uses an analog of the Bayesian information criterion to optimize the sequence of quantum gates used to estimate quantum kernels for Gaussian process models. The algorithm increases the complexity of the quantum circuits incrementally, while improving the performance of the resulting kernels, and is shown to yield much higher model accuracy with fewer quantum gates than a fixed quantum circuit ansatz. We demonstrate that quantum kernels thus obtained can be used to build accurate models of global potential energy surfaces (PES) for polyatomic molecules. The average interpolation error of the six-dimensional PES obtained with a random distribution of 2000 energy points is 16 cm−1 for H3O+, 15 cm−1 for H2CO and 88 cm−1 for HNO2. We show that a compositional optimization of classical kernels for Gaussian process regression converges to the same errors. This indicates that quantum kernels can achieve the same, though not better, expressivity as classical kernels for regression problems.

arXiv:2407.15961•Machine Learning Science and Technology•Sep 1, 2024•1 citation
We introduce the quantum Gaussian process state, motivated via a statistical inference for the wave function supported by a data set of unentangled product states. We show that this condenses down to a compact and expressive parametric form, with a variational flexibility shown to be competitive or surpassing established alternatives. The connections of the state to its roots as a Bayesian inference machine as well as matrix product states, also allow for efficient deterministic training of global states from small training data with enhanced generalization, including on application to frustrated spin physics.
The recently introduced Gaussian Process State (GPS) provides a highly flexible, compact, and physically insightful representation of quantum many-body states based on ideas from the zoo of machine learning approaches. In this work, we give a comprehensive description of how such a state can be learned from given samples of a potentially unknown target state and show how regression approaches based on Bayesian inference can be used to compress a target state into a highly compact and accurate GPS representation. By application of a type II maximum likelihood method based on relevance vector machines, we are able to extract many-body configurations from the underlying Hilbert space, which are particularly relevant for the description of the target state, as support points to define the GPS. Together with an introduced optimization scheme for the hyperparameters of the model characterizing the weighting of modeled correlation features, this makes it possible to easily extract physical characteristics of the state such as the relative importance of particular correlation properties. We apply the Bayesian learning scheme to the problem of modeling ground states of small Fermi-Hubbard chains and show that the found solutions represent a systematically improvable trade-off between sparsity and accuracy of the model. Moreover, we show how the learned hyperparameters and the extracted relevant configurations, characterizing the correlation of the wave function, depend on the interaction strength of the Hubbard model and the target accuracy of the representation.
In this thesis, I present several results on quantum statistical inference in the following two directions. Firstly, I demonstrate that quantum algorithms can be applied to enhance the computing and training of Gaussian processes (GPs), a powerful model widely used in classical statistical inference and supervised machine learning. A crucial component of the quantum GP algorithm is solving linear systems with quantum computers, for which I present a novel algorithm that achieves a provable advantage over previously known methods. I will also explicitly address the task of encoding the classical data into a quantum state for machine learning applications. I then apply the quantum enhanced GPs to Bayesian deep learning and present an experimental demonstration on contemporary hardware and simulators. Secondly, I look into the notion of quantum causality and apply it to inferring spatial and temporal quantum correlations, and present an analytical toolkit for causal inference in quantum data. I will also make the connection between causality and quantum communications, and present a general bound for the quantum capacity of noisy communication channels.
Gaussian processes are widely known for their ability to provide probabilistic predictions in supervised machine learning models. Their non-parametric nature and flexibility make them particularly effective for regression tasks. However, training a Gaussian process model using standard methods requires matrix inversions with a cubic time complexity, which poses significant computational challenges for inference on larger datasets. Quantum algorithms, such as the HHL algorithm, have been proposed as solutions that overcome the need for classical matrix inversions by efficiently solving linear systems of equations using quantum computers. However, to gain a computational advantage over classical algorithms, these algorithms require fault-tolerant quantum computers with a large number of qubits, which are not yet available. The Variational Quantum Linear Solver is a hybrid quantum-classical algorithm that solves linear systems of equations by optimizing the parameters of a variational quantum circuit using a classical computer. This method is especially suitable for noisy intermediate-scale quantum computers, as it does not require many qubits. It can be used to compute the posterior distribution of a Gaussian process by reformulating the matrix inversion into a set of linear systems of equations. We empirically demonstrate that using the Variational Quantum Linear Solver to perform inference for Gaussian process regression delivers regression quality comparable to that of classical methods.
Gaussian processes (GPs) are flexible nonparametric Bayesian priors over functions and are widely used in regression, time-series modelling, and Bayesian optimisation. Yet their performance is often bottlenecked by the choice of covariance kernel, especially when the relevant correlations are unknown or inherently non-stationary. In this work, we put forward a NISQ-compatible framework that uses a quantum device as a generator of local quantum kernels for GP learning. At a high level, shallow, geometry-aware randomly parametrized circuits with area-law entanglement encode inputs into many-qubit states, and few-body Pauli measurements-estimated efficiently via classical shadows-produce quantum feature vectors that are subsequently wrapped into classical scalar kernels. A multiplekernel learning layer then fits a convex mixture of these quantum kernels by maximizing the GP marginal likelihood, so that all heavy optimisation remains on the classical side, while the quantum hardware is used solely for kernel estimation. On synthetic regression tasks, we find that the learned mixture can approximate both stationary and non-stationary covariances, achieving high kernel alignment and accurate predictions. Taken together, these results suggest that local quantum kernels can in principle form a family of flexible GP covariance learners within realistic NISQ resource budgets.
Probabilistic machine learning models are distinguished by their ability to integrate prior knowledge of noise statistics, smoothness parameters, and training data uncertainty. A common approach involves modeling data with Gaussian processes; however, their computational complexity quickly becomes intractable as the training dataset grows. To address this limitation, we introduce a quantum-assisted algorithm for sparse Gaussian process regression based on the random Fourier feature kernel approximation. We start by encoding the data matrix into a quantum state using a multi-controlled unitary operation, which encodes the classical representation of the random Fourier features matrix used for kernel approximation. We then employ a quantum principal component analysis along with a quantum phase estimation technique to extract the spectral decomposition of the kernel matrix. We apply a conditional rotation operator to the ancillary qubit based on the eigenvalue. We then use Hadamard and swap tests to compute the mean and variance of the posterior Gaussian distribution. We achieve a polynomialorder computational speedup relative to the classical method.
Abstract Quantum computing algorithms have been shown to produce performant quantum kernels for machine-learning classification problems. Here, we examine the performance of quantum kernels for regression problems of practical interest. For an unbiased benchmarking of quantum kernels, it is necessary to construct the most optimal functional form of the classical kernels and the most optimal quantum kernels for each given data set. We develop an algorithm that uses an analog of the Bayesian information criterion to optimize the sequence of quantum gates used to estimate quantum kernels for Gaussian process models. The algorithm increases the complexity of the quantum circuits incrementally, while improving the performance of the resulting kernels, and is shown to yield much higher model accuracy with fewer quantum gates than a fixed quantum circuit ansatz. We demonstrate that quantum kernels thus obtained can be used to build accurate models of global potential energy surfaces (PES) for polyatomic molecules. The average interpolation error of the six-dimensional PES obtained with a random distribution of 2000 energy points is 16 cm−1 for H3O+, 15 cm−1 for H2CO and 88 cm−1 for HNO2. We show that a compositional optimization of classical kernels for Gaussian process regression converges to the same errors. This indicates that quantum kernels can achieve the same, though not better, expressivity as classical kernels for regression problems.