Moment-Structured Block Encodings of Periodic Finite-Difference Operators

• URL: http://arxiv.org/abs/2607.11596v1
• Date: Mon, 13 Jul 2026 14:17:57 GMT
• Title: Moment-Structured Block Encodings of Periodic Finite-Difference Operators
• Abstract summary: Block encoding is the standard technique for accessing matrix data in quantum linear-algebra algorithms.<n>Explicit construction of block encodings with provably optimal subnormalization exists for only a handful of operators.<n>We develop a framework to block encode translation-invariant finite-difference operators on a periodic grid.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Block encoding is the standard technique for accessing matrix data in quantum linear-algebra algorithms. Its implementation directly affects its subnormalization, which in turn controls the algorithm's success probability, simulation time, and downstream costs. Explicit construction of block encodings with provably optimal subnormalization exists for only a handful of operators, with bespoke calculations used in its design. In this work, we develop a framework to block encode translation-invariant finite-difference operators on a periodic grid. These operators are the finite-difference discretizations of the constant-coefficient partial differential equations that sit at the core of scientific computing. We show that the moment order of these stencils can be used to simultaneously determine the continuum operator approximated, the vanishing order of the Fourier symbol, and the cost of the block encoding. From there, we derive a closed-form optimality criterion as a function of the stencil coefficients, which certifies whether the construction attains the optimal subnormalization for an entire operator family, uniformly in grid size, and quantifies the gap when it does not. The framework subsumes optimal constructions for the Laplacian operator in the literature and can be used to certify new instances at higher even orders, including the biharmonic operator. Furthermore, we derive success-probability floors parameterized by spectral properties of the operator's symbol and find explicit constants for the block encoding of the advection-diffusion family for which no prior explicit spatial block encoding exists.

Related papers

• Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions [45.88028371034407]
  Block encoding provides the standard method for accessing matrix data within quantum circuits.<n>We present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian.
  arXiv  Detail & Related papers  (2026-03-12T19:35:16Z)
• Compile-once block encodings for masked similarity-transformed effective Hamiltonians [9.489652688191917]
  We present COMPOSER, a compile-once modular parametric parametric for similarity-encoded oracle effective reduction of electronic-structure operators.<n>Low-rank factorization compress Hamiltonians and anti-Hermitian generators into rank-one bilinear and projected-quadratic ladders.<n>A fixed orbital pool and qubit register is compiled once; geometry, active-space (mask) updates, and truncations are absorbed by re-dialed single-qubit rotations.
  arXiv  Detail & Related papers  (2026-02-28T18:05:51Z)
• 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)
• Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformer [65.38883376379812]
  We propose the Discrete Transformer, an architecture engineered to bridge the gap between continuous representations and discrete symbolic logic.<n> Empirically, the Discrete Transformer not only achieves performance comparable to RNN-based baselines but crucially extends interpretability to continuous variable domains.
  arXiv  Detail & Related papers  (2026-01-09T12:49:41Z)
• Structural encoding with classical codes for computational-basis bit-flip correction in the early fault-tolerant regime [0.6524460254566904]
  We propose a novel framework that integrates quantum computation with the functionality of classical error correction.<n>In this approach, quantum computation is performed within the codeword subspace defined by a classical error correction code.
  arXiv  Detail & Related papers  (2025-10-13T01:36:06Z)
• Efficient and Explicit Block Encoding of Finite Difference Discretizations of the Laplacian [0.0]
  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.
  arXiv  Detail & Related papers  (2025-09-02T15:31:43Z)
• Factorizers for Distributed Sparse Block Codes [45.29870215671697]
  We propose a fast and highly accurate method for factorizing distributed block codes (SBCs) Our iterative factorizer introduces a threshold-based nonlinear activation, conditional random sampling, and an $ell_infty$-based similarity metric. We demonstrate the feasibility of our method on four deep CNN architectures over CIFAR-100, ImageNet-1K, and RAVEN datasets.
  arXiv  Detail & Related papers  (2023-03-24T12:31:48Z)
• On efficient quantum block encoding of pseudo-differential operators [6.134067544403308]
  Block encoding lies at the core of many existing quantum algorithms. This paper presents a study of the block encoding of a rich family of dense operators: the pseudo-differential operators (PDOs)
  arXiv  Detail & Related papers  (2023-01-21T07:18:57Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• Differentiable Top-k Operator with Optimal Transport [135.36099648554054]
  The SOFT top-k operator approximates the output of the top-k operation as the solution of an Entropic Optimal Transport (EOT) problem. We apply the proposed operator to the k-nearest neighbors and beam search algorithms, and demonstrate improved performance.
  arXiv  Detail & Related papers  (2020-02-16T04:57:52Z)
• Supervised Quantile Normalization for Low-rank Matrix Approximation [50.445371939523305]
  We learn the parameters of quantile normalization operators that can operate row-wise on the values of $X$ and/or of its factorization $UV$ to improve the quality of the low-rank representation of $X$ itself. We demonstrate the applicability of these techniques on synthetic and genomics datasets.
  arXiv  Detail & Related papers  (2020-02-08T21:06: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.