Quantum computer formulation of the FKP-operator eigenvalue problem for probabilistic learning on manifolds

• URL: http://arxiv.org/abs/2502.14580v1
• Date: Thu, 20 Feb 2025 14:05:16 GMT
• Title: Quantum computer formulation of the FKP-operator eigenvalue problem for probabilistic learning on manifolds
• Authors: Christian Soize, Loïc Joubert-Doriol, Artur F. Izmaylov,
• Abstract summary: We present a quantum computing formulation to address a challenging problem in the development of probabilistic learning on manifold (PLoM) It involves solving the spectral problem of the high-dimensional Fokker-Planck operator, which remains beyond the reach of classical computing. Explicit formulas for the Laplacian and potential are derived and mapped onto qubits using Pauli matrix expressions.
• Score: 0.0
• License:
• Abstract: We present a quantum computing formulation to address a challenging problem in the development of probabilistic learning on manifolds (PLoM). It involves solving the spectral problem of the high-dimensional Fokker-Planck (FKP) operator, which remains beyond the reach of classical computing. Our ultimate goal is to develop an efficient approach for practical computations on quantum computers. For now, we focus on an adapted formulation tailored to quantum computing. The methodological aspects covered in this work include the construction of the FKP equation, where the invariant probability measure is derived from a training dataset, and the formulation of the eigenvalue problem for the FKP operator. The eigen equation is transformed into a Schr\"odinger equation with a potential V, a non-algebraic function that is neither simple nor a polynomial representation. To address this, we propose a methodology for constructing a multivariate polynomial approximation of V, leveraging polynomial chaos expansion within the Gaussian Sobolev space. This approach preserves the algebraic properties of the potential and adapts it for quantum algorithms. The quantum computing formulation employs a finite basis representation, incorporating second quantization with creation and annihilation operators. Explicit formulas for the Laplacian and potential are derived and mapped onto qubits using Pauli matrix expressions. Additionally, we outline the design of quantum circuits and the implementation of measurements to construct and observe specific quantum states. Information is extracted through quantum measurements, with eigenstates constructed and overlap measurements evaluated using universal quantum gates.

Related papers

• Quantum Circuit for Non-Unitary Linear Transformation of Basis Sets [4.289769713465494]
  This paper introduces a novel approach to implementing non-unitary linear transformations of basis on quantum computational platforms. By integrating Singular Value Decomposition (SVD) into the process, the method achieves an operational depth of $O(n)$ with about $n$ ancilla qubits. It allows for a deeper exploration of complex quantum states and phenomena, expanding the practical applications of quantum computing in physics and chemistry.
  arXiv  Detail & Related papers  (2025-02-13T04:55:51Z)
• Nonlinear functions of quantum states [5.641998714611475]
  We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits. We develop quantum algorithms of fundamental tasks, achieving a sample complexity of $tildemathcalO (1/(varepsilon2kappa)$ for both von Neumann entropy estimation and quantum state fidelity calculations.
  arXiv  Detail & Related papers  (2024-12-02T16:40:17Z)
• Quantum DeepONet: Neural operators accelerated by quantum computing [1.4918461320598675]
  We propose to utilize quantum computing to accelerate DeepONet evaluations. We benchmark our quantum DeepONet using a variety of PDEs, including the antiderivative operator, advection equation, and Burgers' equation.
  arXiv  Detail & Related papers  (2024-09-24T02:53:42Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Exploiting Structure in Quantum Relative Entropy Programs [6.281229317487581]
  We show how common structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy programs. Our numerical results show that these techniques improve computation times by up to several orders of magnitude, and allow previously intractable problems to be solved.
  arXiv  Detail & Related papers  (2024-06-28T21:37:45Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Quantum Chebyshev Transform: Mapping, Embedding, Learning and Sampling Distributions [18.124351208075062]
  We show how to encode data into quantum states with amplitudes growing exponentially in the system size. We propose an embedding circuit for generating the orthonormal Chebyshev basis of exponential capacity. This enables automatic model differentiation, and opens a route to solving differential equations.
  arXiv  Detail & Related papers  (2023-06-29T15:19:32Z)
• Unitary Complexity and the Uhlmann Transformation Problem [41.67228730328207]
  We introduce a framework for unitary synthesis problems, including notions of reductions and unitary complexity classes. We use this framework to study the complexity of transforming one entangled state into another via local operations. Our framework for unitary complexity thus provides new avenues for studying the computational complexity of many natural quantum information processing tasks.
  arXiv  Detail & Related papers  (2023-06-22T17:46:39Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods [44.99833362998488]
  We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
  arXiv  Detail & Related papers  (2022-06-20T16:33:23Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)

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.