Simplification by Rotation for Frobenius/Hopf algebras Aleks - - PowerPoint PPT Presentation

simplification by rotation for frobenius hopf algebras
SMART_READER_LITE
LIVE PREVIEW

Simplification by Rotation for Frobenius/Hopf algebras Aleks - - PowerPoint PPT Presentation

Simplification by Rotation for Frobenius/Hopf algebras Aleks Kissinger September 9, 2017 The goal Simplification for special commutative Frobenius algebras: = = = = = = = = = = = The goal Simplification for commutative Hopf


slide-1
SLIDE 1

Simplification by Rotation for Frobenius/Hopf algebras

Aleks Kissinger September 9, 2017

slide-2
SLIDE 2

The goal

Simplification for special commutative Frobenius algebras: = = = = = = = = = = =

slide-3
SLIDE 3

The goal

Simplification for commutative Hopf algebras: = = = = = = = = = = = =

slide-4
SLIDE 4

The goal

Simplification for the system IB:

Frobenius Frobenius Hopf Hopf

slide-5
SLIDE 5

The goal

Simplification for the system IB:

Frobenius Frobenius Hopf Hopf

:= = := =

slide-6
SLIDE 6

The goal

Simplification for the system IB:

Frobenius Frobenius Hopf Hopf

:= = := = (a.k.a. the phase-free fragment of the ZX-calculus)

slide-7
SLIDE 7

The (first) problem

  • (Biased) AC rules are not terminating:

= =

slide-8
SLIDE 8

The (first) problem

  • (Biased) AC rules are not terminating:

= =

  • Solution: use unbiased simplifications:

⇒ ⇐

slide-9
SLIDE 9

The (first) problem

  • (Biased) AC rules are not terminating:

= =

  • Solution: use unbiased simplifications:

⇒ ⇐

  • =

⇒ need infinitely many rules, or rule schemas

slide-10
SLIDE 10

!-boxes: simple diagram schemas

⇒ ... = · · · , , , ,

slide-11
SLIDE 11

!-boxes: simple diagram rule schemas

... = ... ... ⇒ =

slide-12
SLIDE 12

!-boxes

=

slide-13
SLIDE 13

!-boxes

= = ⇒ =

slide-14
SLIDE 14

Unbiased Frobenius algebras

... = ... ... ... ... ... ⇒ =

slide-15
SLIDE 15

Unbiased bialgebras

... ... = ... ... ... ... ... ... ⇒ =

slide-16
SLIDE 16

To quanto!

slide-17
SLIDE 17

Interacting bialgebras are linear relations IB ∼

= LinRelZ2

slide-18
SLIDE 18

Interacting bialgebras are linear relations IB ∼

= LinRelZ2

  • LinRelZ2 has:
  • objects: N
  • morphisms: R : m → n is a subspace R ⊆ Zm

2 × Zn 2

  • tensor is ⊕, composition is relation-style
slide-19
SLIDE 19

Interacting bialgebras are linear relations IB ∼

= LinRelZ2

  • LinRelZ2 has:
  • objects: N
  • morphisms: R : m → n is a subspace R ⊆ Zm

2 × Zn 2

  • tensor is ⊕, composition is relation-style
  • Pseudo-normal forms can be interpreted as:
  • white spiders := place-holders
  • grey spiders := vectors spanning the subspace
slide-20
SLIDE 20

Lets see how this works...

  • Subspaces can be represented as:

     1 1 1       ,       1 1      

  • The 1’s indicate where edges appear for each vector.
slide-21
SLIDE 21

Lets see how this works...

  • Subspaces can be represented as:

     1 1 1       ,       1 1      

  • The 1’s indicate where edges appear for each vector.
slide-22
SLIDE 22

Lets see how this works...

  • Subspaces can be represented as:

     1 1 1       ,       1 1      

  • The 1’s indicate where edges appear for each vector.
slide-23
SLIDE 23

Lets see how this works...

  • Not unique! We can always add or remove a vector that is the sum of

two other spanning vectors and get the same space: ↔

     1 1 1       ,       1 1       ,       1 1 1      

slide-24
SLIDE 24

Addition is a !-box rule

  • ‘Addition’ operation can be written as a !-box rule:

=

slide-25
SLIDE 25

Addition is a !-box rule

  • ‘Addition’ operation can be written as a !-box rule:

=

  • We can also apply this forward then backward to get a ‘rotation’ rule:

=

slide-26
SLIDE 26

Addition is a !-box rule

  • ‘Addition’ operation can be written as a !-box rule:

=

  • We can also apply this forward then backward to get a ‘rotation’ rule:

=

  • Note this rule decreases the arity of the white dot on the left by 1.
slide-27
SLIDE 27

Thanks!

  • Joint work with Lucas Dixon, Alex Merry, Ross Duncan, Vladimir

Zamdzhiev, David Quick, Hector Miller-Bakewell and others

  • See: quantomatic.github.io