Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.37247

Quantum circuits of elastic wave equations via Schrödingerisation

Shi Jin, Chundan Zhang

quant-phmath.NASubmitted Oct 27, 2026• Announced Oct 28, 2026• 0 citations
arXivHTMLPDF

Abstract

We construct explicit quantum circuits for the velocity-stress formulation of elastic wave equations in homogeneous media using Schrödingerisation. After rewriting the equations in symmetric matrix form(SMF), we use Fourier spectral discretization for source-driven periodic problems and staggered-grid finite differences for Dirichlet, Neumann, and impedance boundary conditions. The Schrödingerisation method transforms any linear PDEs into a system of Schrödinger-type PDEs -with unitary evolution- using the warped phase transformation that maps the equations in one higher dimension. For periodic problems, we develop circuits by combining controlled Fourier-mode rotations. For physical boundaries, interleaved encoding swaps the spatial and field-component registers, enabling a more efficient circuit construction using shift operators. We analyze $p$th-order Trotter-Suzuki formulas and derive splitting-error and CNOT-gate estimates, under the assumptions of smooth auxiliary initialization and solution-state recovery. Comparison with classical partitioned splitting methods identifies a polynomial improvement in spatial-resolution dependence for the quantum state-evolution subroutine. Noiseless circuit simulations of a forced periodic problem and an impedance problem illustrate the constructions and quantify their errors against exact solutions and classical reference computations.

AI Summary

The paper addresses explicit quantum-circuit implementation of homogeneous-medium elastic wave propagation with time-independent forcing and physical boundary conditions. It symmetrizes the velocity–stress equations, uses Fourier spectral discretization for periodic problems and staggered-grid finite differences for Dirichlet, Neumann, and impedance boundaries, and applies Schrödingerisation to embed non-unitary dynamics into unitary evolution with one additional coordinate. Periodic circuits use Fourier-mode-controlled rotations, with explicit field-component circuits in two and three dimensions. For physical boundaries, interleaving spatial and component registers produces shift-operator circuits; Neumann evolution follows by conjugating the Dirichlet construction, while impedance terms use exact rotations on boundary subspaces. Nested $p$th-order Trotter–Suzuki formulas provide commutator-based error and CNOT estimates. Assuming smooth auxiliary initialization and the stated recovery conditions, the one-dimensional periodic cost is $\widetilde O_p(s_p^2T^{1+1/p}R_T^{1+1/p}\varepsilon^{-1/p}h^{-1})$, where $R_T=\max\{1,\|u(0)\|/\|u(T)\|\}$ and $s_p$ is the product-formula stage count. Physical-boundary costs scale as $\widetilde O_p(s_p^4T^{1+1/p}R_T^{1+1/p}\varepsilon^{-1/p}h^{-1-1/p})$ in one dimension. Comparison with classical partitioned splitting identifies a polynomial spatial-resolution advantage for state evolution only. Noiseless simulations use 19 qubits for a forced two-dimensional periodic example and 14 for a one-dimensional impedance example. Periodic circuit errors approximately halve when the timestep halves; the impedance circuit error is about $3.90\times10^{-2}$. The impedance pulse remains away from the boundaries throughout the test. Input preparation, observable estimation, finite-gate-set implementation, complex media, and more general boundary geometries remain outside the demonstrated scope.

Little sign of AI-generated textIncrementalStrong assumptionsMissing comparisonPossible error

Central claim may not hold: The physical-boundary recovered-state complexity omits an auxiliary-profile norm ratio that grows at least as exp(aT/(2h)) under the paper's prescribed Dirichlet augmentation and recovery threshold, so Theorem 3's polynomial complexity does not follow. The plotted impedance boundary circuit replaces required conditional scalar phases with target-qubit phase gates and uses the left impedance in the right-boundary phase, so it does not implement the derived exact boundary rotations.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
36 pages, 16 figures

Related papers

Hamiltonian simulation for 3D elastic wave equations in homogeneous elastic media

Kosuke Nakanishi, Hiroshi Yano, Yuki Sato

We present an explicit quantum circuit construction for Hamiltonian simulation of a first-order velocity--stress formulation of the three-dimensional elastic wave equation in homogeneous isotropic media. Previous studies have shown how elastic wave equations can be cast into forms amenable to Hamiltonian simulation, but they typically rely on black box Hamiltonian access assumptions, making gate complexity estimation difficult. Starting from the first-order velocity--stress formulation, we discretize the system by finite differences, transform it into Schrödinger form, and exploit the separation between the component register and the spatial register to decompose the Hamiltonian into structured tensor product terms. This yields explicit implementations of first-order and second-order Trotter formulas for the resulting time evolution operator. We derive corresponding error bounds and constant sensitive qubit and CNOT complexity estimates in terms of the discretization parameter, simulation time, target accuracy, and material parameters. Numerical experiments validate the proposed framework through comparisons with the exact time evolution and reconstructed physical fields.

quant-pharXiv:2604.20284•Physical Review Applied•Apr 23, 2026•0 citations

Quantum Simulation of Elastic Wave Equations via Schrödingerisation

Shi Jin, Chundan Zhang

In this paper we study quantum simulation algorithms on the elastic wave equations using the Schrödingerisation method. The Schrödingerisation method transforms any linear PDEs into a system of Schrödinger-type PDEs–with unitary evolution–using the warped phase transformation that maps the equations in one higher dimension. This makes them suitable for quantum simulations. We explore the application in two forms of the elastic wave equations. For the velocity-stress equation in isotropic media, we explore the symmetric matrix form under the external forcing via Schrödingerisation combined with spectral method. For problems with variable medium parameters, we apply Schrödingerisation method based on the staggered grid method to simulate velocity and stress fields, and give the complexity estimates. For the wave displacement equation, we transform it into a hyperbolic system and apply the Schrödingerisation method, which is then discretized by the spectral method and central difference scheme. Details of the quantum algorithms will be provided, along with the complexity analysis which demonstrates an exponential quantum advantage in space dimension over the classical algorithms if only considering the quantum subroutine which evolves the initial quantum state to the final quantum state.

arXiv:2505.18711•Communications in Computational Physics•Jul 30, 2026•0 citations

Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms

Chuwen Ma, Jin, Shi, Nana Liu +2 more

The Schrödingerisation method combined with the autonomozation technique in \cite{cjL23} converts general non-autonomous linear differential equations with non-unitary dynamics into systems of autonomous Schrödinger-type equations, via the so-called warped phase transformation that maps the equation into two higher dimension. Despite the success of Schrödingerisation techniques, they typically require the black box of the sparse Hamiltonian simulation, suitable for continuous-variable based analog quantum simulation. For qubit-based general quantum computing one needs to design the quantum circuits for practical implementation. This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions and time-dependent source terms, based on Schrödingerization and autonomozation, with corresponding computational complexity analysis. Through initial value smoothing and high-order approximation to the delta function, the increase in qubits from the extra dimensions only requires minor rise in computational complexity, almost $\log\log {1/\varepsilon}$ where $\varepsilon$ is the desired precision. Our analysis demonstrates that quantum algorithms constructed using Schrödingerisation exhibit polynomial acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.

arXiv:2411.10999•Nov 17, 2024•0 citations

Quantum Hamiltonian simulation of linearised Euler equations in complex geometries

Vladyslav Bohun, Andrij Romanovych Kuzmak, Maciej Koch-Janusz

Quantum computing promises exponential improvements in solving large systems of partial differential equations (PDE), which forms a bottleneck in high-resolution simulations of, among others, computational fluid dynamics (CFD) in aerospace applications and weather forecasting. One approach is via mapping classical PDE problems to a quantum Hamiltonian evolution, for which recently an explicit quantum circuit construction has been shown in simple cases, allowing proof-of-concept execution on quantum processors. Here we extended this method to more complex and practically relevant cases. We first demonstrate how arbitrary complex-shaped geometrical obstacles with Dirichlet, Neumann or mixed boundary conditions can be introduced in the quantum representations of elementary difference operators used to implement the PDE, either directly or using Linear Combination of Unitaries (LCU). We provide their explicit and efficient circuit constructions, and analyze the Trotter errors and asymptotic gate complexities, which in the Dirichlet case do not grow compared to the free space equation. Using these methods we then derive quantum circuits for the linearized Euler equations in the presence of a background fluid flow and obstacles, both in the conservative and non-conservative regimes. We illustrate our results by simulating the obtained quantum circuits for different boundary conditions and geometries, comparing their error to a classical finite difference scheme.

arXiv:2510.17978•Oct 20, 2025•0 citations

Quantum framework for simulating linear PDEs with Robin boundary conditions

Nikita Guseynov, Xiajie Huang, Nana Liu

Abstract We propose an explicit quantum framework for numerically simulating general linear partial differential equations (PDEs), extending previous work (Guseynov et al 2025 Phys. Rev. Res. 7 033100) to incorporate (a) Robin boundary conditions—which include Neumann and Dirichlet conditions as special cases–(b) inhomogeneous terms, and (c) variable coefficients in space and time. Our approach begins with a general finite-difference discretization and applies the Schrödingerisation technique to transform the resulting system into one that admits unitary quantum evolution, enabling quantum simulation. For the Schrödinger equation corresponding to the discretized PDE, we construct an efficient block-encoding of the Hamiltonian H that scales polylogarithmically with the number of grid points N . This encoding is compatible with quantum signal processing and allows for the implementation of the evolution operator e − i H t . The explicit circuit construction in our method permits complexity to be measured in fundamental gate units–namely, CNOT gates and single-qubit rotations–bypassing the inefficiencies of oracle queries. Consequently, the overall algorithm scales polynomially with N and linearly with the spatial dimension d . Under certain input/output assumptions our method achieves a polynomial speedup in N and an exponential advantage in d for a wide class of PDEs, thereby mitigating the classical curse of dimensionality. The validity and efficiency of the proposed approach are further substantiated by numerical simulations. By explicitly defining the quantum operations and quantifying their resource requirements, our approach offers a practical alternative for numerically solving PDEs, distinct from others that rely on oracle queries and purely asymptotic scaling methods.

arXiv:2506.20478•Quantum Science and Technology•Jan 27, 2026•0 citations

Convolution absorbing boundaries for explicit-circuit quantum simulation of the wave equation

Hoang Anh Nguyen, Ali Tura

Explicit quantum circuits for the wave equation, built by Hamiltonian simulation, are restricted to closed domains, in which outgoing waves reflect off the edge of the computational region and return. We lift that restriction with absorbing boundaries of the convolution type - a complex-frequency-shifted perfectly matched layer realised through exponential-kernel memory variables - and make the resulting non-unitary dynamics quantum-implementable by Schrodingerisation. We obtain three results. First, explicit gate-level circuits for the absorbing evolution, obtained by extending a Bell- basis term-evolution circuit to projector-valued operator strings and Trotterising to second order; these run end to end on seventeen to twenty-one qubits and agree with exact references to within a tenth of a percent to a percent. Second, a structural obstruction: the memory form of the absorbing generator carries an irreducibly indefinite Hermitian part, whose largest eigenvalue grows as the square root of the absorption strength divided by the grid spacing and survives any diagonal rescaling of the memory fields. The known recovery threshold for Schrodingerisation then makes the post-selection cost grow exponentially in the simulated time. Third, a remedy: a Lyapunov symmetrizer, precomputed classically, renders the transformed generator dissipative and replaces that time-dependent penalty with a time-independent conditioning factor of several hundred, measured on grids of up to four thousand unknowns and saturating under mesh refinement. The crossover is early: past it the symmetrized recovery is cheaper by four to twenty-six orders of magnitude in post-selection cost, and at the longest horizons tested it is the only recovery that works.

quant-pharXiv:2609.03440•Sep 4, 2026•0 citations
We construct explicit quantum circuits for the velocity-stress formulation of elastic wave equations in homogeneous media using Schrödingerisation. After rewriting the equations in symmetric matrix form(SMF), we use Fourier spectral discretization for source-driven periodic problems and staggered-grid finite differences for Dirichlet, Neumann, and impedance boundary conditions. The Schrödingerisation method transforms any linear PDEs into a system of Schrödinger-type PDEs -with unitary evolution- using the warped phase transformation that maps the equations in one higher dimension. For periodic problems, we develop circuits by combining controlled Fourier-mode rotations. For physical boundaries, interleaved encoding swaps the spatial and field-component registers, enabling a more efficient circuit construction using shift operators. We analyze pppth-order Trotter-Suzuki formulas and derive splitting-error and CNOT-gate estimates, under the assumptions of smooth auxiliary initialization and solution-state recovery. Comparison with classical partitioned splitting methods identifies a polynomial improvement in spatial-resolution dependence for the quantum state-evolution subroutine. Noiseless circuit simulations of a forced periodic problem and an impedance problem illustrate the constructions and quantify their errors against exact solutions and classical reference computations.
The paper addresses explicit quantum-circuit implementation of homogeneous-medium elastic wave propagation with time-independent forcing and physical boundary conditions. It symmetrizes the velocity–stress equations, uses Fourier spectral discretization for periodic problems and staggered-grid finite differences for Dirichlet, Neumann, and impedance boundaries, and applies Schrödingerisation to embed non-unitary dynamics into unitary evolution with one additional coordinate.
Periodic circuits use Fourier-mode-controlled rotations, with explicit field-component circuits in two and three dimensions. For physical boundaries, interleaving spatial and component registers produces shift-operator circuits; Neumann evolution follows by conjugating the Dirichlet construction, while impedance terms use exact rotations on boundary subspaces. Nested pppth-order Trotter–Suzuki formulas provide commutator-based error and CNOT estimates. Assuming smooth auxiliary initialization and the stated recovery conditions, the one-dimensional periodic cost is O~p(sp2T1+1/pRT1+1/pε−1/ph−1)\widetilde O_p(s_p^2T^{1+1/p}R_T^{1+1/p}\varepsilon^{-1/p}h^{-1})Op​(sp2​T1+1/pRT1+1/p​ε−1/ph−1), where RT=max⁡{1,∥u(0)∥/∥u(T)∥}R_T=\max\{1,\|u(0)\|/\|u(T)\|\}RT​=max{1,∥u(0)∥/∥u(T)∥} and sps_psp​ is the product-formula stage count. Physical-boundary costs scale as O~p(sp4T1+1/pRT1+1/pε−1/ph−1−1/p)\widetilde O_p(s_p^4T^{1+1/p}R_T^{1+1/p}\varepsilon^{-1/p}h^{-1-1/p})Op​(sp4​T1+1/pRT1+1/p​ε−1/ph−1−1/p) in one dimension. Comparison with classical partitioned splitting identifies a polynomial spatial-resolution advantage for state evolution only.
Noiseless simulations use 19 qubits for a forced two-dimensional periodic example and 14 for a one-dimensional impedance example. Periodic circuit errors approximately halve when the timestep halves; the impedance circuit error is about 3.90×10−23.90\times10^{-2}3.90×10−2. The impedance pulse remains away from the boundaries throughout the test. Input preparation, observable estimation, finite-gate-set implementation, complex media, and more general boundary geometries remain outside the demonstrated scope.
We present an explicit quantum circuit construction for Hamiltonian simulation of a first-order velocity--stress formulation of the three-dimensional elastic wave equation in homogeneous isotropic media. Previous studies have shown how elastic wave equations can be cast into forms amenable to Hamiltonian simulation, but they typically rely on black box Hamiltonian access assumptions, making gate complexity estimation difficult. Starting from the first-order velocity--stress formulation, we discretize the system by finite differences, transform it into Schrödinger form, and exploit the separation between the component register and the spatial register to decompose the Hamiltonian into structured tensor product terms. This yields explicit implementations of first-order and second-order Trotter formulas for the resulting time evolution operator. We derive corresponding error bounds and constant sensitive qubit and CNOT complexity estimates in terms of the discretization parameter, simulation time, target accuracy, and material parameters. Numerical experiments validate the proposed framework through comparisons with the exact time evolution and reconstructed physical fields.
In this paper we study quantum simulation algorithms on the elastic wave equations using the Schrödingerisation method. The Schrödingerisation method transforms any linear PDEs into a system of Schrödinger-type PDEs–with unitary evolution–using the warped phase transformation that maps the equations in one higher dimension. This makes them suitable for quantum simulations. We explore the application in two forms of the elastic wave equations. For the velocity-stress equation in isotropic media, we explore the symmetric matrix form under the external forcing via Schrödingerisation combined with spectral method. For problems with variable medium parameters, we apply Schrödingerisation method based on the staggered grid method to simulate velocity and stress fields, and give the complexity estimates. For the wave displacement equation, we transform it into a hyperbolic system and apply the Schrödingerisation method, which is then discretized by the spectral method and central difference scheme. Details of the quantum algorithms will be provided, along with the complexity analysis which demonstrates an exponential quantum advantage in space dimension over the classical algorithms if only considering the quantum subroutine which evolves the initial quantum state to the final quantum state.
The Schrödingerisation method combined with the autonomozation technique in \cite{cjL23} converts general non-autonomous linear differential equations with non-unitary dynamics into systems of autonomous Schrödinger-type equations, via the so-called warped phase transformation that maps the equation into two higher dimension. Despite the success of Schrödingerisation techniques, they typically require the black box of the sparse Hamiltonian simulation, suitable for continuous-variable based analog quantum simulation. For qubit-based general quantum computing one needs to design the quantum circuits for practical implementation. This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions and time-dependent source terms, based on Schrödingerization and autonomozation, with corresponding computational complexity analysis. Through initial value smoothing and high-order approximation to the delta function, the increase in qubits from the extra dimensions only requires minor rise in computational complexity, almost log⁡log⁡1/ε\log\log {1/\varepsilon}loglog1/ε where ε\varepsilonε is the desired precision. Our analysis demonstrates that quantum algorithms constructed using Schrödingerisation exhibit polynomial acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
Quantum computing promises exponential improvements in solving large systems of partial differential equations (PDE), which forms a bottleneck in high-resolution simulations of, among others, computational fluid dynamics (CFD) in aerospace applications and weather forecasting. One approach is via mapping classical PDE problems to a quantum Hamiltonian evolution, for which recently an explicit quantum circuit construction has been shown in simple cases, allowing proof-of-concept execution on quantum processors. Here we extended this method to more complex and practically relevant cases. We first demonstrate how arbitrary complex-shaped geometrical obstacles with Dirichlet, Neumann or mixed boundary conditions can be introduced in the quantum representations of elementary difference operators used to implement the PDE, either directly or using Linear Combination of Unitaries (LCU). We provide their explicit and efficient circuit constructions, and analyze the Trotter errors and asymptotic gate complexities, which in the Dirichlet case do not grow compared to the free space equation. Using these methods we then derive quantum circuits for the linearized Euler equations in the presence of a background fluid flow and obstacles, both in the conservative and non-conservative regimes. We illustrate our results by simulating the obtained quantum circuits for different boundary conditions and geometries, comparing their error to a classical finite difference scheme.
Abstract We propose an explicit quantum framework for numerically simulating general linear partial differential equations (PDEs), extending previous work (Guseynov et al 2025 Phys. Rev. Res. 7 033100) to incorporate (a) Robin boundary conditions—which include Neumann and Dirichlet conditions as special cases–(b) inhomogeneous terms, and (c) variable coefficients in space and time. Our approach begins with a general finite-difference discretization and applies the Schrödingerisation technique to transform the resulting system into one that admits unitary quantum evolution, enabling quantum simulation. For the Schrödinger equation corresponding to the discretized PDE, we construct an efficient block-encoding of the Hamiltonian H that scales polylogarithmically with the number of grid points N . This encoding is compatible with quantum signal processing and allows for the implementation of the evolution operator e − i H t . The explicit circuit construction in our method permits complexity to be measured in fundamental gate units–namely, CNOT gates and single-qubit rotations–bypassing the inefficiencies of oracle queries. Consequently, the overall algorithm scales polynomially with N and linearly with the spatial dimension d . Under certain input/output assumptions our method achieves a polynomial speedup in N and an exponential advantage in d for a wide class of PDEs, thereby mitigating the classical curse of dimensionality. The validity and efficiency of the proposed approach are further substantiated by numerical simulations. By explicitly defining the quantum operations and quantifying their resource requirements, our approach offers a practical alternative for numerically solving PDEs, distinct from others that rely on oracle queries and purely asymptotic scaling methods.
Explicit quantum circuits for the wave equation, built by Hamiltonian simulation, are restricted to closed domains, in which outgoing waves reflect off the edge of the computational region and return. We lift that restriction with absorbing boundaries of the convolution type - a complex-frequency-shifted perfectly matched layer realised through exponential-kernel memory variables - and make the resulting non-unitary dynamics quantum-implementable by Schrodingerisation. We obtain three results. First, explicit gate-level circuits for the absorbing evolution, obtained by extending a Bell- basis term-evolution circuit to projector-valued operator strings and Trotterising to second order; these run end to end on seventeen to twenty-one qubits and agree with exact references to within a tenth of a percent to a percent. Second, a structural obstruction: the memory form of the absorbing generator carries an irreducibly indefinite Hermitian part, whose largest eigenvalue grows as the square root of the absorption strength divided by the grid spacing and survives any diagonal rescaling of the memory fields. The known recovery threshold for Schrodingerisation then makes the post-selection cost grow exponentially in the simulated time. Third, a remedy: a Lyapunov symmetrizer, precomputed classically, renders the transformed generator dissipative and replaces that time-dependent penalty with a time-independent conditioning factor of several hundred, measured on grids of up to four thousand unknowns and saturating under mesh refinement. The crossover is early: past it the symmetrized recovery is cheaper by four to twenty-six orders of magnitude in post-selection cost, and at the longest horizons tested it is the only recovery that works.