SLIDE 1 Categorical relativistic quantum theory
Chris Heunen Pau Enrique Moliner Sean Tull
1 / 15
SLIDE 2 Idea
◮ Hilbert modules: naive quantum field theory ◮ Idempotent subunits: base space in any category ◮ Support: where morphisms live ◮ Causal structures: relativistic quantum information
2 / 15
SLIDE 3 Base space
Let X be locally compact Hausdorff space. C0(X) = {f : X → C cts | ∀ε > 0 ∃K ⊆ X cpt: f(X \ K) < ε} C X ε f K Cb(X) = {f : X → C cts | ∃f < ∞ ∀t ∈ X : |f(t)| ≤ f}
3 / 15
SLIDE 4 Hilbert spaces
C-module H with complete C-valued inner product tensor product over C monoidal category tensor unit C tensor unit I complex numbers C scalars I → I finite dimensional dual objects adjoints dagger
commutative dagger Frobenius structure fin-dim C*-algebra dagger Frobenius structure
4 / 15
SLIDE 5 Hilbert modules
C0(X)-module H with complete C0(X)-valued inner product tensor product over C0(X) monoidal category tensor unit C0(X) tensor unit I complex numbers Cb(X) scalars I → I finitely presented dual objects adjoints dagger finite coverings commutative dagger Frobenius structure unif fin-dim C*-bundles dagger Frobenius structure ‘Scalars are not numbers’
4 / 15
SLIDE 6 Bundles of Hilbert spaces
Bundle E ։ X, each fibre Hilbert space, operations continuous E X t Et
5 / 15
SLIDE 7 Bundles of Hilbert spaces
Bundle E ։ X, each fibre Hilbert space, operations continuous, with E X t Et
5 / 15
SLIDE 8 Bundles of Hilbert spaces
Bundle E ։ X, each fibre Hilbert space, operations continuous, with E X t Et Hilbert C0(X)-modules ≃ bundles of Hilbert spaces over X sections vanishing at infinity ← E ։ X E → localisation
5 / 15
SLIDE 9 Idempotent subunits
Definition: ISub(C) = {s: S I | idS ⊗ s: S ⊗ S → S ⊗ I iso}/ ≃
6 / 15
SLIDE 10 Idempotent subunits
Definition: ISub(C) = {s: S I | idS ⊗ s: S ⊗ S → S ⊗ I iso}/ ≃
◮ Analysis: ISub(HilbC0(X)) = {S ⊆ X open}:
‘idempotent subunits are open subsets of base space’
6 / 15
SLIDE 11 Idempotent subunits
Definition: ISub(C) = {s: S I | idS ⊗ s: S ⊗ S → S ⊗ I iso}/ ≃
◮ Analysis: ISub(HilbC0(X)) = {S ⊆ X open}:
‘idempotent subunits are open subsets of base space’
◮ Logic: ISub(Sh(X)) = {S ⊆ X open}:
‘idempotent subunits are truth values’
6 / 15
SLIDE 12 Idempotent subunits
Definition: ISub(C) = {s: S I | idS ⊗ s: S ⊗ S → S ⊗ I iso}/ ≃
◮ Analysis: ISub(HilbC0(X)) = {S ⊆ X open}:
‘idempotent subunits are open subsets of base space’
◮ Logic: ISub(Sh(X)) = {S ⊆ X open}:
‘idempotent subunits are truth values’
◮ Order theory: ISub(Q) = {x ∈ Q | x2 = x ≤ 1} for quantale Q:
‘idempotent subunits are side-effect-free observations’
6 / 15
SLIDE 13 Idempotent subunits
Definition: ISub(C) = {s: S I | idS ⊗ s: S ⊗ S → S ⊗ I iso}/ ≃
◮ Analysis: ISub(HilbC0(X)) = {S ⊆ X open}:
‘idempotent subunits are open subsets of base space’
◮ Logic: ISub(Sh(X)) = {S ⊆ X open}:
‘idempotent subunits are truth values’
◮ Order theory: ISub(Q) = {x ∈ Q | x2 = x ≤ 1} for quantale Q:
‘idempotent subunits are side-effect-free observations’
◮ Algebra: ISub(ModR) = {S ⊆ R ideal
‘idempotent subunits are idempotent ideals’
6 / 15
SLIDE 14 Semilattice
Proposition: ISub(C) is a semilattice, ∧ = ⊗, 1 = idI T S I Caveat: C must be firm, i.e. s ⊗ idT monic, and size issue
7 / 15
SLIDE 15 Semilattice
Proposition: ISub(C) is a semilattice, ∧ = ⊗, 1 = idI T S I Caveat: C must be firm, i.e. s ⊗ idT monic, and size issue SemiLat FirmCat ⊥ ISub id
7 / 15
SLIDE 16 Spatial categories
Call C spatial when ISub(C) is frame SemiLat FirmCat Frame SpatCat ⊥ ISub ⊣ ⊥ ISub ⊣ (C, ⊗) ([Cop, Set]supp, ⊗Day)
8 / 15
SLIDE 17 Support
Say s ∈ ISub(C) supports f : A → B when A B B ⊗ S B ⊗ I f id ⊗ s ≃
9 / 15
SLIDE 18 Support
Say s ∈ ISub(C) supports f : A → B when A B B ⊗ S B ⊗ I f id ⊗ s ≃ C2 Pow(ISub(C)) supp f {s | s supports f}
9 / 15
SLIDE 19 Support
Say s ∈ ISub(C) supports f : A → B when A B B ⊗ S B ⊗ I f id ⊗ s ≃ Monoidal functor: supp(f) ∧ supp(g) ≤ supp(f ⊗ g) C2 Pow(ISub(C)) supp f {s | s supports f}
9 / 15
SLIDE 20 Support
Say s ∈ ISub(C) supports f : A → B when A B B ⊗ S B ⊗ I f id ⊗ s ≃ Monoidal functor: supp(f) ∧ supp(g) ≤ supp(f ⊗ g) C2 Pow(ISub(C)) supp f {s | s supports f} Q ∈ Frame F
universal with F(f) = {F(s) | s ∈ ISub(C) supports f}
9 / 15
SLIDE 21 Restriction
Full subcategory C
- s of A with idA ⊗ s invertible:
◮ monoidal with tensor unit S ◮ coreflective: C
C ⊥
◮ tensor ideal: if A ∈ C and B ∈ C
◮ monocoreflective: counit εI monic (and idA ⊗ εI iso for A ∈ C
10 / 15
SLIDE 22 Restriction
Full subcategory C
- s of A with idA ⊗ s invertible:
◮ monoidal with tensor unit S ◮ coreflective: C
C ⊥
◮ tensor ideal: if A ∈ C and B ∈ C
◮ monocoreflective: counit εI monic (and idA ⊗ εI iso for A ∈ C
Proposition: ISub(C) ≃ {monocoreflective tensor ideals in C}
10 / 15
SLIDE 23 Localisation
A graded monad is a monoidal functor E → [C, C] (η: A → T(1), µ: T(t) ◦ T(s) → T(s ⊗ t)) Lemma: s → C
- s is an ISub(C)-graded monad
11 / 15
SLIDE 24 Localisation
A graded monad is a monoidal functor E → [C, C] (η: A → T(1), µ: T(t) ◦ T(s) → T(s ⊗ t)) Lemma: s → C
- s is an ISub(C)-graded monad
universal property of localisation for Σ = {idE ⊗ s | E ∈ C} C C
D (−) ⊗ S F inverting Σ ≃
11 / 15
SLIDE 25 Spacetime
What if X is more than just space? Lorentzian manifold with time orientation: s ≪ t: there is future-directed timelike curve s → t s ≺ t: there is future-directed non-spacelike curve s → t chronological causal future I+(t) = {s ∈ X | t ≪ s} J+(t) = {s ∈ X | t ≺ s} past I−(t) = {s ∈ X | s ≪ t} J−(t) = {s ∈ X | s ≺ t}
12 / 15
SLIDE 26 Spacetime
What if X is more than just space? Lorentzian manifold with time orientation: s ≪ t: there is future-directed timelike curve s → t s ≺ t: there is future-directed non-spacelike curve s → t chronological causal future I+(t) = {s ∈ X | t ≪ s} J+(t) = {s ∈ X | t ≺ s} past I−(t) = {s ∈ X | s ≪ t} J−(t) = {s ∈ X | s ≺ t} If S ⊆ X open, then I+(S) =
s∈S I+(s) = s∈S J+(s) = J+(S)
I+ and I− give ‘future’ and ‘past’ operators
12 / 15
SLIDE 27 Causal structure
Closure operator on partially ordered set P is function C : P → P:
◮ if s ≤ t, then C(s) ≤ C(t); ◮ s ≤ C(s); ◮ C(C(s)) ≤ C(s).
Causal structure on C is pair C± of closure operators on ISub(C)
13 / 15
SLIDE 28 Causal structure
Closure operator on partially ordered set P is function C : P → P:
◮ if s ≤ t, then C(s) ≤ C(t); ◮ s ≤ C(s); ◮ C(C(s)) ≤ C(s).
Causal structure on C is pair C± of closure operators on ISub(C) Proposition: if r ∈ ISub(C) and C is closure operator on C, then D(s) = C(s) ∧ r is closure operator on C
’Causal structure restricts’
13 / 15
SLIDE 29 Teleportation
’Restriction = propagation’
pair creation Alice Bob
compact category + support + causal structure = teleportation only successful on intersection of future sets
14 / 15
SLIDE 30 Further
◮ relativistic quantum information protocols ◮ causality ◮ proof analysis ◮ control flow ◮ data flow ◮ concurrency ◮ graphical calculus
15 / 15
SLIDE 31
Complements
Subunit is split when S I s id SISub(C) is a sub-semilattice of ISub(C) (don’t need firmness)
SLIDE 32
Complements
Subunit is split when S I s id SISub(C) is a sub-semilattice of ISub(C) (don’t need firmness) If C has zero object, ISub(C) has least element 0 s, s⊥ are complements if s ∧ s⊥ = 0 and s ∨ s⊥ = 1
SLIDE 33
Complements
Subunit is split when S I s id SISub(C) is a sub-semilattice of ISub(C) (don’t need firmness) If C has zero object, ISub(C) has least element 0 s, s⊥ are complements if s ∧ s⊥ = 0 and s ∨ s⊥ = 1 Proposition: when C has finite biproducts, then s, s⊥ ∈ SISub(C) are complements if and only if they are biproduct injections Corollary: if ⊕ distributes over ⊗, then SISub(C) is a Boolean algebra (universal property?)
SLIDE 34
Linear logic
if T : C → C monoidal monad, Kl(T) is monoidal semilattice morphism {ηI ◦ s | s ∈ ISub(C), T(s) is monic in C} → ISub(Kl(T)) is not injective, nor surjective
SLIDE 35
Linear logic
if T : C → C monoidal monad, Kl(T) is monoidal semilattice morphism {ηI ◦ s | s ∈ ISub(C), T(s) is monic in C} → ISub(Kl(T)) is not injective, nor surjective model for linear logic: ∗-autonomous category C with finite products, monoidal comonad !: (C, ⊗) → (C, ×) (then Kl(!) cartesian closed) if ε epi, then ISub(C, ×) ≃ ISub(Kl(!), ×) (but hard to compare to ISub(C, ⊗))