pith. machine review for the scientific record. sign in

arxiv: 2603.12405 · v2 · submitted 2026-03-12 · 🪐 quant-ph

Recognition: 2 theorem links

· Lean Theorem

Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions

Alexandre Boutot , Viraj Dsouza
Authors on Pith no claims yet

Pith reviewed 2026-05-15 11:37 UTC · model grok-4.3

classification 🪐 quant-ph
keywords block encodingdiscrete Laplacianquantum circuitsboundary conditionsfinite differenceHamiltonian simulation
0
0 comments X

The pith

Block encodings now support discrete Laplacians with mixed boundary conditions per axis.

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

The paper develops explicit quantum circuit constructions that block-encode finite-difference discretizations of the Laplacian operator. These circuits accommodate Dirichlet, periodic, or Neumann boundary conditions chosen independently along each spatial dimension, including anisotropic grids in one to three dimensions. The approach uses a single modular architecture instead of separate designs for each boundary type. A reader would care because this reduces circuit depth relative to general-purpose block encodings and raises the success probability of the resulting quantum algorithms for PDEs or Hamiltonian simulation.

Core claim

We present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian that supports Dirichlet, periodic, and Neumann boundary conditions in arbitrary spatial dimensions. Our construction allows different boundary conditions and grid sizes to be specified independently along each coordinate axis, enabling mixed-boundary and anisotropic discretizations within a single modular circuit architecture. We provide analytical gate-complexity estimates and perform circuit-level benchmarks after transpilation to an IBM hardware gate set. Across one-, two-, and three-dimensional examples, the resulting circuits exhibit substantially lower gate counts and higher

What carries the argument

A modular circuit architecture that composes one-dimensional discrete-Laplacian block encodings along each axis while inserting boundary-specific adjustments through selective additions of shifted identity blocks.

If this is right

  • Gate counts drop substantially for 1D, 2D, and 3D Laplacians relative to generic block-encoding techniques.
  • Success probabilities increase on hardware simulation for the same accuracy target.
  • Anisotropic grids and mixed boundaries are handled by the same circuit skeleton without redesign.
  • Analytical complexity expressions scale with dimension count and local grid size.

Where Pith is reading between the lines

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

  • The same modular blocks could be reused inside larger quantum PDE solvers that alternate between different boundary types over time.
  • Combining these encodings with product-formula time evolution would yield circuits for the heat or wave equation on irregular domains.
  • Numerical tests on grids larger than those benchmarked would show whether the reported depth advantage persists under realistic noise.

Load-bearing premise

The analytical gate counts remain favorable once the circuit is fully transpiled and that the underlying finite-difference stencil stays accurate enough for the target applications.

What would settle it

Transpile the 3D mixed-boundary construction to the IBM gate set for a 16-point grid per axis and compare measured success probability against the paper's reported benchmark value.

Figures

Figures reproduced from arXiv: 2603.12405 by Alexandre Boutot, Viraj Dsouza.

Figure 1
Figure 1. Figure 1: Block encoding circuit for the 1D Laplacian with periodic boundary, as provided in [ [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Block encoding circuit for the 1D Laplacian with Dirichlet boundary. [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Block encoding circuit for the 1D Laplacian with Neumann boundary. [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Block encoding circuit for the D−dimensional Laplacian with boundaries b0, b1, · · · bD−1 where each bi can be Dirichlet, periodic or Neumann. The circuits for each Ubi can be inferred from the 1D constructions provided earlier. For example, if a dimension m has a periodic boundary, Ubm is just the Identity matrix. Proof. Similar to the 1D cases, we verify the block encoding relation on computational basis… view at source ↗
Figure 5
Figure 5. Figure 5: State preparation circuit (Uprep_k) for D = 3, 4. The rotation angles for the RY and controlled-RY gates are θ0 = 2 arccos (√ ω0 + ω2), θ1 = 2 arccos (q ω0 ω0+ω2 ), θ2 = 2 arccos (q ω1 ω1+ω3 ). goal is to express the implementation cost in the Clifford+T basis, which is the standard metric for fault-tolerant quantum computation. The circuit contains three types of components: (i) single-qubit Clifford gate… view at source ↗
Figure 6
Figure 6. Figure 6: Comparison of resources for block encoding constructions of the [PITH_FULL_IMAGE:figures/full_fig_p014_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Comparison of resources for block encoding constructions of the [PITH_FULL_IMAGE:figures/full_fig_p014_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Comparison of resources for block encoding constructions of the [PITH_FULL_IMAGE:figures/full_fig_p014_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Success probability of different block encoding constructions for the [PITH_FULL_IMAGE:figures/full_fig_p015_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Comparison of resources for block encoding constructions of the [PITH_FULL_IMAGE:figures/full_fig_p015_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Success probability of block encoding constructions for the [PITH_FULL_IMAGE:figures/full_fig_p016_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Comparison of resources for block encoding constructions of a [PITH_FULL_IMAGE:figures/full_fig_p016_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Success probability of block encoding constructions for the [PITH_FULL_IMAGE:figures/full_fig_p017_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Heat maps of the matrices obtained from the top-left block of the block encoding unitaries [PITH_FULL_IMAGE:figures/full_fig_p020_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: Heat maps of the matrices obtained from the top-left block of the block encoding unitary [PITH_FULL_IMAGE:figures/full_fig_p020_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: Heat maps of the matrices obtained from the top-left block of the block encoding unitary [PITH_FULL_IMAGE:figures/full_fig_p021_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: Comparison of circuit resources for block encoding constructions of the [PITH_FULL_IMAGE:figures/full_fig_p021_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: Success probability of the block encoding constructions for the [PITH_FULL_IMAGE:figures/full_fig_p021_18.png] view at source ↗
Figure 19
Figure 19. Figure 19: Comparison of circuit resources for block encoding constructions of the [PITH_FULL_IMAGE:figures/full_fig_p022_19.png] view at source ↗
Figure 20
Figure 20. Figure 20: Comparison of circuit resources for block encoding constructions of the [PITH_FULL_IMAGE:figures/full_fig_p022_20.png] view at source ↗
Figure 21
Figure 21. Figure 21: Success probability of the block encoding constructions for the [PITH_FULL_IMAGE:figures/full_fig_p022_21.png] view at source ↗
read the original abstract

Discrete Laplacian operators arise ubiquitously in scientific computing and frequently appear in quantum algorithms for tasks such as linear algebra, Hamiltonian simulation, and partial differential equations. Block encoding provides the standard method for accessing matrix data within quantum circuits. Efficient implementations of such algorithms require efficient block encodings of the discretized operator. While several general-purpose techniques exist for block encoding arbitrary matrices, they usually require deep quantum circuits. Moreover, existing efficient constructions that exploit Laplacian structure are limited in scope, typically assuming fixed boundary conditions or uniform grid resolutions. In this work, we present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian that supports Dirichlet, periodic, and Neumann boundary conditions in arbitrary spatial dimensions. Our construction allows different boundary conditions and grid sizes to be specified independently along each coordinate axis, enabling mixed-boundary and anisotropic discretizations within a single modular circuit architecture. We provide analytical gate-complexity estimates and perform circuit-level benchmarks after transpilation to an IBM hardware gate set. Across one-, two-, and three-dimensional examples, the resulting circuits exhibit substantially lower gate counts and higher success probabilities when compared to certain existing approaches.

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 presents a unified framework for explicitly block-encoding finite-difference discretizations of the Laplacian that supports Dirichlet, periodic, and Neumann boundary conditions in arbitrary dimensions. The construction decomposes the multi-dimensional operator as a sum of Kronecker products of independent 1D finite-difference operators, each block-encoded according to its own boundary condition and grid size, enabling mixed-boundary and anisotropic discretizations within a single modular circuit architecture. Analytical gate-complexity estimates are provided along with post-transpilation benchmarks on an IBM hardware gate set showing lower gate counts and higher success probabilities than certain existing approaches.

Significance. If the central construction holds, the result would provide a practical modular primitive for quantum algorithms involving PDEs, Hamiltonian simulation, and linear systems, extending existing block-encoding techniques to flexible boundary conditions and grid resolutions without requiring global adjustments or additional cross terms. The tensor-product structure and reported circuit metrics represent a concrete advance in making such discretizations implementable on near-term hardware.

major comments (2)
  1. [Abstract and construction overview] The abstract and construction summary indicate that analytical gate counts are derived from LCU or product-formula techniques applied to the sum of Kronecker products, but the manuscript does not appear to include a full step-by-step derivation of the block-encoding unitary or the precise scaling with dimension and grid size; this makes it difficult to verify the claimed parameter-free nature of the estimates.
  2. [Numerical benchmarks section] Benchmarks are reported after transpilation, but without explicit error-bar details or the exact baseline circuits used for comparison, it is unclear whether the reported reduction in gate count and improvement in success probability is robust across different grid sizes or merely holds for the specific 1D/2D/3D examples shown.
minor comments (2)
  1. [Section 2] Notation for the 1D operators and their boundary-condition-specific block encodings should be introduced with explicit matrix forms or circuit diagrams in an early section to improve readability for readers unfamiliar with the LCU decomposition.
  2. [Analytical estimates] The manuscript would benefit from a short table summarizing the gate-complexity scaling for each boundary-condition type (Dirichlet, Neumann, periodic) as a function of grid size n.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive assessment and recommendation for minor revision. The comments highlight opportunities to improve clarity in the construction and benchmarks, which we will address in the revised manuscript.

read point-by-point responses

  1. Referee: [Abstract and construction overview] The abstract and construction summary indicate that analytical gate counts are derived from LCU or product-formula techniques applied to the sum of Kronecker products, but the manuscript does not appear to include a full step-by-step derivation of the block-encoding unitary or the precise scaling with dimension and grid size; this makes it difficult to verify the claimed parameter-free nature of the estimates.

    Authors: We agree that additional detail would aid verification. The 1D block encodings and their Kronecker-sum combination via LCU are derived in Section 3, but we will expand this section in the revision to include an explicit step-by-step construction of the overall unitary, together with the closed-form gate-complexity scaling in dimension d and grid size N that confirms the parameter-free estimates. revision: yes

  2. Referee: [Numerical benchmarks section] Benchmarks are reported after transpilation, but without explicit error-bar details or the exact baseline circuits used for comparison, it is unclear whether the reported reduction in gate count and improvement in success probability is robust across different grid sizes or merely holds for the specific 1D/2D/3D examples shown.

    Authors: The reported benchmarks use representative 1D/2D/3D grids with mixed boundary conditions. In the revision we will add error bars obtained from repeated transpilation runs, explicitly document the baseline circuits, and include results for a broader range of grid sizes to demonstrate that the observed improvements hold more generally. revision: yes

Circularity Check

0 steps flagged

Minor self-citation not load-bearing; derivation self-contained

full rationale

The central construction decomposes the multi-dimensional discrete Laplacian as a sum of Kronecker products of independent 1D finite-difference operators, each block-encoded according to its own boundary condition and grid size. This tensor-product structure directly supports the claimed modularity for mixed BCs and anisotropic grids without requiring additional cross terms or global adjustments. The provided analytical gate counts and post-transpilation benchmarks are consistent with standard LCU or product-formula techniques for such sums; no internal contradiction appears in the derivation or the reported circuit metrics. Self-citations to prior block-encoding primitives exist but are not load-bearing for the explicit constructions presented.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The framework rests on standard quantum circuit primitives for block encoding and finite-difference stencils; no new free parameters, ad-hoc axioms, or invented entities are introduced.

axioms (1)
  • standard math Standard properties of block encodings and finite-difference discretizations hold
    The construction invokes known quantum primitives and grid-based approximations without additional proof.

pith-pipeline@v0.9.0 · 5490 in / 1094 out tokens · 43672 ms · 2026-05-15T11:37:07.196776+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.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface

    quant-ph 2026-04 unverdicted novelty 6.0

    The Eclipse Qrisp BlockEncoding interface provides high-level programming abstractions for block-encodings, enabling easier implementation of quantum algorithms such as QSVT, matrix inversion, and Hamiltonian simulation.

Reference graph

Works this paper leans on

28 extracted references · 28 canonical work pages · cited by 1 Pith paper · 3 internal anchors

  1. [1]

    Numerical solution of partial differential equations: Finite difference methods

    G. D. Smith. “Numerical solution of partial differential equations: Finite difference methods”. Oxford Applied Mathematics and Computing Science Series. Clarendon Press. Oxford (1993). 3 edition

    work page 1993

  2. [2]

    Krylov subspace methods for linear systems

    Tomohiro Sogabe. “Krylov subspace methods for linear systems”. Volume 60 of Springer Series in Computational Mathematics. Springer Nature. Singapore (2022)

    work page 2022

  3. [3]

    Quantum computation and quantum information

    Michael A. Nielsen and Isaac L. Chuang. “Quantum computation and quantum information”. Cambridge University Press. Cambridge (2010). 17

    work page 2010

  4. [4]

    Quantum linear system solvers: A survey of algorithms and applications

    Mauro E. S. Morales, Lirandë Pira, Philipp Schleich, Kelvin Koor, Pedro C. S. Costa, Dong An, Alán Aspuru-Guzik, Lin Lin, Patrick Rebentrost, and Dominic W. Berry. “Quantum linear system solvers: A survey of algorithms and applications” (2025). arXiv:2411.02522

    work page arXiv 2025

  5. [5]

    Optimal hamiltonian simulation by quantum signal processing

    Guang Hao Low and Isaac L. Chuang. “Optimal hamiltonian simulation by quantum signal processing”. Phys. Rev. Lett.118, 010501 (2017)

    work page 2017

  6. [6]

    Quantum singular value transfor- mation and beyond: exponential improvements for quantum matrix arithmetics

    András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe. “Quantum singular value transfor- mation and beyond: exponential improvements for quantum matrix arithmetics”. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Page 193–204. STOC ’19. ACM (2019)

    work page 2019

  7. [7]

    FABLE: Fast approximate quantum circuits for block- encodings

    Daan Camps and Roel Van Beeumen. “FABLE: Fast approximate quantum circuits for block- encodings” (2022). arXiv:2205.00081

    work page arXiv 2022

  8. [8]

    Quantum resources required to block-encode a matrix of classical data

    B. David Clader, Alexander M. Dalzell, Nikitas Stamatopoulos, Grant Salton, Mario Berta, and William J. Zeng. “Quantum resources required to block-encode a matrix of classical data”. IEEE Transactions on Quantum Engineering3, 1–23 (2022)

    work page 2022

  9. [9]

    Hamiltonian simulation using linear combinations of unitary operations

    Andrew M. Childs and Nathan Wiebe. “Hamiltonian simulation using linear combinations of unitary operations”. Quantum Info. Comput.12, 901–924 (2012)

    work page 2012

  10. [10]

    Binary tree block encoding of classical matrix

    Zexian Li, Xiao-Ming Zhang, Chunlin Yang, and Guofeng Zhang. “Binary tree block encoding of classical matrix”. IEEE Transactions on Quantum Engineering7, 1–18 (2026)

    work page 2026

  11. [11]

    Efficient block- encodings require structure

    Parker Kuklinski, Benjamin Rempfer, Justin Elenewski, and Kevin Obenland. “Efficient block- encodings require structure” (2025). arXiv:2509.19667

    work page arXiv 2025

  12. [12]

    Hamiltonian simulation by qubitization

    Guang Hao Low and Isaac L. Chuang. “Hamiltonian simulation by qubitization”. Quantum3, 163 (2019)

    work page 2019

  13. [13]

    Explicit quantum circuits for block encodings of certain sparse matrices

    Daan Camps, Lin Lin, Roel Van Beeumen, and Chao Yang. “Explicit quantum circuits for block encodings of certain sparse matrices” (2023). arXiv:2203.10236

    work page arXiv 2023

  14. [14]

    Block-encoding structured matrices for data input in quantum computing

    Christoph Sünderhauf, Earl Campbell, and Joan Camps. “Block-encoding structured matrices for data input in quantum computing”. Quantum8, 1226 (2024)

    work page 2024

  15. [15]

    Efficient and explicit block encoding of finite difference discretizations of the laplacian

    Andreas Sturm and Niclas Schillo. “Efficient and explicit block encoding of finite difference discretizations of the laplacian” (2025). arXiv:2509.02429

    work page arXiv 2025

  16. [16]

    Quantum computing with Qiskit

    Ali Javadi-Abhari, Matthew Treinish, Kevin Krsulich, Christopher J. Wood, Jake Lishman, Julien Gacon, Simon Martiel, Paul D. Nation, Lev S. Bishop, Andrew W. Cross, Blake R. Johnson, and Jay M. Gambetta. “Quantum computing with qiskit” (2024). arXiv:2405.08810

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  17. [17]

    laplacian_beqc

    TDC28. “laplacian_beqc”.https://github.com/TDC28/laplacian_beqc(2025). GitHub repos- itory

    work page 2025

  18. [18]

    Creating superpositions that correspond to efficiently integrable probability distributions

    Lov Grover and Terry Rudolph. “Creating superpositions that correspond to efficiently integrable probability distributions” (2002). arXiv:quant-ph/0208112

    work page internal anchor Pith review Pith/arXiv arXiv 2002

  19. [19]

    Rise of conditionally clean ancillae for efficient quantum circuit constructions

    Tanuj Khattar and Craig Gidney. “Rise of conditionally clean ancillae for efficient quantum circuit constructions”. Quantum9, 1752 (2025)

    work page 2025

  20. [20]

    Elementary gates for quantum computation

    Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margo- lus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter. “Elementary gates for quantum computation”. Phys. Rev. A52, 3457–3467 (1995)

    work page 1995

  21. [21]

    Efficient implementation of multicontrolled quantum gates

    Ben Zindorf and Sougato Bose. “Efficient implementation of multicontrolled quantum gates”. Phys. Rev. Appl.24, 044030 (2025)

    work page 2025

  22. [22]

    Quantum circuits of T-depth one

    Peter Selinger. “Quantum circuits of T-depth one”. Phys. Rev. A87, 042302 (2013)

    work page 2013

  23. [23]

    Constructing large controlled NOTs

    Craig Gidney. “Constructing large controlled NOTs”.https://algassert.com/circuits/2015/ 06/05/Constructing-Large-Controlled-Nots.html(2015). Blog post. 18

    work page 2015

  24. [24]

    Advantages of using relative-phase toffoli gates with an application to multiple control toffoli optimization

    Dmitri Maslov. “Advantages of using relative-phase toffoli gates with an application to multiple control toffoli optimization”. Phys. Rev. A93, 022311 (2016)

    work page 2016

  25. [25]

    Quantum networks for elementary arithmetic operations

    Vlatko Vedral, Adriano Barenco, and Artur Ekert. “Quantum networks for elementary arithmetic operations”. Phys. Rev. A54, 147–153 (1996)

    work page 1996

  26. [26]

    Halving the cost of quantum addition

    Craig Gidney. “Halving the cost of quantum addition”. Quantum2, 74 (2018)

    work page 2018

  27. [27]

    A logarithmic-depth quantum carry-lookahead adder

    Thomas G. Draper, Samuel A. Kutin, Eric M. Rains, and Krysta M. Svore. “A logarithmic-depth quantum carry-lookahead adder” (2004). arXiv:quant-ph/0406142

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  28. [28]

    Trading T gates for dirty qubits in state preparation and unitary synthesis

    Guang Hao Low, Vadym Kliuchnikov, and Luke Schaeffer. “Trading T gates for dirty qubits in state preparation and unitary synthesis”. Quantum8, 1375 (2024). 19 Appendix A Structure of Discrete Laplacian Matrices In this appendix we visualize the structure of the discrete Laplacian operators considered throughout the paper. Rather than constructing the matr...

    work page 2024