Operator Learning with Variational Quantum Circuits

• URL: http://arxiv.org/abs/2609.14131v1
• Date: Sat, 12 Sep 2026 20:19:31 GMT
• Title: Operator Learning with Variational Quantum Circuits
• Abstract summary: A new methodology is developed for quantum machine learning which enables variational quantum circuits to learn linear and non-linear solution operators to differential equations.<n>The branch and trunk neural networks are replaced by variational quantum circuits, leveraging the quantum universal approximation theorem.<n>The model displays improved error and parameter scaling relative to the classical DeepONet.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A new methodology is developed for quantum machine learning which enables variational quantum circuits to learn linear and non-linear solution operators to differential equations. This is devised by extending the framework of the DeepONet, a technique for modeling differential equations. The branch and trunk neural networks are replaced by variational quantum circuits, leveraging the quantum universal approximation theorem. The methodology is tested on several differential equations and yields low approximation & generalization errors even with shallow circuit depths. In addition, it does not encounter barren plateaus during training. The model displays improved error and parameter scaling relative to the classical DeepONet. This is due to the intrinsic property that the approximation error depends on the dimension of the input function space, rather than the number of sensor locations. A theoretical framework is established in the form of explicit error bounds, which measure the contributions of the truncation, branch, and trunk circuit errors to the total operator approximation error. Full derivations for the error bounds are developed in the norms $L^2$, $L^p$, $C^0$, and Sobolev $H^k$, along with a classical-quantum comparative analysis (as Supplemental Materials).

Related papers

• Physics-Informed Quantum Machine Learning with Hard Constraint Embedding for Nonlinear Differential Equations of the First Order [14.324339765884053]
  This work proposes a physics-informed quantum machine learning (PIQML) framework with hard constraint embedding.<n>Within this framework, parameterized quantum circuits serve as machine learning models, where the input variable is encoded into a high-dimensional feature space.<n>Results demonstrate that our quantum model successfully learns the solution, showing close agreement with a high-precision classical numerical benchmark.
  arXiv  Detail & Related papers  (2026-08-04T02:17:21Z)
• Circuit Depth Reduction of One-Ancilla Quantum Differential Equation Solver via Extrapolation [1.0742675209112622]
  A recent one-ancilla quantum differential equation solver provides a hardware-friendly and locality-preserving approach.<n>We reduce the maximum single-run circuit depth to $O(mathrmpolylog (1/)$ without adding quantum ancillae or sacrificing locality.<n> Numerical experiments on the Hatano-Nelson model (ODE) and the convection-diffusion equation (PDE) demonstrate the effectiveness of the approach.
  arXiv  Detail & Related papers  (2026-07-08T13:20:43Z)
• Explainable quantum regression algorithm with encoded data structure [0.0]
  We construct the first interpretable quantum regression algorithm, in which the quantum state exactly encodes the classical data table.<n>We also exploit the encoded data structure to reduce the gate complexity of computing the regression map.
  arXiv  Detail & Related papers  (2026-04-17T03:42:12Z)
• Domain decomposition architectures and Gauss-Newton training for physics-informed neural networks [47.614449195824335]
  Approxing boundary value problems governed by partial differential equations with neural networks is challenging, largely due to the difficult training process.<n>This difficulty can be partly explained by the spectral bias, that is, the slower convergence of high-frequency components.<n>We combine this localization with the Gauss-Newton method as the gradient to obtain faster convergence than gradient-based schemes such as Adam.<n>Our numerical results indicate that combining localization and Gauss-Newton optimization is promising for neural network-based solvers for partial differential equations.
  arXiv  Detail & Related papers  (2025-10-30T21:45:10Z)
• Enabling Automatic Differentiation with Mollified Graph Neural Operators [73.52999622724101]
  We propose the mollified graph neural operator ($m$GNO), the first method to leverage automatic differentiation and compute exact gradients on arbitrary geometries.<n>For a PDE example on regular grids, $m$GNO paired with autograd reduced the L2 relative data error by 20x compared to finite differences.<n>It can also solve PDEs on unstructured point clouds seamlessly, using physics losses only, at resolutions vastly lower than those needed for finite differences to be accurate enough.
  arXiv  Detail & Related papers  (2025-04-11T06:16:30Z)
• Physics-Informed Quantum Machine Learning: Solving nonlinear differential equations in latent spaces without costly grid evaluations [21.24186888129542]
  We propose a physics-informed quantum algorithm to solve nonlinear and multidimensional differential equations. By measuring the overlaps between states which are representations of DE terms, we construct a loss that does not require independent sequential function evaluations on grid points. When the loss is trained variationally, our approach can be related to the differentiable quantum circuit protocol.
  arXiv  Detail & Related papers  (2023-08-03T15:38:31Z)
• Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation [0.0]
  We develop a recipe for mitigating quantum gate errors for variational algorithms using zero-noise extrapolation. We utilize the fact that gate errors in a physical quantum device are distributed inhomogeneously over different qubits and qubit pairs. We find that the estimated energy in the variational approach is approximately linear with respect to the circuit error sum.
  arXiv  Detail & Related papers  (2023-07-20T18:00:03Z)
• Correspondence between open bosonic systems and stochastic differential equations [77.34726150561087]
  We show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment. A particular system with the form of a discrete nonlinear Schr"odinger equation is analyzed in more detail.
  arXiv  Detail & Related papers  (2023-02-03T19:17:37Z)
• Tunable Complexity Benchmarks for Evaluating Physics-Informed Neural Networks on Coupled Ordinary Differential Equations [64.78260098263489]
  In this work, we assess the ability of physics-informed neural networks (PINNs) to solve increasingly-complex coupled ordinary differential equations (ODEs) We show that PINNs eventually fail to produce correct solutions to these benchmarks as their complexity increases. We identify several reasons why this may be the case, including insufficient network capacity, poor conditioning of the ODEs, and high local curvature, as measured by the Laplacian of the PINN loss.
  arXiv  Detail & Related papers  (2022-10-14T15:01:32Z)
• Fourier Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  We formulate a new neural operator by parameterizing the integral kernel directly in Fourier space. We perform experiments on Burgers' equation, Darcy flow, and Navier-Stokes equation. It is up to three orders of magnitude faster compared to traditional PDE solvers.
  arXiv  Detail & Related papers  (2020-10-18T00:34:21Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)

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.