arXiv:2402.00544 · Physical Review A

Quantum-assisted Hilbert-space Gaussian process regression

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

Published May 7, 2024• 5 citations

Abstract

Gaussian processes are probabilistic models that are commonly used as functional priors in machine learning. Due to their probabilistic nature, they can be used to capture prior information on the statistics of noise, smoothness of the functions, and training data uncertainty. However, their computational complexity quickly becomes intractable as the size of the data set grows. We propose a Hilbert-space approximation-based quantum algorithm for Gaussian process regression to overcome this limitation. Our method consists of a combination of classical basis function expansion with quantum computing techniques of quantum principal component analysis, conditional rotations, and Hadamard and tests. The quantum principal component analysis is used to estimate the eigenvalues, while the conditional rotations and the Hadamard and tests are employed to evaluate the posterior mean and variance of the Gaussian process. Our method provides polynomial computational complexity reduction over the classical method. Published by the American Physical Society 2024

DOI: 10.1103/physreva.109.052410

Related papers

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, 20250 citations

Variational quantum principal component analysis for Hilbert space Gaussian process regression

Kerem Bükrü, Ralf Sturm, Tjark Siefkes

Abstract Gaussian processes are widely used probabilistic models for regression and classification tasks. Their flexibility and ability to quantify uncertainties make them well-suited for many applications. However, their applicability to large datasets is limited by the cubic computational time complexity. While reduced-rank methods such as Hilbert space approximations reduce this complexity, scaling to very large datasets remains challenging. Quantum algorithms are promising candidates to further accelerate such computations. Quantum principal component analysis has previously been applied to Hilbert space Gaussian process regression to address this scaling limitation. However, its applicability is limited by the requirement for fault-tolerant quantum hardware. In this work, we present a hybrid quantum-classical model for reduced-rank Gaussian process regression, where we apply a quantum principal component analysis algorithm based on parameterized quantum circuits to Hilbert space Gaussian process regression. In noiseless simulations on a one-dimensional test function, the resulting model reaches a regression accuracy comparable to that of the exact Gaussian process and the classical Hilbert space Gaussian process. The framework uses shallow parameterized circuits and does not require fault-tolerant quantum hardware, which makes it a candidate for noisy intermediate-scale quantum devices.

Machine Learning Science and TechnologyOct 15, 20260 citations

Provable Quantum Algorithm Advantage for Gaussian Process Quadrature

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

The aim of this paper is to develop novel quantum algorithms for Gaussian process quadrature methods. Gaussian process quadratures are numerical integration methods where Gaussian processes are used as functional priors for the integrands to capture the uncertainty arising from the sparse function evaluations. Quantum computers have emerged as potential replacements for classical computers, offering exponential reductions in the computational complexity of machine learning tasks. In this paper, we combine Gaussian process quadratures and quantum computing by proposing a quantum low-rank Gaussian process quadrature method based on a Hilbert space approximation of the Gaussian process kernel and enhancing the quadrature using a quantum circuit. The method combines the quantum phase estimation algorithm with the quantum principal component analysis technique to extract information up to a desired rank. Then, Hadamard and SWAP tests are implemented to find the expected value and variance that determines the quadrature. We use numerical simulations of a quantum computer to demonstrate the effectiveness of the method. Furthermore, we provide a theoretical complexity analysis that shows a polynomial advantage over classical Gaussian process quadrature methods. The code is available at https://github.com/cagalvisf/Quantum_HSGPQ.

arXiv:2502.14467Feb 20, 20250 citations

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.15486Oct 17, 20250 citations

Quantum algorithm for Gaussian process regression

Menghan Chen, Chao‐Hua Yu, Jianliang Gao +4 more

The Gaussian process is a widely used model for regression problems in supervised machine learning. However, predicting new inputs via a Gaussian process model becomes computationally inefficient when training a large data set. This paper proposes a fast quantum algorithm for prediction based on the Gaussian process regression. The proposed quantum algorithm consists of two subalgorithms: the first one aims to efficiently prepare the squared exponential covariance matrices and covariance functions vector with annihilation and creation operators; the other is to obtain predictive mean values and covariance values for new inputs. Evidence is also shown that the proposed quantum Gaussian process regression algorithm can achieve quadratic speedup over the classical counterpart.

Physical Review AJul 5, 202220 citations

Error mitigation in variational quantum eigensolvers using tailored probabilistic machine learning

Tao Jiang, J. Rogers, Marius S. Frank +3 more

Quantum computing technology has the potential to revolutionize the simulation of materials and molecules in the near future. A primary challenge in achieving near-term quantum advantage is effectively mitigating the noise effects inherent in current quantum processing units (QPUs). This challenge is also decisive in the context of quantum-classical hybrid schemes employing variational quantum eigensolvers (VQEs) that have attracted significant interest in recent years. In this paper, we present a method that employs parametric Gaussian process regression (GPR) within an active learning framework to mitigate noise in quantum computations, focusing on VQEs. Our approach, grounded in probabilistic machine learning, exploits a custom prior based on the VQE ansatz to capture the underlying correlations between VQE outputs for different variational parameters, thereby enhancing both accuracy and efficiency. We demonstrate the effectiveness of our method on a two-site Anderson impurity model and a eight-site Heisenberg model, using the IBM open-source quantum computing framework, Qiskit, showcasing substantial improvements in the accuracy of VQE outputs while reducing the number of direct QPU energy evaluations. This paper contributes to the ongoing efforts in quantum-error mitigation and optimization, bringing us a step closer to realizing the potential of quantum computing in quantum matter simulations. Published by the American Physical Society 2024

arXiv:2111.08814Physical Review ResearchJul 15, 20244 citations