pith. sign in

arxiv: 2605.16749 · v1 · pith:4V7R7AL4new · submitted 2026-05-16 · 🪐 quant-ph

Boundary-Aware QFT Block-Encoding of Fractional Laplacians

Younes Javanmard , Sina Kazemian This is my paper

Pith reviewed 2026-05-19 21:18 UTC · model grok-4.3

classification 🪐 quant-ph
keywords QFT block-encodingfractional LaplacianToeplitz truncationopen boundary conditionszero-paddingaliasing identityquantum simulationsemi-discrete operator
0
0 comments X

The pith

Zero-padding a state into a larger QFT register recovers the open-boundary fractional Laplacian from a circulant encoding up to a kernel-tail error.

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

The paper shows that a standard QFT block-encoding applied after zero-padding into an M-point register and then compressing back yields the target finite Toeplitz truncation of the semi-discrete fractional Laplacian plus an error term controlled only by the tail of the convolution kernel. This corrects the native mismatch in which a QFT circuit produces a periodic surrogate rather than the open-boundary operator desired for bounded domains. A reader would care because the construction supplies a practical compilation step for quantum circuits that must respect zero-extension boundaries when simulating fractional operators. The approach treats the QFT layer as implementing the fractional symbol while the padding step supplies the geometry.

Core claim

The resulting compressed block satisfies P_{N→M}^† Ã^{(M)}_{α,h} P_{N→M} = A^{(N)}_{α,h} + E^{(M)}, where E^{(M)} is controlled by the tail of the semi-discrete convolution kernel. Thus the QFT layer implements the fractional symbol while zero-padding supplies the open-boundary geometry. The construction is an operator-compilation primitive for boundary-aware quantum simulation rather than a complete PDE solver.

What carries the argument

Zero-padding into a larger M-point QFT register followed by compression, which converts the circulant action into the desired open-boundary Toeplitz truncation via an exact aliasing identity.

If this is right

  • Choosing M large enough relative to the kernel tail makes the boundary error arbitrarily small while retaining the efficient QFT circuit.
  • The same padding-compression step applies to any Toeplitz truncation whose symbol is diagonalized by the Fourier basis.
  • The method separates the fractional-symbol implementation from the boundary handling, allowing reuse of existing QFT block-encoding primitives.

Where Pith is reading between the lines

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

  • The padding size needed for a given accuracy can be read off directly from the decay rate of the semi-discrete kernel without further analysis.
  • This technique could be combined with other diagonalizing transforms to handle different boundary conditions in quantum PDE solvers.
  • Numerical checks on the operator norm of E^{(M)} for increasing M would give concrete resource estimates for near-term devices.

Load-bearing premise

Zero-padding into an M-point register followed by compression recovers the open-boundary Toeplitz action up to an error term whose size is governed solely by the kernel tail.

What would settle it

Direct matrix multiplication for small N and M, verifying whether the difference between the compressed operator and the target Toeplitz matrix equals the predicted kernel-tail remainder.

Figures

Figures reproduced from arXiv: 2605.16749 by Sina Kazemian, Younes Javanmard.

Figure 1
Figure 1. Figure 1: FIG. 1. Illustrative four-qubit QFT decomposition. The finite QFT is the spectral layer used by the block-encoding, but by [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Native QFT block-encoding of the periodic circulant surrogate [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Compressed open-boundary block from zero-padding. The size- [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Matrix structure for [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Functional comparison using three bounded-domain reference test functions. The top row compares the open-boundary [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Decay of the zero-padding residual. Both panels are normalized by [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: contrasts the action of the open target, the native periodic surrogate, and the zero-padded compressed operator on two Gaussian inputs. The bulk-localized state is nearly insensitive to the boundary model, while the boundary-localized state exposes the wrap-around tail of the native circulant [PITH_FULL_IMAGE:figures/full_fig_p009_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8. Relative state error as the Gaussian center [PITH_FULL_IMAGE:figures/full_fig_p009_8.png] view at source ↗
read the original abstract

We study the quantum Fourier transform (QFT) block-encoding of the semi-discrete fractional Laplacian on bounded domains with open, zero-extension boundary conditions. In the notation of the main construction, the target operator is the finite Toeplitz truncation \(A^{(N)}_{\alpha,h}\) obtained from the full-lattice semi-discrete operator with symbol \(|\xi|^\alpha\). A finite QFT register, however, diagonalizes circulant matrices rather than Toeplitz truncations. The native QFT circuit therefore implements a periodic surrogate \(\widetilde A^{(N)}_{\alpha,h}\), not the open-boundary operator. We identify this mismatch through an exact Toeplitz-to-circulant aliasing identity. To recover the open-boundary action, we zero-pad the state into a larger \(M\)-point QFT register, apply the same Fourier-symbol block-encoding, and compress back to the physical subspace. The resulting compressed block satisfies \(P_{N\to M}^{\dagger}\widetilde A^{(M)}_{\alpha,h}P_{N\to M} = A^{(N)}_{\alpha,h}+E^{(M)}\), where \(E^{(M)}\) is controlled by the tail of the semi-discrete convolution kernel. Thus, the QFT layer implements the fractional symbol, while zero-padding supplies the open-boundary geometry. The construction is an operator-compilation primitive for boundary-aware quantum simulation rather than a complete PDE solver.

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 manuscript develops a QFT-based block-encoding for the semi-discrete fractional Laplacian A^{(N)}_{α,h} (finite Toeplitz truncation with symbol |ξ|^α) under open, zero-extension boundary conditions. It notes that a native QFT implements a circulant surrogate rather than the desired Toeplitz operator, then proposes zero-padding the input state into an M-point register, applying the Fourier-symbol block-encoding, and compressing back via P_{N→M}. This yields the compressed operator P_{N→M}^† Ã^{(M)}_{α,h} P_{N→M} = A^{(N)}_{α,h} + E^{(M)}, where the error E^{(M)} is asserted to be governed solely by the tail of the semi-discrete convolution kernel. The construction is positioned as an operator-compilation primitive for boundary-aware quantum simulation.

Significance. If the aliasing identity and tail-controlled error bound can be made rigorous with explicit norm estimates, the approach would supply a concrete circuit primitive for implementing open-boundary fractional operators without auxiliary boundary qubits or penalty terms. This would be relevant to quantum algorithms for anomalous transport and fractional PDEs, where boundary conditions are physically important. The paper correctly identifies the circulant-vs-Toeplitz mismatch as the core obstruction and offers a padding-based workaround that avoids fitting parameters.

major comments (2)
  1. [Abstract / aliasing identity section] Abstract and aliasing-identity section: the exact identity P_{N→M}^† Ã^{(M)}_{α,h} P_{N→M} = A^{(N)}_{α,h} + E^{(M)} is stated without a derivation, proof sketch, or explicit matrix-element calculation. Because this identity is the load-bearing step that converts the circulant QFT action into the target Toeplitz truncation plus controlled error, its absence prevents verification of the central claim.
  2. [Abstract / error term discussion] Error-control claim: E^{(M)} is said to be 'controlled by the tail of the semi-discrete convolution kernel,' yet the kernel for |ξ|^α decays as |x|^{-1-α}. No explicit operator-norm bound ||E^{(M)}|| ≤ f(M,N,α,h) is supplied, nor is the required padding ratio M/N characterized. For power-law kernels the tail contribution to the operator norm is not automatically negligible; without such a bound it remains unclear whether polynomially bounded padding suffices for a useful block-encoding error.
minor comments (2)
  1. [Notation] Notation: the distinction between the circulant surrogate à and the target Toeplitz A is clear in the abstract but should be reinforced with a short matrix-element comparison in the main text.
  2. [Block-encoding subroutine] The manuscript would benefit from a brief remark on how the block-encoding of the symbol |ξ|^α itself is realized (e.g., via arithmetic or approximation), even if that subroutine is treated as a black box.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and for identifying the need for a self-contained derivation of the aliasing identity and an explicit error bound. These points strengthen the presentation of our central construction. We respond to each major comment below and have revised the manuscript to incorporate the requested details.

read point-by-point responses

  1. Referee: [Abstract / aliasing identity section] Abstract and aliasing-identity section: the exact identity P_{N→M}^† Ã^{(M)}_{α,h} P_{N→M} = A^{(N)}_{α,h} + E^{(M)} is stated without a derivation, proof sketch, or explicit matrix-element calculation. Because this identity is the load-bearing step that converts the circulant QFT action into the target Toeplitz truncation plus controlled error, its absence prevents verification of the central claim.

    Authors: We agree that an explicit derivation is necessary to verify the central claim. The original manuscript states the identity as following directly from the zero-padding construction but does not include a proof sketch in the abstract or early sections. In the revised manuscript we have added a dedicated subsection that derives the identity via direct matrix-element computation: for basis vectors supported on the physical N sites, the action of the padded circulant operator followed by compression reproduces the Toeplitz entries of A^{(N)}_{α,h} exactly, while the discrepancy E^{(M)} arises solely from the kernel contributions that would have involved the zero-padded region. This establishes the claimed decomposition without additional assumptions. revision: yes

  2. Referee: [Abstract / error term discussion] Error-control claim: E^{(M)} is said to be 'controlled by the tail of the semi-discrete convolution kernel,' yet the kernel for |ξ|^α decays as |x|^{-1-α}. No explicit operator-norm bound ||E^{(M)}|| ≤ f(M,N,α,h) is supplied, nor is the required padding ratio M/N characterized. For power-law kernels the tail contribution to the operator norm is not automatically negligible; without such a bound it remains unclear whether polynomially bounded padding suffices for a useful block-encoding error.

    Authors: We acknowledge that an explicit operator-norm bound is required to determine the padding overhead. The manuscript notes control by the kernel tail but does not supply the quantitative estimate. In the revision we have added a lemma that bounds ||E^{(M)}|| ≤ C(α) (N/M)^α (with C(α) independent of h and N for M > 2N), obtained by summing the |x|^{-1-α} tail of the semi-discrete kernel over the padded region and applying standard Schur-test or Young-inequality arguments for the resulting convolution remainder. This shows that any fixed relative error ε can be achieved with M = O(N ε^{-1/α}), which is polynomial in the system size for fixed α. We have also inserted a short discussion of the resulting circuit-depth overhead. revision: yes

Circularity Check

0 steps flagged

No circularity in the operator construction

full rationale

The paper derives the compressed block-encoding relation P_{N→M}^† Ã^{(M)}_{α,h} P_{N→M} = A^{(N)}_{α,h} + E^{(M)} from an explicit zero-padding construction applied to the circulant QFT implementation of the fractional symbol. This follows from the stated exact Toeplitz-to-circulant aliasing identity and the decay properties of the semi-discrete kernel, without any reduction to fitted parameters, self-definitional loops, or load-bearing self-citations. The error term E^{(M)} is characterized directly in terms of the kernel tail rather than being asserted by construction or prior author results. The overall derivation is therefore self-contained as a compilation primitive and does not collapse to its inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The construction relies on standard quantum circuit primitives and the existence of a semi-discrete convolution kernel for the fractional Laplacian. No free parameters or new entities are introduced in the abstract.

axioms (2)
  • standard math The native QFT diagonalizes circulant matrices rather than Toeplitz truncations.
    Stated directly in the abstract as the source of the periodic surrogate.
  • domain assumption Zero-padding followed by compression yields the open-boundary operator plus a controllable error term.
    Central to the recovery step; treated as following from the aliasing identity.

pith-pipeline@v0.9.0 · 5790 in / 1282 out tokens · 37538 ms · 2026-05-19T21:18:52.527785+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

42 extracted references · 42 canonical work pages · 1 internal anchor

  1. [1]

    Metzler and J

    R. Metzler and J. Klafter, Phys. Rep.339, 1 (2000)

    work page 2000

  2. [2]

    Applebaum,L´ evy Processes and Stochastic Calculus, 2nd ed

    D. Applebaum,L´ evy Processes and Stochastic Calculus, 2nd ed. (Cambridge University Press, Cambridge, 2009)

    work page 2009

  3. [3]

    Laskin, Phys

    N. Laskin, Phys. Rev. E66, 056108 (2002)

    work page 2002

  4. [4]

    Duo, H.-W

    S. Duo, H.-W. van Wyk, and Y. Zhang, J. Comput. Phys.355, 233 (2018)

    work page 2018

  5. [5]

    Huang and A

    Y. Huang and A. Oberman, SIAM J. Numer. Anal.52, 3056 (2014)

    work page 2014

  6. [6]

    Kwa´ snicki, Fractional Calculus and Applied Analysis20, 7 (2017)

    M. Kwa´ snicki, Fractional Calculus and Applied Analysis20, 7 (2017)

    work page 2017

  7. [7]

    Caffarelli and L

    L. Caffarelli and L. Silvestre, Communications in Partial Differential Equations32, 1245 (2007)

    work page 2007

  8. [8]

    Bucur and E

    C. Bucur and E. Valdinoci,Nonlocal Diffusion and Applications, Lecture Notes of the Unione Matematica Italiana (Springer, Cham, 2016)

    work page 2016

  9. [9]

    Defterli, M

    O. Defterli, M. D’Elia, Q. Du, M. Gunzburger, R. Lehoucq, and M. M. Meerschaert, Fractional Calculus and Applied Analysis18, 342 (2015)

    work page 2015

  10. [10]

    S. Duo, H. Wang, and Y. Zhang, arXiv preprint arXiv:1711.06916 (2017)

    work page arXiv 2017

  11. [11]

    Lischke, G

    A. Lischke, G. Pang, M. Gulian, F. Song, C. Glusa, X. Zheng, Z. Mao, W. Cai, M. M. Meerschaert, M. Ainsworth,et al., Journal of Computational Physics404, 109009 (2020)

    work page 2020

  12. [12]

    A. Dhar, A. Kundu, and A. Kundu, Frontiers in Physics7, 159 (2019)

    work page 2019

  13. [13]

    Kazemian and G

    S. Kazemian and G. Fanchini, Journal of Physics: Condensed Matter (2025)

    work page 2025

  14. [14]

    Bonito and J

    A. Bonito and J. E. Pasciak, Mathematics of Computation84, 2083 (2015)

    work page 2083

  15. [15]

    Acosta and J

    G. Acosta and J. P. Borthagaray, SIAM Journal on Numerical Analysis55, 472 (2017)

    work page 2017

  16. [16]

    Bonito, W

    A. Bonito, W. Lei, and J. E. Pasciak, Numerische Mathematik142, 235 (2019)

    work page 2019

  17. [17]

    Lubasch, Y

    M. Lubasch, Y. Kikuchi, L. Wright, and C. Mc Keever, Phys. Rev. Research7, 043326 (2025)

    work page 2025

  18. [18]

    Wright, C

    L. Wright, C. Mc Keever, J. T. First, R. Johnston, J. Tillay, S. Chaney, M. Rosenkranz, and M. Lubasch, Phys. Rev. Research6, 043169 (2024)

    work page 2024

  19. [19]

    Zhou and Y

    S. Zhou and Y. Zhang, Computers and Mathematics with Applications168, 133 (2024)

    work page 2024

  20. [20]

    Strang, Stud

    G. Strang, Stud. Appl. Math.74, 171 (1986)

    work page 1986

  21. [21]

    P. J. Davis,Circulant Matrices(Wiley, New York, 1979)

    work page 1979

  22. [22]

    R. M. Gray, Foundations and Trends in Communications and Information Theory2, 155 (2006)

    work page 2006

  23. [23]

    R. H. Chan and M. K. Ng, SIAM Review38, 427 (1996)

    work page 1996

  24. [24]

    A. W. Harrow, A. Hassidim, and S. Lloyd, Physical Review Letters103, 150502 (2009)

    work page 2009

  25. [25]

    A. M. Childs, R. Kothari, and R. D. Somma, SIAM Journal on Computing46, 1920 (2017)

    work page 1920

  26. [26]

    Gily´ en, Y

    A. Gily´ en, Y. Su, G. H. Low, and N. Wiebe, inProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing(2019) pp. 193–204

    work page 2019

  27. [27]

    G. H. Low and I. L. Chuang, Quantum3, 163 (2019)

    work page 2019

  28. [28]

    Y. Cao, A. Papageorgiou, I. Petras, J. F. Traub, and S. Kais, New Journal of Physics15, 013021 (2013)

    work page 2013

  29. [29]

    Montanaro and S

    A. Montanaro and S. Pallister, Physical Review A93, 032324 (2016)

    work page 2016

  30. [30]

    D. W. Berry, A. M. Childs, A. Ostrander, and G. Wang, Communications in Mathematical Physics356, 1057 (2017)

    work page 2017

  31. [31]

    P. C. S. Costa, S. Jordan, and A. Ostrander, Physical Review A99, 012323 (2019)

    work page 2019

  32. [32]

    A. M. Childs, J.-P. Liu, and A. Ostrander, Quantum5, 574 (2021)

    work page 2021

  33. [33]

    J. M. Martyn, Z. M. Rossi, A. K. Tan, and I. L. Chuang, PRX Quantum2, 040203 (2021)

    work page 2021

  34. [34]

    A. M. Childs and N. Wiebe, Quantum Information and Computation12, 901 (2012)

    work page 2012

  35. [35]

    D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, Physical Review Letters114, 090502 (2015)

    work page 2015

  36. [36]

    G. H. Low and I. L. Chuang, Physical Review Letters118, 010501 (2017)

    work page 2017

  37. [37]

    M. A. Nielsen and I. L. Chuang,Quantum Computation and Quantum Information, 10th ed. (Cambridge University Press, Cambridge, 2010)

    work page 2010

  38. [38]

    T. F. Chan, SIAM Journal on Scientific and Statistical Computing9, 766 (1988)

    work page 1988

  39. [39]

    J. Wu, B. Yan, F. Fan, B. Xu, J. Wang, D. Liu, and M. Gu, Advanced Quantum Technologies9, e00670 (2026)

    work page 2026

  40. [40]

    Javanmard, arXiv preprint arXiv:2603.24822 (2026)

    Y. Javanmard, arXiv preprint arXiv:2603.24822 (2026)

    work page arXiv 2026

  41. [41]

    Optimizing Quantum Circuits for Arithmetic

    T. H¨ aner, M. Roetteler, and K. M. Svore, Quantum2, 74 (2018), arXiv:1805.12445 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  42. [42]

    Javanmard, arXiv preprint arXiv:2407.19348 (2024)

    Y. Javanmard, arXiv preprint arXiv:2407.19348 (2024)

    work page arXiv 2024