The Thermodynamic Cost of Computing with Heat

arXiv:2608.10027v2 Announce Type: replace 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 \xi \rangle$ diverges as $\langle \xi \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. We demonstrate that the required dissipation grows linearly $\mathcal{O}(L)$ with network depth for shallow networks, but diverges as the network depth $L$ approaches a fundamental maximum limit $L_{\max} = \epsNet/\epsMin$ imposed by the minimum error floor. Furthermore, under strong noise amplification conditions, the required dissipation can grow up to $\mathcal{O}(L^3)$. Our framework bridges stochastic thermodynamics, finite-time information theory, and autonomous computation, providing rigorous design principles for energy-efficient analog thermodynamic hardware.

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 \xi \rangle$ diverges as $\langle \xi \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. We demonstrate that the required dissipation grows linearly $\mathcal{O}(L)$ with network depth for shallow networks, but diverges as the network depth $L$ approaches a fundamental maximum limit $L_{\max} = \epsNet/\epsMin$ imposed by the minimum error floor. Furthermore, under strong noise amplification conditions, the required dissipation can grow up to $\mathcal{O}(L^3)$. Our framework bridges stochastic thermodynamics, finite-time information theory, and autonomous computation, providing rigorous design principles for energy-efficient analog thermodynamic hardware.

arXiv:2608.10027 [quant-ph]

(or arXiv:2608.10027v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2608.10027 Focus to learn more arXiv-issued DOI via DataCite

https://doi.org/10.1088/1402-4896/aea665 Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

aiqbench analysis

The Thermodynamic Cost of Computing with Heat

Related coverage