Quantum Frozen--Oseen homotopy analysis method with LCHS for solving nonlinear partial differential equations

arXiv:2609.39170 · math.NA, cs.NA, quant-ph · Submitted 2026-09-30 · Read on arXiv

math.NA, cs.NA, quant-ph

Submitted: 2026-09-30

Updated: 2026-09-30

Comments: 52 pages, 7 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Block Encoding — 7× in this paper · explained in 4 episodes
• Sparsity — 7× in this paper · explained in 4 episodes
• Accuracy — 4× in this paper · explained in 1 episode
• Alignment — 3× in this paper · explained in 1 episode
• Ablation — 2× in this paper · explained in 1 episode
• Approximation Bound — 2× in this paper · explained in 1 episode
• Benchmark — 2× in this paper · explained in 2 episodes
• Initial Data — 2× in this paper · explained in 2 episodes
• Ancillary Qubits — 1× in this paper · explained in 1 episode
• Calibration — 1× in this paper · explained in 7 episodes
• Conservation Laws — 1× in this paper · explained in 3 episodes
• Core — 1× in this paper · explained in 2 episodes
• Hilbert Space — 1× in this paper · explained in 2 episodes
• Robustness — 1× in this paper · explained in 5 episodes
• Sample Complexity — 1× in this paper · explained in 15 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Optimal quantum simulation of linear non-unitary dynamics
• Quantum Amplitude Amplification and Estimation

Related papers

• Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
• A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
• Operator learning meets inverse problems: A probabilistic perspective
• Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
• Windowed thinning and query complexity for the bouncy particle and Zigzag samplers
• Data-efficient Kernel Methods for Learning Hamiltonian Systems