Embedding memory-efficient stochastic simulators as quantum trajectories
arXiv:2402.04708 · doi:10.1103/PhysRevA.109.022434
Abstract
By exploiting the complexity intrinsic to quantum dynamics, quantum technologies promise a whole host of computational advantages. One such advantage lies in the field of stochastic modelling, 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 modelling 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 new means of studying structural complexity in quantum systems themselves.
arXiv comment16 pages, 4 figures
References in corpus (29)
- Quantum Computing in the NISQ era and beyond
- The Quantum Jump Approach to Dissipative Dynamics in Quantum Optics
- Quantum trajectories and open many-body quantum systems
- Measurement-Induced Phase Transitions in the Dynamics of Entanglement
- Computational Mechanics: Pattern and Prediction, Structure and Simplicity
- Quantum Trajectories and Quantum Measurement Theory
- Matrix product simulations of non-equilibrium steady states of quantum spin chains
- Quantum stochastic processes and quantum non-Markovian phenomena
- Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
- A practical, unitary simulator for non-Markovian complex processes
- Extreme dimensionality reduction with quantum modelling
- Optimal stochastic modelling with unitary quantum dynamics
- Informational and Causal Architecture of Continuous-time Renewal and Hidden Semi-Markov Processes
- Superior memory efficiency of quantum devices for the simulation of continuous-time stochastic processes
- Unbounded memory advantage in stochastic simulation using quantum mechanics
- How many bits does it take to track an open quantum system?
- Causal Asymmetry in a Quantum World
- Structure and Randomness of Continuous-Time Discrete-Event Processes
- Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models
- Autonomous Ticking Clocks from Axiomatic Principles
- Single-shot quantum memory advantage in the simulation of stochastic processes
- Memory-efficient tracking of complex temporal and symbolic dynamics with quantum simulators
- Divergent Predictive States: The Statistical Complexity Dimension of Stationary, Ergodic Hidden Markov Processes
- Thermal Efficiency of Quantum Memory Compression
- Implementing quantum dimensionality reduction for non-Markovian stochastic simulation
- A quantum algorithm for the direct estimation of the steady state of open quantum systems
- Quantum coarse-graining for extreme dimension reduction in modelling stochastic temporal dynamics
- Open quantum systems are harder to track than open classical systems
- Surveying structural complexity in quantum many-body systems