Dagger linear logic for categorical quantum mechanics Robin - - PowerPoint PPT Presentation

dagger linear logic for categorical quantum mechanics
SMART_READER_LITE
LIVE PREVIEW

Dagger linear logic for categorical quantum mechanics Robin - - PowerPoint PPT Presentation

Dagger linear logic for categorical quantum mechanics Robin Cockett, Cole Comfort, and Priyaa Srinivasan University of Calgary 0/30 Motivation Mixed Unitary Categories Unitary construction Dagger compact closed categories This work is


slide-1
SLIDE 1

Dagger linear logic for categorical quantum mechanics

Robin Cockett, Cole Comfort, and Priyaa Srinivasan University of Calgary

0/30

slide-2
SLIDE 2

1/30

Motivation Mixed Unitary Categories Unitary construction

Dagger compact closed categories

This work is available at arXiv:1809.00275 Dagger compact closed categories (†-KCC) provide a categorical framework to represent finite dimensional quantum processes. What is a framework that supports infinite dimensional processes? Dagger compact closed categories ⇒ Finite-dimensionality on Hilbert Spaces. Because infinite dimensional Hilbert spaces are not compact closed. One possibility is to drop the compact closure property and to consider † symmetric monoidal categories (†-SMC). However, one loses the rich structure provided by the dualizing functor, ∗.

1 / 30

slide-3
SLIDE 3

2/30

Motivation Mixed Unitary Categories Unitary construction

Dagger linear logic for quantum processes

Is there a way to generalize †-KCCs and still retain the goodness of the compact closed structure? ∗-autonomous categories or more generally, linearly distributive categories (LDCs) generalize compact closed categories and allow for infinite dimensions. What is a dagger structure for LDCs? What are unitary isomorphisms in †-LDCs?

2 / 30

slide-4
SLIDE 4

3/30

Motivation Mixed Unitary Categories Unitary construction

Linearly distributive categories

A linearly distributive category (LDC) has two monoidal structures (⊗, ⊤, a⊗, uL

⊗, uR ⊗) and (⊕, ⊥, a⊕, uL ⊕, uR ⊕) linked by

natural transformations called the linear distributors: ∂L : A ⊗ (B ⊕ C) → (A ⊗ B) ⊕ C ∂R : (A ⊕ B) ⊗ C → A ⊕ (B ⊗ C) LDCs are equipped with a graphical calculus. LDCs provide a categorical semantics for multiplicative linear logic.

3 / 30

slide-5
SLIDE 5

4/30

Motivation Mixed Unitary Categories Unitary construction

Mix categories

A mix category is a LDC with a mix map m : ⊥ − → ⊤ in X such that mxA,B : A ⊗ B − → A ⊕ B :=

m

=

m

(1⊕(uL

⊕)−1)(1⊗(m⊕1))δL(uR ⊗⊕1) = ((uR ⊕)−1⊕1)((1⊕m)⊗1)δR(1⊕uR ⊗)

mx is called a mixor. The mixor is a natural transformation. It is an isomix category if m is an isomorphism. m being an isomorphism does not make the mixor an isomorphism.

4 / 30

slide-6
SLIDE 6

5/30

Motivation Mixed Unitary Categories Unitary construction

The Core of mix category

The core of a mix category, Core(X) ⊆ X, is the full subcategory determined by objects U ∈ X for which the natural transformations are isomorphisms: U ⊗ ( )

mxU,( )

− − − − − → U ⊕ ( ) ( ) ⊗ U

mx( ),U

− − − − − → ( ) ⊕ U The core of a mix category is closed to ⊗ and ⊕. The core of an isomix category contains the monoidal units ⊤ and ⊥. A compact LDC is an LDC in which every mixor is an isomorphism i.e., in a compact LDC ⊗ ≃ ⊕. Compact LDCs (X, ⊗, ⊤, ⊕, ⊥) are linearly equivalent to underlying monoidal categories (X, ⊗, ⊤) and (X, ⊕, ⊥).

5 / 30

slide-7
SLIDE 7

6/30

Motivation Mixed Unitary Categories Unitary construction

Examples of mix categories

A monoidal category is trivially an isomix category: ⊗ = ⊕ Finiteness spaces/matrices Coherent spaces ChuI(X), The Chu construction over closed symmetric monoidal categories and the monoidal unit

6 / 30

slide-8
SLIDE 8

7/30

Motivation Mixed Unitary Categories Unitary construction

Linear duals

Suppose X is a LDC and A, B ∈ X. Then, B is left linear dual (η, ε) : B ⊣ ⊣ A, if there exists η : ⊤ → B ⊕ A ε : A ⊗ B → ⊥ such that the snake diagrams hold. A

(uR

⊗)−1

A ⊗ ⊤

1⊗η

A ⊗ (B ⊕ A)

∂L

  • A

⊥ ⊕ A

uL

  • (A ⊗ B) ⊕ A

ε⊕1

  • ε

η

= A *-autonomous category is a category in which every object has a chosen left and right linear dual.

7 / 30

slide-9
SLIDE 9

8/30

Motivation Mixed Unitary Categories Unitary construction

Forging the †

The definition of † : Xop − → X cannot be directly imported to LDCs because the dagger has to flip the tensor products: (A ⊗ B)† = A† ⊕ B† Why? If the dagger is identity-on-objects, then the linear distributor degenerates to an associator: δR : (A ⊕ B) ⊗ C − → A ⊕ (B ⊗ C) (δR)† : A ⊕ (B ⊗ C) − → (A ⊕ B) ⊗ C

8 / 30

slide-10
SLIDE 10

9/30

Motivation Mixed Unitary Categories Unitary construction

†-LDCs

A †-LDC is an LDC X with a dagger functor † : Xop − → X and the natural isomorphisms: tensor laxors: λ⊕ : A† ⊕ B† − → (A ⊗ B)† λ⊗ : A† ⊗ B† − → (A ⊕ B)† unit laxors: λ⊤ : ⊤ − → ⊥† λ⊥ : ⊥ − → ⊤† involutor: ι : A − → A†† such that certain coherence conditions hold.

9 / 30

slide-11
SLIDE 11

10/30

Motivation Mixed Unitary Categories Unitary construction

Coherences for †-LDCs

Coherences for the interaction between the tensor laxors and the basic natural isomorphisms (6 coherences): A† ⊗ (B† ⊗ C †)

a⊗

  • 1⊗λ⊗
  • (A† ⊗ B†) ⊗ C †

λ⊗⊗1

  • (A† ⊗ (B ⊕ C)†)

λ⊗

  • (A ⊕ B)† ⊗ C †

λ⊗

  • (A ⊕ (B ⊕ C))†

(a−1

⊕ )† ((A ⊕ B) ⊕ C)†

10 / 30

slide-12
SLIDE 12

11/30

Motivation Mixed Unitary Categories Unitary construction

Coherences for †-LDCs (cont.)

Interaction between the unit laxors and the unitors (4 coherences): ⊤ ⊗ A†

λ⊤⊗1

  • ul

⊥† ⊗ A†

λ⊗

  • A†

(⊥ ⊕ A)†

  • (ul

⊕)†

⊥ ⊕ A†

λ⊥⊕1

  • ul

⊤† ⊕ A†

λ⊕

  • A†

(⊤ ⊗ A)†

  • (ul

⊗)†

Interaction between the involutor and the laxors (4 coherences): A ⊕ B

ι

  • i⊕i
  • ((A ⊕ B)†)†

λ†

  • (A†)† ⊕ (B†)†

λ⊕

(A† ⊗ B†)†

ι λ⊥

  • (⊥†)†

λ†

  • ⊤†

ιA† = (ι−1

A )† : A† −

→ A†††

11 / 30

slide-13
SLIDE 13

12/30

Motivation Mixed Unitary Categories Unitary construction

†-mix categories

A †-mix category is a †-LDC with m : ⊥ − → ⊤ such that: ⊥

m

  • λ⊥

λ⊤

  • ⊤†

m† ⊥†

If m is an isomorphism, then X is a †-isomix category. Lemma 1: The following diagram commutes in a mix †-LDC: A† ⊗ B†

mx

  • λ⊗

A† ⊕ B†

λ⊕

  • (A ⊕ B)†

mx† (A ⊗ B)†

12 / 30

slide-14
SLIDE 14

13/30

Motivation Mixed Unitary Categories Unitary construction

†-mix categories

Lemma 2: Suppose X is a †-mix category and A ∈ Core(X) then A† ∈ Core(X). Proof: The natural transformation A† ⊗ X

mx

− − → A† ⊕ X is an isomorphism: A† ⊗ X

1⊗ι mx

  • nat. mx

A† ⊗ X ††

λ⊗ mx

  • Lemma 1

(A ⊕ X †)†

mx†

  • A† ⊕ X

1⊕ι

A† ⊕ A††

λ⊕

(A ⊗ X †)†

commutes.

13 / 30

slide-15
SLIDE 15

14/30

Motivation Mixed Unitary Categories Unitary construction

Example of a †-isomix category

Category of finite-dimensional framed vector spaces, FFVecK Objects: The objects are pairs (V , V) where V is a finite dimensional K-vector space and V = {v1, ..., vn} is a basis; Maps: These are vector space homomorphisms which ignore the basis information; Tensor product: (V , V)⊗(W , W) = (V ⊗W , {v ⊗w|v ∈ V, w ∈ W}) Tensor unit: (K, {e}) where e is the unit of the field K.

14 / 30

slide-16
SLIDE 16

15/30

Motivation Mixed Unitary Categories Unitary construction

Example (cont.)

To define the “dagger” we assume that the field has an involution ( ) : K − → K, that is a field homomorphism with k = (k). This involution then can be extended to a (covariant) functor: ( ) : FFVecK − → FFVecK; (V , V)

f

  • (W , W)

→ (V , V)

f

  • (W , W)

where (V , V) is the vector space with the same basis but the conjugate action c · v = c · v. f is the same underlying map.

15 / 30

slide-17
SLIDE 17

16/30

Motivation Mixed Unitary Categories Unitary construction

Example (cont.)

FFVecK is also a compact closed category with (V , B)∗ = (V ∗, { bi|bi ∈ B}) where V ∗ = V ⊸ K and

  • bi : V −

→ K;  

j

βj · bj   → βi Hence, we have a contravariant functor ( )∗ : FFVecop

K −

→ FFVecK. (V , B)† = (V , B)∗ ι : (V , V) − → ((V , V)†)†; v → λf .f (v) FFVecK is a compact LDC: ⊗ and ⊕ coincides.

16 / 30

slide-18
SLIDE 18

17/30

Motivation Mixed Unitary Categories Unitary construction

Diagrammatic calculus for †-LDC

Extends the diagrammatic calculus of LDCs The action of dagger is represented diagrammatically using dagger boxes: † :

A B f

f A B A† B†

. λ⊗ : A† ⊗ B† → (A ⊕ B)† = λ⊤ : ⊤ → ⊥† =

⊥ ⊤

17 / 30

slide-19
SLIDE 19

18/30

Motivation Mixed Unitary Categories Unitary construction

Next step: Unitary structure

Define †-LDC Define unitary isomorphisms The usual definition of unitary maps (f † : B† → A† = f −1 : B − → A) is applicable only when the † functor is stationary on objects.

18 / 30

slide-20
SLIDE 20

19/30

Motivation Mixed Unitary Categories Unitary construction

Unitary structure

A †-isomix category has unitary structure in case there is an essentially small class of objects called unitary objects such that: Every unitary object, A ∈ U, is in the core; Each unitary object A ∈ U comes equipped with an isomorphism, called the unitary strucure of A,

A A† : A

ϕA

− → A† such that

A† A†† A† A†† = = ι A A† A†† A A††

ϕA† = ((ϕA)−1)† (ϕAϕA†) = ι

19 / 30

slide-21
SLIDE 21

20/30

Motivation Mixed Unitary Categories Unitary construction

Unitary structure (cont.)

⊤, ⊥ are unitary objects with: ϕ⊥ = mλ⊤ ϕ⊤ = m−1λ⊥ If A and B are unitary objects then A ⊗ B and A ⊕ B are unitary objects such that: A⊗B

ϕA⊗B

− − − − →

(A⊗B)†

λ−1

− − − →

A†⊕B†

ϕ−1

A

⊕ ϕ−1

B

− − − − − − − − →

A⊕B = mx A⊗B

ϕA ⊗ ϕB

− − − − − − →

(A† ⊗B†

λ⊗

− − − →

(A⊕B)†

ϕ−1

(A⊕B)

− − − − − →

A⊕B = mx

20 / 30

slide-22
SLIDE 22

21/30

Motivation Mixed Unitary Categories Unitary construction

Unitary isomorphisms

Suppose A and B are unitary objects. An isomorphism A f − → B is said to be a unitary isomorphism if the following diagram commutes: A

ϕA f

  • A†
  • f †

B

ϕB B†

A B B† A† f f

=

A A†

Lemma: In a †-isomix category with unitary structure, f † is a unitary map iff f is; f ⊗ g and f ⊕ g are unitary maps whenever f and g are. a⊗, a⊕, c⊗, c⊕, δL, m, and mx are unitary isomorphisms. λ⊗, λ⊕, λ⊤, λ⊥, and ι are unitary isomorphisms. ϕA is a unitary isomorphisms for for all unitary objects A.

21 / 30

slide-23
SLIDE 23

22/30

Motivation Mixed Unitary Categories Unitary construction

Unitary structure of FFVecK

Unitary structure for FFVecK is ϕ(V ,V) : (V , V) − → (V , V)†; vi → vi Define a functor U : FFVecK − → Mat(K)

  • for each object in FFVecK we choose a total order on the

elements of the basis

  • any map is given by a matrix acting on the bases

Lemma: An isomorphism u : (A, A) − → (B, B) in FFVecK is unitary if and only if U(f ) is unitary in Mat(K).

22 / 30

slide-24
SLIDE 24

23/30

Motivation Mixed Unitary Categories Unitary construction

Unitary duals

A linear dual (η, ε) : A ⊣ ⊣ u B is a unitary linear dual if A and B are unitary objects satisfying in addition: ⊤

ηA

  • λ⊤

A ⊕ B

ϕA⊕ϕB

  • ⊥†

ε†

  • A† ⊕ B†

c⊕

  • (B ⊗ A)†

λ−1

B† ⊕ A†

A ⊗ B

ϕA⊗ϕB

  • c⊗
  • A† ⊗ B†

λ⊗

  • B ⊗ A

εA

  • (A ⊕ B)†

η†

A

λ⊥

⊤†

ε B† A†

=

η η A† B†

=

ε

23 / 30

slide-25
SLIDE 25

24/30

Motivation Mixed Unitary Categories Unitary construction

Unitary categories

A unitary category is a compact †-LDC in which every object is unitary. Unitary categories are ‘†- linearly equivalent’ to dagger monoidal categories. A unitary category is closed if every object has a unitary dual. Closed unitary categories are ‘†- linearly equivalent’ to dagger compact closed categories

24 / 30

slide-26
SLIDE 26

25/30

Motivation Mixed Unitary Categories Unitary construction

Mixed Unitary Categories

A Mixed Unitary Category is a †-isomix functor: Unitary category − → †-isomix category The functor factors through the Core of the †-isomix category. Examples: Finiteness matrices, Coherent spaces, Chu Spaces over involutive closed monoidal categories and the monoidal unit

25 / 30

slide-27
SLIDE 27

26/30

Motivation Mixed Unitary Categories Unitary construction

Unitary construction

In a †-mix category a pre-unitary object is an object U, which in the core, together with an isomorphism: α : U − → U† such that α(α−1)† = ι Suppose X is a †-isomix category, then define Unitary(X): Objects: Pre-unitary objects (U, α) Maps: (U, α)

f

− − → (V , β) where U

f

− − → V is in X

26 / 30

slide-28
SLIDE 28

27/30

Motivation Mixed Unitary Categories Unitary construction

Unitary construction (cont.)

⊗ on objects: (A, α) ⊗ (B, β) := (A⊗B, A⊗B

mx

− − − → A⊕B

α ⊕ β

− − − − → A†⊕B†

λ⊕

− − − → (A⊗B)†) Unit of ⊗: (⊤, m−1λ⊥ : ⊤ − → ⊤†) ⊕ on objects: (A, α) ⊕ (B, β) := (A⊕B, A⊕B

mx−1

− − − − → A⊗B

α ⊗ β

− − − − → A†⊗B†

λ⊗

− − − → (A⊕B)† Unit of ⊕: (⊥, mλ⊤ : ⊥ − → ⊥†)

27 / 30

slide-29
SLIDE 29

28/30

Motivation Mixed Unitary Categories Unitary construction

Unitary construction (cont.)

Lemma: Unitary(X) is a unitary category. Proof: (U, α)† := (U†, (α−1)†) (U, α)† ∈ Unitary(X): (α−1)†(((α−1)†)−1)† = (α−1)†(α†)† = (α†α−1)† = (ι−1)† = ι Every object (U, α) has an obvious unitary structure: (U, α)

α

− − → (U†, (α−1)†) Proposition: If X is any †-isomix category, then Unitary(X) is a unitary category with a full and faithful underlying †-isomix functor to U : Unitary(X) − → X.

28 / 30

slide-30
SLIDE 30

29/30

Motivation Mixed Unitary Categories Unitary construction

Summary

A Mixed Unitary Category (a MUC) is: †-isomix functor: Unitary category − → †-isomix category Unitary categories are compact †-LDCs in which every object is unitary. Unitary categories are ‘†-linearly equivalent’ to † monoidal categories. The dagger functor is non-stationary on objects in †-isomix categories.

29 / 30

slide-31
SLIDE 31

30/30

Motivation Mixed Unitary Categories Unitary construction

Bibliography

LDC: Robin Cockett, and Robert Seely. Weakly distributive

  • categories. Journal of Pure and Applied Algebra 114.2 (1997): 133-173.

The core of a mix category: Richard Blute, Robin Cockett, and Robert

  • Seely. Feedback for linearly distributive categories: traces and
  • fixpoints. Journal of Pure and Applied Algebra 154.1-3 (2000): 27-69.

Graphical calculus for LDCs: Richard Blute, Robin Cockett , Robert Seely, and Tood Trimble. Natural deduction and coherence for weakly distributive categories. Journal of Pure and Applied Algebra 113.3 (1996): 229-296. Linear logic: Girard, Jean-Yves. Linear logic. Theoretical computer science 50.1 (1987): 1-101.

30 / 30