Quantum circuits for partial differential equations in Fourier space

• URL: http://arxiv.org/abs/2505.16895v1
• Date: Thu, 22 May 2025 16:53:17 GMT
• Title: Quantum circuits for partial differential equations in Fourier space
• Authors: Michael Lubasch, Yuta Kikuchi, Lewis Wright, Conor Mc Keever,
• Abstract summary: 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.
• Score: 0.4593579891394288
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For the solution of partial differential equations (PDEs), we show that the quantum Fourier transform (QFT) can enable the design of quantum circuits that are particularly simple, both conceptually and with regard to hardware requirements. This is shown by explicit circuit constructions for the incompressible advection, heat, isotropic acoustic wave, and Poisson's equations as canonical examples. We utilize quantum singular value transformation to develop circuits that are expected to be of optimal computational complexity. Additionally, we consider approximations suited for smooth initial conditions and describe circuits that make lower demands on hardware. The simple QFT-based circuits are efficient with respect to dimensionality and pave the way for current quantum computers to solve high-dimensional PDEs.

Related papers

• Quantum physics informed neural networks for multi-variable partial differential equations [1.024113475677323]
  We introduce an architecture specifically designed to compute second-order (and higher-order) derivatives without relying on nested automatic differentiation methods.<n>This approach mitigates the unwanted side effects associated with nested gradients in simulations, paving the way for more efficient and accurate implementations.<n>As a proof-of-concept, we solve a one-dimensional instance of the heat equation, demonstrating its effectiveness in handling PDEs.
  arXiv  Detail & Related papers  (2025-03-15T19:55:33Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  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 [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
  We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers. The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
  arXiv  Detail & Related papers  (2024-03-25T14:06:18Z)
• Quantum Circuits for partial differential equations via Schrödingerisation [26.7034263292622]
  We present implementation of a quantum algorithm for general PDEs using Schr"odingerisation techniques.<n>We provide examples of the heat equation, and the advection equation approximated by the upwind scheme.
  arXiv  Detail & Related papers  (2024-03-15T05:42:03Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Towards Quantum Computational Mechanics [1.530480694206666]
  We show how quantum computing can be used to solve representative element volume (RVE) problems in computational homogenisation. Our quantum RVE solver attains exponential acceleration with respect to classical solvers.
  arXiv  Detail & Related papers  (2023-12-06T12:53:02Z)
• Variational Quantum Simulation of Partial Differential Equations: Applications in Colloidal Transport [0.0]
  We show that real-amplitude ansaetze with full circular entangling layers lead to higher-fidelity solutions. To efficiently encode impulse functions, we propose a graphical mapping technique for quantum states.
  arXiv  Detail & Related papers  (2023-07-14T05:51:57Z)
• Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
  The first complete equational theory for quantum circuits has only recently been introduced. We simplify the equational theory by proving that several rules can be derived from the remaining ones. The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
  arXiv  Detail & Related papers  (2023-03-06T13:31:27Z)
• 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)
• Quantum Circuits in Additive Hilbert Space [0.0]
  We show how conventional circuits can be expressed in the additive space and how they can be recovered. In particular in our formalism we are able to synthesize high-level multi-controlled primitives from low-level circuit decompositions. Our formulation also accepts a circuit-like diagrammatic representation and proposes a novel and simple interpretation of quantum computation.
  arXiv  Detail & Related papers  (2021-11-01T19:05:41Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Solving nonlinear differential equations with differentiable quantum circuits [21.24186888129542]
  We propose a quantum algorithm to solve systems of nonlinear differential equations. We use automatic differentiation to represent function derivatives in an analytical form as differentiable quantum circuits. We show how this approach can implement a spectral method for solving differential equations in a high-dimensional feature space.
  arXiv  Detail & Related papers  (2020-11-20T13:21:11Z)

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.