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

Nonlinear processes in geophysics

Quantum data assimilation: a new approach to solving data assimilation on quantum annealers

Shunji Kotsuki, Fumitoshi Kawasaki, Masanao Ohashi

Published Jun 7, 2024• 13 citations
Publisher

Abstract

Data assimilation is a crucial component in the Earth science field, enabling the integration of observation data with numerical models. In the context of numerical weather prediction (NWP), data assimilation is particularly vital for improving initial conditions and subsequent predictions. However, the computational demands imposed by conventional approaches, which employ iterative processes to minimize cost functions, pose notable challenges in computational time. The emergence of quantum computing provides promising opportunities to address these computation challenges by harnessing the inherent parallelism and optimization capabilities of quantum annealing machines. In this investigation, we propose a novel approach termed quantum data assimilation, which solves the data assimilation problem using quantum annealers. Our data assimilation experiments using the 40-variable Lorenz model were highly promising, showing that the quantum annealers produced an analysis with comparable accuracy to conventional data assimilation approaches. In particular, the D-Wave Systems physical quantum annealing machine achieved a significant reduction in execution time.

DOI
10.5194/npg-31-237-2024

Related papers

Hybrid variational quantum-classical data assimilation for numerical weather prediction using Lorenz system benchmarks

T. Praveen Kumar, K. V. Raghavender, T. Veeranna +3 more

Abstract The major computational bottleneck of operational Numerical Weather Prediction (NWP) is data assimilation, in which a high-dimensional, prohibitively expensive variational cost function must be minimised repeatedly, with computational costs scaling alongside model resolution. This work presents a systematic empirical evaluation of an Adaptive Hybrid Variational Quantum-Classical (VQE)-based framework for Four-Dimensional Variational Data Assimilation (4DVAR), benchmarked against Classical BFGS optimisation and three deep learning baselines: a standard Long Short-Term Memory network (LSTM), a task-aligned Data Assimilation LSTM (DA-LSTM), and a Neural Ordinary Differential Equation (Neural ODE) across two canonical chaotic atmospheric models of increasing complexity: the three-variable Lorenz-1963 (L63) and the forty-variable Lorenz-1996 (L96) systems. All experiments were conducted using PennyLane quantum simulation across 50 independent runs per method, with rigorous statistical validation including paired t-tests, Wilcoxon signed-rank tests, bootstrap 95% confidence intervals, and formal effect size estimation. Results are reported with full timing decomposition separating quantum circuit execution (T 1 ), classical optimiser time (T 2 ), and infrastructure overhead (T 3 ). The central finding is that the Adaptive Hybrid Quantum-Classical model with a Hardware-Efficient Ansatz (Hybrid QC-HEA) achieves a mean 4DVAR cost of 2.10 on L63 and 21.0 on L96 representing only 11.7% and 14.8% above the Classical 4DVAR baseline respectively—differences that are not statistically significant at p < 0.05. Crucially, Hybrid QC-HEA outperforms all three deep learning baselines by substantial margins on L96, achieving 5.5x lower cost than DA-LSTM, 5.2x lower than LSTM, and 8.3x lower than Neural ODE. The Hybrid QC-HEA also exhibits the tightest cost distribution across 50 runs on L96, demonstrating superior operational reliability compared to all competing methods. Conversely, all-quantum VQE-based methods with no refinement by classical methods scale to cost 32 and 75x more than classical on L96, and thus gradient-free quantum optimisation without the classical BFGS refinement step is ultimately impractical to high-precision data assimilation and the classical BFGS refinement step is in any case a fundamental element of the architecture. Computational scaling analysis reveals that Classical 4DVAR wall-clock time grows 126-fold from L63 to L96, consistent with theoretical predictions of exponentially increasing complexity in chaotic optimisation landscapes, while the hybrid framework maintains near-classical accuracy at both scales. These results constitute an empirical proof-of-concept for hybrid quantum-classical data assimilation on realistic atmospheric models, establishing a reproducible benchmarking framework for future investigation on near-term quantum processors based NISQ devices.

Scientific Reports•Jul 12, 2026•0 citations

Role of Quantum Computing in Weather Prediction Models Through Pre-Parametrization

Kallur V. Vijayakumar, Madhukar K, Soumya Teggi +2 more

Numerical Weather Prediction (NWP) refers to the use of mathematical models to simulate the atmosphere's behavior and predict weather conditions. These models are based on the fundamental laws of physics and dynamics, integrated using initial atmospheric observations. Pioneers like Lewis Fry Richardson and Edward Lorenz laid the foundation of modern weather prediction. Parametrization involves replacing complex or unresolved physical processes (e.g., cloud formation, turbulence) with simplified models. It enhances computational efficiency and model realism. Quantum computing leverages quantum bits (qubits), which exist in superpositions and exhibit entanglement. Quantum gates manipulate qubits, and circuits' process quantum information. Quantum computing offers a way to solve high-dimensional, nonlinear systems more efficiently, crucial for parametrization in weather models. In this paper we discuss the quantum computing, though nascent, shows strong potential in enhancing the accuracy and efficiency of weather forecasting through refined parametrization.

IEEE International Conference on Blockchain and Distributed Systems Security (ICBDS)•Oct 30, 2025•1 citation

A Quantum Optimization Framework for Data-Assimilation-Augmented Parameter Estimation

Muhammad Jalil Ahmad, Mohammadhossein Mohammadisiahroudi, Animikh Biswas +1 more

Parameter estimation is a fundamental challenge in the calibration of ordinary differential equation (ODE) models, where repeated numerical integration can lead to high computational cost. In this work, we investigate whether quantum algorithms can be leveraged to assist parameter estimation in nonlinear dynamical systems. We develop a hybrid classical-quantum framework that reformulates a data-assimilation-augmented parameter estimation problem as a combinatorial optimization task. Model dynamics and data assimilation are enforced entirely on the classical side, while the resulting parameter estimation cost functional is discretized and approximated by a quadratic unconstrained binary optimization (QUBO) surrogate. This surrogate is mapped to an Ising Hamiltonian, and quantum optimizers are used to search for low-energy configurations corresponding to candidate parameter estimates. We apply the framework to SIS and SIR epidemic models, the chaotic Lorenz-63 system, and a high-dimensional two-layer Lorenz-96 system. In this setting, the method is used to recover classical system parameters from partial state observations across steady-state, chaotic, and high-dimensional multiscale dynamical systems. Numerical experiments with synthetic data show that the proposed approach accurately recovers parameters while requiring data-assimilation solves only on a prescribed coarse grid. The framework avoids quantum state tomography, illustrating a viable pathway for integrating quantum optimization into data-driven parameter estimation for nonlinear dynamical systems.

quant-pharXiv:2608.13614•Aug 14, 2026•0 citations

Quantum Approximate Optimization Algorithm and Quantum-enhanced Markov Chain Monte Carlo: A Hybrid Approach to Data Assimilation in 4DVAR

Abhiram Sripat

We propose a novel hybrid quantum-classical framework that integrates the Quantum Approximate Optimization Algorithm (QAOA) and Quantum-enhanced Markov Chain Monte Carlo (QMCMC) with variational particle filters to tackle the computational challenges in Four-Dimensional Variational Data Assimilation (4DVAR). 4DVAR, widely used in numerical weather prediction, suffers from inefficiencies in high-dimensional, non-linear systems. Our approach, the Quantum Variational Particle Filter (QVPF), uses QAOA to optimize particle proposals and QMCMC to efficiently compute particle weights and resample, accelerating convergence while reducing the computational load. The QVPF framework addresses the curse of dimensionality by minimizing the number of particles required for accurate state estimation, thus improving efficiency in systems with complex dynamics. The hybrid model offers enhanced accuracy by integrating quantum algorithms into the variational particle filter, making it particularly suited for applications in climate modeling, space weather prediction, and defense. The potential for achieving unprecedented resolution in predictive models could transform sectors that rely on high-resolution forecasting. We present the mathematical foundations of the approach, along with discussions on algorithmic implementation and hardware requirements. Early results suggest that this hybrid framework could significantly improve data assimilation, with future implementations on near-term quantum devices offering a practical pathway for scaling up. This work demonstrates how quantum computing can address the growing need for more accurate and computationally feasible methods in large-scale data assimilation.

arXiv:2410.03853•Oct 4, 2024•2 citations

Towards Quantum Computing: Solving Satisfiability Problem by Quantum Annealing

Juexiao Su

To date, conventional computers have never been able to efficiently handle certain tasks, where the number of computation steps is likely to blow up as the problem size increases. As an emerging technology and new computing paradigm, quantum computing has a great potential to tackle those hard tasks efficiently. Among all the existing quantum computation models, quantum annealing has drawn significant attention in recent years due to the realization of the commercialized quantum annealer, sparking research interests in developing applications to solve problems that are intractable for classical computers.However, designing and implementing algorithms that manage to harness the enormous computation power from quantum annealer remains a challenging task. Generally, it requires mapping of the given optimization problem into quadratic unconstrained binary optimization(QUBO) problem and embedding the subsequent QUBO onto the physical architecture of quantum annealer. Additionally, practical quantum annealers are susceptible to errors leading to low probability of the correct solution.In this study, we focus on solving Boolean satisfiability (SAT) problem using quantum annealer while addressing practical limitations. We have proposed a mapping technique that maps SAT problem to QUBO, and we have further devised a tool flow that embeds the QUBO onto the architecture of a quantum annealing device. Additionally, We have optimized the proposed embedding flow to reduce run-time in addition to shortening the qubit chain length, leading to robust quantum annealing. To further improve the reliability of quantum annealing, we have also developed a post processing embedding technique that enlarges the energy gap between ground state and the first excited state. To demonstrate the effectiveness of proposed methods, we have conducted experiments on real quantum annealing devices manufactured by D-Wave Systems, showing compelling result of using quantum annealer to solve SAT problem.

•Jan 1, 2018•4 citations

Quantum-Inspired Optimization Techniques for Big Data Warehousing and Real-Time Predictive Analytics

Mohan V, Sathish J

Modern businesses are facing more and more challenges in terms of Big Data warehousing and real-time data analytics due to the sheer volume of growing data. Traditional optimization techniques are increasingly ineffective when working with high-dimensional datasets, thus creating delays in resource allocation and query processing. Since there is a growing demand for faster solutions for data analytics, it is necessary to find new methods for solving optimization issues. In this respect, new emerging quantum-inspired computing techniques allow solving complex optimization problems by employing the principles of quantum mechanics—superposition and probability exploration. To enhance the performance of systems used for predictive analytics and data warehousing, a quantum-inspired optimization framework is proposed. This approach involves incorporating quantum-inspired techniques such as simulations of quantum annealing processes into frameworks used for distributed processing, thus resulting in the improvement of the areas of data indexing, query execution paths and load balancing of computers. The data processing machines are improved due to the advancements in feature selection and attainment of results in a faster way. Evaluation of the method on the big datasets showed that the query performance, and the accuracy of prediction is higher than that demonstrated by conventional techniques, and the architecture is efficient and can be scaled for processing the workloads for real-time analytics.

Journal of Computer Applications and Information Technology•Jun 30, 2026•0 citations
Data assimilation is a crucial component in the Earth science field, enabling the integration of observation data with numerical models. In the context of numerical weather prediction (NWP), data assimilation is particularly vital for improving initial conditions and subsequent predictions. However, the computational demands imposed by conventional approaches, which employ iterative processes to minimize cost functions, pose notable challenges in computational time. The emergence of quantum computing provides promising opportunities to address these computation challenges by harnessing the inherent parallelism and optimization capabilities of quantum annealing machines. In this investigation, we propose a novel approach termed quantum data assimilation, which solves the data assimilation problem using quantum annealers. Our data assimilation experiments using the 40-variable Lorenz model were highly promising, showing that the quantum annealers produced an analysis with comparable accuracy to conventional data assimilation approaches. In particular, the D-Wave Systems physical quantum annealing machine achieved a significant reduction in execution time.
Abstract The major computational bottleneck of operational Numerical Weather Prediction (NWP) is data assimilation, in which a high-dimensional, prohibitively expensive variational cost function must be minimised repeatedly, with computational costs scaling alongside model resolution. This work presents a systematic empirical evaluation of an Adaptive Hybrid Variational Quantum-Classical (VQE)-based framework for Four-Dimensional Variational Data Assimilation (4DVAR), benchmarked against Classical BFGS optimisation and three deep learning baselines: a standard Long Short-Term Memory network (LSTM), a task-aligned Data Assimilation LSTM (DA-LSTM), and a Neural Ordinary Differential Equation (Neural ODE) across two canonical chaotic atmospheric models of increasing complexity: the three-variable Lorenz-1963 (L63) and the forty-variable Lorenz-1996 (L96) systems. All experiments were conducted using PennyLane quantum simulation across 50 independent runs per method, with rigorous statistical validation including paired t-tests, Wilcoxon signed-rank tests, bootstrap 95% confidence intervals, and formal effect size estimation. Results are reported with full timing decomposition separating quantum circuit execution (T 1 ), classical optimiser time (T 2 ), and infrastructure overhead (T 3 ). The central finding is that the Adaptive Hybrid Quantum-Classical model with a Hardware-Efficient Ansatz (Hybrid QC-HEA) achieves a mean 4DVAR cost of 2.10 on L63 and 21.0 on L96 representing only 11.7% and 14.8% above the Classical 4DVAR baseline respectively—differences that are not statistically significant at p < 0.05. Crucially, Hybrid QC-HEA outperforms all three deep learning baselines by substantial margins on L96, achieving 5.5x lower cost than DA-LSTM, 5.2x lower than LSTM, and 8.3x lower than Neural ODE. The Hybrid QC-HEA also exhibits the tightest cost distribution across 50 runs on L96, demonstrating superior operational reliability compared to all competing methods. Conversely, all-quantum VQE-based methods with no refinement by classical methods scale to cost 32 and 75x more than classical on L96, and thus gradient-free quantum optimisation without the classical BFGS refinement step is ultimately impractical to high-precision data assimilation and the classical BFGS refinement step is in any case a fundamental element of the architecture. Computational scaling analysis reveals that Classical 4DVAR wall-clock time grows 126-fold from L63 to L96, consistent with theoretical predictions of exponentially increasing complexity in chaotic optimisation landscapes, while the hybrid framework maintains near-classical accuracy at both scales. These results constitute an empirical proof-of-concept for hybrid quantum-classical data assimilation on realistic atmospheric models, establishing a reproducible benchmarking framework for future investigation on near-term quantum processors based NISQ devices.
Numerical Weather Prediction (NWP) refers to the use of mathematical models to simulate the atmosphere's behavior and predict weather conditions. These models are based on the fundamental laws of physics and dynamics, integrated using initial atmospheric observations. Pioneers like Lewis Fry Richardson and Edward Lorenz laid the foundation of modern weather prediction. Parametrization involves replacing complex or unresolved physical processes (e.g., cloud formation, turbulence) with simplified models. It enhances computational efficiency and model realism. Quantum computing leverages quantum bits (qubits), which exist in superpositions and exhibit entanglement. Quantum gates manipulate qubits, and circuits' process quantum information. Quantum computing offers a way to solve high-dimensional, nonlinear systems more efficiently, crucial for parametrization in weather models. In this paper we discuss the quantum computing, though nascent, shows strong potential in enhancing the accuracy and efficiency of weather forecasting through refined parametrization.
Parameter estimation is a fundamental challenge in the calibration of ordinary differential equation (ODE) models, where repeated numerical integration can lead to high computational cost. In this work, we investigate whether quantum algorithms can be leveraged to assist parameter estimation in nonlinear dynamical systems. We develop a hybrid classical-quantum framework that reformulates a data-assimilation-augmented parameter estimation problem as a combinatorial optimization task. Model dynamics and data assimilation are enforced entirely on the classical side, while the resulting parameter estimation cost functional is discretized and approximated by a quadratic unconstrained binary optimization (QUBO) surrogate. This surrogate is mapped to an Ising Hamiltonian, and quantum optimizers are used to search for low-energy configurations corresponding to candidate parameter estimates. We apply the framework to SIS and SIR epidemic models, the chaotic Lorenz-63 system, and a high-dimensional two-layer Lorenz-96 system. In this setting, the method is used to recover classical system parameters from partial state observations across steady-state, chaotic, and high-dimensional multiscale dynamical systems. Numerical experiments with synthetic data show that the proposed approach accurately recovers parameters while requiring data-assimilation solves only on a prescribed coarse grid. The framework avoids quantum state tomography, illustrating a viable pathway for integrating quantum optimization into data-driven parameter estimation for nonlinear dynamical systems.
We propose a novel hybrid quantum-classical framework that integrates the Quantum Approximate Optimization Algorithm (QAOA) and Quantum-enhanced Markov Chain Monte Carlo (QMCMC) with variational particle filters to tackle the computational challenges in Four-Dimensional Variational Data Assimilation (4DVAR). 4DVAR, widely used in numerical weather prediction, suffers from inefficiencies in high-dimensional, non-linear systems. Our approach, the Quantum Variational Particle Filter (QVPF), uses QAOA to optimize particle proposals and QMCMC to efficiently compute particle weights and resample, accelerating convergence while reducing the computational load. The QVPF framework addresses the curse of dimensionality by minimizing the number of particles required for accurate state estimation, thus improving efficiency in systems with complex dynamics. The hybrid model offers enhanced accuracy by integrating quantum algorithms into the variational particle filter, making it particularly suited for applications in climate modeling, space weather prediction, and defense. The potential for achieving unprecedented resolution in predictive models could transform sectors that rely on high-resolution forecasting. We present the mathematical foundations of the approach, along with discussions on algorithmic implementation and hardware requirements. Early results suggest that this hybrid framework could significantly improve data assimilation, with future implementations on near-term quantum devices offering a practical pathway for scaling up. This work demonstrates how quantum computing can address the growing need for more accurate and computationally feasible methods in large-scale data assimilation.
To date, conventional computers have never been able to efficiently handle certain tasks, where the number of computation steps is likely to blow up as the problem size increases. As an emerging technology and new computing paradigm, quantum computing has a great potential to tackle those hard tasks efficiently. Among all the existing quantum computation models, quantum annealing has drawn significant attention in recent years due to the realization of the commercialized quantum annealer, sparking research interests in developing applications to solve problems that are intractable for classical computers.However, designing and implementing algorithms that manage to harness the enormous computation power from quantum annealer remains a challenging task. Generally, it requires mapping of the given optimization problem into quadratic unconstrained binary optimization(QUBO) problem and embedding the subsequent QUBO onto the physical architecture of quantum annealer. Additionally, practical quantum annealers are susceptible to errors leading to low probability of the correct solution.In this study, we focus on solving Boolean satisfiability (SAT) problem using quantum annealer while addressing practical limitations. We have proposed a mapping technique that maps SAT problem to QUBO, and we have further devised a tool flow that embeds the QUBO onto the architecture of a quantum annealing device. Additionally, We have optimized the proposed embedding flow to reduce run-time in addition to shortening the qubit chain length, leading to robust quantum annealing. To further improve the reliability of quantum annealing, we have also developed a post processing embedding technique that enlarges the energy gap between ground state and the first excited state. To demonstrate the effectiveness of proposed methods, we have conducted experiments on real quantum annealing devices manufactured by D-Wave Systems, showing compelling result of using quantum annealer to solve SAT problem.
Modern businesses are facing more and more challenges in terms of Big Data warehousing and real-time data analytics due to the sheer volume of growing data. Traditional optimization techniques are increasingly ineffective when working with high-dimensional datasets, thus creating delays in resource allocation and query processing. Since there is a growing demand for faster solutions for data analytics, it is necessary to find new methods for solving optimization issues. In this respect, new emerging quantum-inspired computing techniques allow solving complex optimization problems by employing the principles of quantum mechanics—superposition and probability exploration. To enhance the performance of systems used for predictive analytics and data warehousing, a quantum-inspired optimization framework is proposed. This approach involves incorporating quantum-inspired techniques such as simulations of quantum annealing processes into frameworks used for distributed processing, thus resulting in the improvement of the areas of data indexing, query execution paths and load balancing of computers. The data processing machines are improved due to the advancements in feature selection and attainment of results in a faster way. Evaluation of the method on the big datasets showed that the query performance, and the accuracy of prediction is higher than that demonstrated by conventional techniques, and the architecture is efficient and can be scaled for processing the workloads for real-time analytics.