The Logic of Quantum Mechanics - take II - Perimeter Institute

More documents

Recommendations

Info

— symbolically: dagger compact categories — Thm. [Kelly-Laplaza ’80; Selinger ’05] An equational statement between expressions in dagger compact categorical language holds if and only if it is derivable in the graphical notation via homotopy.
— symbolically: dagger compact categories — Thm. [Kelly-Laplaza ’80; Selinger ’05] An equational statement between expressions in dagger compact categorical language holds if and only if it is derivable in the graphical notation via homotopy. there are many models, i.e. concrete dagger compact categories, e.g. linear maps, relations, ...
Page 1 and 2:
The Logic of Quantum Mechanics - ta
Page 3 and 4:
— genesis — [von Neumann 1932]
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
— the mathematics of it — Hilbe
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
— the physics of it —
Page 17 and 18:
— the physics of it — von Neuma
Page 19 and 20:
— the physics of it — von Neuma
Page 21 and 22:
— the game plan — Task 0. Solve
Page 23 and 24:
— the game plan — Task 0. Solve
Page 25 and 26:
Outcome 1a: “Sheer ratio of resul
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Outcome 2a:
Page 33 and 34: — the logic of it —
Page 35 and 36: — the logic of it — WHAT IS “
Page 45 and 46: — the data of tensor logic — Bo
Page 47 and 48: — the data of tensor logic — Bo
Page 49 and 50: — the connectives of tensor logic
Page 51 and 52: — merely a new notation? —
Page 53 and 54: — merely a new notation? — (g
Page 55 and 56: — merely a new notation? — (g
Page 57 and 58: — topological connectedness as a
Page 59 and 60: — topological connectedness as a
Page 61 and 62: A MINIMAL LANGUAGE FOR QUANTUM REAS
Page 63 and 64: — graphical notation for states a
Page 73 and 74: — adjoint — f † : B → A A f
Page 75 and 76: = = — asserting (pure) entangleme
Page 77 and 78: — quantum-like — =
Page 79 and 80: classical data flow? f f f f =
Page 81 and 82: classical data flow? f f =
Page 83: — symbolically: dagger compact ca
Page 87 and 88: — symbolically: dagger compact ca
Page 89 and 90: — the from-words-to-a-sentence pr
Page 91 and 92: — the from-words-to-a-sentence pr
Page 93 and 94: = — the from-words-to-a-sentence
Page 95 and 96: — grammar as pregroups - Lambek
Page 97 and 98: — from gammer to meaning — For
Page 99 and 100: — −−−→ Alice ⊗ −−
Page 101 and 102: — −−−→ Alice ⊗ −−
Page 103 and 104: — experiment: word disambiguation
Page 105 and 106: — analogy: “non-local” info-f
Page 107 and 108: THE EXTENDED LANGUAGE: BASES AND CO
Page 109 and 110: — commutative Frobenius algebras
Page 113 and 114: commutative monoid cocommutative co
Page 115 and 116: commutative monoid cocommutative co
Page 119 and 120: — bases in tensor logic — The n
Page 121 and 122: such that, for k > 0: — spiders
Page 123 and 124: such that, for k > 0: — spiders
Page 125 and 126: — complementary bases —
Page 127 and 128: — quantum gates — Z-spin: δ Z
Page 129 and 130: — quantum gates — ⎛ ⎜ ⎝ 1
Page 131 and 132: — quantum gates —
Page 133 and 134: — quantum gates —
Page 135 and 136:
— classical communication and con
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
qubit 1 the leftmost, and qubit 4 i
Page 143 and 144:
— automated theory exploration
Page 145 and 146:
Defn. Special CFA (SCFA): =
Page 147 and 148:
= = Defn. Special CFA (SCFA): Lem.
Page 149 and 150:
— C(F)As ←→ tripartite states
Page 151 and 152:
= = Theorem. If a CFA on C 2 is spe
Page 153 and 154:
— W algebra — ( 1 0 0 0 ) ( 1 0
Page 155 and 156:
— W “exploding spiders” — D
Page 157 and 158:
— GHZ-W interaction —
Page 159 and 160:
Informatics information flow vs no
Page 161 and 162:
( ) (( ) ( )) 1 0 0 0 1 1 ⊗ 0 0 0
Page 163 and 164:
( ) (( ) ( )) ( ) 1 0 0 0 1 1 1 ⊗
Page 165:
Posters on this line of work: • A
show all

The Logic of Quantum Mechanics - take II - Perimeter Institute

Create successful ePaper yourself

Delete template?

Save as template?