quantum information



physics, mathematical physics, philosophy of physics

Surveys, textbooks and lecture notes

theory (physics), model (physics)

experiment, measurement, computable physics

under construction



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.

Categorical quantum information refers to a program in which the cogent aspects of Hilbert space-based quantum information theory are abstracted to the level of symmetric monoidal categories.

Quantum protocols and algorithms

Brief synopsis of teleportation, entanglement swapping, BB84, E91, Deutsch-Jozsa, Shor should go here…

Categorical formulation

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 () (-)^\dagger 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 () (-)^\dagger from Hilb opHilb^{op} to HilbHilb. Furthermore, the category FHilb of finite dimensional Hilbert spaces forms a †-compact closed category, or a compact closed category such that A *A_* := (A *) =(A ) *(A^*)^\dagger = (A^\dagger)^* and (η A) =ϵ A *(\eta_A)^\dagger = \epsilon_{A^*}.

Graphical notation

Aleks Kissinger: Much of this could probably be incorporated into the page on string diagrams.

Morphisms in a monoidal category (and 2-categories in general) are inherently two dimensional, where \circ is vertical composition and \otimes is horizontal composition. These satisfy an interchange law:

(1)(f 1f 2)(g 1g 2)=(f 1g 1)(f 2g 2) (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 A,BA,B as directed strings and arrows f:ABf : A \rightarrow B as boxes.

A B f

We represent the tensor product as juxtaposition:

A B f C D g A B f C D g =

and composition as graph composition:

A B f B C g = A B C g f

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.

(2)(f1 D)(1 Ag)=(f1 A)(1 Dg)=(1 Bf)(g1 C)=(1 Bg)(f1 C) (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.

A B D g f C = A B D g f C


CPM, classical structures, …

Last revised on April 19, 2013 at 01:07:03. See the history of this page for a list of all contributions to it.