Completely Reducible maps in Quantum Information Theory
Daniel Cariello

TL;DR
This paper explores conditions under which associated self-adjoint maps in quantum information are completely reducible, providing new proofs and characterizations for PPT, SPC, and realignment-invariant matrices, with implications for quantum state decompositions.
Contribution
It establishes that certain classes of matrices in quantum information theory have completely reducible associated maps and characterizes these classes using group actions and invariance properties.
Findings
Associated self-adjoint maps are completely reducible for PPT, SPC, and realignment-invariant matrices.
Every realignment-invariant matrix in M_2⊗M_2 is PPT, with a counterexample for higher dimensions.
The paper provides new proofs for known theorems and characterizes matrix classes with reducible associated maps.
Abstract
In order to compute the Schmidt decomposition of , we must consider an associated self-adjoint map. Here, we show that if is positive under partial transposition (PPT) or symmetric with positive coefficients (SPC) or invariant under realignment then its associated self-adjoint map is completely reducible. We give applications of this fact in Quantum Information Theory. We recover some theorems recently proved for PPT and SPC matrices and we prove these theorems for matrices invariant under realignment using theorems of Perron-Frobenius theory. We also provide a new proof of the fact that if contains mutually unbiased bases then contains . We search for other types of matrices that could have the same property. We consider a group of linear transformations acting on , which contains the partial…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
