Circuit complexity and functionality: A statistical thermodynamics perspective
Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexit...
Saved in:
| Published in: | Proceedings of the National Academy of Sciences - PNAS Vol. 122; no. 23; p. e2415913122 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
10.06.2025
|
| Subjects: | |
| ISSN: | 1091-6490, 1091-6490 |
| Online Access: | Get more information |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexity has been promoted to a physical property, wherein the growth of complexity is reflected in the time evolution of the Einstein-Rosen bridge ("wormhole") connecting the two sides of an anti-de Sitter "eternal" black hole. Here, we are motivated by an independent set of considerations and explore links between complexity and thermodynamics for functionally equivalent circuits, making the physics-inspired approach relevant to real computational problems, for which functionality is the key element of interest. In particular, our thermodynamic framework provides an alternative perspective on the obfuscation of programs of arbitrary length-an important problem in cryptography-as thermalization through recursive mixing of neighboring sections of a circuit, which can be viewed as the mixing of two containers with "gases of gates." This recursive process equilibrates the average complexity and leads to the saturation of the circuit entropy, while preserving functionality of the overall circuit. The thermodynamic arguments hinge on ergodicity in the space of circuits which we conjecture is limited to disconnected ergodic sectors due to fragmentation. The notion of fragmentation has important implications for the problem of circuit obfuscation as it implies that there are circuits of same size and functionality that cannot be connected via a polynomial number of local moves. Furthermore, we argue that fragmentation is unavoidable unless the complexity classes NP and coNP coincide, a statement that implies the collapse of the polynomial hierarchy of computational complexity theory to its first level. |
|---|---|
| AbstractList | Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexity has been promoted to a physical property, wherein the growth of complexity is reflected in the time evolution of the Einstein-Rosen bridge ("wormhole") connecting the two sides of an anti-de Sitter "eternal" black hole. Here, we are motivated by an independent set of considerations and explore links between complexity and thermodynamics for functionally equivalent circuits, making the physics-inspired approach relevant to real computational problems, for which functionality is the key element of interest. In particular, our thermodynamic framework provides an alternative perspective on the obfuscation of programs of arbitrary length-an important problem in cryptography-as thermalization through recursive mixing of neighboring sections of a circuit, which can be viewed as the mixing of two containers with "gases of gates." This recursive process equilibrates the average complexity and leads to the saturation of the circuit entropy, while preserving functionality of the overall circuit. The thermodynamic arguments hinge on ergodicity in the space of circuits which we conjecture is limited to disconnected ergodic sectors due to fragmentation. The notion of fragmentation has important implications for the problem of circuit obfuscation as it implies that there are circuits of same size and functionality that cannot be connected via a polynomial number of local moves. Furthermore, we argue that fragmentation is unavoidable unless the complexity classes NP and coNP coincide, a statement that implies the collapse of the polynomial hierarchy of computational complexity theory to its first level.Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexity has been promoted to a physical property, wherein the growth of complexity is reflected in the time evolution of the Einstein-Rosen bridge ("wormhole") connecting the two sides of an anti-de Sitter "eternal" black hole. Here, we are motivated by an independent set of considerations and explore links between complexity and thermodynamics for functionally equivalent circuits, making the physics-inspired approach relevant to real computational problems, for which functionality is the key element of interest. In particular, our thermodynamic framework provides an alternative perspective on the obfuscation of programs of arbitrary length-an important problem in cryptography-as thermalization through recursive mixing of neighboring sections of a circuit, which can be viewed as the mixing of two containers with "gases of gates." This recursive process equilibrates the average complexity and leads to the saturation of the circuit entropy, while preserving functionality of the overall circuit. The thermodynamic arguments hinge on ergodicity in the space of circuits which we conjecture is limited to disconnected ergodic sectors due to fragmentation. The notion of fragmentation has important implications for the problem of circuit obfuscation as it implies that there are circuits of same size and functionality that cannot be connected via a polynomial number of local moves. Furthermore, we argue that fragmentation is unavoidable unless the complexity classes NP and coNP coincide, a statement that implies the collapse of the polynomial hierarchy of computational complexity theory to its first level. Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexity has been promoted to a physical property, wherein the growth of complexity is reflected in the time evolution of the Einstein-Rosen bridge ("wormhole") connecting the two sides of an anti-de Sitter "eternal" black hole. Here, we are motivated by an independent set of considerations and explore links between complexity and thermodynamics for functionally equivalent circuits, making the physics-inspired approach relevant to real computational problems, for which functionality is the key element of interest. In particular, our thermodynamic framework provides an alternative perspective on the obfuscation of programs of arbitrary length-an important problem in cryptography-as thermalization through recursive mixing of neighboring sections of a circuit, which can be viewed as the mixing of two containers with "gases of gates." This recursive process equilibrates the average complexity and leads to the saturation of the circuit entropy, while preserving functionality of the overall circuit. The thermodynamic arguments hinge on ergodicity in the space of circuits which we conjecture is limited to disconnected ergodic sectors due to fragmentation. The notion of fragmentation has important implications for the problem of circuit obfuscation as it implies that there are circuits of same size and functionality that cannot be connected via a polynomial number of local moves. Furthermore, we argue that fragmentation is unavoidable unless the complexity classes NP and coNP coincide, a statement that implies the collapse of the polynomial hierarchy of computational complexity theory to its first level. |
| Author | Chamon, Claudio Mucciolo, Eduardo R Ruckenstein, Andrei E Canetti, Ran |
| Author_xml | – sequence: 1 givenname: Claudio orcidid: 0000-0002-8275-2024 surname: Chamon fullname: Chamon, Claudio organization: Department of Physics, Boston University, Boston, MA 02215 – sequence: 2 givenname: Andrei E orcidid: 0009-0003-8314-9803 surname: Ruckenstein fullname: Ruckenstein, Andrei E organization: Department of Physics, Boston University, Boston, MA 02215 – sequence: 3 givenname: Eduardo R orcidid: 0000-0002-8629-0509 surname: Mucciolo fullname: Mucciolo, Eduardo R organization: Department of Physics, University of Central Florida, Orlando, FL 32816 – sequence: 4 givenname: Ran orcidid: 0000-0002-5479-7540 surname: Canetti fullname: Canetti, Ran organization: Department of Computer Science, Boston University, Boston, MA 02215 |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/40455979$$D View this record in MEDLINE/PubMed |
| BookMark | eNpNkEtLAzEUhYNU7EPX7iRLN1Nz82gbd6X4gqIbXQ9J5gYjM5lxkhHn31uwgqvzcfg4izMnk9hGJOQS2BLYWtx00aQll6A0COD8hMyAaShWUrPJP56SeUofjDGtNuyMTCWTSum1npHnXejdEDJ1bdPV-B3ySE2sqB-iy6GNpj40t3RLUzY5pBycqWl-x75pqzGaJrhEO-xThwf9C8_JqTd1wotjLsjb_d3r7rHYvzw87bb7wkmQueDMWnDWbpQCj8xpFG6DwnvLrYQKlTQC7cohalNx9Fw6BmvDwEjwnnu-INe_u13ffg6YctmE5LCuTcR2SKXgoLhQoNhBvTqqg22wKrs-NKYfy78P-A-4pWLz |
| ContentType | Journal Article |
| DBID | NPM 7X8 |
| DOI | 10.1073/pnas.2415913122 |
| DatabaseName | PubMed MEDLINE - Academic |
| DatabaseTitle | PubMed MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic PubMed |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | no_fulltext_linktorsrc |
| Discipline | Sciences (General) |
| EISSN | 1091-6490 |
| ExternalDocumentID | 40455979 |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: DOE grantid: DE-FG02-06ER46316 – fundername: NSF grantid: GCR-2428487 |
| GroupedDBID | --- -DZ -~X .55 0R~ 123 2FS 2WC 4.4 5RE 5VS 85S AACGO AAFWJ AANCE ABOCM ABPLY ABPPZ ABTLG ABZEH ACGOD ACIWK ACNCT ACPRK AENEX AFFNX AFHIN AFOSN AFRAH ALMA_UNASSIGNED_HOLDINGS BKOMP CS3 D0L DIK DU5 E3Z EBS F5P FRP GX1 H13 HH5 JLS JSG KQ8 L7B LU7 N9A NPM N~3 O9- OK1 PNE PQQKQ R.V RHI RNA RNS RPM RXW SJN TAE TN5 UKR WH7 WOQ X7M XSW Y6R YKV YSK ZCA ~02 ~KM 7X8 YBH |
| ID | FETCH-LOGICAL-c414t-20bb1cbb8551fe0c9e3c8e3ffb2b41de54a3eb6cee9ad2ef24c017a01a41ff2f2 |
| IEDL.DBID | 7X8 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001510573100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1091-6490 |
| IngestDate | Fri Sep 05 15:58:13 EDT 2025 Thu Jun 19 02:15:56 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 23 |
| Keywords | thermodynamics classical reversible circuits complexity cryptography quantum circuits |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c414t-20bb1cbb8551fe0c9e3c8e3ffb2b41de54a3eb6cee9ad2ef24c017a01a41ff2f2 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0002-8275-2024 0000-0002-5479-7540 0000-0002-8629-0509 0009-0003-8314-9803 |
| OpenAccessLink | https://www.pnas.org/doi/10.1073/pnas.2415913122 |
| PMID | 40455979 |
| PQID | 3215235150 |
| PQPubID | 23479 |
| ParticipantIDs | proquest_miscellaneous_3215235150 pubmed_primary_40455979 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-06-10 |
| PublicationDateYYYYMMDD | 2025-06-10 |
| PublicationDate_xml | – month: 06 year: 2025 text: 2025-06-10 day: 10 |
| PublicationDecade | 2020 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | Proceedings of the National Academy of Sciences - PNAS |
| PublicationTitleAlternate | Proc Natl Acad Sci U S A |
| PublicationYear | 2025 |
| SSID | ssj0009580 |
| Score | 2.4826698 |
| Snippet | Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer... |
| SourceID | proquest pubmed |
| SourceType | Aggregation Database Index Database |
| StartPage | e2415913122 |
| Title | Circuit complexity and functionality: A statistical thermodynamics perspective |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/40455979 https://www.proquest.com/docview/3215235150 |
| Volume | 122 |
| WOSCitedRecordID | wos001510573100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV27TsMwFLWAMrAA5VleMhIDDKF-JbFZUFVRsRB1AKlb5afUgSQ0LeLzsZNUZUFCYslgKVF0dY_v8bV9DgA3JiWKm5C8seYRM8pEChmPKxWzRKNEUa1qs4k0y_hkIsZtw61qj1Wu5sR6ojaFDj3yPg0GrNRXX_RYfkTBNSrsrrYWGpugQz2VCVmdTvgP0V3eqBEIHCVMoJW0T0r7ZS6r-1C9BKY4OOf-xi_rOjPa--8f7oPdlmHCQZMSXbBh8wPQbTFcwdtWaPruEGTD2VwvZwtYnyu3X56QQ5kbGGpd0yL0Iw9wAMOto1rQ2X83EMb3wjRG9hUs15c1j8Db6Ol1-By1_gqRZpgtPECUwlop7lmTs0gLSzW31DlFFMPGxkxSqxJfRoU0xDrCtMevRFgy7Bxx5Bhs5UVuTwFUsbREKy4xs0xjqWLMkaE05dQmJhU9cL2K2dTnb9iUkLktltV0HbUeOGkCPy0boY0p83zTL3jE2R_ePgc7JFjzBlshdAE6zqPXXoJt_ekDNL-qE8M_s_HLNwmxxbE |
| linkProvider | ProQuest |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Circuit+complexity+and+functionality%3A+A+statistical+thermodynamics+perspective&rft.jtitle=Proceedings+of+the+National+Academy+of+Sciences+-+PNAS&rft.au=Chamon%2C+Claudio&rft.au=Ruckenstein%2C+Andrei+E&rft.au=Mucciolo%2C+Eduardo+R&rft.au=Canetti%2C+Ran&rft.date=2025-06-10&rft.eissn=1091-6490&rft.volume=122&rft.issue=23&rft.spage=e2415913122&rft_id=info:doi/10.1073%2Fpnas.2415913122&rft_id=info%3Apmid%2F40455979&rft_id=info%3Apmid%2F40455979&rft.externalDocID=40455979 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1091-6490&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1091-6490&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1091-6490&client=summon |