Symmetry, compact closure and dagger compactness for categories of convex operational models

Howard Barnum, Ross Duncan, Alexander Wilce

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In the categorical approach to the foundations of quantum theory, one begins with a symmetric monoidal category, the objects of which represent physical systems, and the morphisms of which represent physical processes. Usually, this category is taken to be at least compact closed, and more often, dagger compact, enforcing a certain self-duality, whereby preparation processes (roughly, states) are interconvertible with processes of registration (roughly, measurement outcomes). This is in contrast to the more concrete “operational” approach, in which the states and measurement outcomes associated with a physical system are represented in terms of what we here call a convex operational model: a certain dual pair of ordered linear spaces–generally, not isomorphic to one another. On the other hand, state spaces for which there is such an isomorphism, which we term weakly self-dual, play an important role in reconstructions of various quantum-information theoretic protocols, including teleportation and ensemble steering. In this paper, we characterize compact closure of symmetric monoidal categories of convex operational models in two ways: as a statement about the existence of teleportation protocols, and as the principle that every process allowed by that theory can be realized as an instance of a remote evaluation protocol—hence, as a form of classical probabilistic conditioning. In a large class of cases, which includes both the classical and quantum cases, the relevant compact closed categories are degenerate, in the weak sense that every object is its own dual. We characterize the dagger-compactness of such a category (with respect to the natural adjoint) in terms of the existence, for each system, of a symmetric bipartite state, the associated conditioning map of which is an isomorphism.
LanguageEnglish
Pages501-523
Number of pages23
JournalJournal of Philosophical Logic
Volume42
Issue number3
DOIs
Publication statusPublished - Jun 2013

Fingerprint

Closure
Symmetry
Compactness
Dagger
Physical
Conditioning
Isomorphism
Registration
Quantum Information
Quantum Theory
Ensemble
Duality
Categorical
Evaluation

Keywords

  • quantum foundations
  • convex operational theories
  • compact closed category
  • dagger-compact category

Cite this

@article{bcd05b1837d6446a9a21c33cb66d4a99,
title = "Symmetry, compact closure and dagger compactness for categories of convex operational models",
abstract = "In the categorical approach to the foundations of quantum theory, one begins with a symmetric monoidal category, the objects of which represent physical systems, and the morphisms of which represent physical processes. Usually, this category is taken to be at least compact closed, and more often, dagger compact, enforcing a certain self-duality, whereby preparation processes (roughly, states) are interconvertible with processes of registration (roughly, measurement outcomes). This is in contrast to the more concrete “operational” approach, in which the states and measurement outcomes associated with a physical system are represented in terms of what we here call a convex operational model: a certain dual pair of ordered linear spaces–generally, not isomorphic to one another. On the other hand, state spaces for which there is such an isomorphism, which we term weakly self-dual, play an important role in reconstructions of various quantum-information theoretic protocols, including teleportation and ensemble steering. In this paper, we characterize compact closure of symmetric monoidal categories of convex operational models in two ways: as a statement about the existence of teleportation protocols, and as the principle that every process allowed by that theory can be realized as an instance of a remote evaluation protocol—hence, as a form of classical probabilistic conditioning. In a large class of cases, which includes both the classical and quantum cases, the relevant compact closed categories are degenerate, in the weak sense that every object is its own dual. We characterize the dagger-compactness of such a category (with respect to the natural adjoint) in terms of the existence, for each system, of a symmetric bipartite state, the associated conditioning map of which is an isomorphism.",
keywords = "quantum foundations, convex operational theories, compact closed category, dagger-compact category",
author = "Howard Barnum and Ross Duncan and Alexander Wilce",
year = "2013",
month = "6",
doi = "10.1007/s10992-013-9280-8",
language = "English",
volume = "42",
pages = "501--523",
journal = "Journal of Philosophical Logic",
issn = "0022-3611",
number = "3",

}

Symmetry, compact closure and dagger compactness for categories of convex operational models. / Barnum, Howard; Duncan, Ross; Wilce , Alexander.

In: Journal of Philosophical Logic, Vol. 42, No. 3, 06.2013, p. 501-523.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Symmetry, compact closure and dagger compactness for categories of convex operational models

AU - Barnum, Howard

AU - Duncan, Ross

AU - Wilce , Alexander

PY - 2013/6

Y1 - 2013/6

N2 - In the categorical approach to the foundations of quantum theory, one begins with a symmetric monoidal category, the objects of which represent physical systems, and the morphisms of which represent physical processes. Usually, this category is taken to be at least compact closed, and more often, dagger compact, enforcing a certain self-duality, whereby preparation processes (roughly, states) are interconvertible with processes of registration (roughly, measurement outcomes). This is in contrast to the more concrete “operational” approach, in which the states and measurement outcomes associated with a physical system are represented in terms of what we here call a convex operational model: a certain dual pair of ordered linear spaces–generally, not isomorphic to one another. On the other hand, state spaces for which there is such an isomorphism, which we term weakly self-dual, play an important role in reconstructions of various quantum-information theoretic protocols, including teleportation and ensemble steering. In this paper, we characterize compact closure of symmetric monoidal categories of convex operational models in two ways: as a statement about the existence of teleportation protocols, and as the principle that every process allowed by that theory can be realized as an instance of a remote evaluation protocol—hence, as a form of classical probabilistic conditioning. In a large class of cases, which includes both the classical and quantum cases, the relevant compact closed categories are degenerate, in the weak sense that every object is its own dual. We characterize the dagger-compactness of such a category (with respect to the natural adjoint) in terms of the existence, for each system, of a symmetric bipartite state, the associated conditioning map of which is an isomorphism.

AB - In the categorical approach to the foundations of quantum theory, one begins with a symmetric monoidal category, the objects of which represent physical systems, and the morphisms of which represent physical processes. Usually, this category is taken to be at least compact closed, and more often, dagger compact, enforcing a certain self-duality, whereby preparation processes (roughly, states) are interconvertible with processes of registration (roughly, measurement outcomes). This is in contrast to the more concrete “operational” approach, in which the states and measurement outcomes associated with a physical system are represented in terms of what we here call a convex operational model: a certain dual pair of ordered linear spaces–generally, not isomorphic to one another. On the other hand, state spaces for which there is such an isomorphism, which we term weakly self-dual, play an important role in reconstructions of various quantum-information theoretic protocols, including teleportation and ensemble steering. In this paper, we characterize compact closure of symmetric monoidal categories of convex operational models in two ways: as a statement about the existence of teleportation protocols, and as the principle that every process allowed by that theory can be realized as an instance of a remote evaluation protocol—hence, as a form of classical probabilistic conditioning. In a large class of cases, which includes both the classical and quantum cases, the relevant compact closed categories are degenerate, in the weak sense that every object is its own dual. We characterize the dagger-compactness of such a category (with respect to the natural adjoint) in terms of the existence, for each system, of a symmetric bipartite state, the associated conditioning map of which is an isomorphism.

KW - quantum foundations

KW - convex operational theories

KW - compact closed category

KW - dagger-compact category

U2 - 10.1007/s10992-013-9280-8

DO - 10.1007/s10992-013-9280-8

M3 - Article

VL - 42

SP - 501

EP - 523

JO - Journal of Philosophical Logic

T2 - Journal of Philosophical Logic

JF - Journal of Philosophical Logic

SN - 0022-3611

IS - 3

ER -