English

Equality condition for a matrix inequality by partial transpose

Quantum Physics 2025-08-27 v1

Abstract

The partial transpose map is a linear map widely used quantum information theory. We study the equality condition for a matrix inequality generated by partial transpose, namely \rank(j=1KAjTBj)K\rank(j=1KAjBj)\rank(\sum^K_{j=1} A_j^T \otimes B_j)\le K \cdot \rank(\sum^K_{j=1} A_j \otimes B_j), where AjA_j's and BjB_j's are respectively the matrices of the same size, and KK is the Schmidt rank. We explicitly construct the condition when AiA_i's are column or row vectors, or 2×22\times 2 matrices. For the case where the Schmidt rank equals the dimension of AjA_j, we extend the results from 2×22\times 2 matrices to square matrices, and further to rectangular matrices. In detail, we show that j=1KAjBj\sum^K_{j=1} A_j \otimes B_j is locally equivalent to an elegant block-diagonal form consisting solely of identity and zero matrices. We also study the general case for K=2K=2, and it turns out that the key is to characterize the expression of matrices AjA_j's and BjB_j's.

Cite

@article{arxiv.2508.18644,
  title  = {Equality condition for a matrix inequality by partial transpose},
  author = {Nalan Wang and Lin Chen},
  journal= {arXiv preprint arXiv:2508.18644},
  year   = {2025}
}

Comments

21 pages

R2 v1 2026-07-01T05:05:45.551Z