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:2610.10756 · Quantum Science and Technology

Quantum-Enhanced Inference of Conditional Future Probabilities with Reduced Memory Cost

Jianjun Chen, Akshat Gupta, Chengran Yang, Ariel Neufeld, Jayne Thompson, Thomas J. Elliott, Mile Gu

quant-phSubmitted Oct 7, 2026• Announced Oct 9, 2026• 0 citations
arXivHTMLPDF

Abstract

Many potential future events have devastating consequences, from the onset of earthquakes to financial black swan events. Accurate predictions of their probability of occurrence are vital. Yet as the stochastic systems underlying such events become increasingly complex, these probabilities can depend on ever-growing amounts of past data, which require ever more memory to track. The accuracy of our estimates is ultimately limited by both computational and memory constraints; the former to reduce sampling error, the latter to avoid sampling bias. Traditional quantum algorithms -- such as amplitude estimation -- address only the former, and become untenable especially in near-future quantum devices where quantum memory is a premium. Here, we offer quantum-algorithmic means to reduce systematic bias while maintaining a quadratic speed-up. Our results thus advance the timeline for the practical deployment of quantum technologies, and illustrate their additional benefits when simulating processes of growing complexity.

AI Summary

The paper asks whether conditional future-event probabilities in stochastic processes can be estimated with both quantum amplitude estimation’s sampling advantage and lower bias under a fixed memory constraint. It combines existing quantum predictive-model compression with amplitude estimation: a classical model is converted into a quantum simulator with nonorthogonal memory states, optionally compressed through variational infinite-matrix-product-state approximation, and run coherently for $L$ steps. Amplitude estimation accommodates the residual memory–output entanglement by including both registers in state preparation, inversion, and the zero-state reflection. The resulting estimator retains $O(1/\epsilon)$ state-preparation queries for additive sampling error $\epsilon$, separate from model bias. Generic state-preparation synthesis costs $O(L\tilde D^2|\mathcal X|^2)$ CNOTs for compressed memory dimension $\tilde D$. Numerical demonstrations compare compressed quantum models with classical causal-state clusterings optimized for KL-divergence rate. For eight-state ring diffusion compressed to four memory states, the average RMSE over 36 events with probabilities $10^{-9}$–$10^{-8}$ falls below the classical model’s approximately $10^{-6}$ bias floor after roughly $2\times10^4$ queries. A sixteen-state example crosses its classical baseline after approximately 3,000 queries. The demonstrations use small models, and compression introduces irreducible bias. Existing bounds control fidelity divergence rate, rather than directly bounding conditional-event error; bounded entropic quantum memory does not imply bounded exact memory dimension. Compression preprocessing depends on convergence and spectral properties, while quoted overall gate scaling assumes an inexpensive event oracle. A noise simulation additionally tests reduced gate-error accumulation, but does not demonstrate noisy amplitude estimation.

Little sign of AI-generated textIncrementalOverclaimsMissing comparisonPossible error

Central claim may not hold: The cyclic-walk figures label the error of a KL-rate-optimal causal-state clustering as a classical lower bound without establishing optimality for the tested conditional events or over all memory-constrained classical models. The target-probability additive-error complexity omits compression bias, although QAE's O(1/epsilon) guarantee directly concerns the compressed model's probability. The continuum-limit fidelity-divergence-rate bound is not converted into a guarantee for finite-horizon probabilities conditioned on a particular past. The supplementary AR(2) derivation replaces continuous past values with their signs and therefore does not represent the claimed sign-thresholded Gaussian AR(2) process. The printed reduced classical cyclic-walk transition formula sums two normalized transition distributions without averaging weights, producing total outgoing probability 2 rather than 1.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Spatiotemporal quantum advantages for rare-event sampling

Akshat Gupta, Jianjun Chen, Chengran Yang +4 more

In a world fraught with uncertainty, it behooves us to consider the most disastrous possible outcomes, in order that we can best mitigate against them. Often these are extreme risk events -- of high consequence, but low probability. Yet, the rarity of such events limits our ability to study them; there is a paucity of past occurrences to draw upon, and sampling such rare events from models is typically costly in time. Here, we introduce an approach for rare-event sampling based on quantum stochastic models. This integrates the memory advantages of quantum stochastic modelling -- and its associated efficient means of preparing quantum sample states -- with the `speed-ups' of quantum amplitude amplification, to yield simultaneous reductions in spatial and temporal computational complexity compared to classical Monte Carlo-based approaches.

quant-pharXiv:2610.03026•Physical Review Letters•Oct 5, 2026•1 citation

Implementing quantum dimensionality reduction for non-Markovian stochastic simulation

Kang‐Da Wu, Chengran Yang, Ren-Dong He +5 more

Complex systems are embedded in our everyday experience. Stochastic modelling enables us to understand and predict the behaviour of such systems, cementing its utility across the quantitative sciences. Accurate models of highly non-Markovian processes - where the future behaviour depends on events that happened far in the past - must track copious amounts of information about past observations, requiring high-dimensional memories. Quantum technologies can ameliorate this cost, allowing models of the same processes with lower memory dimension than corresponding classical models. Here we implement such memory-efficient quantum models for a family of non-Markovian processes using a photonic setup. We show that with a single qubit of memory our implemented quantum models can attain higher precision than possible with any classical model of the same memory dimension. This heralds a key step towards applying quantum technologies in complex systems modelling.

arXiv:2208.12744•Nature Communications•May 6, 2023•16 citations

Quantum-Enhanced Statistical Inference with Adaptive Sampling

Jincheng Zhang

Quantum-enhanced statistical inference is a burgeoning field aiming to significantly improve the efficiency and accuracy of statistical analysis, particularly for complex datasets. This paper explores a novel method, Quantum-Enhanced Statistical Inference with Adaptive Sampling, designed to address a key challenge in this area – the increasing computational cost associated with traditional statistical methods. We propose an algorithm that utilizes quantum properties to enhance the precision of statistical estimates, reducing computational demands without sacrificing accuracy. This work introduces a framework for adaptive sampling, dynamically adjusting the sampling process based on data characteristics, ultimately offering a promising path towards more efficient and reliable statistical analysis of complex datasets. This paper provides a detailed explanation of the core mechanism, its potential benefits, and preliminary results demonstrating its effectiveness.

•Sep 2, 2026•0 citations

Quantum enhanced rare event discovery and sampling

Naixu Guo, Po-Wei Huang, Qisheng Wang +4 more

Financial crashes, cascading failures in infrastructure, and critical errors in AI systems are frequently triggered by events that occur with extremely small probability. Efficiently discovering and sampling events with probability below a threshold is therefore of critical interest. Yet this task is highly non-trivial using existing classical or quantum methods. Being rare, such events require an immense sampling overhead to collect sufficient data samples. Moreover, because the rare events are not known in advance, they cannot be flagged for amplification using standard techniques. Here, we introduce a quantum algorithm for rare-event discovery and sampling without first learning which events are rare. The algorithm achieves the optimal quantum scaling with the rarity threshold. We further demonstrate that this can achieve a quadratic speedup for heavy-tailed systems whose tail has nonvanishing total mass, and translates into a robust polynomial speedup for stationary stochastic processes, with the exponent determined by its entropy-rate structure.

quant-pharXiv:2606.06316•Jun 5, 2026•5 citations

Extreme Dimensionality Reduction with Quantum Modeling

Thomas J. Elliott, Chengran Yang, Felix C. Binder +3 more

Effective and efficient forecasting relies on identification of the relevant information contained in past observations-the predictive features-and isolating it from the rest. When the future of a process bears a strong dependence on its behavior far into the past, there are many such features to store, necessitating complex models with extensive memories. Here, we highlight a family of stochastic processes whose minimal classical models must devote unboundedly many bits to tracking the past. For this family, we identify quantum models of equal accuracy that can store all relevant information within a single two-dimensional quantum system (qubit). This represents the ultimate limit of quantum compression and highlights an immense practical advantage of quantum technologies for the forecasting and simulation of complex systems.

arXiv:1909.02817•Physical Review Letters•Dec 22, 2020•45 citations

Title: Quantum-Enhanced Bayesian Network Inference

Jincheng Zhang

Quantum-enhanced Bayesian Network Inference addresses the computational challenges associated with large, complex Bayesian networks through the integration of quantum algorithms. This paper introduces a novel technique leveraging Grover's search to accelerate conditional probability computations, ultimately enhancing inference efficiency. The core mechanism centers around quantum-enhanced probability updates, offering a potential paradigm shift in the processing of large network data. We explore the theoretical implications and preliminary experimental results demonstrating the efficacy of this approach, highlighting its potential to overcome limitations of traditional methods. The paper concludes with a discussion of future research directions, focusing on scalability and practical application.

•Aug 29, 2026•0 citations
Many potential future events have devastating consequences, from the onset of earthquakes to financial black swan events. Accurate predictions of their probability of occurrence are vital. Yet as the stochastic systems underlying such events become increasingly complex, these probabilities can depend on ever-growing amounts of past data, which require ever more memory to track. The accuracy of our estimates is ultimately limited by both computational and memory constraints; the former to reduce sampling error, the latter to avoid sampling bias. Traditional quantum algorithms -- such as amplitude estimation -- address only the former, and become untenable especially in near-future quantum devices where quantum memory is a premium. Here, we offer quantum-algorithmic means to reduce systematic bias while maintaining a quadratic speed-up. Our results thus advance the timeline for the practical deployment of quantum technologies, and illustrate their additional benefits when simulating processes of growing complexity.
The paper asks whether conditional future-event probabilities in stochastic processes can be estimated with both quantum amplitude estimation’s sampling advantage and lower bias under a fixed memory constraint. It combines existing quantum predictive-model compression with amplitude estimation: a classical model is converted into a quantum simulator with nonorthogonal memory states, optionally compressed through variational infinite-matrix-product-state approximation, and run coherently for LLL steps. Amplitude estimation accommodates the residual memory–output entanglement by including both registers in state preparation, inversion, and the zero-state reflection.
The resulting estimator retains O(1/ϵ)O(1/\epsilon)O(1/ϵ) state-preparation queries for additive sampling error ϵ\epsilonϵ, separate from model bias. Generic state-preparation synthesis costs O(LD~2∣X∣2)O(L\tilde D^2|\mathcal X|^2)O(LD~2∣X∣2) CNOTs for compressed memory dimension D~\tilde DD~. Numerical demonstrations compare compressed quantum models with classical causal-state clusterings optimized for KL-divergence rate. For eight-state ring diffusion compressed to four memory states, the average RMSE over 36 events with probabilities 10−910^{-9}10−9–10−810^{-8}10−8 falls below the classical model’s approximately 10−610^{-6}10−6 bias floor after roughly 2×1042\times10^42×104 queries. A sixteen-state example crosses its classical baseline after approximately 3,000 queries.
The demonstrations use small models, and compression introduces irreducible bias. Existing bounds control fidelity divergence rate, rather than directly bounding conditional-event error; bounded entropic quantum memory does not imply bounded exact memory dimension. Compression preprocessing depends on convergence and spectral properties, while quoted overall gate scaling assumes an inexpensive event oracle. A noise simulation additionally tests reduced gate-error accumulation, but does not demonstrate noisy amplitude estimation.
In a world fraught with uncertainty, it behooves us to consider the most disastrous possible outcomes, in order that we can best mitigate against them. Often these are extreme risk events -- of high consequence, but low probability. Yet, the rarity of such events limits our ability to study them; there is a paucity of past occurrences to draw upon, and sampling such rare events from models is typically costly in time. Here, we introduce an approach for rare-event sampling based on quantum stochastic models. This integrates the memory advantages of quantum stochastic modelling -- and its associated efficient means of preparing quantum sample states -- with the `speed-ups' of quantum amplitude amplification, to yield simultaneous reductions in spatial and temporal computational complexity compared to classical Monte Carlo-based approaches.
Complex systems are embedded in our everyday experience. Stochastic modelling enables us to understand and predict the behaviour of such systems, cementing its utility across the quantitative sciences. Accurate models of highly non-Markovian processes - where the future behaviour depends on events that happened far in the past - must track copious amounts of information about past observations, requiring high-dimensional memories. Quantum technologies can ameliorate this cost, allowing models of the same processes with lower memory dimension than corresponding classical models. Here we implement such memory-efficient quantum models for a family of non-Markovian processes using a photonic setup. We show that with a single qubit of memory our implemented quantum models can attain higher precision than possible with any classical model of the same memory dimension. This heralds a key step towards applying quantum technologies in complex systems modelling.
Quantum-enhanced statistical inference is a burgeoning field aiming to significantly improve the efficiency and accuracy of statistical analysis, particularly for complex datasets. This paper explores a novel method, Quantum-Enhanced Statistical Inference with Adaptive Sampling, designed to address a key challenge in this area – the increasing computational cost associated with traditional statistical methods. We propose an algorithm that utilizes quantum properties to enhance the precision of statistical estimates, reducing computational demands without sacrificing accuracy. This work introduces a framework for adaptive sampling, dynamically adjusting the sampling process based on data characteristics, ultimately offering a promising path towards more efficient and reliable statistical analysis of complex datasets. This paper provides a detailed explanation of the core mechanism, its potential benefits, and preliminary results demonstrating its effectiveness.
Financial crashes, cascading failures in infrastructure, and critical errors in AI systems are frequently triggered by events that occur with extremely small probability. Efficiently discovering and sampling events with probability below a threshold is therefore of critical interest. Yet this task is highly non-trivial using existing classical or quantum methods. Being rare, such events require an immense sampling overhead to collect sufficient data samples. Moreover, because the rare events are not known in advance, they cannot be flagged for amplification using standard techniques. Here, we introduce a quantum algorithm for rare-event discovery and sampling without first learning which events are rare. The algorithm achieves the optimal quantum scaling with the rarity threshold. We further demonstrate that this can achieve a quadratic speedup for heavy-tailed systems whose tail has nonvanishing total mass, and translates into a robust polynomial speedup for stationary stochastic processes, with the exponent determined by its entropy-rate structure.
Effective and efficient forecasting relies on identification of the relevant information contained in past observations-the predictive features-and isolating it from the rest. When the future of a process bears a strong dependence on its behavior far into the past, there are many such features to store, necessitating complex models with extensive memories. Here, we highlight a family of stochastic processes whose minimal classical models must devote unboundedly many bits to tracking the past. For this family, we identify quantum models of equal accuracy that can store all relevant information within a single two-dimensional quantum system (qubit). This represents the ultimate limit of quantum compression and highlights an immense practical advantage of quantum technologies for the forecasting and simulation of complex systems.
Quantum-enhanced Bayesian Network Inference addresses the computational challenges associated with large, complex Bayesian networks through the integration of quantum algorithms. This paper introduces a novel technique leveraging Grover's search to accelerate conditional probability computations, ultimately enhancing inference efficiency. The core mechanism centers around quantum-enhanced probability updates, offering a potential paradigm shift in the processing of large network data. We explore the theoretical implications and preliminary experimental results demonstrating the efficacy of this approach, highlighting its potential to overcome limitations of traditional methods. The paper concludes with a discussion of future research directions, focusing on scalability and practical application.