Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.02425 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908658908004352 |
|---|---|
| author | Chanavat, Clémence Srinivasan, Priyaa Varshinee |
| author_facet | Chanavat, Clémence Srinivasan, Priyaa Varshinee |
| contents | We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the equivalence relation of its domain. We model computational and physical transformations as subdistribution matrices over the category of sets and partitioned matrices on partitioned sets, respectively. We show that the interactions between the physical and computational transformations are governed by an aggregation functor whose functoriality and monoidality we deduce from general principles of the formal theory of monads. We study the associated copy-discard structures, in particular, general conditions for determinism and partial invertibility. We then define several notions of entropies that we use to state and prove the fundamental theorem of generalized reversible computing. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_02425 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Compositional Account of Generalized Reversible Computing Chanavat, Clémence Srinivasan, Priyaa Varshinee Category Theory 18M35, 18M05 We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the equivalence relation of its domain. We model computational and physical transformations as subdistribution matrices over the category of sets and partitioned matrices on partitioned sets, respectively. We show that the interactions between the physical and computational transformations are governed by an aggregation functor whose functoriality and monoidality we deduce from general principles of the formal theory of monads. We study the associated copy-discard structures, in particular, general conditions for determinism and partial invertibility. We then define several notions of entropies that we use to state and prove the fundamental theorem of generalized reversible computing. |
| title | A Compositional Account of Generalized Reversible Computing |
| topic | Category Theory 18M35, 18M05 |
| url | https://arxiv.org/abs/2511.02425 |