Picturing Quantum Entanglement ...in MBQC Aleks Kissinger March 7, - - PowerPoint PPT Presentation

picturing quantum entanglement in mbqc
SMART_READER_LITE
LIVE PREVIEW

Picturing Quantum Entanglement ...in MBQC Aleks Kissinger March 7, - - PowerPoint PPT Presentation

ZX-calculus Hopf algebras and Entanglement Picturing Quantum Entanglement ...in MBQC Aleks Kissinger March 7, 2015 Q UANTUM G ROUP ZX-calculus Hopf algebras and Entanglement ZX-calculus The ZX-calculus is a formalism that studies


slide-1
SLIDE 1

ZX-calculus Hopf algebras and Entanglement

Picturing Quantum Entanglement ...in MBQC

Aleks Kissinger March 7, 2015

QUANTUM GROUP

slide-2
SLIDE 2

ZX-calculus Hopf algebras and Entanglement

ZX-calculus

  • The ZX-calculus is a formalism that studies diagrams built from three

kinds of generators:

α

... ... := |0...00...0| + eiα |1...11...1|

α

... ... := |+...++...+| + eiα |−...−−...−| := |+0| + |−1|

slide-3
SLIDE 3

ZX-calculus Hopf algebras and Entanglement

ZX-calculus in QC

  • Admits an encoding of circuits:

U Z

  • α

γ β

slide-4
SLIDE 4

ZX-calculus Hopf algebras and Entanglement

ZX-calculus in QC

  • Admits an encoding of circuits:

U Z

  • α

γ β

  • ...and MBQC:

... ... ... ... ... ... ... ... ...

  • ...

... ... ... ... ... ... ... ...

slide-5
SLIDE 5

ZX-calculus Hopf algebras and Entanglement

ZX-calculus in QC

  • Admits an encoding of circuits:

U Z

  • α

γ β

  • ...and MBQC:

... ... ... ... ... ... ... ... ...

  • ...

... ... ... ... ... ... ... ...

  • ...and a means of translating between the two.
slide-6
SLIDE 6

ZX-calculus Hopf algebras and Entanglement

Algebraic structure

  • All of its power comes from its underlying algebraic structures:

frobenius hopf hopf frobenius

  • ...which have been studied extensively in category theory and

representation theory.

slide-7
SLIDE 7

ZX-calculus Hopf algebras and Entanglement

Algebraic structure

  • All of its power comes from its underlying algebraic structures:

frobenius hopf hopf frobenius

  • ...which have been studied extensively in category theory and

representation theory.

slide-8
SLIDE 8

ZX-calculus Hopf algebras and Entanglement

Hopf algebras and Z2-matrices

  • (Commutative, self-inverse) Hopf algebra expressions are totally

characterised by their Z2-path matrices: ↔  1 0 1

1 0 1

  ↔

slide-9
SLIDE 9

ZX-calculus Hopf algebras and Entanglement

Hopf algebras and Z2-matrices

  • (Commutative, self-inverse) Hopf algebra expressions are totally

characterised by their Z2-path matrices: ↔  1 0 1

1 0 1

  ↔

slide-10
SLIDE 10

ZX-calculus Hopf algebras and Entanglement

Hopf algebras and Z2-matrices

  • (Commutative, self-inverse) Hopf algebra expressions are totally

characterised by their Z2-path matrices: ↔  1 0 1

1 0 1

  ↔

slide-11
SLIDE 11

ZX-calculus Hopf algebras and Entanglement

Hopf algebras and Z2-matrices

  • (Commutative, self-inverse) Hopf algebra expressions are totally

characterised by their Z2-path matrices: ↔  1 0 1

1 0 1

  ↔

slide-12
SLIDE 12

ZX-calculus Hopf algebras and Entanglement

Hopf algebras and Z2-matrices

  • (Commutative, self-inverse) Hopf algebra expressions are totally

characterised by their Z2-path matrices: ↔  1 0 1

1 0 1

  ↔

  • In category-theoretic terms, this means Mat(Z2) is a PROP for

commutative, self-inverse Hopf algebras.

slide-13
SLIDE 13

ZX-calculus Hopf algebras and Entanglement

Measuring Entanglement

  • Proposition: The amount of entanglement across any bipartition of a

graph state is equal to its cut-rank (i.e. the rank of the associated adjacency matrix over Z2)1, e.g.

  • rank

    1 1 1 1 1     = 2 ebits

1Hein, Eisart, Briegel. arXiv:quant-ph/0602096, Prop. 11

slide-14
SLIDE 14

ZX-calculus Hopf algebras and Entanglement

slide-15
SLIDE 15

ZX-calculus Hopf algebras and Entanglement

slide-16
SLIDE 16

ZX-calculus Hopf algebras and Entanglement

slide-17
SLIDE 17

ZX-calculus Hopf algebras and Entanglement

slide-18
SLIDE 18

ZX-calculus Hopf algebras and Entanglement

unitary unitary

slide-19
SLIDE 19

ZX-calculus Hopf algebras and Entanglement

unitary unitary

slide-20
SLIDE 20

ZX-calculus Hopf algebras and Entanglement

unitary unitary

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

slide-21
SLIDE 21

ZX-calculus Hopf algebras and Entanglement

unitary unitary

    1 1 1 1 1     =     1 1 1 1     1 1 1

slide-22
SLIDE 22

ZX-calculus Hopf algebras and Entanglement

Measuring Entanglement

  • When the cut-rank is k, this always yields a factorisation by

isometries through k wires

slide-23
SLIDE 23

ZX-calculus Hopf algebras and Entanglement

Measuring Entanglement

  • When the cut-rank is k, this always yields a factorisation by

isometries through k wires

  • Writing as a bipartite state:

...

k wires

...

  • U
  • V

...

∼ =

k Bell pairs

  • U

... ... ...

  • V
slide-24
SLIDE 24

ZX-calculus Hopf algebras and Entanglement

Measuring Entanglement

  • When the cut-rank is k, this always yields a factorisation by

isometries through k wires

  • Writing as a bipartite state:

...

k wires

...

  • U
  • V

...

∼ =

k Bell pairs

  • U

... ... ...

  • V
  • Computing the entropy of entanglement:

S      

  • U

... ... ...

  • V

     

slide-25
SLIDE 25

ZX-calculus Hopf algebras and Entanglement

Measuring Entanglement

  • When the cut-rank is k, this always yields a factorisation by

isometries through k wires

  • Writing as a bipartite state:

...

k wires

...

  • U
  • V

...

∼ =

k Bell pairs

  • U

... ... ...

  • V
  • Computing the entropy of entanglement:

S      

  • U

... ...      

slide-26
SLIDE 26

ZX-calculus Hopf algebras and Entanglement

Measuring Entanglement

  • When the cut-rank is k, this always yields a factorisation by

isometries through k wires

  • Writing as a bipartite state:

...

k wires

...

  • U
  • V

...

∼ =

k Bell pairs

  • U

... ... ...

  • V
  • Computing the entropy of entanglement:

S      

  • U

... ...      

slide-27
SLIDE 27

ZX-calculus Hopf algebras and Entanglement

Measuring Entanglement

  • When the cut-rank is k, this always yields a factorisation by

isometries through k wires

  • Writing as a bipartite state:

...

k wires

...

  • U
  • V

...

∼ =

k Bell pairs

  • U

... ... ...

  • V
  • Computing the entropy of entanglement:

S       ...      

slide-28
SLIDE 28

ZX-calculus Hopf algebras and Entanglement

Measuring Entanglement

  • When the cut-rank is k, this always yields a factorisation by

isometries through k wires

  • Writing as a bipartite state:

...

k wires

...

  • U
  • V

...

∼ =

k Bell pairs

  • U

... ... ...

  • V
  • Computing the entropy of entanglement:

k · S

  • = k