The Thermodynamic Cost of Computing with Heat
Authors: M. W. AlMasri
Abstract: Autonomous quantum thermal machines have recently been proposed as physics-based computing substrates where logical inputs and outputs are encoded in temperature gradients. While such ``thermodynamic neurons'' exhibit a clear trade-off between computational fidelity and heat dissipation, the fundamental information-theoretic limits of temperature-encoded computation remain uncharacterized. Here, we derive rigorous bounds linking average error probability, channel capacity, and entropy production for finite-capacity thermal reservoirs operating far from equilibrium. We prove that the minimal dissipation required to achieve a target average error probability $\langle ξ\rangle$ diverges as $\langle ξ\rangle$ approaches a fundamental minimum error floor $\epsMin$ imposed by finite-reservoir thermal fluctuations. We further establish a thermodynamic channel capacity that saturates at high dissipation, and quantify the minimal dissipation required for cascaded networks to maintain target fidelity, demonstrating a fundamental $\mathcal{O}(L \ln L)$ overhead with network depth, with the required dissipation growing up to $\mathcal{O}(L^3)$ under strong noise amplification conditions. Our framework bridges stochastic thermodynamics, finite-time information theory, and autonomous computation, providing rigorous design principles for energy-efficient analog thermodynamic hardware.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
Some bits of the article are not summarized yet, you can re-run the summarizing process by clicking on the Run button below.
Look for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.