skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


This content will become publicly available on February 1, 2026

Title: Coupling capacity in C*-algebras
Given two unital C*-algebras equipped with states and a positive operator in the enveloping von Neumann algebra of their minimal tensor product, we define three parameters that measure the capacity of the operator to align with a coupling of the two given states. Further, we establish a duality formula that shows the equality of two of the parameters for operators in the minimal tensor product of the relevant C*-algebras. In the context of abelian C*-algebras, our parameters are related to quantitative versions of Arveson's null set theorem and to dualities considered in the theory of optimal transport. On the other hand, restricting to matrix algebras we recover and generalize quantum versions of Strassen's theorem. We show that in the latter case our parameters can detect maximal entanglement and separability.  more » « less
Award ID(s):
2115071
PAR ID:
10608616
Author(s) / Creator(s):
; ;
Publisher / Repository:
arXiv
Date Published:
Journal Name:
Proceedings of the Royal Society of Edinburgh: Section A Mathematics
Volume:
155
Issue:
1
ISSN:
0308-2105
Page Range / eLocation ID:
81 to 103
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We introduce the notion of a Tsirelson pair of C*-algebras, which is a pair of C*-algebras for which the space of quantum strategies obtained by using states on the minimal tensor product of the pair is dense in the space of quantum strategies obtained by using states on the maximal tensor product. We exhibit a number of examples of such pairs that are “nontrivial” in the sense that the minimal tensor product and the maximal tensor product of the pair are not isomorphic. For example, we prove that any pair containing a C*-algebra with Kirchberg’s QWEP property is a Tsirelson pair. We then introduce the notion of a C*-algebra with the Tsirelson property (TP) and establish a number of closure properties for this class. We also show that the class of C*-algebras with the TP forms an elementary class (in the sense of model theory), but that this class does not admit an effective axiomatization. 
    more » « less
  2. The classical result of Eisenhart states that, if a Riemannian metric admits a Riemannian metric that is not constantly proportional to and has the same (parameterized) geodesics as in a neighborhood of a given point, then is a direct product of two Riemannian metrics in this neighborhood. We introduce a new generic class of step graded nilpotent Lie algebras, called -surjective, and extend the Eisenhart theorem to sub-Riemannian metrics on step distributions with -surjective Tanaka symbols. The class of ad-surjective step nilpotent Lie algebras contains a well-known class of algebras of H-type as a very particular case. 
    more » « less
  3. A braided Frobenius algebra is a Frobenius algebra with a Yang–Baxter operator that commutes with the operations, that are related to diagrams of compact surfaces with boundary expressed as ribbon graphs. A heap is a ternary operation exemplified by a group with the operation [Formula: see text], that is ternary self-distributive. Hopf algebras can be endowed with the algebra version of the heap operation. Using this, we construct braided Frobenius algebras from a class of certain Hopf algebras that admit integrals and cointegrals. For these Hopf algebras we show that the heap operation induces a Yang–Baxter operator on the tensor product, which satisfies the required compatibility conditions. Diagrammatic methods are employed for proving commutativity between Yang–Baxter operators and Frobenius operations. 
    more » « less
  4. We generalize Jones’ planar algebras by internalising the notion to a pivotal braided tensor category C \mathcal {C} . To formulate the notion, the planar tangles are now equipped with additional ‘anchor lines’ which connect the inner circles to the outer circle. We call the resulting notion ananchored planar algebra. If we restrict to the case when C \mathcal {C} is the category of vector spaces, then we recover the usual notion of a planar algebra. Building on our previous work on categorified traces, we prove that there is an equivalence of categories between anchored planar algebras in C \mathcal {C} and pivotal module tensor categories over C \mathcal {C} equipped with a chosen self-dual generator. Even in the case of usual planar algebras, the precise formulation of this theorem, as an equivalence of categories, has not appeared in the literature. Using our theorem, we describe many examples of anchored planar algebras. 
    more » « less
  5. Discriminating between quantum states is a fundamental task in quantum information theory. Given two quantum states, ρ+ and ρ− , the Helstrom measurement distinguishes between them with minimal probability of error. However, finding and experimentally implementing the Helstrom measurement can be challenging for quantum states on many qubits. Due to this difficulty, there is a great interest in identifying local measurement schemes which are close to optimal. In the first part of this work, we generalize previous work by Acin et al. (Phys. Rev. A 71, 032338) and show that a locally greedy (LG) scheme using Bayesian updating can optimally distinguish between any two states that can be written as a tensor product of arbitrary pure states. We then show that the same algorithm cannot distinguish tensor products of mixed states with vanishing error probability (even in a large subsystem limit), and introduce a modified locally-greedy (MLG) scheme with strictly better performance. In the second part of this work, we compare these simple local schemes with a general dynamic programming (DP) approach. The DP approach finds the optimal series of local measurements and optimal order of subsystem measurement to distinguish between the two tensor-product states. 
    more » « less