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:1704.04231 · npj Quantum Information

Superior memory efficiency of quantum devices for the simulation of continuous-time stochastic processes

Thomas J. Elliott, Mile Gu

Published Feb 16, 2018• 37 citations
arXivHTMLPDF

Abstract

Abstract Continuous-time stochastic processes pervade everyday experience, and the simulation of models of these processes is of great utility. Classical models of systems operating in continuous-time must typically track an unbounded amount of information about past behaviour, even for relatively simple models, enforcing limits on precision due to the finite memory of the machine. However, quantum machines can require less information about the past than even their optimal classical counterparts to simulate the future of discrete-time processes, and we demonstrate that this advantage extends to the continuous-time regime. Moreover, we show that this reduction in the memory requirement can be unboundedly large, allowing for arbitrary precision even with a finite quantum memory. We provide a systematic method for finding superior quantum constructions, and a protocol for analogue simulation of continuous-time renewal processes with a quantum machine.

DOI
10.1038/s41534-018-0064-4

Related papers

Occam's Vorpal Quantum Razor: Memory Reduction When Simulating Continuous-Time Stochastic Processes With Quantum Devices

Thomas J. Elliott, Mile Gu

Continuous-time stochastic processes pervade everyday experience, and the simulation of models of these processes is of great utility. Classical models of systems operating in continuous-time must typically track an unbounded amount of information about past behaviour, even for relatively simple models, enforcing limits on precision due to the finite memory of the machine. However, quantum machines can require less information about the past than even their optimal classical counterparts to simulate the future of discrete-time processes, and we demonstrate that this advantage extends to the continuous-time regime. Moreover, we show that this reduction in the memory requirement can be unboundedly large, allowing for arbitrary precision even with a finite quantum memory. We provide a systematic method for finding superior quantum constructions, and a protocol for analogue simulation of continuous-time renewal processes with a quantum machine.

•Apr 13, 2017•2 citations

Memory-efficient tracking of complex temporal and symbolic dynamics with quantum simulators

Thomas J. Elliott, Andrew J. P. Garner, Mile Gu

Tracking the behaviour of stochastic systems is a crucial task in the statistical sciences. It has recently been shown that quantum models can faithfully simulate such processes whilst retaining less information about the past behaviour of the system than the optimal classical models. We extend these results to general temporal and symbolic dynamics. Our systematic protocol for quantum model construction relies only on an elementary description of the dynamics of the process. This circumvents restrictions on corresponding classical construction protocols, and allows for a broader range of processes to be modelled efficiently. We illustrate our method with an example exhibiting an apparent unbounded memory advantage of the quantum model compared to its optimal classical counterpart.

arXiv:1803.05426•New Journal of Physics•Dec 12, 2018•18 citations

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•15 citations

Provably unbounded memory advantage in stochastic simulation using quantum mechanics

Andrew J. P. Garner, Qing Liu, Jayne Thompson +2 more

Simulating the stochastic evolution of real quantities on a digital computer requires a trade-off between the precision to which these quantities are approximated, and the memory required to store them. The statistical accuracy of the simulation is thus generally limited by the internal memory available to the simulator. Here, using tools from computational mechanics, we show that quantum processors with a fixed finite memory can simulate stochastic processes of real variables to arbitrarily high precision. This demonstrates a provable, unbounded memory advantage that a quantum simulator can exhibit over its best possible classical counterpart.

arXiv:1609.04408•New Journal of Physics•Oct 12, 2017•28 citations

Embedding memory-efficient stochastic simulators as quantum trajectories

Thomas J. Elliott, Mile Gu

By exploiting the complexity intrinsic to quantum dynamics, quantum technologies promise a host of computational advantages. One such advantage lies in the field of stochastic modeling, where it has been shown that quantum stochastic simulators can operate with a lower memory overhead than their best classical counterparts. This advantage is particularly pronounced for continuous-time stochastic processes; however, the corresponding quantum stochastic simulators heretofore prescribed operate only on a quasi-continuous-time basis and suffer an ever-increasing circuit complexity with increasing temporal resolution. Here, by establishing a correspondence with quantum trajectories (a method for modeling open quantum systems), we show how truly continuous-time quantum stochastic simulators can be embedded in such open quantum systems, bridging this gap and obviating previous constraints. We further show how such an embedding can be made for discrete-time stochastic processes, which manifest as jump-only trajectories, and discuss how viewing the correspondence in the reverse direction provides a means of studying structural complexity in quantum systems themselves. Published by the American Physical Society 2024

arXiv:2402.04708•Physical Review A•Feb 26, 2024•4 citations

Quantum Coarse Graining for Extreme Dimension Reduction in Modeling Stochastic Temporal Dynamics

Thomas J. Elliott

Stochastic modeling of complex systems plays an essential, yet often computationally intensive, role across the quantitative sciences.Recent advances in quantum information processing have elucidated the potential for quantum simulators to exhibit memory advantages for such tasks.Heretofore, the focus has been on lossless memory compression, wherein the advantage is typically in terms of lessening the amount of information tracked by the model, while-arguably more practical-reductions in memory dimension are not always possible.Here, we address the case of lossy compression for quantum stochastic modeling of continuous-time processes, introducing a method for coarse graining in quantum state space that drastically reduces the requisite memory dimension for modeling temporal dynamics while retaining near-exact statistics.In contrast to classical coarse graining, this compression is not based on sacrificing temporal resolution and brings memory-efficient high-fidelity stochastic modeling within reach of present quantum technologies.

arXiv:2105.06831•PRX Quantum•Jun 16, 2021•12 citations
Abstract Continuous-time stochastic processes pervade everyday experience, and the simulation of models of these processes is of great utility. Classical models of systems operating in continuous-time must typically track an unbounded amount of information about past behaviour, even for relatively simple models, enforcing limits on precision due to the finite memory of the machine. However, quantum machines can require less information about the past than even their optimal classical counterparts to simulate the future of discrete-time processes, and we demonstrate that this advantage extends to the continuous-time regime. Moreover, we show that this reduction in the memory requirement can be unboundedly large, allowing for arbitrary precision even with a finite quantum memory. We provide a systematic method for finding superior quantum constructions, and a protocol for analogue simulation of continuous-time renewal processes with a quantum machine.
Continuous-time stochastic processes pervade everyday experience, and the simulation of models of these processes is of great utility. Classical models of systems operating in continuous-time must typically track an unbounded amount of information about past behaviour, even for relatively simple models, enforcing limits on precision due to the finite memory of the machine. However, quantum machines can require less information about the past than even their optimal classical counterparts to simulate the future of discrete-time processes, and we demonstrate that this advantage extends to the continuous-time regime. Moreover, we show that this reduction in the memory requirement can be unboundedly large, allowing for arbitrary precision even with a finite quantum memory. We provide a systematic method for finding superior quantum constructions, and a protocol for analogue simulation of continuous-time renewal processes with a quantum machine.
Tracking the behaviour of stochastic systems is a crucial task in the statistical sciences. It has recently been shown that quantum models can faithfully simulate such processes whilst retaining less information about the past behaviour of the system than the optimal classical models. We extend these results to general temporal and symbolic dynamics. Our systematic protocol for quantum model construction relies only on an elementary description of the dynamics of the process. This circumvents restrictions on corresponding classical construction protocols, and allows for a broader range of processes to be modelled efficiently. We illustrate our method with an example exhibiting an apparent unbounded memory advantage of the quantum model compared to its optimal classical counterpart.
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.
Simulating the stochastic evolution of real quantities on a digital computer requires a trade-off between the precision to which these quantities are approximated, and the memory required to store them. The statistical accuracy of the simulation is thus generally limited by the internal memory available to the simulator. Here, using tools from computational mechanics, we show that quantum processors with a fixed finite memory can simulate stochastic processes of real variables to arbitrarily high precision. This demonstrates a provable, unbounded memory advantage that a quantum simulator can exhibit over its best possible classical counterpart.
By exploiting the complexity intrinsic to quantum dynamics, quantum technologies promise a host of computational advantages. One such advantage lies in the field of stochastic modeling, where it has been shown that quantum stochastic simulators can operate with a lower memory overhead than their best classical counterparts. This advantage is particularly pronounced for continuous-time stochastic processes; however, the corresponding quantum stochastic simulators heretofore prescribed operate only on a quasi-continuous-time basis and suffer an ever-increasing circuit complexity with increasing temporal resolution. Here, by establishing a correspondence with quantum trajectories (a method for modeling open quantum systems), we show how truly continuous-time quantum stochastic simulators can be embedded in such open quantum systems, bridging this gap and obviating previous constraints. We further show how such an embedding can be made for discrete-time stochastic processes, which manifest as jump-only trajectories, and discuss how viewing the correspondence in the reverse direction provides a means of studying structural complexity in quantum systems themselves. Published by the American Physical Society 2024
Stochastic modeling of complex systems plays an essential, yet often computationally intensive, role across the quantitative sciences.Recent advances in quantum information processing have elucidated the potential for quantum simulators to exhibit memory advantages for such tasks.Heretofore, the focus has been on lossless memory compression, wherein the advantage is typically in terms of lessening the amount of information tracked by the model, while-arguably more practical-reductions in memory dimension are not always possible.Here, we address the case of lossy compression for quantum stochastic modeling of continuous-time processes, introducing a method for coarse graining in quantum state space that drastically reduces the requisite memory dimension for modeling temporal dynamics while retaining near-exact statistics.In contrast to classical coarse graining, this compression is not based on sacrificing temporal resolution and brings memory-efficient high-fidelity stochastic modeling within reach of present quantum technologies.