A Quantum-Inspired Algorithm for Wave Simulation Using Tensor Networks

• URL: http://arxiv.org/abs/2504.11181v1
• Date: Tue, 15 Apr 2025 13:36:08 GMT
• Title: A Quantum-Inspired Algorithm for Wave Simulation Using Tensor Networks
• Authors: Kevin Lively, Vittorio Pagni, Gonzalo Camacho,
• Abstract summary: We present an efficient classical algorithm for simulating the Isotropic Wave Equation (IWE) in one, two, or three dimensions.<n>Exact diagonalization of the unitary circuit in combination with Networks allows simulation of the wave equation with a resolution of $1013$ grid points on a laptop.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present an efficient classical algorithm based on the construction of a unitary quantum circuit for simulating the Isotropic Wave Equation (IWE) in one, two, or three dimensions. Using an analogy with the massless Dirac equation, second order time and space derivatives in the IWE are reduced to first order, resulting in a Schr\"odinger equation of motion. Exact diagonalization of the unitary circuit in combination with Tensor Networks allows simulation of the wave equation with a resolution of $10^{13}$ grid points on a laptop. A method for encoding arbitrary analytical functions into diagonal Matrix Product Operators is employed to prepare and evolve a Matrix Product State (MPS) encoding the solution. Since the method relies on the Quantum Fourier Transform, which has been shown to generate small entanglement when applied to arbitrary MPSs, simulating the evolution of initial conditions with sufficiently low bond dimensions to high accuracy becomes highly efficient, up to the cost of Trotterized propagation and sampling of the wavefunction. We conclude by discussing possible extensions of the approach for carrying out Tensor Network simulations of other partial differential equations such as Maxwell's equations.

Related papers

• Explicit near-optimal quantum algorithm for solving the advection-diffusion equation [0.0]
  An explicit quantum algorithm is proposed for modeling dissipative initial-value problems.<n>We propose a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function.<n>The proposed algorithm can be used for modeling a wide class of nonunitary initial-value problems.
  arXiv  Detail & Related papers  (2025-01-19T19:03:29Z)
• Quantum Wave Simulation with Sources and Loss Functions [0.0]
  We present a quantum algorithmic framework for simulating linear, anti-Hermitian (lossless) wave equations in heterogeneous media.<n>Our framework is compatible with standard numerical discretization schemes.<n>We show that subspace energies can be extracted and wave fields compared through an $l$ loss function.
  arXiv  Detail & Related papers  (2024-11-26T17:42:55Z)
• Noisy intermediate-scale quantum simulation of the one-dimensional wave equation [0.0]
  We design and implement quantum circuits for the simulation of the one-dimensional wave equation on the Quantinuum H1-1 quantum computer.<n>Our approach to simulating the wave equation can be used with appropriate state preparation algorithms across different quantum processors and serve as an application-oriented benchmark.
  arXiv  Detail & Related papers  (2024-02-29T15:21:41Z)
• Improving Pseudo-Time Stepping Convergence for CFD Simulations With Neural Networks [44.99833362998488]
  Navier-Stokes equations may exhibit a highly nonlinear behavior. The system of nonlinear equations resulting from the discretization of the Navier-Stokes equations can be solved using nonlinear iteration methods, such as Newton's method. In this paper, pseudo-transient continuation is employed in order to improve nonlinear convergence.
  arXiv  Detail & Related papers  (2023-10-10T15:45:19Z)
• Polynomial-time Solver of Tridiagonal QUBO and QUDO problems with Tensor Networks [41.94295877935867]
  We present an algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization (QUBO) problems and Quadratic Unconstrained Discrete Optimization (QUDO) problems with one-neighbor interactions. Our method is based on the simulation of a quantum state to which we will apply an imaginary time evolution and perform a series of partial traces to obtain the state of maximum amplitude.
  arXiv  Detail & Related papers  (2023-09-19T10:45:15Z)
• Quantum simulation of Maxwell's equations via Schr\"odingersation [27.193565893837356]
  We present quantum algorithms for electromagnetic fields governed by Maxwell's equations. The algorithms are based on the Schr"odingersation approach. Instead of qubits, the quantum algorithms can also be formulated in the continuous variable quantum framework.
  arXiv  Detail & Related papers  (2023-08-16T14:52:35Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Quantum Simulation of Molecules without Fermionic Encoding of the Wave Function [62.997667081978825]
  fermionic encoding of the wave function can be bypassed, leading to more efficient quantum computations. An application to computing the ground-state energy and 2-RDM of H$_4$ is presented.
  arXiv  Detail & Related papers  (2021-01-27T18:57:11Z)
• Quantum Algorithm for Smoothed Particle Hydrodynamics [0.0]
  We present a quantum computing algorithm for the smoothed particle hydrodynamics (SPH) method. Error convergence is exponentially fast in the number of qubits. We extend the method to solve the one-dimensional advection and partial diffusion differential equations.
  arXiv  Detail & Related papers  (2020-06-11T18:28:24Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.