= = = f f BOB BOB meaning vectors of words not does like = - - PowerPoint PPT Presentation

f f bob bob meaning vectors of words not does like not
SMART_READER_LITE
LIVE PREVIEW

= = = f f BOB BOB meaning vectors of words not does like = - - PowerPoint PPT Presentation

The logic of quantum mechanics - take II arXiv:1204.3458 ALICE ALICE f f f f = = = f f BOB BOB meaning vectors of words not does like = not like Alice Bob Alice Bob not pregroup grammar genesis genesis


slide-1
SLIDE 1

The logic of quantum mechanics - take II

arXiv:1204.3458

=

f f

=

f f f

ALICE BOB

=

ALICE BOB

f

=

not

like

Bob Alice does Alice

not

like

not Bob

meaning vectors of words pregroup grammar
slide-2
SLIDE 2

— genesis —

slide-3
SLIDE 3

— genesis — [von Neumann 1932] Formalized quantum mechanics in “Mathematische Grundlagen der Quantenmechanik”

slide-4
SLIDE 4

— genesis — [von Neumann 1932] Formalized quantum mechanics in “Mathematische Grundlagen der Quantenmechanik” [von Neumann to Birkhoff 1935] “I would like to make a confession which may seem immoral: I do not believe absolutely in Hilbert space no more.” (sic)

slide-5
SLIDE 5

— genesis — [von Neumann 1932] Formalized quantum mechanics in “Mathematische Grundlagen der Quantenmechanik” [von Neumann to Birkhoff 1935] “I would like to make a confession which may seem immoral: I do not believe absolutely in Hilbert space no more.” (sic) [Birkhoff and von Neumann 1936] The Logic of Quantum Mechanics in Annals of Mathematics.

slide-6
SLIDE 6

— genesis — [von Neumann 1932] Formalized quantum mechanics in “Mathematische Grundlagen der Quantenmechanik” [von Neumann to Birkhoff 1935] “I would like to make a confession which may seem immoral: I do not believe absolutely in Hilbert space no more.” (sic) [Birkhoff and von Neumann 1936] The Logic of Quantum Mechanics in Annals of Mathematics. [1936 – 2000] many followed them, ... and FAILED.

slide-7
SLIDE 7

— genesis — [von Neumann 1932] Formalized quantum mechanics in “Mathematische Grundlagen der Quantenmechanik” [von Neumann to Birkhoff 1935] “I would like to make a confession which may seem immoral: I do not believe absolutely in Hilbert space no more.” (sic) [Birkhoff and von Neumann 1936] The Logic of Quantum Mechanics in Annals of Mathematics. [1936 – 2000] many followed them, ... and FAILED.

slide-8
SLIDE 8

— the mathematics of it —

slide-9
SLIDE 9

— the mathematics of it — Hilbert space stuff: continuum, field structure of com- plex numbers, vector space over it, inner-product, etc.

slide-10
SLIDE 10

— the mathematics of it — Hilbert space stuff: continuum, field structure of com- plex numbers, vector space over it, inner-product, etc. WHY?

slide-11
SLIDE 11

— the mathematics of it — Hilbert space stuff: continuum, field structure of com- plex numbers, vector space over it, inner-product, etc. WHY? von Neumann: only used it since it was ‘available’.

slide-12
SLIDE 12

— the physics of it —

slide-13
SLIDE 13

— the physics of it — von Neumann crafted Birkhoff-von Neumann Quan- tum ‘Logic’ to capture the concept of superposition.

slide-14
SLIDE 14

— the physics of it — von Neumann crafted Birkhoff-von Neumann Quan- tum ‘Logic’ to capture the concept of superposition. Schr¨

  • dinger (1935): the stuff which is the true soul of

quantum theory is how quantum systems compose.

slide-15
SLIDE 15

— the physics of it — von Neumann crafted Birkhoff-von Neumann Quan- tum ‘Logic’ to capture the concept of superposition. Schr¨

  • dinger (1935): the stuff which is the true soul of

quantum theory is how quantum systems compose. Quantum Computer Scientists: Schr¨

  • dinger is right!
slide-16
SLIDE 16

— the game plan —

slide-17
SLIDE 17

— the game plan — Task 0. Solve: tensor product structure the other stuff = ???

slide-18
SLIDE 18

— the game plan — Task 0. Solve: tensor product structure the other stuff = ??? i.e. axiomatize “⊗” without reference to spaces.

slide-19
SLIDE 19

— the game plan — Task 0. Solve: tensor product structure the other stuff = ??? i.e. axiomatize “⊗” without reference to spaces. Task 1. Investigate which assumptions (i.e. which struc- ture) on ⊗ is needed to deduce physical phenomena.

slide-20
SLIDE 20

— the game plan — Task 0. Solve: tensor product structure the other stuff = ??? i.e. axiomatize “⊗” without reference to spaces. Task 1. Investigate which assumptions (i.e. which struc- ture) on ⊗ is needed to deduce physical phenomena. Task 2. Investigate wether such an “interaction struc- ture” appear elsewhere in “our classical reality”.

slide-21
SLIDE 21

Outcome 1a: “Sheer ratio of results to assumptions”

slide-22
SLIDE 22

Outcome 1a: “Sheer ratio of results to assumptions” confirms that we are probing something very essential.

Hans Halvorson (2010) Editorial to: Deep Beauty: Understanding the Quan- tum World through Mathematical Innovation, Cambridge University Press.

slide-23
SLIDE 23

Outcome 1a: “Sheer ratio of results to assumptions” confirms that we are probing something very essential.

Hans Halvorson (2010) Editorial to: Deep Beauty: Understanding the Quan- tum World through Mathematical Innovation, Cambridge University Press.

slide-24
SLIDE 24

Outcome 1a: “Sheer ratio of results to assumptions” confirms that we are probing something very essential. Outcome 1b: Exposing this structure has already helped to solve open problems elsewhere.

E.g.: Ross Duncan & Simon Perdrix (2010) Rewriting measurement-based quantum computations with generalised flow. ICALP’10.

slide-25
SLIDE 25

Outcome 1a: “Sheer ratio of results to assumptions” confirms that we are probing something very essential. Outcome 1b: Exposing this structure has already helped to solve open problems elsewhere. Outcome 1c: Framework is a simple intuitive (but rigorous) diagrammatic language, meanwhile adopted by others e.g. Lucien Hardy in arXiv:1005.5164: “... we join the quantum picturalism revolution [1]”

[1] BC (2010) Quantum picturalism. Contemporary Physics 51, 59–83.

slide-26
SLIDE 26

Outcome 1a: “Sheer ratio of results to assumptions” confirms that we are probing something very essential. Outcome 1b: Exposing this structure has already helped to solve open problems elsewhere. Outcome 1c: Framework is a simple intuitive (but rigorous) diagrammatic language, meanwhile adopted by others e.g. Lucien Hardy in arXiv:1005.5164: “... we join the quantum picturalism revolution [1]”

[1] BC (2010) Quantum picturalism. Contemporary Physics 51, 59–83.

slide-27
SLIDE 27

Outcome 2a:

Behaviors of matter (Abramsky-C; LiCS’04, quant-ph/0402130) :

=

f f

=

f f f

ALICE BOB

=

ALICE BOB

f

Meaning in language (Clark-C-Sadrzadeh; Linguistic Analysis, arXiv:1003.4394) :

=

not

like

Bob Alice does Alice not

like

not Bob meaning vectors of words pregroup grammar

Knowledge updating (C-Spekkens; Synthese, arXiv:1102.2368) :

conditional independence

=

P(C|AB)

A A

=

A

=

A B A B

=

B (BA) 1

  • A

C 1

  • C 1
  • C
P(AB|C) P(A|C) P(B|C) P(C|A) P(C|B) P(C|B) P(C|A)
slide-28
SLIDE 28

— the logic of it —

slide-29
SLIDE 29

— the logic of it — WHAT IS “LOGIC”?

slide-30
SLIDE 30

— the logic of it — WHAT IS “LOGIC”? Pragmatic option 1: Logic is structure in language.

slide-31
SLIDE 31

— the logic of it — WHAT IS “LOGIC”? Pragmatic option 1: Logic is structure in language.

“Alice and Bob ate everything or nothing, then got sick.” connectives (∧, ∨) : and, or negation (¬) : not (cf. nothing = not something) entailment (⇒) : then quantifiers (∀, ∃) : every(thing), some(thing) constants (a, b) : thing variable (x) : Alice, Bob predicates (P(x), R(x, y)) : eating, getting sick truth valuation (0, 1) : true, false

(∀z : Eat(a, z) ∧ Eat(b, z)) ∧ ¬(∃z : Eat(a, z) ∧ Eat(b, z)) ⇒ Sick(a), Sick(b)

slide-32
SLIDE 32

— the logic of it — WHAT IS “LOGIC”? Pragmatic option 1: Logic is structure in language. Pragmatic option 2: Logic lets machines reason.

slide-33
SLIDE 33

— the logic of it — WHAT IS “LOGIC”? Pragmatic option 1: Logic is structure in language. Pragmatic option 2: Logic lets machines reason.

  • Cf. the soft incarnation of AI in robotics, automated

theorem proving, automated theory exploration, ...

slide-34
SLIDE 34

— the logic of it — WHAT IS “LOGIC”? Pragmatic option 1: Logic is structure in language. Pragmatic option 2: Logic lets machines reason. Our framework appeals to both senses of logic, and moreover induces important new applications:

slide-35
SLIDE 35

— the logic of it — WHAT IS “LOGIC”? Pragmatic option 1: Logic is structure in language. Pragmatic option 2: Logic lets machines reason. Our framework appeals to both senses of logic, and moreover induces important new applications: From truth to meaning in natural language processing:

— (December 2010)

slide-36
SLIDE 36

— the logic of it — WHAT IS “LOGIC”? Pragmatic option 1: Logic is structure in language. Pragmatic option 2: Logic lets machines reason. Our framework appeals to both senses of logic, and moreover induces important new applications: From truth to meaning in natural language processing:

— (December 2010)

Automated theorem generation for graphical theories:

http://sites.google.com/site/quantomatic/

slide-37
SLIDE 37

MINIMAL QUANTUM PROCESS LANGUAGE

Samson Abramsky & BC (2004) A categorical semantics for quantum proto-

  • cols. In: IEEE-LiCS’04. quant-ph/0402130

BC (2005) Kindergarten quantum mechanics. quant-ph/0510032

slide-38
SLIDE 38

— wire and box language —

f

  • utput wire(s)
  • utput wire(s)

input wire(s) input wire(s)

Box Box = :

Interpretation: wire := system ; box := process

  • ne system:

n subsystems: no system:

  • 1

. . .

  • n
slide-39
SLIDE 39

— wire and box games — sequential or causal or connected composition:

g ◦ f ≡

g f

parallel or acausal or disconnected composition:

f ⊗ g ≡

f f g

slide-40
SLIDE 40

— merely a new notation? —

(g ◦ f) ⊗ (k ◦ h) = (g ⊗ k) ◦ (f ⊗ h)

=

f h g k f h g k

slide-41
SLIDE 41

— quantitative metric —

f : A → B

f A B

slide-42
SLIDE 42

— quantitative metric —

f†: B → A

f B A

slide-43
SLIDE 43

— asserting (pure) entanglement — quantum classical =

= =

slide-44
SLIDE 44

— asserting (pure) entanglement — quantum classical =

= =

⇒ introduce ‘parallel wire’ between systems: subject to: only topology matters!

slide-45
SLIDE 45

— quantum-like — E.g.

=

slide-46
SLIDE 46

Transpose:

f f

=

Conjugate:

f f

=

slide-47
SLIDE 47

classical data flow? f

=

f f f

slide-48
SLIDE 48

classical data flow? f

=

f

slide-49
SLIDE 49

classical data flow? f

=

f

slide-50
SLIDE 50

classical data flow? f

ALICE BOB

=

ALICE BOB

f

⇒ quantum teleportation

slide-51
SLIDE 51

— symbolically: dagger compact categories —

  • Thm. [Kelly-Laplaza ’80; Selinger ’05] An equa-

tional statement between expressions in dagger com- pact categorical language holds if and only if it is derivable in the graphical notation via homotopy.

  • Thm. [Hasegawa-Hofmann-Plotkin; Selinger ’08]

An equational statement between expressions in dag- ger compact categorical language holds if and only if it is derivable in the dagger compact category of fi- nite dimensional Hilbert spaces, linear maps, tensor product and adjoints.

slide-52
SLIDE 52

— symbolically: dagger compact categories — In words: Any equation involving:

  • states, operations, effects
  • unitarity, adjoints (e.g. self-adjoint), projections
  • Bell-states/effects, transpose, conjugation
  • inner-product, trace, Hilbert-Schmidt norm
  • positivity, completely positive maps, ...

holds in quantum theory if and only if it can be derived in the graphical language via homotopy.

slide-53
SLIDE 53

— kindergarten quantum mechanics: the experiment — Contest in problem solving between:

  • Children using quantum picturalism
  • Physics teachers using ordinary QM

The children will win!

[1] BC (2010) Quantum picturalism. Contemporary Physics 51, 59–83.

slide-54
SLIDE 54

A SLIGHTLY DIFFERENT LANGUAGE FOR NATURAL LANGUAGE MEANING

BC, Mehrnoosh Sadrzadeh & Stephen Clark (2010) Mathematical foundations for a compositional distributional model of meaning. arXiv:1003.4394

slide-55
SLIDE 55

— the from-words-to-a-sentence process —

slide-56
SLIDE 56

— the from-words-to-a-sentence process — Consider meanings of words, e.g. as vectors (cf. Google):

word 1 word 2 word n

...

slide-57
SLIDE 57

— the from-words-to-a-sentence process — What is the meaning the sentence made up of these?

word 1 word 2 word n

...

slide-58
SLIDE 58

— the from-words-to-a-sentence process — I.e. how do we/machines produce meanings of sentences?

word 1 word 2 word n

...

?

slide-59
SLIDE 59

— the from-words-to-a-sentence process — I.e. how do we/machines produce meanings of sentences?

word 1 word 2 word n

...

grammar

Gerald Gazdar (1996) Paradigm merger in natural language processing. In: Computing tomorrow: future research directions in computer science, eds.,

  • I. Wand and R. Milner, Cambridge University Press.
slide-60
SLIDE 60

— the from-words-to-a-sentence process — Information flow within a verb:

verb

  • bject
  • bject

subject subject

slide-61
SLIDE 61

— the from-words-to-a-sentence process — Information flow within a verb:

verb

  • bject
  • bject

subject subject

Again we have:

=

slide-62
SLIDE 62

— grammar as pregroups – Lambek ’99 — A Al A A A A

l r

A Ar

=

A A A A

=

A A A A

r r

=

A A A A

=

A A A A

l l l l r r

slide-63
SLIDE 63

— grammar as pregroups – Lambek ’99 — For noun type n, verb type is −1(n) · s · (n)−1, so:

slide-64
SLIDE 64

— grammar as pregroups – Lambek ’99 — For noun type n, verb type is −1(n) · s · (n)−1, so:

n · −1(n) · s · (n)−1 · n = s

slide-65
SLIDE 65

— grammar as pregroups – Lambek ’99 — For noun type n, verb type is −1(n) · s · (n)−1, so:

n · −1(n) · s · (n)−1 · n = s

Diagrammatic typing:

n n s (n) (n)

  • 1
  • 1
slide-66
SLIDE 66

— grammar as pregroups – Lambek ’99 — For noun type n, verb type is −1(n) · s · (n)−1, so:

n · −1(n) · s · (n)−1 · n = s

Diagrammatic meaning:

verb n n

flow flow flow flow

slide-67
SLIDE 67

— − − − → Alice ⊗ − − → does ⊗ − → not ⊗ − − → like ⊗ − − → Bob —

slide-68
SLIDE 68

— − − − → Alice ⊗ − − → does ⊗ − → not ⊗ − − → like ⊗ − − → Bob —

Alice

not

like

Bob

meaning vectors of words

not

grammar

does

slide-69
SLIDE 69

— − − − → Alice ⊗ − − → does ⊗ − → not ⊗ − − → like ⊗ − − → Bob —

Alice

like

Bob

meaning vectors of words grammar not

slide-70
SLIDE 70

— − − − → Alice ⊗ − − → does ⊗ − → not ⊗ − − → like ⊗ − − → Bob —

Alice

like

Bob

meaning vectors of words grammar not

slide-71
SLIDE 71

— − − − → Alice ⊗ − − → does ⊗ − → not ⊗ − − → like ⊗ − − → Bob —

Alice

like

Bob

meaning vectors of words grammar not

=

not

like

Bob Alice

slide-72
SLIDE 72

— − − − → Alice ⊗ − − → does ⊗ − → not ⊗ − − → like ⊗ − − → Bob —

Alice

like

Bob

meaning vectors of words grammar not

=

not

like

Bob Alice

=

not

like

Bob Alice

Using:

=

like like

=

like like

slide-73
SLIDE 73

— − − − → Alice ⊗ − − → does ⊗ − → not ⊗ − − → like ⊗ − − → Bob —

Alice

like

Bob

meaning vectors of words grammar not

=

not

like

Bob Alice

=

not

like

Bob Alice

= g

  • f(

x, y)

slide-74
SLIDE 74

— experiment: word disambiguation — E.g. what is “saw”’ in: “Alice saw Bob with a saw”.

Edward Grefenstette & Mehrnoosh Sadrzadeh (2011) Experimental support for a categorical compositional distributional model of meaning. Accepted for: Empirical Methods in Natural Language Processing (EMNLP’11).

slide-75
SLIDE 75

WHERE DOES THE ANALOGY STOP?

slide-76
SLIDE 76

— Frobenius algebras — quantum.1: classical data/observables ‘spiders’ =   

m

  • ....

....

  • n

   such that, for k > 0:

m+m′−k

  • ....

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

  • n+n′−k

= .... ....

BC & Dusko Pavlovic (2007) Quantum measurement without sums. In: Math- ematics of Quantum Computing and Technology. quant-ph/0608035 BC, Dusko Pavlovic & Jamie Vicary (2008) A new description of orthogonal

  • bases. Mathematical Structures in Computer Science. 0810.0812
slide-77
SLIDE 77

— Frobenius algebras — quantum.2: complementary quantum observables

BC & Ross Duncan (2008) Interacting quantum observables. ICALP’08 & New Journal of Physics 13, 043016. arXiv:0906.4725 Miriam Backens (2012) The ZX-calculus is complete for stabilizer quantum

  • mechanics. In: Proc. Quantum Physic and Logic IX.
slide-78
SLIDE 78

— Frobenius algebras — quantum.3: entangelement classes GHZ = |000 + |111 W = |001 + |010 + |100 = ‘special’ CFAs ‘anti-special’ CFAs =

= =

= × + ⇒ distributivity

BC & Aleks Kissinger (2010) The compositional structure of multipartite quan- tum entanglement. ICALP’10. arXiv:1002.2540

slide-79
SLIDE 79

— Frobenius algebras — Language-meaning: (the) man who Alice hates

Stephen Clark, BC and Mehrnoosh Sadrzadeh (2013) The Frobenius Anatomy

  • f Relative Pronouns. MOL’13.