2000 character limit reached
Majorization in some symplectic weak supermajorizations
Published 8 Apr 2024 in math.FA, math-ph, math.MP, math.SG, math.SP, and quant-ph | (2404.05795v2)
Abstract: Symplectic eigenvalues are known to satisfy analogs of several classic eigenvalue inequalities. Of these is a set of weak supermajorization relations concerning symplectic eigenvalues that are weaker analogs of some majorization relations corresponding to eigenvalues. The aim of this letter is to establish necessary and sufficient conditions for the saturation of the symplectic weak supermajorization relations by majorization.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.