Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions
arXiv QuantumArchived Mar 16, 2026✓ Full text saved
arXiv:2603.12405v1 Announce Type: new 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 technique
Full text archived locally
✦ AI Summary· Claude Sonnet
Quantum Physics
[Submitted on 12 Mar 2026]
Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions
Alexandre Boutot, Viraj Dsouza
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.
Comments: 21 pages, 21 figures
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:2603.12405 [quant-ph]
(or arXiv:2603.12405v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2603.12405
Focus to learn more
Submission history
From: Viraj Dsouza Mr [view email]
[v1] Thu, 12 Mar 2026 19:35:16 UTC (2,879 KB)
Access Paper:
view license
Current browse context:
quant-ph
< prev | next >
new | recent | 2026-03
References & Citations
INSPIRE HEP
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)