Quantum Signal Processing for Linear PDEs: Circuit Design and Experimental Validation

• URL: http://arxiv.org/abs/2606.00368v1
• Date: Fri, 29 May 2026 21:21:32 GMT
• Title: Quantum Signal Processing for Linear PDEs: Circuit Design and Experimental Validation
• Abstract summary: We develop end-to-end implementations of quantum circuits compiled to machine-level instructions.<n>We experimentally demonstrate that the QSP-augmented algorithm can provide accurate solutions under realistic hardware constraints.
• Score: 1.814099487268094
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum algorithms offer new avenues for solving partial differential equations (PDEs). While the potential for end-to-end quantum advantage is at present not well understood, recent literature presents explicit circuit constructions for solving certain classes of linear PDEs in the frequency domain and thus offers concrete examples to study. In this work, we develop end-to-end implementations of these quantum circuits compiled to machine-level instructions and benchmark them in both numerical simulations and IBMQ hardware experiments. We focus on the advection, wave, and Poisson equations and study quantum circuits that propagate the dynamics in frequency space via the quantum Fourier transform using approximate methods based on a first-order approximation which offer compact representations with uncontrollable approximation error, and polynomial approximation methods based on quantum signal processing (QSP) leading to deeper circuits with tunable algorithmic error. In addition, we experimentally demonstrate that the QSP-augmented algorithm can provide accurate solutions under realistic hardware constraints. Finally, we extend our method to address non-homogeneous Dirichlet boundary conditions and verify it numerically for a Poisson equation with source term obtained from high-fidelity physics simulations of a capacitively coupled plasma.

Related papers

• Quantum simulation of Liouville equation in geometrical optics with partial transmission and reflection via Schrödingerization [42.22857110018992]
  This paper investigates quantum simulation algorithms for the Liouville equation in geometrical optics with partial transmission and reflection at sharp interfaces.<n>By means of a warped phase transformation in one higher dimension, the Schrdingerization method converts linear partial differential equations into a system of Schrdinger-type equations with unitary evolution.<n>We present detailed constructions of the resulting quantum algorithms and show through complexity analysis that the proposed methods achieve quantum advantage in the precision parameter $$ over their classical counterparts.
  arXiv  Detail & Related papers  (2026-03-12T14:47:16Z)
• Experimental differentiation and extremization with analog quantum circuits [0.712813885457233]
  Differentiable quantum circuits (DQC) offer a viable route to compute differential equations (DEs)<n>Quantum extremal learning (QEL) complements such approach by finding extreme points in the output of learnable models of unknown (implicit) functions.<n>We show the results from the first experimental demonstration of both DQC and QEL, displaying their performance on a synthetic usecase.
  arXiv  Detail & Related papers  (2025-10-23T16:29:28Z)
• Quantum Hamiltonian simulation of linearised Euler equations in complex geometries [0.0]
  Quantum computing promises exponential improvements in solving systems of partial differential equations.<n>One approach is via mapping classical CFD problems to a quantum Hamiltonian evolution.<n>Here we extend this method to more complex and practically relevant cases.
  arXiv  Detail & Related papers  (2025-10-20T18:00:16Z)
• Solving wave equation problems on D-Wave quantum annealers [44.99833362998488]
  We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by the D-Wave systems within a pseudospectral scheme.<n>We assess the performance of different strategies of encoding based on algebraic arguments and the adiabatic condition.
  arXiv  Detail & Related papers  (2025-07-18T08:06:43Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Quantum circuits for partial differential equations in Fourier space [0.4593579891394288]
  We show that the quantum Fourier transform (QFT) can enable the design of quantum circuits that are particularly simple.<n> circuits are efficient with respect to dimensionality and pave the way for current quantum computers to solve high-dimensional PDEs.
  arXiv  Detail & Related papers  (2025-05-22T16:53:17Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations [0.0]
  We introduce two different architectures of a novel variational quantum algorithm (VQA) with Lagrange encoding in combination with derivative quantum circuits.<n>It is shown that the proposed new VQA has a reduced gate complexity compared to previous variational quantum algorithms, for a similar or better quality of the solution.
  arXiv  Detail & Related papers  (2024-07-23T10:11:44Z)
• Compact quantum algorithms for time-dependent differential equations [0.0]
  We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems.<n>We generate hybrid quantum-classical algorithms that efficiently perform matrix-vector multiplication and matrix inversion operations.
  arXiv  Detail & Related papers  (2024-05-16T02:14:58Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)

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.