Adaptive agents realise complex reactive behaviours by using a memory of past input stimuli and output actions to guide structured future responses. Quantum adaptive agents can operate while storing less information in memory than optimal classical counterparts; yet, this does not necessarily translate into a reduced dimension of the memory that must be physically realised. We introduce a route-truncate-repair procedure that can convert entropic quantum memory advantages into reductions in memory dimension. Routing a reference input process through an agent yields a temporal matrix product state representation whose canonical bond is identified with the joint reference--agent memory. Truncating the agent's share of this bond and locally repairing the resulting dynamics produces a smaller, physically-valid agent that remains capable of responding to arbitrary input sequences. A fidelity-divergence certificate quantifies the resulting trade-off between accuracy and memory dimension. Benchmark adaptive processes exhibit substantial dimension reduction whilst preserving the underlying behaviour with high fidelity. The construction extends to feedback and coherent quantum interactions, with accuracy guarantees under arbitrary adaptive interrogation for a class of agents. For a resettable clock, four quantum memory dimensions attain an input--output fidelity divergence rate first matched with eleven states in our search over classical reduced models. These results establish a route from entropic memory advantages to practical, dimension-reduced adaptive quantum agents.
Recurrent quantum models (RQMs) realize sequential quantum processes through repeated application of a unitary operation on a memory system coupled with a series of output registers. However, such models often rely on unnecessarily large memory spaces, introducing redundancy and limiting scalability. Here, we introduce a \textit{variational quantum dimension reduction} framework that identifies and removes irrelevant memory degrees of freedom while preserving the recurrent dynamics of the target model. Our approach employs two parameterized quantum circuits: a decoupling unitary
V(θ1) that isolates the essential memory subspace; and a compressed recurrent unitary
U~(θ2) that reconstructs the dynamics in the reduced space. The optimization is guided by a unified cost function combining decoupling fidelity and dynamical accuracy, evaluated using the \textit{Quantum Fidelity Divergence Rate} (QFDR), a metric that quantifies long-term fidelity per time step. Applied to a cyclic random walk model, our framework achieves up to three orders of magnitude smaller QFDR compared to variational matrix product state truncation, while requiring only trajectory samples rather than explicit state reconstructions. This establishes a scalable, data-driven paradigm for learning minimal recurrent quantum architectures, enabling variational circuit optimization and quantum process compression for near-term quantum devices.
Central to the success of adaptive systems is their ability to interpret signals from their environment and respond accordingly-they act as agents interacting with their surroundings.Such agents typically perform better when able to execute increasingly complex strategies.This comes with a cost: the more information the agent must recall from its past experiences, the more memory it will need.Here we investigate the power of agents capable of quantum information processing.We uncover the most general form a quantum agent need adopt to maximize memory compression advantages and provide a systematic means of encoding their memory states.We show these encodings can exhibit extremely favorable scaling advantages relative to memoryminimal classical agents, particularly when information must be retained about events increasingly far into the past.
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.
Abstract Quantum technologies offer a promising route to the efficient sampling and analysis of stochastic processes, with potential applications across the sciences. Such quantum advantages rely on the preparation of a quantum sample state of the stochastic process, which requires a memory system to propagate correlations between the past and future of the process. Here, we introduce a method of lossy quantum dimension reduction that allows this memory to be compressed, not just beyond classical limits, but also beyond current state-of-the-art quantum stochastic sampling approaches. We investigate the trade-off between the saving in memory resources from this compression, and the distortion it introduces. We show that our approach can be highly effective in low distortion compression of both Markovian and strongly non-Markovian processes alike. We further discuss the application of our results to quantum stochastic modelling more broadly.
Predicting a stochastic process' future lies at the heart of many scientific areas.A predictive model extracts information from a stochastic process' past and uses it to generate future statistics.There has been significant amount of effort expended towards finding optimal predictive models that minimize the required amount of past information.By taking advantage of quantum resources, quantum models have been shown to reduce the memory requirements beyond classical limits.Meanwhile, tensor networks are an extremely useful mathematical tool for understanding quantum many-body systems.In this thesis, we explore the connection between tensor networks and quantum predictive models.A particular class of tensor networks, matrix product states (MPS), is utilized to further improve quantum models.First, we establish a connection between matrix product states (MPS) and the optimal classical predictive models.MPS methods offer a systematic method for constructing quantum predictive models and even an improved method for computing the amount of quantum memory.Second, we show that for some families of stochastic processes our method allows us to construct quantum models with unbounded memory advantages over the optimal classical models.Third, we propose a family of divergence measures to quantify the distance between two stochastic processes.This family of divergence measures overcomes certain weaknesses of the existing measures.Moreover, we propose an efficient means of computing the divergence measure using our MPS methods.Finally, we address the problem of constructing quantum predictive models solely from the output of an observed stochastic process.We use machine learning methods to propose a systematic algorithm for learning the quantum model.This provides an alternative method for constructing quantum models with fixed amounts of amount of memory.
Quantum process tomography, the task of learning an unknown quantum channel from black-box access, is a central problem in quantum information. In this setting, protocols with quantum memory can coherently store and jointly process quantum information obtained from multiple channel uses, whereas protocols without quantum memory must measure after each use and retain only a classical transcript of the measurement outcomes. A fundamental open question is whether quantum memory provides a query-complexity advantage even when protocols without quantum memory may adapt their experiments based on all previous outcomes with unbounded classical computational power. In this work, we show that it does. We determine the optimal query complexity of quantum process tomography without quantum memory up to a constant factor to be
Θ(din3dout3/ε2), where
din and
dout are the channel input and output dimensions, respectively, and
ε is the target diamond-norm accuracy. More precisely, we prove that any incoherent protocol for this task, including adaptive protocols, requires
Ω(din3dout3/ε2) queries, even when each channel use may be assisted by arbitrary fresh ancilla, and we present a non-adaptive, ancilla-free incoherent protocol achieving the matching upper bound
O(din3dout3/ε2). Our results thereby generalize the optimal sample-complexity bounds for single-copy state tomography, recovered as the special case
din=1. By contrast, coherent protocols with quantum memory achieve query complexity
Θ(din2dout2/ε2). Hence, our results establish a rigorous learning separation between quantum process tomography with and without quantum memory.