aiqbench analysis
This study demonstrates that custom embedding techniques producing full-rank matrices with reduced dynamic ranges significantly improve the numerical stability and accuracy of quantum annealers when solving the Helmholtz equation. By benchmarking against classical simulated annealing, the research validates hybrid quantum-classical schemes that simultaneously address algebraic conditioning and adiabatic requirements. These findings provide a concrete pathway for optimizing quantum hardware performance on complex differential equations under nontrivial initial conditions.
Solving wave equation problems on D-Wave quantum annealers
arXiv:2507.13724v2 Announce Type: replace Abstract: We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by D-Wave Systems within a pseudospectral framework, where the solution is encoded in an appropriate set of basis functions. We evaluate the performance of different encoding strategies based on algebraic conditioning and adiabatic considerations, and benchmark their performance against the classical simulated annealing algorithm. In particular, we analyze the minimum energy gap, the so-called dynamic range, and the mean squared error to assess the numerical stability, consistency, and accuracy of the solutions returned by each strategy. Our work highlights the importance of developing custom embedding techniques ensuring well-conditioned algebraic systems. In particular, we show that encoding strategies producing full-rank matrices with reduced dynamic ranges enhance the performance of the quantum annealer even under polychromatic driving and nontrivial initial conditions. We further discuss the potential of developing hybrid quantum-classical schemes designed to simultaneously satisfy algebraic conditioning and adiabatic requirements.
Abstract:We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by D-Wave Systems within a pseudospectral framework, where the solution is encoded in an appropriate set of basis functions. We evaluate the performance of different encoding strategies based on algebraic conditioning and adiabatic considerations, and benchmark their performance against the classical simulated annealing algorithm. In particular, we analyze the minimum energy gap, the so-called dynamic range, and the mean squared error to assess the numerical stability, consistency, and accuracy of the solutions returned by each strategy. Our work highlights the importance of developing custom embedding techniques ensuring well-conditioned algebraic systems. In particular, we show that encoding strategies producing full-rank matrices with reduced dynamic ranges enhance the performance of the quantum annealer even under polychromatic driving and nontrivial initial conditions. We further discuss the potential of developing hybrid quantum-classical schemes designed to simultaneously satisfy algebraic conditioning and adiabatic requirements.
20+2 pages, 7 figures. Figures has been improved. Main text has been slightly modified. Accepted for publication in Quantum Information Processing. Comments are welcome
arXiv:2507.13724 [quant-ph]
(or arXiv:2507.13724v2 [quant-ph] for this version)
From: Antonio A. Valido [view email] [v1] Fri, 18 Jul 2025 08:06:43 UTC (2,248 KB) [v2] Tue, 2 Jun 2026 17:32:25 UTC (4,241 KB)
Full text under the publisher's open licence · 208 words
Related coverage
Solving Differential Equations Using Continuous-Variable Quantum Annealing
arXiv · Aug 6, 2026
Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques
arXiv · Aug 19, 2026
Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques
arXiv · Jun 15, 2026
Zermelo's navigation problem through the lens of quantum annealing: How the Landau-Zener approximation leads to an efficient classical solution
arXiv · Jun 9, 2026