Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions
Summarize this article with:
Quantum Physics arXiv:2603.12405 (quant-ph) [Submitted on 12 Mar 2026] Title:Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions Authors:Alexandre Boutot, Viraj Dsouza View a PDF of the paper titled Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions, by Alexandre Boutot and Viraj Dsouza View PDF 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. Comments: 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 arXiv-issued DOI via DataCite (pending registration) Submission history From: Viraj Dsouza Mr [view email] [v1] Thu, 12 Mar 2026 19:35:16 UTC (2,879 KB) Full-text links: Access Paper: View a PDF of the paper titled Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions, by Alexandre Boutot and Viraj DsouzaView PDFTeX Source view license Current browse context: quant-ph new | recent | 2026-03 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: 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 Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)