Thomas Joseph Elliott
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Thomas Joseph Elliott has a total of 74 co-authors. Here are the top co-authors by number of shared publications:
- Mile Gu
Nanyang Technological University
14 shared publications - Chengran Yang
Nanyang Technological University
5 shared publications - Andrew J. P. Garner
Institute for Quantum Optics and Quantum Information (IQOQI) Vienna, Austrian Academy of Sciences, Wien, Austria
4 shared publications - Igor B. Mekhovt
St. Petersburg State University, St. Petersburg, Russia
4 shared publications - Jayne Thompson
Centre for Quantum Technologies National University of Singapore 3 Science Drive 2 117543 Singapore
4 shared publications - Santiago F. Caballero-Benitez
Universidad Nacional Autónoma de México
3 shared publications
Latest Publications
- Open Access
- 21 October 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (4) , 045082
Quantum-enhanced inference of conditional future probabilities with reduced memory cost
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.
- 21 October 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (4) , 045082
Open AccessQuantum-enhanced inference of conditional future probabilities with reduced memory cost
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.
- Open Access
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
Quantum dimension reduction of hidden Markov models
Hidden Markov models (HMMs) are ubiquitous in time-series modeling, with applications ranging from chemical reaction modeling to speech recognition. These HMMs are often large, with high-dimensional memories. A recently proposed application of quantum technologies is to execute quantum analogs 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 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 favorable memory-accuracy tradeoffs in the examples studied, relative to a simple classical state-merging baseline.
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
Open AccessQuantum dimension reduction of hidden Markov models
Hidden Markov models (HMMs) are ubiquitous in time-series modeling, with applications ranging from chemical reaction modeling to speech recognition. These HMMs are often large, with high-dimensional memories. A recently proposed application of quantum technologies is to execute quantum analogs 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 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 favorable memory-accuracy tradeoffs in the examples studied, relative to a simple classical state-merging baseline.
- Open Access
- 24 April 2026
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 7 (3)
BOA Constrictor: A Mamba-based lossless compressor for scientific data
The petabyte-scale data generated by High Energy Physics (HEP) experiments presents a significant storage challenge. We present the Bytewise Online Autoregressive (BOA) Constrictor, a new pseudo-streaming lossless neural compressor built upon the Mamba state space model. BOA achieves competitive compression ratios across diverse structured HEP datasets, matching or exceeding LZMA, ZSTD and ZLIB at maximum compression, among other tested algorithms. With a 2.21 MB model, BOA achieves an effective compression ratio (defined as the ratio of original to compressed file size, inclusive of model size) of 7.23× on ATLAS Open Data (HDF5) and 9.13× on simulated particle collision records (HepMC v3), outperforming the next-best traditional algorithm (6.79× and 5.33×, respectively on each dataset). BOA also demonstrates robust cross-file and cross-condition generalisation on CMS Open Data (NanoAOD format), where it obtains comparable or improved effective compression ratios (within 5%) with respect to the next-best traditional algorithm. Ablation studies show that transitioning to half-precision (FP16) weights reduces the model footprint without degrading predictive accuracy, and data-type analyses reveal BOA performs best on high-entropy float32 payloads. The model has also been tested in other kinds of scientific data, yielding 1.61× (vs. 1.14× for next-best algorithm) in computational fluid dynamics and up to 1.53× (vs. 1.27×) in cosmology (CAMELS) datasets. BOA is supported by a deterministic reference C++ implementation which ensures bit-exact reproducibility across different CUDA architectures. In this proof-of-principle implementation, BOA delivers a ∼3.5 to 45 MB/s compression and ∼1.5 to 25 MB/s decompression throughput that is not yet competitive with optimised algorithms such as ZSTD or LZMA, but still provides a first step towards data compression improvements for next-generation scientific data.
- 24 April 2026
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 7 (3)
Open AccessBOA Constrictor: A Mamba-based lossless compressor for scientific data
The petabyte-scale data generated by High Energy Physics (HEP) experiments presents a significant storage challenge. We present the Bytewise Online Autoregressive (BOA) Constrictor, a new pseudo-streaming lossless neural compressor built upon the Mamba state space model. BOA achieves competitive compression ratios across diverse structured HEP datasets, matching or exceeding LZMA, ZSTD and ZLIB at maximum compression, among other tested algorithms. With a 2.21 MB model, BOA achieves an effective compression ratio (defined as the ratio of original to compressed file size, inclusive of model size) of 7.23× on ATLAS Open Data (HDF5) and 9.13× on simulated particle collision records (HepMC v3), outperforming the next-best traditional algorithm (6.79× and 5.33×, respectively on each dataset). BOA also demonstrates robust cross-file and cross-condition generalisation on CMS Open Data (NanoAOD format), where it obtains comparable or improved effective compression ratios (within 5%) with respect to the next-best traditional algorithm. Ablation studies show that transitioning to half-precision (FP16) weights reduces the model footprint without degrading predictive accuracy, and data-type analyses reveal BOA performs best on high-entropy float32 payloads. The model has also been tested in other kinds of scientific data, yielding 1.61× (vs. 1.14× for next-best algorithm) in computational fluid dynamics and up to 1.53× (vs. 1.27×) in cosmology (CAMELS) datasets. BOA is supported by a deterministic reference C++ implementation which ensures bit-exact reproducibility across different CUDA architectures. In this proof-of-principle implementation, BOA delivers a ∼3.5 to 45 MB/s compression and ∼1.5 to 25 MB/s decompression throughput that is not yet competitive with optimised algorithms such as ZSTD or LZMA, but still provides a first step towards data compression improvements for next-generation scientific data.
- 17 July 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (16) , 160402
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 behavior.
- 17 July 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (16) , 160402
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 behavior.
- Open Access
- 2 June 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (6)
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. Published by the American Physical Society 2025
- 2 June 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (6)
Open AccessStrict 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. Published by the American Physical Society 2025
- Open Access
- 28 February 2025
- Published by Springer Nature in npj Quantum Information
- Vol. 11 (1) , 1-12
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.
- 28 February 2025
- Published by Springer Nature in npj Quantum Information
- Vol. 11 (1) , 1-12
Open AccessDimension 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.
- Open Access
- 26 February 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (2) , 022434
Embedding memory-efficient stochastic simulators as quantum trajectories
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
- 26 February 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (2) , 022434
Open AccessEmbedding memory-efficient stochastic simulators as quantum trajectories
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
- Open Access
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.
Open AccessImplementing 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.
- Open Access
- 1 September 2023
- Published by American Vacuum Society in AVS Quantum Science
- Vol. 5 (3)
Nondestructively 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.
- 1 September 2023
- Published by American Vacuum Society in AVS Quantum Science
- Vol. 5 (3)
Open AccessNondestructively 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.
- Open Access
- 19 June 2023
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 138 (6) , 1-12
Quantum-inspired identification of complex cellular automata
- 19 June 2023
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 138 (6) , 1-12
Open AccessQuantum-inspired identification of complex cellular automata