In the present paper we initiate the study of the product higher rank numerical range. The latter, being a variant of the higher rank numerical range [M.-D. Choi et al., Rep. Math. Phys. 58, 77 (20...
In the present paper we initiate the study of the product higher rank numerical range. The latter, being a variant of the higher rank numerical range [M.--D. Choi {\it et al.}, Rep. Math. Phys. {\bf 58}, 77 (2006); Lin. Alg. Appl. {\bf 418}, 828 (2006)], is a natural tool for studying a construction of quantum error correction codes for multiple access channels. We review properties of this set and relate it to other numerical ranges, which were recently introduced in the literature. Further, the concept is applied to the construction of codes for bi--unitary two--access channels with a hermitian noise model. Analytical techniques for both outerbounding the product higher rank numerical range and determining its exact shape are developed for this case. Finally, the reverse problem of constructing a noise model for a given product range is considered.
We address various aspects of a widely used tool in quantum information theory: the Choi-Jamiolkowski isomorphism [A. Jamiolkowski, Rep. Math. Phys., 3, 275 (1972)]. We review different versions of the isomorphism, their properties and propose a unified description that combines them all. To this end, we identify the physical reason for the appearance of the (basis-dependent) operation of transposition in the isomorphism as used in Choi's theorem [M.-D. Choi, Lin. Alg. Appl., 10, 285 (1975)]. This requires a careful distinction between Jordan algebras and the different C*-algebras they arise from, which are distinguished by their order of composition. Physically, the latter encodes a choice of time orientation in the respective algebras, which relates to a number of recent results, including a characterisation of quantum from more general non-signalling bipartite correlations [M. Frembs and A. Döring, arXiv:2204.11471] and a classification of bipartite entanglement [M. Frembs, arXiv:2207.00024].
Abstract The Choi–Jamiołkowski isomorphism is an essential component in every quantum information theorist’s toolkit: it allows to identify linear maps between two quantum systems with linear operators on the composite system. Here, we analyse this widely used gadget from a new perspective. Namely, we explicitly distinguish between its kinematical and dynamical properties, that is, we study the isomorphism on two different levels: Jordan algebras and the different C ∗ -algebras they arise from, which are distinguished by their order of composition. A number of important and novel insights stem from our analysis. We find that Choi’s theorem, which asserts that Choi’s version of the isomorphism (Choi 1975 Lin. Alg. Appl. 10 285) further maps the positive cone of completely positive linear maps (such as quantum channels) to the cone of positive linear operators (such as quantum states) on the composite system, crucially depends on the dynamical structure in C ∗ -algebras. We explain in detail how this dependence gives rise to the mismatch between the basis-dependence of Choi’s version of the isomorphism, and the basis-independent version by Jamiołkowski (1972 Rep. Math. Phys. 3 275). We then overcome this subtle but pervasive issue in a number of ways: first, we prove a version of Choi’s theorem for Jamiołkowski’s isomorphism, second, we define a basis-independent variant of Choi’s isomorphism and, third, by making explicit the dynamical distinction between Jordan and C ∗ -algebras, we combine the different variants of the isomorphism into a unified description, that subsumes their individual features. We also embed and interpret our results in the graphical calculus of categorical quantum mechanics.