Skip to content

Upgrade graph module for paper visualizations - #58

Merged
caldwellb merged 46 commits into
feature-graph-modulefrom
main
Oct 13, 2025
Merged

caldwellb merged 46 commits into
feature-graph-modulefrom
main

Conversation

@caldwellb

Copy link
Copy Markdown
Member

No description provided.

wjbs and others added 30 commits July 20, 2024 12:22
…ular:

- Defines `ZXperm n`, a predicate defining the subset of `ZX n n` which are
  permutation-like, i.e. stacks and compositions of `Empty`, `Wire`, and `Swap`.
- Defines `perm_of_zx`, which gives the underlying permutation of a ZXperm, and
  shows that this determines the semantics of the diagram, so that showing the
  equivalence of `ZXperm`s reduces to showing the equality of their underlying
  permutations. This task in invariably far simpler (in particular, tractable),
  and we also provide significant automation for completing this task.
- Defines `zx_of_perm`, which realizes an arbitrary permutation as a ZX diagram.
  We prove this is suitably inverse to `perm_of_zx`.
- Defines `zx_comm n m : ZX (n + m) (m + n)` and proves its naturality, i.e.
  `(zx0 ↕ zx1) ⟷ zx_comm m q ∝ zx_comm n p ⟷ (zx1 ↕ zx0)`
  (see `zx_comm_commutes_r` in `ZXpermFacts.v`). This gives pulling arbitrary
  diagrams through Swap. Similarly generalize `a_swap` to show arbitrary
  diagrams can be pulled through it.
…, of the form [name]_nat_(top|mid|bot)_(r|l)[_1], to ZXpermFacts
Remove admitteds from main
@caldwellb
caldwellb merged commit 4c71746 into feature-graph-module Oct 13, 2025
7 of 12 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants