Quantum simulation of multiscale linear transport equations via Schrödingerization and exponential integrators

• URL: http://arxiv.org/abs/2507.18970v1
• Date: Fri, 25 Jul 2025 05:44:28 GMT
• Title: Quantum simulation of multiscale linear transport equations via Schrödingerization and exponential integrators
• Authors: Xiaoyang He, Shi Jin,
• Abstract summary: We present two Hamiltonian simulation algorithms for multiscale linear transport equations, combining the Schr"odingerization method.<n>The query complexity of both algorithms, $mathcalO(N_vN_x2log N_x)$, outperforms existing quantum and classical algorithms for solving this equation.
• Score: 26.87128563756398
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we present two Hamiltonian simulation algorithms for multiscale linear transport equations, combining the Schr\"odingerization method [S. Jin, N. Liu and Y. Yu, Phys. Rev. Lett, 133 (2024), 230602][S. Jin, N. Liu and Y. Yu, Phys. Rev. A, 108 (2023), 032603] and exponential integrator while incorporating incoming boundary conditions. These two algorithms each have advantages in terms of design easiness and scalability, and the query complexity of both algorithms, $\mathcal{O}(N_vN_x^2\log N_x)$, outperforms existing quantum and classical algorithms for solving this equation. In terms of the theoretical framework, these are the first quantum Hamiltonian simulation algorithms for multiscale linear transport equation to combine the Schr\"odingerization method with an effective asymptotic-preserving schemes, which are efficient for handling multiscale problems with stiff terms.

Related papers

• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• 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)
• High order schemes for solving partial differential equations on a quantum computer [0.0]
  We show that higher-order methods can reduce the number of qubits necessary for discretization, similar to the classical case.<n>This result has important consequences for the practical application of quantum algorithms based on Hamiltonian evolution.
  arXiv  Detail & Related papers  (2024-12-26T14:21:59Z)
• Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms [24.890270804373824]
  This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions. We show that quantum algorithms constructed using Schr"odingerisation exhibit acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
  arXiv  Detail & Related papers  (2024-11-17T08:15:37Z)
• Quantum and classical algorithms for nonlinear unitary dynamics [0.5729426778193399]
  We present a quantum algorithm for a non-linear differential equation of the form $fracd|urangledt.<n>We also introduce a classical algorithm based on the Euler method allowing comparably scaling to the quantum algorithm in a restricted case.
  arXiv  Detail & Related papers  (2024-07-10T14:08:58Z)
• 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)
• Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective [39.58317527488534]
  We present a new approach for solving systems of linear equations with tensor networks based on the quantum HHL algorithm.<n>We first develop a novel HHL in the qudits formalism, the generalization of qubits, and then transform its operations into an equivalent classical HHL.
  arXiv  Detail & Related papers  (2023-09-11T08:18:41Z)
• 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)
• Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations [31.986350313948435]
  We construct quantum algorithms to compute the solution and/or physical observables of nonlinear ordinary differential equations. We compare the quantum linear systems algorithms based methods and the quantum simulation methods arising from different numerical approximations.
  arXiv  Detail & Related papers  (2022-09-18T05:50:23Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• 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)

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.