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

Acta Mathematicae Applicatae Sinica English Series

Quantum gaussian processes

Yazhen Wang

Published Jul 1, 1994• 1 citation
Publisher
DOI
10.1007/bf02006861

Related papers

Quantum stochastic calculus and quantum Gaussian processes

Kalyanapuram Rangachari Parthasarathy

arXiv:1408.5686•Indian Journal of Pure and Applied Mathematics•Oct 6, 2015•24 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.14467•Feb 20, 2025•1 citation

Quantum Stochastic Processes

Anatolij Dvurečenskij, Sylvia Pulmannová

Springer eBooks•Jan 1, 1983•0 citations

Quantum stochastic processes

C. Barnett, R. F. Streater, Ivan F. Wilde

Lecture notes in mathematics•Jan 1, 1984•8 citations

Characterizing Gaussian quantum processes with Gaussian resources

Logan W. Grove, Pratik J. Barge, Kevin Valson Jacob

Characterizing quantum processes is indispensable for the implementation of any task in quantum information processing. In this paper, we develop an efficient method to fully characterize arbitrary Gaussian processes in continuous-variable quantum systems. This is done by directly obtaining all elements of the symplectic matrix that describes the process. Only Gaussian resources such as coherent probes and quadrature measurements are needed for this task. The method is efficient, involving only $O({N}^{2})$ steps to characterize an $N$-mode system. Further, the method is resilient to uniform loss. We simulate this procedure using the Python package Strawberry Fields. We observe that heterodyne measurements outperform homodyne measurements for reconstructing Gaussian processes.

arXiv:2503.13698•Physical Review A•Aug 13, 2025•1 citation

Quantum Gaussian Processes for Data-Driven Design of Metamaterials

Gaweł Kuś

The data-driven approach shows great potential for designing new materials with unprecedented properties by using machine learning and optimization. Recently, a data-driven framework was successfully applied to design a unit cell of metamaterial achieving super-compressibility, despite being built out of brittle base material. The key element of the framework is the algorithm called Gaussian processes regression (GPs) – a unique machine learning method that provides with the uncertainty of the prediction, which can be used during the design process to account for inherent material imperfections, ensuring the robustness of the design. Despite their superior predictive performance, however, GPs suffer from scalability issues, which limit their application to relatively small design problems. In the future, those limitations could be surpassed by quantum computing. This research aims at demonstrating how quantum computing could enhance the computational design of materials, specifically by replacing the expensive machine learning step of the data-driven design framework with an exponentially faster quantum algorithm for Gaussian processes (QGP). This objective is achieved in two steps. First, the QGP algorithm was Implementation and simulated within a quantum computing framework (Qiskit), which allowed to understand and control its performance (in particular its accuracy), proving the feasibility for practical applications. Furthermore, the numerical tests exposed a mechanism for inducing a low-rank approximation, which allows for additional speed-up, making the QGP algorithm similar to classical sparse Gaussian processes, which rely on low-rank approximations to improve the scalability of full GPs. In the second part of this research, the implemented QGP algorithm was integrated within a computational framework for the data-driven design of materials and applied to two example design problems of optimization a unit cell for a super-compressible metamaterial. The results obtained with the QGP were comparable to those obtained with classical methods (also from literature), which proved the feasibility of the concept.

•Jan 1, 2019•0 citations
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.
Characterizing quantum processes is indispensable for the implementation of any task in quantum information processing. In this paper, we develop an efficient method to fully characterize arbitrary Gaussian processes in continuous-variable quantum systems. This is done by directly obtaining all elements of the symplectic matrix that describes the process. Only Gaussian resources such as coherent probes and quadrature measurements are needed for this task. The method is efficient, involving only O(N2)O({N}^{2})O(N2) steps to characterize an NNN-mode system. Further, the method is resilient to uniform loss. We simulate this procedure using the Python package Strawberry Fields. We observe that heterodyne measurements outperform homodyne measurements for reconstructing Gaussian processes.
The data-driven approach shows great potential for designing new materials with unprecedented properties by using machine learning and optimization. Recently, a data-driven framework was successfully applied to design a unit cell of metamaterial achieving super-compressibility, despite being built out of brittle base material. The key element of the framework is the algorithm called Gaussian processes regression (GPs) – a unique machine learning method that provides with the uncertainty of the prediction, which can be used during the design process to account for inherent material imperfections, ensuring the robustness of the design. Despite their superior predictive performance, however, GPs suffer from scalability issues, which limit their application to relatively small design problems. In the future, those limitations could be surpassed by quantum computing. This research aims at demonstrating how quantum computing could enhance the computational design of materials, specifically by replacing the expensive machine learning step of the data-driven design framework with an exponentially faster quantum algorithm for Gaussian processes (QGP). This objective is achieved in two steps. First, the QGP algorithm was Implementation and simulated within a quantum computing framework (Qiskit), which allowed to understand and control its performance (in particular its accuracy), proving the feasibility for practical applications. Furthermore, the numerical tests exposed a mechanism for inducing a low-rank approximation, which allows for additional speed-up, making the QGP algorithm similar to classical sparse Gaussian processes, which rely on low-rank approximations to improve the scalability of full GPs. In the second part of this research, the implemented QGP algorithm was integrated within a computational framework for the data-driven design of materials and applied to two example design problems of optimization a unit cell for a super-compressible metamaterial. The results obtained with the QGP were comparable to those obtained with classical methods (also from literature), which proved the feasibility of the concept.