An order-theoretic circuit syntax and characterisation of the concept lattice
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912471723278336 |
|---|---|
| author | van der Lugt, Tein |
| author_facet | van der Lugt, Tein |
| contents | We take an order-theoretic approach to circuit (string diagram) syntax, treating a circuit as a partial order with additional input-output structure. We define morphisms between circuits and prove a factorisation theorem showing that these can, in the finite case, be regarded as formalising a notion of syntactical circuit rewrites, with quotient maps in particular corresponding to gate composition. We then consider the connectivity of a circuit, expressed as a binary relation between its inputs and outputs, and characterise the concept lattice from formal concept analysis as the unique smallest circuit that admits morphisms from all other circuits with the same connectivity. This has significance for quantum causality, particularly to the study of causal decompositions of unitary transformations. We close by constructing the circuit characterised by the dual statement. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_05428 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An order-theoretic circuit syntax and characterisation of the concept lattice van der Lugt, Tein Quantum Physics Logic in Computer Science Combinatorics We take an order-theoretic approach to circuit (string diagram) syntax, treating a circuit as a partial order with additional input-output structure. We define morphisms between circuits and prove a factorisation theorem showing that these can, in the finite case, be regarded as formalising a notion of syntactical circuit rewrites, with quotient maps in particular corresponding to gate composition. We then consider the connectivity of a circuit, expressed as a binary relation between its inputs and outputs, and characterise the concept lattice from formal concept analysis as the unique smallest circuit that admits morphisms from all other circuits with the same connectivity. This has significance for quantum causality, particularly to the study of causal decompositions of unitary transformations. We close by constructing the circuit characterised by the dual statement. |
| title | An order-theoretic circuit syntax and characterisation of the concept lattice |
| topic | Quantum Physics Logic in Computer Science Combinatorics |
| url | https://arxiv.org/abs/2507.05428 |