A Linear Combination of Unitaries Decomposition for the Laplace Operator

• URL: http://arxiv.org/abs/2601.06370v1
• Date: Sat, 10 Jan 2026 00:54:39 GMT
• Title: A Linear Combination of Unitaries Decomposition for the Laplace Operator
• Authors: Thomas Hogancamp, Reuben Demirdjian, Daniel Gunlycke,
• Abstract summary: We provide novel linear combination of unitaries decompositions for a class of discrete elliptic differential operators.<n>The number of unitary terms required for our decomposition is independent of the number of grid points used in the discretization.<n>Explicit circuit constructions for each unitary are given and their complexities analyzed.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We provide novel linear combination of unitaries decompositions for a class of discrete elliptic differential operators. Specifically, Poisson problems augmented with periodic, Dirichlet, Neumann, Robin, and mixed boundary conditions are considered on the unit interval and on higher-dimensional rectangular domains. The number of unitary terms required for our decomposition is independent of the number of grid points used in the discretization and scales linearly with the spatial dimension. Explicit circuit constructions for each unitary are given and their complexities analyzed. The worst case depth and elementary gate cost of any such circuit is shown to scale at most logarithmically with respect to number of grid points in the underlying discrete system. We also investigate the cost of using our method within the Variational Quantum Linear Solver algorithm and show favorable scaling. Finally, we extend the proposed decomposition technique to treat problems that include first-order derivative terms with variable coefficients.

Related papers

• Analysis of Hessian Scaling for Local and Global Costs in Variational Quantum Algorithm [0.42970700836450487]
  We quantify the entrywise resolvability of the Hessian for Variational Quantum Algorithms.<n>We show two distinct scaling regimes that govern the sample complexity required to resolve Hessian entries against shot noise.
  arXiv  Detail & Related papers  (2026-01-31T15:49:23Z)
• Linear combination of unitaries with exponential convergence [0.0]
  We present a general method for decomposing non-unitary operators into a linear combination of unitary operators.<n>When implemented in a quantum circuit, the subnormalisation of the resulting block encoding scales with the double logarithm of the inverse error.
  arXiv  Detail & Related papers  (2026-01-25T22:47:21Z)
• CFT Complexity and Penalty Factors [0.0]
  We present a framework for studying the complexity of circuits in Lie groups, where penalty factors assign relative weights to different generators.<n>Our approach constructs a metric on the coset space of quantum states, induced from a (pseudo-)Riemannian norm on the space of unitary circuits.<n>As a concrete application, we compute state complexity for states in one- and two-dimensional CFTs.
  arXiv  Detail & Related papers  (2025-07-29T18:00:02Z)
• Stabilizing and Solving Unique Continuation Problems by Parameterizing Data and Learning Finite Element Solution Operators [0.0]
  We consider an inverse problem involving the reconstruction of the solution to a nonlinear partial differential equation (PDE) with unknown boundary conditions.<n>To leverage this collective data, we first compress the boundary data using proper decomposition (POD) in a linear expansion.<n>We then identify a possible nonlinear low-dimensional structure in the expansion coefficients using an autoencoder, which provides a parametrization of the dataset in a lower-dimensional latent space.
  arXiv  Detail & Related papers  (2024-12-05T18:31:14Z)
• Refined Risk Bounds for Unbounded Losses via Transductive Priors [67.12679195076387]
  We revisit the sequential variants of linear regression with the squared loss, classification problems with hinge loss, and logistic regression.<n>Our key tools are based on the exponential weights algorithm with carefully chosen transductive priors.
  arXiv  Detail & Related papers  (2024-10-29T00:01:04Z)
• A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval [56.67706781191521]
  In this work, we present a robust phase retrieval problem where the task is to recover an unknown signal. Our proposed oracle avoids the need for computationally spectral descent, using a simple gradient step and outliers.
  arXiv  Detail & Related papers  (2024-09-07T06:37:23Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Characterization of variational quantum algorithms using free fermions [0.0]
  We numerically study the interplay between these symmetries and the locality of the target state. We find that the number of iterations to converge to the solution scales linearly with system size.
  arXiv  Detail & Related papers  (2022-06-13T18:11:16Z)
• General Solution and Canonical Quantization of the Conic Path Constrained Second-Class System [0.0]
  We consider the problem of constrained motion along a conic path under a given external potential function. We perform the canonical quantization in a consistent way in terms of the corresponding Dirac brackets. The complete Dirac brackets algebra in phase space as well as its physical realization in terms of differential operators is explicitly obtained.
  arXiv  Detail & Related papers  (2022-02-15T13:46:56Z)
• Exponential Convergence of Deep Operator Networks for Elliptic Partial Differential Equations [0.0]
  We construct deep operator networks (ONets) between infinite-dimensional spaces that emulate with an exponential rate of convergence the coefficient-to-solution map of elliptic second-order PDEs. In particular, we consider problems set in $d$-dimensional periodic domains, $d=1, 2, dots$, and with analytic right-hand sides and coefficients. We prove that the neural networks in the ONet have size $mathcalO(left|log(varepsilon)right|kappa)$ for some $kappa
  arXiv  Detail & Related papers  (2021-12-15T13:56:28Z)
• Deep Learning Approximation of Diffeomorphisms via Linear-Control Systems [91.3755431537592]
  We consider a control system of the form $dot x = sum_i=1lF_i(x)u_i$, with linear dependence in the controls. We use the corresponding flow to approximate the action of a diffeomorphism on a compact ensemble of points.
  arXiv  Detail & Related papers  (2021-10-24T08:57:46Z)
• Optimal oracle inequalities for solving projected fixed-point equations [53.31620399640334]
  We study methods that use a collection of random observations to compute approximate solutions by searching over a known low-dimensional subspace of the Hilbert space. We show how our results precisely characterize the error of a class of temporal difference learning methods for the policy evaluation problem with linear function approximation.
  arXiv  Detail & Related papers  (2020-12-09T20:19:32Z)
• 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.