arXiv subjects

Thomas J. Elliott

Publications and source records attributed to Thomas J. Elliott.

At least 19 recordsLinked to original sources

arXiv2026

Efficient optimisation of multi-parameter quantum control protocols for strongly-coupled systems

Achieving high-fidelity control in the presence of strong non-Markovian noise is critical for the optimization of emergent solid-state quantum devices. We present a highly efficient optimization framework that combines automatic differentiation with the non-Markovian uniTEMPO algorithm, enabling direct gradient-based optimization of complex objective functions. We apply this method to semiconductor quantum dots, optimizing multi-pulse excitation schemes: specifically Swing-UP of a Quantum EmmiteR (SUPER) and Floquet-engineered Two-Photon Excitation (FTPE) for single- and bi-exciton generation. Our approach yields high preparation fidelities within experimentally accessible parameter regimes. By integrating adiabatic rapid passage (ARP), we systematically enhance both SUPER and FTPE, demonstrating that these optimized protocols consistently outperform standard resonant pi-pulses and two-photon excitation. Notably, this performance gap widens at elevated temperatures, establishing the superior thermal robustness of our optimized multi-pulse strategies for real-world quantum hardware.

quant-ph↗

arXiv2026

Dimension Reduction for Quantum Adaptive Agents

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 converts 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 agent's memory. Truncating 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. These results establish a route from entropic memory advantages to practical, dimension-reduced adaptive quantum agents.

quant-ph↗

arXiv2026

Quantum Dimension Reduction of Hidden Markov Models

Hidden Markov models (HMMs) are ubiquitous in time-series modelling, with applications ranging from chemical reaction modelling to speech recognition. These HMMs are often large, with high-dimensional memories. A recently-proposed application of quantum technologies is to execute quantum analogues of HMMs. Such quantum HMMs (QHMMs) are strictly more expressive than their classical counterparts, enabling the construction of more parsimonious models of stochastic processes. However, state-of-the-art techniques for QHMM compression, based on tensor networks, are only applicable for a restricted subset of HMMs, where the transitions are deterministic. In this work we introduce a pipeline by which \emph{any} finite, ergodic HMM can be compressed in this manner, providing a route for effective quantum dimension reduction of general HMMs. We demonstrate the method on both a simple toy model, and on a speech-derived HMM trained from data, obtaining favourable memory--accuracy trade-offs in the examples studied, relative to a simple classical state-merging baseline.

quant-ph↗

arXiv2026

Variational Quantum Dimension Reduction for Recurrent Quantum Models

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 $\tilde{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.

quant-ph↗

arXiv2025

Identifiability and minimality bounds of quantum and post-quantum models of classical stochastic processes

To make sense of the world around us, we develop models, constructed to enable us to replicate, describe, and explain the behaviours we see. Focusing on the broad case of sequences of correlated random variables, i.e., classical stochastic processes, we tackle the question of determining whether or not two different models produce the same observable behavior. This is the problem of identifiability. Curiously, the physics of the model need not correspond to the physics of the observations; recent work has shown that it is even advantageous -- in terms of memory and thermal efficiency -- to employ quantum models to generate classical stochastic processes. We resolve the identifiability problem in this regime, providing a means to compare any two models of a classical process, be the models classical, quantum, or `post-quantum', by mapping them to a canonical `generalized' hidden Markov model. Further, this enables us to place (sometimes tight) bounds on the minimal dimension required of a quantum model to generate a given classical stochastic process.

quant-ph↗

arXiv2025

Neural networks leverage nominally quantum and post-quantum representations

We show that deep neural networks, including transformers and RNNs, pretrained as usual on next-token prediction, intrinsically discover and represent beliefs over 'quantum' and 'post-quantum' low-dimensional generative models of their training data -- as if performing iterative Bayesian updates over the latent state of this world model during inference as they observe more context. Notably, neural nets easily find these representation whereas there is no finite classical circuit that would do the job. The corresponding geometric relationships among neural activations induced by different input sequences are found to be largely independent of neural-network architecture. Each point in this geometry corresponds to a history-induced probability density over all possible futures, and the relative displacement of these points reflects the difference in mechanism and magnitude for how these distinct pasts affect the future.

cs.LG↗

arXiv2025

Strict advantage of complex quantum theory in a communication task

Standard formulations of quantum theory are based on complex numbers: Quantum states can be in superpositions, with weights given by complex probability amplitudes. Motivated by quantum theory promising a range of practical advantages over classical for a multitude of tasks, we investigate how the presence of complex amplitudes in quantum theory can yield operational advantages over counterpart real formulations. We identify a straightforward communication task for which complex quantum theory exhibits a provably lower communication cost than not just any classical approach, but also any approach based on real quantum theory. We certify the necessity of complex quantum theory for optimal approaches to the task through geometric properties of quantum state ensembles that witness the presence of basis-independent complexity. This substantiates a strict operational advantage of complex quantum theory. We discuss the relevance of this finding for quantum advantages in stochastic simulation.

quant-ph↗

arXiv2025

Energetic advantages for quantum agents in online execution of complex strategies

Agents often execute complex strategies -- adapting their response to each input stimulus depending on past observations and actions. Here, we derive the minimal energetic cost for classical agents to execute a given strategy, highlighting that they must dissipate a certain amount of heat with each decision beyond Landauer's limit. We then prove that quantum agents can reduce this dissipation below classical limits. We establish the necessary and sufficient conditions for a strategy to guarantee quantum agents have energetic advantage, and illustrate settings where this advantage grows without bound. Our results establish a fundamental energetic advantage for agents utilizing quantum processing to enact complex adaptive behaviour.

quant-ph↗

arXiv2024

Causal classification of spatiotemporal quantum correlations

From correlations in measurement outcomes alone, can two otherwise isolated parties establish whether such correlations are atemporal? That is, can they rule out that they have been given the same system at two different times? Classical statistics says no, yet quantum theory disagrees. Here, we introduce the necessary and sufficient conditions by which such quantum correlations can be identified as atemporal. We demonstrate the asymmetry of atemporality under time reversal, and reveal it to be a measure of spatial quantum correlation distinct from entanglement. Our results indicate that certain quantum correlations possess an intrinsic arrow of time, and enable classification of general quantum correlations across space-time based on their (in)compatibility with various underlying causal structures.

quant-ph↗

arXiv2024

Dimension reduction in quantum sampling of stochastic processes

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.

quant-ph↗

arXiv2024

Quantum-inspired identification of complex cellular automata

Elementary cellular automata (ECA) present iconic examples of complex systems. Though described only by one-dimensional strings of binary cells evolving according to nearest-neighbour update rules, certain ECA rules manifest complex dynamics capable of universal computation. Yet, the classification of precisely which rules exhibit complex behaviour remains a significant challenge. Here we approach this question using tools from quantum stochastic modelling, where quantum statistical memory -- the memory required to model a stochastic process using a class of quantum machines -- can be used to quantify the structure of a stochastic process. By viewing ECA rules as transformations of stochastic patterns, we ask: Does an ECA generate structure as quantified by the quantum statistical memory, and if so, how quickly? We illustrate how the growth of this measure over time correctly distinguishes simple ECA from complex counterparts. Moreover, it provides a more refined means for quantitatively identifying complex ECAs -- providing a spectrum on which we can rank the complexity of ECA by the rate in which they generate structure.

quant-ph↗

arXiv2024

Embedding memory-efficient stochastic simulators as quantum trajectories

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.

quant-ph↗

arXiv2023

Implementing quantum dimensionality reduction for non-Markovian stochastic simulation

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.

quant-ph↗

arXiv2023

Non-destructively probing the thermodynamics of quantum systems with qumodes

Quantum systems are by their very nature fragile. The fundamental backaction on a state due to quantum measurement notwithstanding, there is also in practice often a destruction of the system itself due to the means of measurement. This becomes acutely problematic when we wish to make measurements of the same system at multiple times, or generate a large quantity of measurement statistics. One approach to circumventing this is the use of ancillary probes that couple to the system under investigation, and through their interaction, enable properties of the primary system to be imprinted onto and inferred from the ancillae. Here we highlight means by which continuous variable quantum modes (qumodes) can be employed to probe the thermodynamics of quantum systems in and out of equilibrium, including thermometry, reconstruction of the partition function, and reversible and irreversible work. We illustrate application of our results with the example of a spin-1/2 system in a transverse field.

quant-ph↗

arXiv2023

Hidden Quantum Memory: Is Memory There When Somebody Looks?

In classical physics, memoryless dynamics and Markovian statistics are one and the same. This is not true for quantum dynamics, first and foremost because quantum measurements are invasive. Going beyond measurement invasiveness, here we derive a novel distinction between classical and quantum processes, namely the possibility of hidden quantum memory. While Markovian statistics of classical processes can always be reproduced by a memoryless dynamical model, our main result shows that this is not true in quantum mechanics: We first provide an example of quantum non-Markovianity whose manifestation depends on whether or not a previous measurement is performed -- an impossible phenomenon for memoryless dynamics; we then strengthen this result by demonstrating statistics that are Markovian independent of how they are probed, but are nonetheless still incompatible with memoryless quantum dynamics. Thus, we establish the existence of Markovian statistics gathered by probing a quantum process that nevertheless fundamentally require memory for their creation.

quant-ph↗

arXiv2022

Surveying structural complexity in quantum many-body systems

Quantum many-body systems exhibit a rich and diverse range of exotic behaviours, owing to their underlying non-classical structure. These systems present a deep structure beyond those that can be captured by measures of correlation and entanglement alone. Using tools from complexity science, we characterise such structure. We investigate the structural complexities that can be found within the patterns that manifest from the observational data of these systems. In particular, using two prototypical quantum many-body systems as test cases - the one-dimensional quantum Ising and Bose-Hubbard models - we explore how different information-theoretic measures of complexity are able to identify different features of such patterns. This work furthers the understanding of fully-quantum notions of structure and complexity in quantum systems and dynamics.

quant-ph↗

arXiv2022

Quantum adaptive agents with efficient long-term memories

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 maximise memory compression advantages, and provide a systematic means of encoding their memory states. We show these encodings can exhibit extremely favourable scaling advantages relative to memory-minimal classical agents, particularly when information must be retained about events increasingly far into the past.

quant-ph↗

arXiv2021

Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models

Stochastic modelling is an essential component of the quantitative sciences, with hidden Markov models (HMMs) often playing a central role. Concurrently, the rise of quantum technologies promises a host of advantages in computational problems, typically in terms of the scaling of requisite resources such as time and memory. HMMs are no exception to this, with recent results highlighting quantum implementations of deterministic HMMs exhibiting superior memory and thermal efficiency relative to their classical counterparts. In many contexts however, non-deterministic HMMs are viable alternatives; compared to them the advantages of current quantum implementations do not always hold. Here, we provide a systematic prescription for constructing quantum implementations of non-deterministic HMMs that re-establish the quantum advantages against this broader class. Crucially, we show that whenever the classical implementation suffers from thermal dissipation due to its need to process information in a time-local manner, our quantum implementations will both mitigate some of this dissipation, and achieve an advantage in memory compression.

quant-ph↗