On one-parameter families of hermiticity-preserving superoperators which are not positive
Grzegorz Pastuszak, Alicja Jaworska-Pastuszak, Takeo Kamizawa, Andrzej, Jamio{\l}kowski

TL;DR
This paper develops criteria to determine when a one-parameter family of hermiticity-preserving superoperators fails to be positive, using polynomial sign variation methods like Descartes rule of signs and Sturm-Tarski theorem.
Contribution
It introduces computable sign variation formulas to analyze nonpositivity in parameterized superoperator families, extending existing mathematical tools.
Findings
Provides sufficient conditions for superoperators to be nonpositive
Establishes links between nonpositivity at a point and over intervals
Introduces sign variation formulas for polynomial analysis
Abstract
A one-parameter family of hermiticity-preserving superoperators is a time-dependent family of hermiticity-preserving superoperators determined, in a certain sense, by real and complex polynomial functions in the variable . The paper studies sufficient computable criteria for nonpositivity of superoperators in one-parameter families. More precisely, we give sufficient conditions for the following assertions to hold: every is not positive, is not positive for in some open interval and there is some which is not positive. We show that in some situations implies . Our approach to the problem is based on the Descartes rule of signs and the Sturm-Tarski theorem. In order to apply these…
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.
Taxonomy
TopicsPolynomial and algebraic computation · Matrix Theory and Algorithms · Advanced Topics in Algebra
