Formulation and evaluation of ocean dynamics problems as optimization problems for quantum annealing machines

Abstract

Recent advancements in quantum computing suggest the potential to revolutionize computational algorithms across various scientific domains including oceanography and atmospheric science. The field is still relatively young and quantum computation is so different from classical computation that suitable frameworks to represent oceanic and atmospheric dynamics are yet to be explored. Quantum annealing, one of the major paradigms, focuses on combinatorial optimization tasks. In this paper, we solve the classical Stommel problem by quantum annealing (QA) and simulated annealing (SA), a classical counterpart of quantum annealing. We cast the linear partial differential equation into an optimization problem by the least-squares method and discretize the cost function in two ways: finite difference and truncated basis expansion. In either case, SA successfully reproduces the expected solution when appropriate parameters are chosen, demonstrating that annealing has the potential. In contrast, QA using the D-Wave quantum annealing machine fails to obtain good solutions for some cases owing to hardware limitations; in particular, the highly limited connectivity graph of the machine limits the size of the solvable problems, at least under currently available algorithms. Either expanding the connectivity graph or improving the graph embedding algorithms would probably be necessary for quantum annealing machines to be usable for oceanic and atmospheric dynamics problems. While this finding emphasizes the need for hardware improvements and enhancements in graph embedding algorithms for practical applications of quantum annealers, the results from simulated annealing suggest its potential to address practical geophysical dynamics problems. As quantum calculation continues to evolve, addressing these challenges may lead to transformative advancements in ocean and atmosphere modeling.

References in corpus (19)

• Array Programming with NumPy
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Annealing in the Transverse Ising Model
• Mathematical Foundation of Quantum Annealing
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• A scalable control system for a superconducting adiabatic quantum optimization processor
• Quantum Annealing: An Overview
• A Quantum Inspired Approach to Exploit Turbulence Structures
• Beyond-classical computation in quantum simulation
• Quantum Annealing for Combinatorial Clustering
• Variational Quantum Algorithms for Computational Fluid Dynamics
• The rotational and divergent components of atmospheric circulation on tidally locked planets
• Quantum Computers for Weather and Climate Prediction: The Good, the Bad and the Noisy
• Tensor network reduced order models for wall-bounded flows
• Quantum adiabatic machine learning with zooming
• Elvet -- a neural network-based differential equation and variational problem solver
• Molecular Dynamics on Quantum Annealers
• Effectiveness of quantum annealing for continuous-variable optimization
• Qade: Solving Differential Equations on Quantum Annealers