Efficient and Explicit Block Encoding of Finite Difference Discretizations of the Laplacian

• URL: http://arxiv.org/abs/2509.02429v1
• Date: Tue, 02 Sep 2025 15:31:43 GMT
• Title: Efficient and Explicit Block Encoding of Finite Difference Discretizations of the Laplacian
• Authors: Andreas Sturm, Niclas Schillo,
• Abstract summary: We present an efficient and explicit block encoding method that enhances existing approaches in key aspects.<n>We detail the construction of the quantum algorithm and illustrate how it leverages the unique structure of finite difference discretizations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The data input model is a fundamental component of every quantum algorithm, as its efficiency is crucial for achieving potential speed-ups over classical methods. For quantum linear algebra tasks that utilize quantum eigenvalue or singular value transformations, block encoding is the established technique for accessing matrix data. A key application of this is solving partial differential equations, where the Laplacian operator and its finite difference discretization serve as foundational examples. In this paper, we present an efficient and explicit block encoding method that enhances existing approaches in key aspects. We detail the construction of the quantum algorithm and illustrate how it leverages the unique structure of finite difference discretizations. Furthermore, we analytically derive the scaling of the sub-normalization factor and of the success probability of the block encoding with respect to the problem dimension, the grid width of the finite difference grid and the regularity of the exact solution, and we give resource estimates.

Related papers

• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Quantum remeshing and efficient encoding for fracture mechanics [0.5541644538483946]
  We present a variational quantum algorithm for structural mechanical problems, specifically addressing crack opening simulations.<n>Our approach provides an alternative solution for a relevant 2D case by implementing a parametrized quantum circuit.<n>Our method has been experimentally validated on Quandela's photonic quantum processor Ascella.
  arXiv  Detail & Related papers  (2025-10-16T14:50:59Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things [0.6138671548064355]
  We present a novel framework for Linear Combination of Unitaries (LCU)-style decomposition tailored to structured sparse matrices.<n>LCU is a foundational primitive in both variational and fault-tolerant quantum algorithms.<n>We introduce the Sigma basis, a compact set of simple, non-unitary operators that can better capture sparsity and structure.
  arXiv  Detail & Related papers  (2025-07-04T17:05:07Z)
• Double-Logarithmic Depth Block-Encodings of Simple Finite Difference Method's Matrices [0.0]
  Solving differential equations is one of the most computationally expensive problems in classical computing. Despite recent progress made in the field of quantum computing and quantum algorithms, its end-to-end application towards practical realization still remains unattainable.
  arXiv  Detail & Related papers  (2024-10-07T17:44:30Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Quantization of Large Language Models with an Overdetermined Basis [73.79368761182998]
  We introduce an algorithm for data quantization based on the principles of Kashin representation. Our findings demonstrate that Kashin Quantization achieves competitive or superior quality in model performance.
  arXiv  Detail & Related papers  (2024-04-15T12:38:46Z)
• Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy trade-offs [1.0749601922718608]
  Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms.<n>We introduce a general approach to implement unitary and non-unitary diagonal operators with efficient-adjustable-depth quantum circuits.
  arXiv  Detail & Related papers  (2024-04-03T15:42:25Z)
• Improved Quantum Algorithms for Eigenvalues Finding and Gradient Descent [0.0]
  Block encoding is a key ingredient in the recently developed quantum singular value transformation (QSVT) framework.<n>In this article, we affirm this perspective by leveraging block encoding to substantially enhance two previously proposed quantum algorithms.<n>Our findings demonstrate that even just elementary operations within the unitary block encoding framework can eliminate major scaling factors.
  arXiv  Detail & Related papers  (2023-12-22T15:59:03Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.