
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.
FOS: Computer and information sciences, Quantum Physics, Emerging Technologies (cs.ET), Statistical Mechanics (cond-mat.stat-mech), Physics, QC1-999, Computer Science - Emerging Technologies, FOS: Physical sciences, Quantum Physics (quant-ph), Condensed Matter - Statistical Mechanics
FOS: Computer and information sciences, Quantum Physics, Emerging Technologies (cs.ET), Statistical Mechanics (cond-mat.stat-mech), Physics, QC1-999, Computer Science - Emerging Technologies, FOS: Physical sciences, Quantum Physics (quant-ph), Condensed Matter - Statistical Mechanics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
