pith. sign in

arxiv: 2311.12759 · v2 · pith:3O4VUM7Vnew · submitted 2023-11-21 · ❄️ cond-mat.stat-mech · cs.ET· quant-ph

Thermodynamic Matrix Exponentials and Thermodynamic Parallelism

classification ❄️ cond-mat.stat-mech cs.ETquant-ph
keywords thermodynamicalgorithmlinearmatrixproblemsspeedupadvantageasymptotic
0
0 comments X
read the original abstract

Thermodynamic computing exploits fluctuations and dissipation in physical systems to efficiently solve various mathematical problems. For example, it was recently shown that certain linear algebra problems can be solved thermodynamically, leading to an asymptotic speedup scaling with the matrix dimension. The origin of this "thermodynamic advantage" has not yet been fully explained, and it is not clear what other problems might benefit from it. Here we provide a new thermodynamic algorithm for exponentiating a real matrix, with applications in simulating linear dynamical systems. We describe a simple electrical circuit involving coupled oscillators, whose thermal equilibration can implement our algorithm. We also show that this algorithm also 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, and we hypothesize this as a mechanism to explain thermodynamic advantage more generally.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.