Kaelan Donatella

Kaelan Donatella

Auto-generated profile, based on publicly available information

Kaelan Donatella

Normal Computing

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 August 2023 in Physical Review A
Verified
Journal Article
Closed access
PDF file
KDKaelan Donatella
Kaelan Donatella
ZDZakari Denis
Zakari Denis
ABAlexandre Le Boité
Alexandre Le Boité
CCCristiano Ciuti
Cristiano Ciuti
Despite very promising results, capturing the dynamics of complex quantum systems with neural-network ansätze has been plagued by several problems, one of which is stochastic noise that makes the dynamics unstable and highly dependent on some regularization hyperparameters. We present an alternative general scheme that enables one to capture long-time dynamics of quantum systems in a stable fashion, provided the neural-network ansatz is normalized, which can be ensured by the autoregressive property of the chosen ansatz. We then apply the scheme to time-dependent quench dynamics by investigating the Kibble-Zurek mechanism in the two-dimensional quantum Ising model. We find an excellent agreement with exact dynamics for small systems and are able to recover scaling laws in agreement with other variational methods.

5 November 2024 in npj Unconventional Computing
Verified
Journal Article
Open access
PDF file
MAMaxwell Aifer
Maxwell Aifer
KDKaelan Donatella
Kaelan Donatella
MGMax Hunter Gordon
Max Hunter Gordon
SDSamuel Duffield
Samuel Duffield
TAThomas Ahle
Thomas Ahle
PCPatrick J. Coles
Patrick J. Coles
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.

12 September 2022 in Physical Review A
Verified
Journal Article
Closed access
PDF file
ZLZejian Li
Zejian Li
VHValentin Heyraud
Valentin Heyraud
KDKaelan Donatella
Kaelan Donatella
ZDZakari Denis
Zakari Denis
CCCristiano Ciuti
Cristiano Ciuti
We present a machine-learning scheme based on the relativistic dynamics of a quantum system, namely a quantum detector inside a cavity resonator. An equivalent analog model can be realized for example in a circuit QED platform subject to properly modulated driving fields. We consider a reservoir-computing scheme where the input data are embedded in the modulation of the system (equivalent to the acceleration of the relativistic object) and the output data are obtained by linear combinations of measured observables. As an illustrative example, we have simulated such a relativistic quantum machine for a challenging classification task, showing a very large enhancement of the accuracy in the relativistic regime. Using kernel-machine theory, we show that in the relativistic regime the task-independent expressivity is dramatically magnified with respect to the Newtonian regime.

13 November 2020 in Physical Review Research
Verified
Journal Article
Open access
PDF file
KDKaelan Donatella
Kaelan Donatella
ABAlberto Biella
Alberto Biella
ABAlexandre Le Boité
Alexandre Le Boité
CCCristiano Ciuti
Cristiano Ciuti
We theoretically investigate the entanglement dynamics in photonic Mott insulators in the presence of particle losses and dephasing. We explore two configurations where entanglement is generated following the injection or extraction of a photon in the central site of a chain of cavity resonators. We study the entanglement negativity of two-site reduced density matrices as a function of time and intersite distance. Our findings show that in spite of particle losses the quantum entanglement propagation exhibits a ballistic character with propagation speeds related to the different quasiparticles that are involved in the dynamics, namely photonic doublons and holons respectively. Our analysis reveals that photon dissipation has a strikingly asymmetric behavior in the two configurations with a much more dramatic role on the holon entanglement propagation than for the doublon case.

22 May 2024 in arXiv
Verified
Preprint
Open access
PDF file
KDKaelan Donatella
Kaelan Donatella
SDSamuel Duffield
Samuel Duffield
MAMaxwell Aifer
Maxwell Aifer
DMDenis Melanson
Denis Melanson
GCGavin Crooks
Gavin Crooks
PCPatrick J. Coles
Patrick J. Coles
Second-order training methods have better convergence properties than gradient descent but are rarely used in practice for large-scale training due to their computational overhead. This can be viewed as a hardware limitation (imposed by digital computers). Here we show that natural gradient descent (NGD), a second-order method, can have a similar computational complexity per iteration to a first-order method, when employing appropriate hardware. We present a new hybrid digital-analog algorithm for training neural networks that is equivalent to NGD in a certain parameter regime but avoids prohibitively costly linear system solves. Our algorithm exploits the thermodynamic properties of an analog system at equilibrium, and hence requires an analog thermodynamic computer. The training occurs in a hybrid digital-analog loop, where the gradient and Fisher information matrix (or any other positive semi-definite curvature matrix) are calculated at given time intervals while the analog dynamics take place. We numerically demonstrate the superiority of this approach over state-of-the-art digital first- and second-order training methods on classification tasks and language model fine-tuning tasks.

19 February 2025 in Qeios Preprints
Verified
Preprint
Open access
PDF file
KDKaelan Donatella
Kaelan Donatella
SDSamuel Duffield
Samuel Duffield
DMDenis Melanson
Denis Melanson
MAMaxwell Aifer
Maxwell Aifer
PKPhoebe Klett
Phoebe Klett
PCPatrick J. Coles
Patrick J. Coles
Many hardware proposals have aimed to accelerate inference in AI workloads. Less attention has been paid to hardware acceleration of training, despite the enormous societal impact of rapid training of AI models. Physics-based computers, such as thermodynamic computers, offer an efficient means to solve key primitives in AI training algorithms. Optimizers that normally would be computationally out-of-reach (e.g., due to expensive matrix inversions) on digital hardware could be unlocked with physics-based hardware. In this work, we propose a scalable algorithm for employing thermodynamic computers to accelerate a popular second-order optimizer called Kronecker-factored approximate curvature (K-FAC). Our asymptotic complexity analysis predicts increasing advantage with our algorithm as \(n\), the number of neurons per layer, increases. Numerical experiments show that even under significant quantization noise, the benefits of second-order optimization can be preserved. Finally, we predict substantial speedups for large-scale vision and graph problems based on realistic hardware characteristics.