pith. sign in

arxiv: 2605.04861 · v2 · pith:FZTNL7SGnew · submitted 2026-05-06 · 🪐 quant-ph

Quantum algorithm for solving differential equations using SLAC derivatives

Rakshit M. Gharat , Gopikrishnan Muraleedharan , Dominic W. Berry , Gavin K. Brennen This is my paper

Pith reviewed 2026-05-08 16:47 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum algorithmsdifferential equationsSLAC derivativesblock-encodinglinear combination of unitarieswavelet transformspreconditioningquantum linear systems
0
0 comments X

The pith

Efficient block-encodings of SLAC derivative operators allow quantum linear solvers to handle partial differential equations on finite lattices.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs linear-combination-of-unitaries block-encodings for first-order derivatives and Laplacians in the SLAC representation on a lattice. It shows how to prepare the required amplitudes efficiently using techniques for smoothly decaying functions and how to apply Shannon wavelet transforms to create multi-scale versions of these operators. A diagonal preconditioner is then used to bring the condition number down to a small constant in the wavelet basis. This combination makes it possible to solve PDEs discretized with SLAC derivatives via the quantum linear solving algorithm, with full analysis of the resulting complexity and error. A sympathetic reader would care because classical simulation of high-dimensional PDEs is expensive, and this offers a potential quantum route for certain problems.

Core claim

We present the construction of efficient linear-combination-of-unitaries (LCU)-based block-encodings for the first-order derivative and Laplacian operators in the SLAC representation. We use state-preparation techniques designed for smoothly decaying functions to efficiently prepare the dense LCU amplitudes with high success probability and low gate cost. Furthermore, we demonstrate how Shannon wavelet transforms can be applied to these block-encodings to efficiently obtain multi-scale representations of the SLAC derivative operators. We then show how to apply a diagonal preconditioner that reduces the condition number of these matrices in the multi-scale wavelet basis to a small constant. 1

What carries the argument

LCU-based block-encodings of SLAC first-order derivative and Laplacian operators, combined with Shannon wavelet transforms for multi-scale representation and a diagonal preconditioner in the wavelet basis.

If this is right

  • The dense LCU amplitudes for SLAC operators can be prepared with high success probability using state-preparation for smoothly decaying functions.
  • Shannon wavelet transforms produce efficient multi-scale representations of the block-encoded operators.
  • The condition number is reduced to a small constant by the diagonal preconditioner in the wavelet basis.
  • Partial differential equations discretized on finite lattices with SLAC derivatives become solvable using the quantum linear solving algorithm, with explicit complexity and error bounds.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Such encodings could extend to other derivative operators or higher-order terms in PDEs without changing the core approach.
  • Applications to specific physical systems like fluid dynamics or quantum mechanics simulations on lattices might follow directly.
  • The error scaling analysis suggests the method remains efficient even as lattice size increases, provided the state preparation succeeds.

Load-bearing premise

The state-preparation techniques designed for smoothly decaying functions can efficiently prepare the dense LCU amplitudes with high success probability and low gate cost.

What would settle it

Numerical simulation of the block-encoding and preconditioned system for a small lattice size, such as solving the Poisson equation in 1D or 2D, to verify if the quantum linear solver achieves the predicted scaling in gate count and error.

Figures

Figures reproduced from arXiv: 2605.04861 by Dominic W. Berry, Gavin K. Brennen, Gopikrishnan Muraleedharan, Rakshit M. Gharat.

Figure 1
Figure 1. Figure 1: FIG. 1. Implementation of QSWT in a quantum circuit on view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. High-level circuit implementing the state-preparation protocol for the view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Probability per state view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Complete view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Log–log plot showing the scaling of the operator view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Multi-scaled view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. Quantum circuit for recursively applying the wavelet transform at each scale to the SLAC derivative operator (first view at source ↗
read the original abstract

In numerical approaches to solving differential equations on a lattice, a representation of the derivative operator that correctly matches the continuum behaviour of functions of momentum up to the band limit must be non-local. We present the construction of efficient linear-combination-of-unitaries ($\mathrm{LCU}$)-based block-encodings for the first-order derivative and Laplacian operators in the non-local \(N=2^n\)-dimensional SLAC representation. We use state-preparation techniques designed for smoothly decaying functions to prepare the dense $\mathrm{LCU}$ amplitudes with high success probability and low gate cost. Furthermore, we demonstrate how Shannon wavelet transforms can be applied to these block-encodings to obtain multiscale representations of the SLAC derivative operators. We then show how to apply a diagonal preconditioner that reduces the condition number of these matrices in the multiscale wavelet basis to a small constant. This enables the solution of partial differential equations (PDEs) with SLAC-discretised derivative operators on a finite lattice using the quantum linear solving algorithm ($\mathrm{QLSA}$). For a $d$-dimensional PDE, after projection away from the nullspace, the resulting quantum linear-system algorithm has overall gate complexity ${O}(dn^3\alpha^{(k)}\log(1/\varepsilon))$, where $\alpha^{(k)}$ is the subnormalisation factor of the order-$k$ SLAC block-encoding and $\varepsilon$ denotes the algorithmic approximation error.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper constructs LCU-based block-encodings for the SLAC first-order derivative and Laplacian operators on finite lattices. It invokes state-preparation routines designed for smoothly decaying functions to handle the resulting dense amplitudes with claimed high success probability and low gate cost, incorporates Shannon wavelet transforms to obtain multi-scale representations, and applies a diagonal preconditioner in the wavelet basis that reduces the condition number to a small constant. This enables application of the quantum linear solving algorithm (QLSA) to PDEs discretized with SLAC operators, accompanied by complexity and error analyses.

Significance. If the block-encoding costs remain polylogarithmic and the preconditioner achieves a constant condition number independent of lattice size, the approach could yield an efficient quantum solver for PDEs that exploits the spectral accuracy of SLAC discretizations. The integration of wavelets for multi-resolution analysis and the explicit complexity/error scaling constitute strengths, provided the state-preparation overhead does not introduce hidden exponential factors.

major comments (2)
  1. [LCU block-encoding and state-preparation construction] The central efficiency claim rests on applying state-preparation techniques for smoothly decaying functions to the dense LCU amplitudes arising from the SLAC stencil. No explicit bounds, decay-rate analysis, or numerical verification is provided showing that the SLAC coefficient sequence (a linear combination of shift operators) satisfies the smoothness/decay hypotheses of the cited preparation routine; violation would drop the success probability below 1/poly(log N) and introduce exponential overhead via amplitude amplification, negating the claimed advantage over classical methods.
  2. [Wavelet transform and preconditioner section] The assertion that the diagonal preconditioner reduces the condition number of the SLAC operators to a small constant in the multi-scale wavelet basis lacks supporting eigenvalue bounds or scaling analysis across wavelet levels and lattice sizes. Without this, the QLSA runtime (which depends on both condition number and block-encoding cost) cannot be guaranteed to remain polylogarithmic in the lattice dimension.
minor comments (2)
  1. [Abstract] The abstract and introduction would benefit from a brief statement of the specific PDE classes (e.g., Poisson, advection-diffusion) and spatial dimensions for which the constructions are demonstrated.
  2. [Notation and preliminaries] Notation for the SLAC derivative operator and its LCU decomposition should be introduced with an explicit equation at first appearance to improve readability for readers unfamiliar with the stencil.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and insightful comments, which have helped us identify areas where the manuscript can be strengthened. We address each major comment below and outline the revisions we will make.

read point-by-point responses

  1. Referee: The central efficiency claim rests on applying state-preparation techniques for smoothly decaying functions to the dense LCU amplitudes arising from the SLAC stencil. No explicit bounds, decay-rate analysis, or numerical verification is provided showing that the SLAC coefficient sequence (a linear combination of shift operators) satisfies the smoothness/decay hypotheses of the cited preparation routine; violation would drop the success probability below 1/poly(log N) and introduce exponential overhead via amplitude amplification, negating the claimed advantage over classical methods.

    Authors: We appreciate the referee's careful scrutiny of this foundational step. The SLAC stencil coefficients derive from the Fourier representation of the derivative on a periodic lattice and are known to exhibit exponential decay away from the origin due to the analyticity of the underlying symbol. Nevertheless, we acknowledge that the original manuscript did not supply explicit decay-rate bounds or numerical verification against the hypotheses of the cited state-preparation routine. In the revised version we will add a new subsection that (i) derives an explicit exponential decay bound for the LCU amplitudes of both the first-order SLAC derivative and the Laplacian, (ii) verifies that this decay satisfies the smoothness conditions required for success probability 1-O(1/poly(log N)), and (iii) includes numerical plots of the coefficient tails for lattice sizes up to N=2^12. These additions will remove any ambiguity regarding hidden exponential overhead. revision: yes

  2. Referee: The assertion that the diagonal preconditioner reduces the condition number of the SLAC operators to a small constant in the multi-scale wavelet basis lacks supporting eigenvalue bounds or scaling analysis across wavelet levels and lattice sizes. Without this, the QLSA runtime (which depends on both condition number and block-encoding cost) cannot be guaranteed to remain polylogarithmic in the lattice dimension.

    Authors: We agree that a rigorous justification of the preconditioner's effect on the condition number is essential for the claimed polylogarithmic complexity. While the manuscript demonstrates the construction of the diagonal preconditioner in the Shannon wavelet basis and states that the resulting condition number is O(1), we did not provide explicit eigenvalue bounds or scaling analysis with respect to wavelet level and lattice size. In the revision we will insert a theorem that bounds the eigenvalues of the preconditioned SLAC operators, proving that the condition number remains bounded by a small constant independent of the lattice dimension. The proof will combine the spectral properties of the SLAC symbol with the multi-resolution orthogonality of the Shannon wavelets; we will also supply numerical eigenvalue computations across multiple scales and lattice sizes to corroborate the analytic bound. revision: yes

Circularity Check

0 steps flagged

No circularity: explicit constructions and standard primitives

full rationale

The paper constructs LCU block-encodings for SLAC derivative and Laplacian operators, applies Shannon wavelet transforms for multi-scale representations, introduces a diagonal preconditioner in the wavelet basis, and invokes QLSA. These steps are presented as explicit algorithmic constructions relying on cited state-preparation routines for decaying functions and standard quantum linear algebra primitives. No step reduces by definition or self-citation to the target PDE solution, no fitted parameters are relabeled as predictions, and no load-bearing uniqueness theorem or ansatz is imported from the authors' prior work. The derivation chain remains independent of the final result.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard quantum-computing primitives plus two domain assumptions about efficient state preparation and preconditioner performance that are not derived inside the paper.

axioms (2)
  • domain assumption State-preparation techniques for smoothly decaying functions can prepare dense LCU amplitudes with high success probability and low gate cost
    Invoked to justify efficient implementation of the block-encodings for derivative operators.
  • domain assumption A diagonal preconditioner reduces the condition number of the SLAC operators in the multi-scale wavelet basis to a small constant
    Required for the QLSA to remain efficient; stated as a demonstration in the abstract.

pith-pipeline@v0.9.0 · 5454 in / 1457 out tokens · 43823 ms · 2026-05-08T16:47:42.220003+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.