The Fluctuation-Dissipation Compilation Theorem: A Unified Framework for Thermodynamically Optimal Computing

The Fluctuation-Dissipation Compilation Theorem: A Unified Framework for Thermodynamically Optimal Computing | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article The Fluctuation-Dissipation Compilation Theorem: A Unified Framework for Thermodynamically Optimal Computing Rolando Pablo Hong Enriquez This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8653565/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Computation fundamentally requires energy, with Landauer's principle establishing that erasing one bit of information irreversibly dissipates at least thermal energy times the natural logarithm of two. Modern computers operate millions to billions of times above this fundamental limit. Here we prove the Fluctuation-Dissipation Compilation Theorem, establishing rigorous bounds for transforming arbitrary irreversible programs into thermodynamically reversible equivalents that approach the Landauer limit with quantifiable precision. Our central result unifies fluctuation theorems from non-equilibrium statistical mechanics with compilation theory from computer science. We prove that for any computation producing logical entropy change—measured as Shannon entropy of computational basis measurement distributions—there exists a stochastic reversible compilation whose average energy dissipation equals the product of temperature and logical entropy change, plus corrections that decrease as the inverse square root of the ensemble size. This bound is provably tight: it is achievable through Bennett's copy-compute-uncompute strategy and cannot be improved asymptotically by any alternative method. The proof combines the Jarzynski equality and Crooks fluctuation relation with the central limit theorem and Berry-Esseen convergence bounds, establishing explicit convergence rates absent from prior reversible computing theory. We formulate thermodynamic compilation as a resource theory where reversible transformations conserve entropy and irreversible erasure operations incur fundamental work costs bounded by Shannon information limits. Beyond Bennett's asymptotic results, we provide finite-ensemble guarantees essential for practical implementations, characterizing work fluctuations through complete statistical distributions rather than average values alone. We establish a comprehensive theoretical hierarchy encompassing ancilla requirements by function class and work-time-space Pareto frontiers proving no compilation can simultaneously optimize all resources. Bennett's method offers two implementation variants: standard compilation achieves linear time overhead with space proportional to computation length, while recursive pebbling reduces space to logarithmic growth at quadratic time cost. For fault-tolerant quantum computing, we prove quantum error correction overhead scales with circuit dimensions rather than logical entropy—deterministic algorithms with zero entropy change still incur syndrome measurement costs proportional to circuit size, code distance squared, and physical error rate. Classical simulation of idealized quantum circuits under perfect reversibility assumptions validates our theoretical predictions: computed dissipation for deterministic algorithms approaches effectively zero beyond numerical precision limits, while probabilistic algorithms exhibit dissipation proportional to their logical entropy production. This framework provides the first complete, quantitatively proven path from fundamental physical limits to practical energy-optimal compilation. Applications span quantum computing architectures where thermal budgets constrain gate fidelities, energy-harvesting Internet-of-Things devices requiring decade-scale battery operation, data centers seeking efficiency improvements with billion-dollar economic impact, and deep-space missions operating under extreme power constraints. By establishing thermodynamic compilation as a rigorous mathematical discipline, this work bridges statistical physics, information theory, and computer science, opening new research directions in the ultimate physical limits of computation. Thermodynamics and statistical mechanics Reversible computing Landauer limit fluctuation theorems thermodynamic compilation Bennett's method quantum computing stochastic thermodynamics resource theory Full Text Additional Declarations The authors declare no competing interests. Supplementary Files mainFDCSI.pdf Complete Proofs and Validations codeFDCTheorem.zip FDC Compiler, tutorials, examples. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-8653565","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":577755360,"identity":"46c4f9a7-24d9-485d-b5ee-6848f7819871","order_by":0,"name":"Rolando Pablo Hong Enriquez","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAl0lEQVRIiWNgGAWjYDACCRBRcYBkLWdI1sLYRooW89nNxx5+nXcnj5+B+eGjG8RokblzLN1YdtuzYskGNmPjHKLcJZFjJi257XDihgM8bNIkaJlzOHE/SVokPzYAbWEgXktamjTDscPFEoeJ90vyMckfNYfz+NubHz4mSgsIMPMwMCQwMBOrHAQYf4C0jIJRMApGwSjABQBgOy9Q0E+KZgAAAABJRU5ErkJggg==","orcid":"https://orcid.org/0009-0008-5652-4408","institution":"HPE Labs","correspondingAuthor":true,"prefix":"","firstName":"Rolando","middleName":"Pablo Hong","lastName":"Enriquez","suffix":""}],"badges":[],"createdAt":"2026-01-20 23:26:31","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-8653565/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8653565/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":100788111,"identity":"52ebc31b-e6aa-444a-8c66-c24101d34896","added_by":"auto","created_at":"2026-01-21 12:05:12","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1323298,"visible":true,"origin":"","legend":"","description":"","filename":"mainFDC.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8653565/v1_covered_c5516839-c65b-4666-9f03-5960f325c9c2.pdf"},{"id":100787733,"identity":"f38df826-3229-4b74-aee9-b4d2db124fbc","added_by":"auto","created_at":"2026-01-21 12:03:39","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"supplement","size":1006720,"visible":true,"origin":"","legend":"\u003cp\u003eComplete Proofs and Validations\u003c/p\u003e","description":"","filename":"mainFDCSI.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8653565/v1/d46b925ac230b825e3ba4740.pdf"},{"id":100787845,"identity":"16d485b3-d6de-4584-9519-5cbe2a29f6a2","added_by":"auto","created_at":"2026-01-21 12:04:09","extension":"zip","order_by":2,"title":"","display":"","copyAsset":false,"role":"supplement","size":3280725,"visible":true,"origin":"","legend":"\u003cp\u003eFDC Compiler, tutorials, examples.\u003c/p\u003e","description":"","filename":"codeFDCTheorem.zip","url":"https://assets-eu.researchsquare.com/files/rs-8653565/v1/2a25fcf5f4fd3ea458f7da1e.zip"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eThe Fluctuation-Dissipation Compilation Theorem: A Unified Framework for Thermodynamically Optimal Computing\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"Hewlett Packard Enterprise (United States)","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Reversible computing, Landauer limit, fluctuation theorems, thermodynamic compilation, Bennett's method, quantum computing, stochastic thermodynamics, resource theory","lastPublishedDoi":"10.21203/rs.3.rs-8653565/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8653565/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eComputation fundamentally requires energy, with Landauer's principle establishing that erasing one bit of information irreversibly dissipates at least thermal energy times the natural logarithm of two. Modern computers operate millions to billions of times above this fundamental limit. \u003cstrong\u003eHere we prove the Fluctuation-Dissipation Compilation Theorem, establishing rigorous bounds for transforming arbitrary irreversible programs into thermodynamically reversible equivalents that approach the Landauer limit with quantifiable precision.\u003c/strong\u003e\u003c/p\u003e\n\u003cp\u003eOur central result unifies fluctuation theorems from non-equilibrium statistical mechanics with compilation theory from computer science. We prove that for any computation producing logical entropy change—measured as Shannon entropy of computational basis measurement distributions—there exists a stochastic reversible compilation whose average energy dissipation equals the product of temperature and logical entropy change, plus corrections that decrease as the inverse square root of the ensemble size. This bound is provably tight: it is achievable through Bennett's copy-compute-uncompute strategy and cannot be improved asymptotically by any alternative method.\u003c/p\u003e\n\u003cp\u003eThe proof combines the Jarzynski equality and Crooks fluctuation relation with the central limit theorem and Berry-Esseen convergence bounds, establishing explicit convergence rates absent from prior reversible computing theory. We formulate thermodynamic compilation as a resource theory where reversible transformations conserve entropy and irreversible erasure operations incur fundamental work costs bounded by Shannon information limits. Beyond Bennett's asymptotic results, we provide finite-ensemble guarantees essential for practical implementations, characterizing work fluctuations through complete statistical distributions rather than average values alone.\u003c/p\u003e\n\u003cp\u003eWe establish a comprehensive theoretical hierarchy encompassing ancilla requirements by function class and work-time-space Pareto frontiers proving no compilation can simultaneously optimize all resources. Bennett's method offers two implementation variants: standard compilation achieves linear time overhead with space proportional to computation length, while recursive pebbling reduces space to logarithmic growth at quadratic time cost. For fault-tolerant quantum computing, we prove quantum error correction overhead scales with circuit dimensions rather than logical entropy—deterministic algorithms with zero entropy change still incur syndrome measurement costs proportional to circuit size, code distance squared, and physical error rate. Classical simulation of idealized quantum circuits under perfect reversibility assumptions validates our theoretical predictions: computed dissipation for deterministic algorithms approaches effectively zero beyond numerical precision limits, while probabilistic algorithms exhibit dissipation proportional to their logical entropy production.\u003c/p\u003e\n\u003cp\u003e\u003cstrong\u003eThis framework provides the first complete, quantitatively proven path from fundamental physical limits to practical energy-optimal compilation.\u003c/strong\u003e Applications span quantum computing architectures where thermal budgets constrain gate fidelities, energy-harvesting Internet-of-Things devices requiring decade-scale battery operation, data centers seeking efficiency improvements with billion-dollar economic impact, and deep-space missions operating under extreme power constraints. \u003cstrong\u003eBy establishing thermodynamic compilation as a rigorous mathematical discipline, this work bridges statistical physics, information theory, and computer science, opening new research directions in the ultimate physical limits of computation.\u003c/strong\u003e\u003c/p\u003e","manuscriptTitle":"The Fluctuation-Dissipation Compilation Theorem: A Unified Framework for Thermodynamically Optimal Computing","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-01-21 11:52:38","doi":"10.21203/rs.3.rs-8653565/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"741893ea-fd2e-44fb-a64f-d409e4de0907","owner":[],"postedDate":"January 21st, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":61469016,"name":"Thermodynamics and statistical mechanics"}],"tags":[],"updatedAt":"2026-01-21T11:52:38+00:00","versionOfRecord":[],"versionCreatedAt":"2026-01-21 11:52:38","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8653565","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8653565","identity":"rs-8653565","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}