Vertex-transitive quantum graphs are defined by analogy to classical graphs and all simple examples in M3(C) are classified up to isomorphism via a new panoramic polynomial invariant.
Quantum Wasserstein distance of order 1 between channels
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OA 2verdicts
UNVERDICTED 2representative citing papers
Develops metrics on unital completely positive maps via noncommutative geometry seminorms and a C*-algebraic Choi-Jamiołkowski analogue that satisfy stability and chaining under suitable conditions.
citing papers explorer
-
Vertex-transitive quantum graphs
Vertex-transitive quantum graphs are defined by analogy to classical graphs and all simple examples in M3(C) are classified up to isomorphism via a new panoramic polynomial invariant.
-
Metrics on completely positive maps via noncommutative geometry
Develops metrics on unital completely positive maps via noncommutative geometry seminorms and a C*-algebraic Choi-Jamiołkowski analogue that satisfy stability and chaining under suitable conditions.