Explicit block-encodings for biharmonic boundary-value problems

• URL: http://arxiv.org/abs/2607.22396v1
• Date: Fri, 24 Jul 2026 15:20:32 GMT
• Title: Explicit block-encodings for biharmonic boundary-value problems
• Abstract summary: We develop quantum linear-system algorithms for periodic, simply supported, and Dirichlet--Neumann boundary conditions.<n>For Dirichlet--Neumann problems, we introduce a second-order boundary-corrected finite-difference discretization.<n>We also formulate a coupled-Laplace system with additional boundary unknowns.
• Score: 1.5922179327791923
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The biharmonic equation is a prototypical fourth-order partial differential equation whose high-dimensional discretization suffers from rapidly growing degrees of freedom and severe ill-conditioning. We develop QSVT--VTAA quantum linear-system algorithms by constructing explicit block-encodings tailored to periodic, simply supported, and Dirichlet--Neumann boundary conditions. For periodic and simply supported problems, Fourier and sine-transform diagonalizations yield augmented Poisson systems with the condition-number scaling of a second-order operator. For Dirichlet--Neumann problems, we introduce a second-order boundary-corrected finite-difference discretization, establish mesh-independent stability, and construct an explicit block-encoding of the resulting nonsymmetric matrix. We also formulate a coupled-Laplace system with additional boundary unknowns and characterize its complexity in terms of the condition number of the complete augmented matrix. The analysis covers discretization error, block-encoding normalization, gate complexity, and solution extraction under an amplitude-input and quantum-state-output model. Numerical experiments validate the proposed discretizations and the corresponding linear solves.

Related papers

• Decoded Quantum Interferometry Beyond Hamming: Rank-Metric and Translation Association Schemes [39.146761527401424]
  Decoded Quantum Interferometry (DQI) uses coherent decoding and a quantum Fourier transform to find high-quality solutions of structured optimisation problems.<n>We extend the core DQI mechanism beyond Hamming space to finite geometries with translation symmetry.<n>We find solutions with an effective-rank proxy near min(m,n)-l, and the corresponding expected score can be converted into a constant-probability bound on the residual rank of a sample.
  arXiv  Detail & Related papers  (2026-06-03T13:12:15Z)
• Structure-Preserving Quantum Method of Lines for Evolutionary PDEs with Mixed Boundary Conditions [4.591453488105558]
  We give analysis and circuit design of structure-preserving quantum algorithms for second-order PDEs.<n>We implement our quantum algorithms with explicit block-encoding constructions and circuit implementations.<n>We conduct classical numerical experiments on the convection-diffusion equation, inhomogeneous heat equation, and Klein-Gordon equation.
  arXiv  Detail & Related papers  (2026-06-02T09:48:53Z)
• Quantum algorithms for the fractional Poisson equation via rational approximation [20.497126318288906]
  We present a quantum algorithm for solving the fractional equation ((-)s u = f) with (s in (0,1)) on bounded domains.<n>The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage.
  arXiv  Detail & Related papers  (2026-04-01T08:08:33Z)
• 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)
• 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)
• Linear combination of unitaries with exponential convergence [0.0]
  We present a general method for decomposing non-unitary operators into a linear combination of unitary operators.<n>When implemented in a quantum circuit, the subnormalisation of the resulting block encoding scales with the double logarithm of the inverse error.
  arXiv  Detail & Related papers  (2026-01-25T22:47:21Z)
• A Linear Combination of Unitaries Decomposition for the Laplace Operator [0.0]
  We provide novel linear combination of unitaries decompositions for a class of discrete elliptic differential operators.<n>The number of unitary terms required for our decomposition is independent of the number of grid points used in the discretization.<n>Explicit circuit constructions for each unitary are given and their complexities analyzed.
  arXiv  Detail & Related papers  (2026-01-10T00:54:39Z)
• Explicit block encodings of boundary value problems for many-body elliptic operators [3.326871636198696]
  We systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators.<n>We provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions.<n>We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential.
  arXiv  Detail & Related papers  (2024-07-25T19:29:33Z)
• Polynomial-time Solver of Tridiagonal QUBO, QUDO and Tensor QUDO problems with Tensor Networks [41.94295877935867]
  We present a quantum-inspired tensor network algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization problems.<n>We also solve the more general quadratic unconstrained discrete optimization problems with one-neighbor interactions in a lineal chain.
  arXiv  Detail & Related papers  (2023-09-19T10:45:15Z)
• Blockwise Stochastic Variance-Reduced Methods with Parallel Speedup for Multi-Block Bilevel Optimization [43.74656748515853]
  Non-stationary multi-block bilevel optimization problems involve $mgg 1$ lower level problems and have important applications in machine learning. We aim to achieve three properties for our algorithm: a) matching the state-of-the-art complexity of standard BO problems with a single block; (b) achieving parallel speedup by sampling $I$ samples for each sampled block per-iteration; and (c) avoiding the computation of the inverse of a high-dimensional Hessian matrix estimator.
  arXiv  Detail & Related papers  (2023-05-30T04:10:11Z)
• On optimization of coherent and incoherent controls for two-level quantum systems [77.34726150561087]
  This article considers some control problems for closed and open two-level quantum systems. The closed system's dynamics is governed by the Schr"odinger equation with coherent control. The open system's dynamics is governed by the Gorini-Kossakowski-Sudarshan-Lindblad master equation.
  arXiv  Detail & Related papers  (2022-05-05T09:08:03Z)

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.