Minimal thermodynamic cost of computing with circuits
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917287105134592 |
|---|---|
| author | Yadav, Abhishek Yousef, Mahran Wolpert, David |
| author_facet | Yadav, Abhishek Yousef, Mahran Wolpert, David |
| contents | All digital devices have components that implement Boolean functions, mapping that component's input to its output. However, any fixed Boolean function can be implemented by an infinite number of circuits, all of which vary in their resource costs. This has given rise to the field of circuit complexity theory, which studies the minimal resource cost to implement a given Boolean function with any circuit. Traditionally, circuit complexity theory has focused on the resource costs of a circuit's size (its number of gates) and depth (the longest path length from the circuit's input to its output). In this paper, we extend circuit complexity theory by investigating the minimal thermodynamic cost of a circuit's operation. We do this by using the mismatch cost (MMC) of a given circuit that is run multiple times in a row to calculate a lower bound on the entropy production (EP) incurred in each such run. Specifically, we discuss conditions under which MMC of a circuit is proportional to the size of a circuit, and when they are not. We also use our results to compare the thermodynamic costs of different circuit families implementing the same family of Boolean functions. In addition, we analyze how differences in the underlying physics of individual gates within a circuit influence the minimal thermodynamic cost of the circuit as a whole. These results lay the foundation for extending circuit complexity theory to include mismatch cost as a resource cost. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_04031 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Minimal thermodynamic cost of computing with circuits Yadav, Abhishek Yousef, Mahran Wolpert, David Statistical Mechanics All digital devices have components that implement Boolean functions, mapping that component's input to its output. However, any fixed Boolean function can be implemented by an infinite number of circuits, all of which vary in their resource costs. This has given rise to the field of circuit complexity theory, which studies the minimal resource cost to implement a given Boolean function with any circuit. Traditionally, circuit complexity theory has focused on the resource costs of a circuit's size (its number of gates) and depth (the longest path length from the circuit's input to its output). In this paper, we extend circuit complexity theory by investigating the minimal thermodynamic cost of a circuit's operation. We do this by using the mismatch cost (MMC) of a given circuit that is run multiple times in a row to calculate a lower bound on the entropy production (EP) incurred in each such run. Specifically, we discuss conditions under which MMC of a circuit is proportional to the size of a circuit, and when they are not. We also use our results to compare the thermodynamic costs of different circuit families implementing the same family of Boolean functions. In addition, we analyze how differences in the underlying physics of individual gates within a circuit influence the minimal thermodynamic cost of the circuit as a whole. These results lay the foundation for extending circuit complexity theory to include mismatch cost as a resource cost. |
| title | Minimal thermodynamic cost of computing with circuits |
| topic | Statistical Mechanics |
| url | https://arxiv.org/abs/2504.04031 |