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

arXiv:2611.04872

Conditional Quantum Priors for Chaotic Fluid Dynamics

Shao-Bo Zhou, Yu-Ze Zhu, Hang Song, Xiang Zhao, Lin Yang, Xian-Min Jin

quant-phSubmitted Nov 3, 2026• Announced Nov 4, 2026• 0 citations
arXivHTMLPDF

Abstract

Neural networks that predict chaotic dynamics can reproduce short trajectories while misrepresenting statistics over long times. Quantum priors represent selected dynamical statistics through quantum generative models and provide statistical constraints for classical neural networks. Training a separate prior for each value of a system parameter, such as the Reynolds number, does not explicitly model how these statistics vary with that parameter. We learn a conditional quantum prior that approximates selected statistics of an invariant measure at unseen parameter values within the training range, without retraining. For Lorenz-63, the prior reduces mean Jensen-Shannon divergence by 56.9% relative to a classical multilayer perceptron with a comparable number of weights across 96 unseen parameter values. Across 101 values of the same parameter, the shared prior uses 84.7% fewer trainable weights than would be required by a separate quantum neural network at each value. We then use the learned prior to regularize classical neural networks, encouraging their autoregressive rollouts to better reproduce long-term statistics. For Kolmogorov flow at Reynolds number $Re=1000$, prior regularization reduces forecast mean squared error by 66.0% over 318 steps relative to the classical baseline without prior regularization. We also implement a photonic quantum prior for noisy intermediate-scale quantum (NISQ) devices, achieving a mean Jensen-Shannon divergence of $4.58\times10^{-3}$ for Lorenz-63 and $2.59\times10^{-3}$ for Kolmogorov flow at unseen parameter values.

AI Summary

Queued: an LLM will read the paper as soon as there is capacity.

DOI
10.48550/arxiv.2611.04872

Related papers

Quantum-informed machine learning for predicting spatiotemporal chaos with practical quantum advantage

Maida Wang, Xue Xiao, Mingyang Gao +1 more

We introduce a quantum-informed machine learning (QIML) framework for modeling the long-term behavior of high-dimensional chaotic systems. QIML combines a one-time, offline-trained quantum generative model with a classical autoregressive predictor for spatiotemporal field generation. The quantum model learns a quantum prior (Q-Prior) that guides the representation of small-scale interactions and improves the modeling of fine-scale dynamics. We evaluate QIML on the Kuramoto-Sivashinsky equation, two-dimensional Kolmogorov flow, and the three-dimensional turbulent channel flow used as a realistic inflow condition. Across these systems, QIML improves predictive distribution accuracy by up to 17.25% and full-spectrum fidelity by up to 29.36% relative to classical baselines. For turbulent channel inflow, the Q-Prior is trained on a superconducting quantum processor and proves essential: without it, predictions become unstable, whereas QIML produces physically consistent long-term forecasts that outperform leading partial differential equation solvers. Beyond accuracy, QIML offers a memory advantage by compressing multimegabyte datasets into a kilobyte-scale Q-Prior, enabling scalable integration of quantum resources into scientific modeling.

arXiv:2507.19861•Science Advances•Apr 17, 2026•10 citations

Quantum Statistical Memory Advantage Reveals Predictive Structure in Chaotic Invariant Measures

Maida Wang, Xiao Xue, Minh Chung +1 more

Long-horizon prediction of a chaotic system is governed by fidelity to its invariant measure, and which parts of that measure a learned predictor needs is a physical question not known in advance. We establish a quantum statistical memory advantage for interrogating it. A quantum statistical prior (Q-Prior), trained once on classical data, stores an efficiently preparable $k$-point marginal in polynomially many circuit parameters against exponentially many for explicit tabulation. Collective Bell measurements on two copies then estimate any post hoc Pauli-expectation magnitude at a copy cost independent of register size, with a worst-case exponential separation from single-copy protocols. A single Bell dataset supports an entire family of candidate observables at a cost growing only logarithmically in the family size, so an exponentially large candidate space stays open for later analysis. We implement the protocol on IQM superconducting processors with two-copy registers of up to 54 physical-qubit chips. We apply this to turbulent channel flow and ERA5 forecasting, resolving invariant structure by statistical sector and order. Turbulent phase correlations persist through eighth order, while most predictive gains arise from low-order constraints; in ERA5, planetary-wave phase coherence complements covariance regularisation, identifying distinct low-order sectors with predictive value. Quantum statistical memory is therefore both a near-term computational resource and an instrument for identifying which invariant structures matter for prediction.

quant-pharXiv:2606.13422•Jun 12, 2026•0 citations

Predicting Chaotic Systems with Quantum Echo-state Networks

Erik Connerty, Ethan N. Evans, Gerasimos Angelatos +1 more

Recent advancements in artificial neural networks have enabled impressive tasks on classical computers, but they demand significant computational resources. While quantum computing offers potential beyond classical systems, the advantages of quantum neural networks (QNNs) remain largely unexplored. In this work, we present and examine a quantum circuit (QC) that implements and aims to improve upon the classical echo-state network (ESN), a type of reservoir-based recurrent neural networks (RNNs), using quantum computers. Typically, ESNs consist of an extremely large reservoir that learns high-dimensional embeddings, enabling prediction of complex system trajectories. Quantum echo-state networks (QESNs) aim to reduce this need for prohibitively large reservoirs by leveraging the unique capabilities of quantum computers, potentially allowing for more efficient and higher performing time-series prediction algorithms. The proposed QESN can be implemented on any digital quantum computer implementing a universal gate set, and does not require any sort of stopping or re-initialization of the circuit, allowing continuous evolution of the quantum state over long time horizons. We conducted simulated QC experiments on the chaotic Lorenz system, both with noisy and noiseless models, to demonstrate the circuit's performance and its potential for execution on noisy intermediate-scale quantum (NISQ) computers.

arXiv:2412.07910•Dec 10, 2024•0 citations

Explainable quantum-compressed machine learning for complex fluid flows

Xiao Xue, Maida Wang, Mingyang Gao +2 more

Machine-learning surrogates of physical systems face a paradox: explainable models facing the challenge of expressivity to capture complex nonlinear flows, whereas expressive deep surrogates match high-fidelity simulations only through massive parameterisations that turn the learned dynamics into a black box. Here, we introduce quantum-compressed machine learning (QCML), which resolves this tension by compressing the latent propagator of a flow surrogate from $524{,}288$ trainable parameters to no more than $8$. This parameter reduction brings the learned dynamical law to the parameter scale of a physical constitutive relation rather than a black-box neural network, making the surrogate directly interpretable and controllable without sacrificing expressivity. The compression is realised by a structured quantum circuit whose unitary propagator constrains the latent spectrum to the unit circle exactly and by construction, replacing exponential error growth with linear accumulation over autoregressive rollouts. Classical regularisation only approximates this constraint: even a quantum-inspired classical baseline penalised towards unitarity collapses within one Lyapunov time on turbulent channel flow, whereas QCML remains stable over the full rollout. Shared phase and coupling angles parameterising the circuit correspond directly to modal frequencies and inter-mode interactions, giving the learned dynamics a physical interpretation in spectral space. On two patient-specific cardiovascular benchmarks, the structured QCML propagator matches the predictive accuracy of its classical counterpart on surface pressure spectra, pressure drop, and wall shear stress. These results establish QCML as a working component of scientific machine learning and a concrete contribution towards practical quantum advantage in real-world prediction.

physics.flu-dynCross-listedarXiv:2607.21688•Jul 24, 2026•1 citation

Bayesian Quantum Neural Networks

Nam Nguyen, Kwang‐Cheng Chen

The astounding acceleration in Artificial Intelligence and Quantum Computing advances naturally gives rise to a line of research, which unrolls the potential advantages of quantum computing on classical Machine Learning tasks, known as Quantum Machine Learning or Quantum Machine Intelligence. The typical objectives are either (1) exploring the potential quantum advantages on classical learning tasks or (2) levering well-established classical ML algorithms to tackle quantum-related problems on Noisy Intermediate-Scale Quantum (NISQ) devices. Along the second research direction, we study Quantum Neural Networks (QNNs) to accomplish the purpose of Bayesian learning. By observing a wide range of studies on QNNs, in which the sole training method is based on frequentist training, we find that Bayesian learning benefits QNNs from two aspects. First, Bayesian-trained models enjoy a high level of generalization due to the prior and posterior distribution usage compared to frequentist training, which will be justified by this paper’s theoretical study of model capacity. Second, Bayesian Inference offers epistemic uncertainty estimation, which merits the decision-making process. It is worth mentioning that frequentist-trained QNNs generally lack this desirable property. Under the Bayesian training procedure, our derived models can be considered a new class of QNNs (called BayesianQNNs) which possesses both desirable properties of Bayesian Inference while maintaining comparable predictive performance as frequentist counterparts. The proposed Bayesian Quantum Neural Networks is justified by empirical evidence from numerical experiments.

IEEE Access•Jan 1, 2022•43 citations

Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning

Kuo-Chung Peng, Samuel Yen-Chi Chen, Jiun-Cheng Jiang +16 more

Fast Weight Programmers (FWPs) encode temporal dependencies through dynamically updated parameters rather than recurrent hidden states. Quantum FWPs (QFWPs) extend this idea with variational quantum circuits (VQCs), but existing implementations rely on multi-qubit architectures that are difficult to scale on noisy intermediate-scale quantum (NISQ) devices and expensive to simulate classically. We propose gated QKAN-FWP, a fast-weight framework that integrates FWP with Quantum-inspired Kolmogorov-Arnold Network (QKAN) using single-qubit data re-uploading circuits as learnable nonlinear activation, known as DatA Re-Uploading ActivatioN (DARUAN). We further introduce a scalar-gated fast-weight update rule that stabilizes parameter evolution, supported by a theoretical analysis of its adaptive memory kernel, geometric boundedness, and parallelizable gradient paths. We evaluate the framework across time-series benchmarks, MiniGrid reinforcement learning, and highlight real-world solar cycle forecasting as our main practical result. In the long-horizon setting with 528-month input window and 132-month forecast horizon, our 12.5k-parameter model achieves lower scaled Mean Square Error (MSE), peak amplitude error, and peak timing error than a suite of classical recurrent baselines with up to 13x more parameters, including Long Short-Term Memory (LSTM) networks (25.9k-89.1k parameters), WaveNet-LSTM (167k), Vanilla recurrent neural network (11.5k), and a Modified Echo State Network (132k). To validate NISQ compatibility, we further deploy the trained fast programmer on IonQ and IBM Quantum processors, recovering forecasting accuracy within 0.1% relative MSE of the noiseless simulator at 1024 shots. These results position gated QKAN-FWP as a scalable, parameter-efficient, and NISQ-compatible approach to quantum-inspired sequence modeling.

cs.LGCross-listedarXiv:2605.06734•May 8, 2026•3 citations
Neural networks that predict chaotic dynamics can reproduce short trajectories while misrepresenting statistics over long times. Quantum priors represent selected dynamical statistics through quantum generative models and provide statistical constraints for classical neural networks. Training a separate prior for each value of a system parameter, such as the Reynolds number, does not explicitly model how these statistics vary with that parameter. We learn a conditional quantum prior that approximates selected statistics of an invariant measure at unseen parameter values within the training range, without retraining. For Lorenz-63, the prior reduces mean Jensen-Shannon divergence by 56.9% relative to a classical multilayer perceptron with a comparable number of weights across 96 unseen parameter values. Across 101 values of the same parameter, the shared prior uses 84.7% fewer trainable weights than would be required by a separate quantum neural network at each value. We then use the learned prior to regularize classical neural networks, encouraging their autoregressive rollouts to better reproduce long-term statistics. For Kolmogorov flow at Reynolds number Re=1000Re=1000Re=1000, prior regularization reduces forecast mean squared error by 66.0% over 318 steps relative to the classical baseline without prior regularization. We also implement a photonic quantum prior for noisy intermediate-scale quantum (NISQ) devices, achieving a mean Jensen-Shannon divergence of 4.58×10−34.58\times10^{-3}4.58×10−3 for Lorenz-63 and 2.59×10−32.59\times10^{-3}2.59×10−3 for Kolmogorov flow at unseen parameter values.
We introduce a quantum-informed machine learning (QIML) framework for modeling the long-term behavior of high-dimensional chaotic systems. QIML combines a one-time, offline-trained quantum generative model with a classical autoregressive predictor for spatiotemporal field generation. The quantum model learns a quantum prior (Q-Prior) that guides the representation of small-scale interactions and improves the modeling of fine-scale dynamics. We evaluate QIML on the Kuramoto-Sivashinsky equation, two-dimensional Kolmogorov flow, and the three-dimensional turbulent channel flow used as a realistic inflow condition. Across these systems, QIML improves predictive distribution accuracy by up to 17.25% and full-spectrum fidelity by up to 29.36% relative to classical baselines. For turbulent channel inflow, the Q-Prior is trained on a superconducting quantum processor and proves essential: without it, predictions become unstable, whereas QIML produces physically consistent long-term forecasts that outperform leading partial differential equation solvers. Beyond accuracy, QIML offers a memory advantage by compressing multimegabyte datasets into a kilobyte-scale Q-Prior, enabling scalable integration of quantum resources into scientific modeling.
Long-horizon prediction of a chaotic system is governed by fidelity to its invariant measure, and which parts of that measure a learned predictor needs is a physical question not known in advance. We establish a quantum statistical memory advantage for interrogating it. A quantum statistical prior (Q-Prior), trained once on classical data, stores an efficiently preparable kkk-point marginal in polynomially many circuit parameters against exponentially many for explicit tabulation. Collective Bell measurements on two copies then estimate any post hoc Pauli-expectation magnitude at a copy cost independent of register size, with a worst-case exponential separation from single-copy protocols. A single Bell dataset supports an entire family of candidate observables at a cost growing only logarithmically in the family size, so an exponentially large candidate space stays open for later analysis. We implement the protocol on IQM superconducting processors with two-copy registers of up to 54 physical-qubit chips. We apply this to turbulent channel flow and ERA5 forecasting, resolving invariant structure by statistical sector and order. Turbulent phase correlations persist through eighth order, while most predictive gains arise from low-order constraints; in ERA5, planetary-wave phase coherence complements covariance regularisation, identifying distinct low-order sectors with predictive value. Quantum statistical memory is therefore both a near-term computational resource and an instrument for identifying which invariant structures matter for prediction.
Recent advancements in artificial neural networks have enabled impressive tasks on classical computers, but they demand significant computational resources. While quantum computing offers potential beyond classical systems, the advantages of quantum neural networks (QNNs) remain largely unexplored. In this work, we present and examine a quantum circuit (QC) that implements and aims to improve upon the classical echo-state network (ESN), a type of reservoir-based recurrent neural networks (RNNs), using quantum computers. Typically, ESNs consist of an extremely large reservoir that learns high-dimensional embeddings, enabling prediction of complex system trajectories. Quantum echo-state networks (QESNs) aim to reduce this need for prohibitively large reservoirs by leveraging the unique capabilities of quantum computers, potentially allowing for more efficient and higher performing time-series prediction algorithms. The proposed QESN can be implemented on any digital quantum computer implementing a universal gate set, and does not require any sort of stopping or re-initialization of the circuit, allowing continuous evolution of the quantum state over long time horizons. We conducted simulated QC experiments on the chaotic Lorenz system, both with noisy and noiseless models, to demonstrate the circuit's performance and its potential for execution on noisy intermediate-scale quantum (NISQ) computers.
Machine-learning surrogates of physical systems face a paradox: explainable models facing the challenge of expressivity to capture complex nonlinear flows, whereas expressive deep surrogates match high-fidelity simulations only through massive parameterisations that turn the learned dynamics into a black box. Here, we introduce quantum-compressed machine learning (QCML), which resolves this tension by compressing the latent propagator of a flow surrogate from 524,288524{,}288524,288 trainable parameters to no more than 888. This parameter reduction brings the learned dynamical law to the parameter scale of a physical constitutive relation rather than a black-box neural network, making the surrogate directly interpretable and controllable without sacrificing expressivity. The compression is realised by a structured quantum circuit whose unitary propagator constrains the latent spectrum to the unit circle exactly and by construction, replacing exponential error growth with linear accumulation over autoregressive rollouts. Classical regularisation only approximates this constraint: even a quantum-inspired classical baseline penalised towards unitarity collapses within one Lyapunov time on turbulent channel flow, whereas QCML remains stable over the full rollout. Shared phase and coupling angles parameterising the circuit correspond directly to modal frequencies and inter-mode interactions, giving the learned dynamics a physical interpretation in spectral space. On two patient-specific cardiovascular benchmarks, the structured QCML propagator matches the predictive accuracy of its classical counterpart on surface pressure spectra, pressure drop, and wall shear stress. These results establish QCML as a working component of scientific machine learning and a concrete contribution towards practical quantum advantage in real-world prediction.
The astounding acceleration in Artificial Intelligence and Quantum Computing advances naturally gives rise to a line of research, which unrolls the potential advantages of quantum computing on classical Machine Learning tasks, known as Quantum Machine Learning or Quantum Machine Intelligence. The typical objectives are either (1) exploring the potential quantum advantages on classical learning tasks or (2) levering well-established classical ML algorithms to tackle quantum-related problems on Noisy Intermediate-Scale Quantum (NISQ) devices. Along the second research direction, we study Quantum Neural Networks (QNNs) to accomplish the purpose of Bayesian learning. By observing a wide range of studies on QNNs, in which the sole training method is based on frequentist training, we find that Bayesian learning benefits QNNs from two aspects. First, Bayesian-trained models enjoy a high level of generalization due to the prior and posterior distribution usage compared to frequentist training, which will be justified by this paper’s theoretical study of model capacity. Second, Bayesian Inference offers epistemic uncertainty estimation, which merits the decision-making process. It is worth mentioning that frequentist-trained QNNs generally lack this desirable property. Under the Bayesian training procedure, our derived models can be considered a new class of QNNs (called BayesianQNNs) which possesses both desirable properties of Bayesian Inference while maintaining comparable predictive performance as frequentist counterparts. The proposed Bayesian Quantum Neural Networks is justified by empirical evidence from numerical experiments.
Fast Weight Programmers (FWPs) encode temporal dependencies through dynamically updated parameters rather than recurrent hidden states. Quantum FWPs (QFWPs) extend this idea with variational quantum circuits (VQCs), but existing implementations rely on multi-qubit architectures that are difficult to scale on noisy intermediate-scale quantum (NISQ) devices and expensive to simulate classically. We propose gated QKAN-FWP, a fast-weight framework that integrates FWP with Quantum-inspired Kolmogorov-Arnold Network (QKAN) using single-qubit data re-uploading circuits as learnable nonlinear activation, known as DatA Re-Uploading ActivatioN (DARUAN). We further introduce a scalar-gated fast-weight update rule that stabilizes parameter evolution, supported by a theoretical analysis of its adaptive memory kernel, geometric boundedness, and parallelizable gradient paths. We evaluate the framework across time-series benchmarks, MiniGrid reinforcement learning, and highlight real-world solar cycle forecasting as our main practical result. In the long-horizon setting with 528-month input window and 132-month forecast horizon, our 12.5k-parameter model achieves lower scaled Mean Square Error (MSE), peak amplitude error, and peak timing error than a suite of classical recurrent baselines with up to 13x more parameters, including Long Short-Term Memory (LSTM) networks (25.9k-89.1k parameters), WaveNet-LSTM (167k), Vanilla recurrent neural network (11.5k), and a Modified Echo State Network (132k). To validate NISQ compatibility, we further deploy the trained fast programmer on IonQ and IBM Quantum processors, recovering forecasting accuracy within 0.1% relative MSE of the noiseless simulator at 1024 shots. These results position gated QKAN-FWP as a scalable, parameter-efficient, and NISQ-compatible approach to quantum-inspired sequence modeling.