A strictly positive lower bound on the thermodynamic cost of running a Boolean circuit

[2504.04031] A strictly positive lower bound on the thermodynamic cost of running a Boolean circuit Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Condensed Matter > Statistical Mechanics arXiv:2504.04031 (cond-mat) [Submitted on 5 Apr 2025 ( v1 ), last revised 15 Aug 2026 (this version, v4)] Title: A strictly positive lower bound on the thermodynamic cost of running a Boolean circuit Authors: Abhishek Yadav , Mahran Yousef , David Wolpert View a PDF of the paper titled A strictly positive lower bound on the thermodynamic cost of running a Boolean circuit, by Abhishek Yadav and 2 other authors View PDF HTML (experimental) Abstract: All digital computers implement input-output functions using logic gates connected into circuits. Different circuits computing the same function may nevertheless incur different resource costs, and circuit complexity theory studies these costs through measures such as the number of gates and the length of the longest path from input to output. Energetic cost is another important resource, however, that is typically not included among these measures. To address this, we use mismatch cost (MMC): a nonnegative contribution to the entropy production of a process that can be characterized largely independently of the detailed physical implementation of that process, providing a natural way to analyze the thermodynamic cost of Boolean circuits at an abstract, computational level. We derive an expression for the MMC of circuits composed of Boolean gates, relate it to standard complexity measures such as circuit size and depth, and use it to define mismatch cost complexity as a measure of thermodynamic resource cost. For Boolean circuits computing a non-constant Boolean function, this expression also implies a strictly positive MMC for every input distribution, and therefore a strictly positive lower bound on total entropy production. We characterize when MMC scales linearly with circuit size and when it does not, and compare the MMC of different circuit families that compute the same Boolean function. Together, these results lay the foundation for treating mismatch cost as a resource within circuit complexity theory. Subjects: Statistical Mechanics (cond-mat.stat-mech) Cite as: arXiv:2504.04031 [cond-mat.stat-mech] (or arXiv:2504.04031v4 [cond-mat.stat-mech] for this version) https://doi.org/10.48550/arXiv.2504.04031 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Abhishek Yadav [ view email ] [v1] Sat, 5 Apr 2025 02:55:09 UTC (523 KB) [v2] Sun, 6 Jul 2025 21:37:51 UTC (540 KB) [v3] Sun, 22 Feb 2026 17:27:10 UTC (539 KB) [v4] Sat, 15 Aug 2026 01:16:49 UTC (450 KB) Full-text links: Access Paper: View a PDF of the paper titled A strictly positive lower bound on the thermodynamic cost of running a Boolean circuit, by Abhishek Yadav and 2 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cond-mat.stat-mech < prev | next > new | recent | 2025-04 Change to browse by: cond-mat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) IArxiv recommender toggle IArxiv Recommender ( What is IArxiv? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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 . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• New lower bounds for CDS and $f$-routing#1050472
• New lower bounds for CDS and $f$-routing#1028594
• Ion Crowding Effect in Unilaterally Downsized Perovskite Memristors.#9100
• From Swap Axioms to Weighted Geometric Means: A Characterization of AMMs#120485
• A Loop Thermosyphon for Liquid Cooled Minichannels Heat Sink with Pulsate Surface Heat Flux#932658