Types of quantum field thories
Quantum information refers to data that can be physically stored in a quantum system.
Quantum information theory is the study of how such information can be encoded, measured, and manipulated. A notable sub-field is quantum computation, a term often used synonymously with quantum information theory, which studies protocols and algorithms that use quantum systems to perform computations.
Brief synopsis of teleportation, entanglement swapping, BB84, E91, Deutsch-Jozsa, Shor should go here…
There is a formulation of (aspects of) quantum mechanics in terms of dagger-compact categories. This lends itself to (and is in fact motivated by) to a discussion of quantum information.
The linear adjoint gives Hilbert spaces the structure of a †-category. The category of Hilb of Hilbert spaces forms a †-symmetric monoidal category, that is, a symmetric monoidal category equipped with a symmetric monoidal functor from to . Furthermore, the category FHilb of finite dimensional Hilbert spaces forms a †-compact closed category, or a compact closed category such that := and .
Morphisms in a monoidal category (and 2-categories in general) are inherently two dimensional, where is vertical composition and is horizontal composition. These satisfy an interchange law:
(f_1 \otimes f_2) \circ (g_1 \otimes g_2) = (f_1 \circ g_1) \otimes (f_2 \circ g_2)
So, if we think of these four morphisms as occupying a spot in 2 dimensional space:
Aleks Kissinger: TODO: figure
we realize that the bracketing from above is essentially meaningless syntax. This notion is the guiding concept for the graphical notation of monoidal categories, or string diagrams. In this notation, we represent objects as directed strings and arrows as boxes.
We represent the tensor product as juxtaposition:
and composition as graph composition:
That is, we perform a pushout along the common edge in the category of typed graphs with boundaries. Consider the interchange law from above, but replacing some of the arrows with identities.
(f \otimes 1_D) \circ (1_A \otimes g) = (f \circ 1_A) \otimes (1_D \circ g) = (1_B \circ f) \otimes (g \circ 1_C) = (1_B \otimes g) \circ (f \otimes 1_C)
Graphically, this means we can “slide boxes” past each other.
CPM, classical structures, …