Samuel Duffield
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Samuel Duffield has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Gavin E. Crooks
Physical Biosciences Division Lawrence Berkeley National Laboratory 94720 Berkeley CA USA
2 shared publications Sumeetpal S. Singh
Department of Engineering University of Cambridge CB2 1PZ UK
2 shared publications- Thomas Dybdahl Ahle
University of Copenhagen BARC Facebook
2 shared publications - Daniel Simpson
Normal Computing Corporation, New York, New York, USA
1 shared publication - Gabriel Matos
School of Physics and Astronomy, University of Leeds, Leeds LS2 9JT, United Kingdom
1 shared publication - Kaelan Donatella
Normal Computing
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 10 February 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (1)
Thermodynamic matrix exponentials and thermodynamic parallelism
Thermodynamic computing exploits fluctuations and dissipation in physical systems to efficiently solve various mathematical problems. It was recently shown that certain linear algebra problems can be solved thermodynamically, leading to a speedup scaling with the matrix dimension. Here, we provide a thermodynamic algorithm for exponentiating a real matrix. We describe a simple electrical circuit involving coupled oscillators, which can implement our algorithm. We also show that this algorithm provides an asymptotic speedup that is linear in the dimension. Finally, we introduce the concept of thermodynamic parallelism to explain this speedup, stating that thermodynamic noise provides a resource leading to effective parallelization of computations.
- 10 February 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (1)
Top Cited PapersOpen AccessThermodynamic matrix exponentials and thermodynamic parallelism
Thermodynamic computing exploits fluctuations and dissipation in physical systems to efficiently solve various mathematical problems. It was recently shown that certain linear algebra problems can be solved thermodynamically, leading to a speedup scaling with the matrix dimension. Here, we provide a thermodynamic algorithm for exponentiating a real matrix. We describe a simple electrical circuit involving coupled oscillators, which can implement our algorithm. We also show that this algorithm provides an asymptotic speedup that is linear in the dimension. Finally, we introduce the concept of thermodynamic parallelism to explain this speedup, stating that thermodynamic noise provides a resource leading to effective parallelization of computations.
- Top Cited PapersOpen Access
- 5 November 2024
- Published by Springer Nature in npj Unconventional Computing
- Vol. 1 (1) , 1-11
Thermodynamic linear algebra
Linear algebra is central to many algorithms in engineering, science, and machine learning; hence, accelerating it would have tremendous economic impact. Quantum computing has been proposed for this purpose, although the resource requirements are far beyond current technological capabilities. We consider an alternative physics-based computing paradigm based on classical thermodynamics, to provide a near-term approach to accelerating linear algebra. At first sight, thermodynamics and linear algebra seem to be unrelated fields. Here, we connect solving linear algebra problems to sampling from the thermodynamic equilibrium distribution of a system of coupled harmonic oscillators. We present simple thermodynamic algorithms for solving linear systems of equations, computing matrix inverses, and computing matrix determinants. Under reasonable assumptions, we rigorously establish asymptotic speedups for our algorithms, relative to digital methods, that scale linearly in matrix dimension. Our algorithms exploit thermodynamic principles like ergodicity, entropy, and equilibration, highlighting the deep connection between these two seemingly distinct fields, and opening up algebraic applications for thermodynamic computers.
- 5 November 2024
- Published by Springer Nature in npj Unconventional Computing
- Vol. 1 (1) , 1-11
Top Cited PapersOpen AccessThermodynamic linear algebra
Linear algebra is central to many algorithms in engineering, science, and machine learning; hence, accelerating it would have tremendous economic impact. Quantum computing has been proposed for this purpose, although the resource requirements are far beyond current technological capabilities. We consider an alternative physics-based computing paradigm based on classical thermodynamics, to provide a near-term approach to accelerating linear algebra. At first sight, thermodynamics and linear algebra seem to be unrelated fields. Here, we connect solving linear algebra problems to sampling from the thermodynamic equilibrium distribution of a system of coupled harmonic oscillators. We present simple thermodynamic algorithms for solving linear systems of equations, computing matrix inverses, and computing matrix determinants. Under reasonable assumptions, we rigorously establish asymptotic speedups for our algorithms, relative to digital methods, that scale linearly in matrix dimension. Our algorithms exploit thermodynamic principles like ergodicity, entropy, and equilibration, highlighting the deep connection between these two seemingly distinct fields, and opening up algebraic applications for thermodynamic computers.
- Open Access
- 16 August 2024
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series C: Applied Statistics
- Vol. 73 (5) , 1262-1282
A state-space perspective on modelling and inference for online skill rating
We summarize popular methods used for skill rating in competitive sports, along with their inferential paradigms and introduce new approaches based on sequential Monte Carlo and discrete hidden Markov models. We advocate for a state-space model perspective, wherein players’ skills are represented as time-varying, and match results serve as observed quantities. We explore the steps to construct the model and the three stages of inference: filtering, smoothing, and parameter estimation. We examine the challenges of scaling up to numerous players and matches, highlighting the main approximations and reductions which facilitate statistical and computational efficiency. We additionally compare approaches in a realistic experimental pipeline that can be easily reproduced and extended with our open-source Python package, abile.
- 16 August 2024
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series C: Applied Statistics
- Vol. 73 (5) , 1262-1282
Open AccessA state-space perspective on modelling and inference for online skill rating
We summarize popular methods used for skill rating in competitive sports, along with their inferential paradigms and introduce new approaches based on sequential Monte Carlo and discrete hidden Markov models. We advocate for a state-space model perspective, wherein players’ skills are represented as time-varying, and match results serve as observed quantities. We explore the steps to construct the model and the three stages of inference: filtering, smoothing, and parameter estimation. We examine the challenges of scaling up to numerous players and matches, highlighting the main approximations and reductions which facilitate statistical and computational efficiency. We additionally compare approaches in a realistic experimental pipeline that can be easily reproduced and extended with our open-source Python package, abile.
- Open Access
- 12 September 2023
- Published by The Open Journal in Journal of Open Source Software
- Vol. 8 (89) , 5504
qujax: Simulating quantum circuits with JAX
Qujax is a pure JAX (Bradbury et al., 2018), purely functional Python package for the classical simulation of quantum circuits. A JAX implementation of quantum circuits inherits benefits such as seamless automatic differentiation, support for GPUs/TPUs as well as integration with a host of other tools within the JAX ecosystem. qujax is hosted on PyPI for easy installation and comes with detailed documentation and a suite of example notebooks. qujax represents a quantum circuit as a collection of three equal length Python iterables:
- 12 September 2023
- Published by The Open Journal in Journal of Open Source Software
- Vol. 8 (89) , 5504
Open Accessqujax: Simulating quantum circuits with JAX
Qujax is a pure JAX (Bradbury et al., 2018), purely functional Python package for the classical simulation of quantum circuits. A JAX implementation of quantum circuits inherits benefits such as seamless automatic differentiation, support for GPUs/TPUs as well as integration with a host of other tools within the JAX ecosystem. qujax is hosted on PyPI for easy installation and comes with detailed documentation and a suite of example notebooks. qujax represents a quantum circuit as a collection of three equal length Python iterables:
- Open Access
- 12 April 2023
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 4 (2) , 025007
Bayesian learning of parameterised quantum circuits
Currently available quantum computers suffer from constraints including hardware noise and a limited number of qubits. As such, variational quantum algorithms that utilise a classical optimiser in order to train a parameterised quantum circuit have drawn significant attention for near-term practical applications of quantum technology. In this work, we take a probabilistic point of view and reformulate the classical optimisation as an approximation of a Bayesian posterior. The posterior is induced by combining the cost function to be minimised with a prior distribution over the parameters of the quantum circuit. We describe a dimension reduction strategy based on a maximum a posteriori point estimate with a Laplace prior. Experiments on the Quantinuum H1-2 computer show that the resulting circuits are faster to execute and less noisy than the circuits trained without the dimension reduction strategy. We subsequently describe a posterior sampling strategy based on stochastic gradient Langevin dynamics. Numerical simulations on three different problems show that the strategy is capable of generating samples from the full posterior and avoiding local optima.
- 12 April 2023
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 4 (2) , 025007
Open AccessBayesian learning of parameterised quantum circuits
Currently available quantum computers suffer from constraints including hardware noise and a limited number of qubits. As such, variational quantum algorithms that utilise a classical optimiser in order to train a parameterised quantum circuit have drawn significant attention for near-term practical applications of quantum technology. In this work, we take a probabilistic point of view and reformulate the classical optimisation as an approximation of a Bayesian posterior. The posterior is induced by combining the cost function to be minimised with a prior distribution over the parameters of the quantum circuit. We describe a dimension reduction strategy based on a maximum a posteriori point estimate with a Laplace prior. Experiments on the Quantinuum H1-2 computer show that the resulting circuits are faster to execute and less noisy than the circuits trained without the dimension reduction strategy. We subsequently describe a posterior sampling strategy based on stochastic gradient Langevin dynamics. Numerical simulations on three different problems show that the strategy is capable of generating samples from the full posterior and avoiding local optima.
- Open Access
Ensemble Kalman Inversion for General Likelihoods
In this letter we generalise Ensemble Kalman inversion techniques to general Bayesian models where previously they were restricted to additive Gaussian likelihoods - all in the difficult setting where the likelihood can be sampled from, but its density not necessarily evaluated.
Open AccessEnsemble Kalman Inversion for General Likelihoods
In this letter we generalise Ensemble Kalman inversion techniques to general Bayesian models where previously they were restricted to additive Gaussian likelihoods - all in the difficult setting where the likelihood can be sampled from, but its density not necessarily evaluated.
- Open Access
- 7 May 2022
- Published by Elsevier in Statistics & Probability Letters
- Vol. 187
Ensemble Kalman inversion for general likelihoods
- 7 May 2022
- Published by Elsevier in Statistics & Probability Letters
- Vol. 187
Open AccessEnsemble Kalman inversion for general likelihoods
- Open Access
- 11 February 2022
- Published by The Open Journal in Journal of Open Source Software
- Vol. 7 (70) , 3651
bmm: Bayesian Map-matching
- 11 February 2022
- Published by The Open Journal in Journal of Open Source Software
- Vol. 7 (70) , 3651
Open Accessbmm: Bayesian Map-matching
- 10 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 70 (1053587X) , 497-508
Online Particle Smoothing With Application to Map-Matching
We introduce a novel method for online smoothing in state-space models that utilises a fixed-lag approximation to overcome the well known issue of path degeneracy. Unlike classical fixed-lag techniques that only approximate certain marginals, we introduce an online resampling algorithm, called particle stitching, that converts these marginal samples into a full posterior approximation. We demonstrate the utility of our method in the context of map-matching, the task of inferring a vehicle’s trajectory given a road network and noisy GPS observations. We develop a new state-space model for the difficult task of map-matching on dense, urban road networks.
- 10 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 70 (1053587X) , 497-508
Online Particle Smoothing With Application to Map-Matching
We introduce a novel method for online smoothing in state-space models that utilises a fixed-lag approximation to overcome the well known issue of path degeneracy. Unlike classical fixed-lag techniques that only approximate certain marginals, we introduce an online resampling algorithm, called particle stitching, that converts these marginal samples into a full posterior approximation. We demonstrate the utility of our method in the context of map-matching, the task of inferring a vehicle’s trajectory given a road network and noisy GPS observations. We develop a new state-space model for the difficult task of map-matching on dense, urban road networks.