Trainable quantum spectral models with an intermediate parameterized mixer (ε ≈ 0.5) outperform standard variational quantum circuits for PDEs by learning in spectral representation, with HHL-inspired architectures showing fastest convergence.
Solving nonlinear differential equations with differentiable quantum circuits,
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 5roles
background 1polarities
background 1representative citing papers
QCPIKAN is a quantum-classical physics-informed KAN that claims exponential high-frequency error convergence and superior accuracy over prior QCPINNs on single-phase, transport, and two-phase seepage PDEs.
The reduced basis algorithm exactly reproduces the nonlinear dynamics of polynomial ODEs and PDEs over m timesteps using a linear quantum operator on a reduced monomial basis, with qubit scaling logarithmic in grid size for PDEs.
End-to-end QSP-based quantum circuits solve linear PDEs on IBM hardware with tunable error and handle non-homogeneous Dirichlet boundaries for a plasma Poisson problem.
A survey of variational quantum algorithms, quantum neural networks, and tensor networks for addressing scalability challenges in computational fluid dynamics.
citing papers explorer
-
Trainable Quantum Spectral Models for Partial Differential Equations
Trainable quantum spectral models with an intermediate parameterized mixer (ε ≈ 0.5) outperform standard variational quantum circuits for PDEs by learning in spectral representation, with HHL-inspired architectures showing fastest convergence.
-
Quantum-classical physics-informed Kolmogorov-Arnold networks for PDEs
QCPIKAN is a quantum-classical physics-informed KAN that claims exponential high-frequency error convergence and superior accuracy over prior QCPINNs on single-phase, transport, and two-phase seepage PDEs.
-
Reduced basis algorithm for solving nonlinear differential equations on quantum computers
The reduced basis algorithm exactly reproduces the nonlinear dynamics of polynomial ODEs and PDEs over m timesteps using a linear quantum operator on a reduced monomial basis, with qubit scaling logarithmic in grid size for PDEs.
-
Quantum Signal Processing for Linear PDEs: Circuit Design and Experimental Validation
End-to-end QSP-based quantum circuits solve linear PDEs on IBM hardware with tunable error and handle non-homogeneous Dirichlet boundaries for a plasma Poisson problem.