Source-linked AI summary

Information processing in convex operational theories

Howard Barnum, Alexander Wilce

arXiv:0908.2352v1quant-ph

TL;DR

The paper asks which information-processing phenomena associated with quantum theory persist in a broader convex operational framework. It reviews results on disturbance, cloning, broadcasting, bit commitment, and teleportation, then sketches links to categorical process semantics. The reviewed results show that several supposedly quantum properties are generic across nonclassical models, while categorical structures provide a route for comparing these theories.

  • Problem

    The paper addresses how classical and quantum mechanics can be compared within a broader theory space and which quantum informational phenomena persist in a concrete convex generalization of classical probability.

  • Method

    It reviews information-processing results in ordered linear spaces and proposes connecting this framework with categorical descriptions of processes.

  • Results

    Several properties often regarded as peculiarly quantum are common to all nonclassical theories, while nonclassical theories without entanglement permit exponentially secure bit commitment.

  • Takeaways & Limitations

    Convex operational theories separate generic nonclassical information-processing properties from constraints that more specifically approach quantum behavior, including entanglement-dependent bit commitment and teleportation.

  • Takeaways & Limitations

    The framework permits epistemic disturbance of mixed states when conditioning on obtained information, even under the stated nondisturbance definition.

Abstract

from arXiv · show

In order to understand the source and extent of the greater-than-classical information processing power of quantum systems, one wants to characterize both classical and quantum mechanics as points in a broader space of possible theories. One approach to doing this, pioneered by Abramsky and Coecke, is to abstract the essential categorical features of classical and quantum mechanics that support various information-theoretic constraints and possibilities, e.g., the impossibility of cloning in the latter, and the possibility of teleportation in both. Another approach, pursued by the authors and various collaborators, is to begin with a very conservative, and in a sense very concrete, generalization of classical probability theory--which is still sufficient to encompass quantum theory--and to ask which "quantum" informational phenomena can be reproduced in this much looser setting. In this paper, we review the progress to date in this second programme, and offer some suggestions as to how to link it with the categorical semantics for quantum processes developed by Abramsky and Coecke.

1 Introduction

The paper reviews convex operational theories as a concrete generalization of classical probability that encompasses quantum theory, and connects their information-processing results with categorical approaches. It highlights generic nonclassical phenomena, bit-commitment results, and initial category-theoretic formulations.

  • The framework makes teleportation a nontrivial constraint, although nonclassical, nonquantum models can support teleportation and even deterministic teleportation.
  • The paper reviews information-processing results in ordered linear spaces and relates them to categorical descriptions of processes.
  • Many properties considered peculiarly quantum, including information-disturbance effects and generalized no-cloning and no-broadcasting, occur in all nonclassical theories in the framework.
  • Nonclassical theories without entanglement permit exponentially secure bit commitment, while certain entangled states can defeat the protocol.
  • The proposed categorical direction compares convex-framework conditions with structures such as compact closure, dagger compact closure, and non-cartesianity.

2 Abstract State Spaces

Abstract state spaces represent normalized states and measurement events within finite-dimensional ordered real vector spaces. Classical probability simplices and quantum density operators arise as examples, while state and effect spaces generally have different structures.

  • An abstract state space is a finite-dimensional ordered real vector space with a positive cone and a strictly positive order unit.
  • Normalized states are positive elements evaluated to one by the order unit, forming the convex set ΩA.
  • Classical probability distributions and quantum density operators arise from RX and L(H), respectively, under their standard order units.
  • Effects are positive functionals between zero and the order unit, and observables are lists of effects summing to the order unit.
  • State spaces and their duals generally differ structurally, although classical and finite-dimensional quantum state spaces are self-dual.

3 Composite Systems

Composite systems are modeled by positive bilinear forms constrained between minimal and maximal tensor products. The minimal and maximal products coincide classically, while their separation permits entangled states.

  • The maximal tensor product contains all positive bilinear forms and represents the most general no-signalling composite.
  • The minimal tensor product contains product states and their mixtures, representing composites without entangled states.
  • The minimal and maximal tensor products coincide for classical systems, whereas states in the maximal product but not the minimal product are entangled.
  • A general composite lies between the minimal and maximal tensor products and must contain every product state.

4 Information-disturbance tradeoffs

In convex operational theories, nondisturbing operations reveal only inherently classical information, and cloning and broadcasting are correspondingly restricted. These generic information-disturbance results motivate conjectures about secure key distribution and characterize broadcastable state sets.

  • Nondisturbing maps on a cone decomposed into irreducible components act as nonnegative scalar multiples of the identity on each component.
  • A nondisturbing operation can reveal which irreducible component contains a state, but no information about the state within that component.
  • Because information that cannot be obtained without disturbance is generic in nonclassical models, the authors conjecture secure key distribution is possible in all such models with an authenticated public channel.
  • In this framework, cloning produces two copies, whereas broadcasting requires only equal marginals and can preserve correlations or entanglement.
  • A set of states is broadcastable exactly when it lies within a simplex whose vertices are jointly distinguishable by one measurement.
  • Broadcastable sets are classical state sets, but this classicality differs from the inherently classical information obtainable without disturbance.

5 Nonuniqueness of extremal decomposition, and bit commitment in unentangled theories

Non-simplicial state spaces have nonunique decompositions that support bit-commitment protocols when composites exclude entanglement. The protocol is perfectly sound and hiding, with exponentially low cheating probability.

  • Nonuniqueness of extremal decomposition: Quantum and all nonclassical theories can have mixed states with nonunique decompositions into pure states; this property characterizes nonsimplicial state spaces.The passages note that nonunique decomposability is characteristic of non-simplices, while its direct role in quantum information tasks is not established.
  • Bit commitment in unentangled theories: Bit-commitment protocols exist universally in nonclassical convex theories generated by finite-dimensional systems when the tensor products are minimal, or separable.The construction assumes at least one nonclassical elementary system and closure under the minimal tensor product.
  • Bit commitment construction: Any non-simplicial convex state space has a state with two decompositions into disjoint exposed states, totaling d + 1 states for affine dimension d.Each exposed state has a distinguishing measurement outcome occurring with probability one only for that state.
  • Protocol: Alice commits by sampling n states from the decomposition associated with her bit and sending the resulting sequence to Bob.She later reveals the bit and sample string, allowing Bob to test each subsystem using the corresponding distinguishing effect.
  • Security properties: The protocol is perfectly sound and hiding, while Alice’s successful cheating probability is exponentially low.Bob never falsely rejects an honest Alice, learns nothing before revelation, and faces an exponentially small cheating probability from Alice.

6 Conditioning and teleportation protocols

The paper formulates conditioning and teleportation in ordered state spaces using conditional states, operator representations, and composite-system structures. Teleportation is characterized by invertibility or order-isomorphism conditions, with deterministic protocols obtained under additional symmetry assumptions.

  • Conditioning: A composite state induces marginal, normalized conditional, and unnormalized partially evaluated states through evaluation on effects and order units.For a normalized state ω and effect a, the conditional state is defined by ω(a, b)/ωA(a) when the marginal probability is nonzero.
  • Composite systems: Regular composites are closed under products of multipartite conditional states, while some mixed tensor constructions are regular and others are not.The construction A ⊗min (B ⊗max C) is regular, whereas (A ⊗min B) ⊗max (C ⊗min D) is given as non-regular for suitable state spaces.
  • Remote evaluation: An effect on A ⊗ B and a state on B ⊗ C induce an operator composition that maps an unknown state on A to an unnormalized conditional state on C.This remote-evaluation mechanism becomes teleportation-like when C is a copy of A and a specified isomorphism identifies corresponding states.
  • Conclusive teleportation: A one-outcome teleportation protocol exists exactly when the induced map μ = bω ◦ bf is proportional to an order-space isomorphism; the correction is then also an isomorphism.The protocol condition is expressed through a positive norm-contractive correction map that normalizes the conditional output.
  • Structural consequences: Teleporting a state space through a copy of itself implies weak self-duality, linking teleportation capability to an order-isomorphism between the space and its dual.The result applies the teleportation characterization to obtain the weak self-duality condition.
  • Deterministic teleportation: Deterministic teleportation requires an observable whose outcome-dependent maps are all invertible through dynamically allowed corrections.A sufficient construction uses a finite group acting transitively on pure states and a state inducing a group-equivariant isomorphism; the resulting observable gives deterministic teleportation.

7 Categories of Abstract State Spaces

The paper develops categorical structures for abstract state spaces by addressing duality, tensor products, and teleportation within the convex operational framework. It then proposes convex-enriched process categories as a bridge to categorical semantics for quantum processes.

  • Structural challenges: Abstract state spaces lack a natural internal duality and monoidal structure because maximal and minimal tensor products coexist.The framework nevertheless admits a canonical embedding relating these tensor products, and can be viewed as linearly distributive without negation.
  • Process-space construction: The category C2 of ordered pairs of state spaces places state and effect spaces on equal footing and supplies a natural self-duality.Objects (A, B) represent process spaces from A to B; (A, I) encodes A* and (I, A) encodes A.
  • Process-space construction: When a subcategory is closed under maximal and minimal tensor products, C2 inherits a natural symmetric monoidal structure.This construction provides the tensorial organization needed for categorical process semantics.
  • Teleportation: Within a subcategory of abstract state spaces, teleportation is defined using a composite system, an effect, a state, and a correction morphism.A protocol is correction free when the correction morphism can be chosen as the identity.
  • Teleportation: In a monoidal category, a unit and co-unit for a dual object form a correction-free teleportation protocol.The unit and co-unit are interpreted as the state and effect implementing teleportation, respectively.
  • Convex operational categories: The proposed bridge starts from a category of abstract state spaces and enlarges or restricts it until it has useful duality and monoidal structure.The paper also proposes enriching process categories over ordered linear spaces, with convex cones as hom-sets.
Loading 0908.2352v1…