Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.07914 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916162777907200 |
|---|---|
| author | Booth, Robert I. Carette, Titouan Comfort, Cole |
| author_facet | Booth, Robert I. Carette, Titouan Comfort, Cole |
| contents | We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field. This provides a unified family of graphical languages for both affinely constrained classical mechanical systems, as well as odd-prime-dimensional stabiliser quantum circuits. To this end, we present affine Lagrangian relations by a particular class of undirected coloured graphs. In order to reason about composite systems, we introduce a powerful scalable notation where the vertices of these graphs are themselves coloured by graphs. In the setting of stabiliser quantum mechanics, this scalable notation gives an extremely concise description of graph states, which can be composed via ``phased spider fusion.'' Likewise, in the classical mechanical setting of electrical circuits, we show that impedance matrices for reciprocal networks are presented in essentially the same way. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_07914 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Graphical Symplectic Algebra Booth, Robert I. Carette, Titouan Comfort, Cole Logic in Computer Science Category Theory Symplectic Geometry Quantum Physics We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field. This provides a unified family of graphical languages for both affinely constrained classical mechanical systems, as well as odd-prime-dimensional stabiliser quantum circuits. To this end, we present affine Lagrangian relations by a particular class of undirected coloured graphs. In order to reason about composite systems, we introduce a powerful scalable notation where the vertices of these graphs are themselves coloured by graphs. In the setting of stabiliser quantum mechanics, this scalable notation gives an extremely concise description of graph states, which can be composed via ``phased spider fusion.'' Likewise, in the classical mechanical setting of electrical circuits, we show that impedance matrices for reciprocal networks are presented in essentially the same way. |
| title | Graphical Symplectic Algebra |
| topic | Logic in Computer Science Category Theory Symplectic Geometry Quantum Physics |
| url | https://arxiv.org/abs/2401.07914 |