Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Infinite Dimensional Analysis Quantum Probability and Related Topics

ON EFFECTIVE METHODS OF INVESTIGATION OF NONPOSITIVE MAPS

Andrzej Jamiołkowski

Published Nov 1, 2023• 0 citations
Publisher

Abstract

The main aim of the paper is to give an effective procedure which allows us to distinguish between positive and nonpositive maps inside the set of all hermiticity preserving linear transformations. This procedure is important because we do not have any effective method of characterizing positive maps which are not completely positive. The fundamental role in our considerations is played by the well-known in literature matrix CJ. We analyze signs of eigenvalues of this matrix for a given superoperator Φ.

DOI
10.1142/9789811275999_0009

Related papers

On maps which preserve semipositivity and quantifier elimination theory for real numbers

Grzegorz Pastuszak, Adam Skowyrski, Andrzej Jamiołkowski

Assume that [Formula: see text] is a superoperator which preserves hermiticity. We give an algorithm determining whether [Formula: see text] preserves semipositivity (we call [Formula: see text] positive in this case). Our approach to the problem has a model-theoretic nature, namely, we apply techniques of quantifier elimination theory for real numbers. An approach based on these techniques seems to be the only one that allows to decide whether an arbitrary hermiticity-preserving [Formula: see text] is positive. Before we go to detailed analysis of the problem, we argue that quantifier elimination for real numbers (and also for complex numbers) can play a significant role in quantum information theory and other areas as well.

arXiv:2003.07772•Communications in Contemporary Mathematics•Nov 20, 2020•4 citations

A Simple Proof of the Jamiołkowski Criterion for Complete Positivity of Linear Maps

David Cienfuegos Salgado, J. L. Sánchez‐Gómez, Miguel Ferrero

We give a simple direct proof of the Jamiołkowski criterion to check whether a linear map between matrix algebras is completely positive or not. This proof is more accessible for physicists than other ones found in the literature and provides a systematic method to give any set of Kraus matrices of the Kraus decomposition.

arXiv:math-ph/0406010•Open Systems & Information Dynamics•Mar 1, 2005•15 citations

Characterization of preorders induced by positive maps in the set of Hermitian matrices

Julio I. de Vicente

Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. In this work I characterize the existence of such a transformation when one of the conditions of unitality or trace preservation is dropped. This induces two possible preorders in the set of Hermitian matrices and I argue how this can be used to construct measures quantifying the lack of positive semidefiniteness of any given Hermitian matrix with relevant monotonicity properties. It turns out that the measures in each of the two formalisms are essentially unique.

arXiv:2105.08778•May 18, 2021•0 citations

EFFECTIVE METHODS IN INVESTIGATION OF IRREDUCIBLE QUANTUM OPERATIONS

Andrzej Jamiołkowski

In this paper we discuss some constructive procedures which can be used in characterization of irreducible quantum operations and quantum channels. Our method makes use of an explicit form of a fixed operation in its Kraus representation. A generalization of the Shemesh criterion is discussed.

International Journal of Geometric Methods in Modern Physics•Mar 1, 2012•1 citation

POSITIVE MAPS AND SEPARABLE STATES IN MATRIX ALGEBRAS

Andrzej Kossakowski

A class of linear positive, trace preserving maps in M n is given in terms of affine maps in ℝ n2–1 which map the close unit ball into itself. The above class contains atomic maps considered by Tanahashi and Tomiyama.

•Mar 1, 2006•0 citations

On One-Parameter Families of Hermiticity-Preserving Superoperators which Are Not Positive

Grzegorz Pastuszak, Alicja Jaworska-Pastuszak, Takeo Kamizawa

A one-parameter family of hermiticity-preserving superoperators is a time-dependent family [Formula: see text] of hermiticity-preserving superoperators determined, in a certain sense, by real and complex polynomial functions in the variable [Formula: see text]. 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: [Formula: see text] every [Formula: see text] is not positive, [Formula: see text] [Formula: see text] is not positive for [Formula: see text] in some [Formula: see text] and [Formula: see text] there is some [Formula: see text] which is not positive. We show that [Formula: see text] implies [Formula: see text]. Our approach to the problem is based on the Descartes rule of signs and the Sturm-Tarski theorem. In order to apply these facts, we introduce the sign variation formulas. These formulas are first order logical formulas in one variable [Formula: see text], generalising sign sequences of polynomials used in Descartes rule of signs.

arXiv:2411.11035•Open Systems & Information Dynamics•Mar 1, 2025•2 citations
The main aim of the paper is to give an effective procedure which allows us to distinguish between positive and nonpositive maps inside the set of all hermiticity preserving linear transformations. This procedure is important because we do not have any effective method of characterizing positive maps which are not completely positive. The fundamental role in our considerations is played by the well-known in literature matrix CJ. We analyze signs of eigenvalues of this matrix for a given superoperator Φ.
Assume that [Formula: see text] is a superoperator which preserves hermiticity. We give an algorithm determining whether [Formula: see text] preserves semipositivity (we call [Formula: see text] positive in this case). Our approach to the problem has a model-theoretic nature, namely, we apply techniques of quantifier elimination theory for real numbers. An approach based on these techniques seems to be the only one that allows to decide whether an arbitrary hermiticity-preserving [Formula: see text] is positive. Before we go to detailed analysis of the problem, we argue that quantifier elimination for real numbers (and also for complex numbers) can play a significant role in quantum information theory and other areas as well.
Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix AAA into another BBB if and only if the vector of eigenvalues of AAA majorizes that of BBB. In this work I characterize the existence of such a transformation when one of the conditions of unitality or trace preservation is dropped. This induces two possible preorders in the set of Hermitian matrices and I argue how this can be used to construct measures quantifying the lack of positive semidefiniteness of any given Hermitian matrix with relevant monotonicity properties. It turns out that the measures in each of the two formalisms are essentially unique.
A one-parameter family of hermiticity-preserving superoperators is a time-dependent family [Formula: see text] of hermiticity-preserving superoperators determined, in a certain sense, by real and complex polynomial functions in the variable [Formula: see text]. 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: [Formula: see text] every [Formula: see text] is not positive, [Formula: see text] [Formula: see text] is not positive for [Formula: see text] in some [Formula: see text] and [Formula: see text] there is some [Formula: see text] which is not positive. We show that [Formula: see text] implies [Formula: see text]. Our approach to the problem is based on the Descartes rule of signs and the Sturm-Tarski theorem. In order to apply these facts, we introduce the sign variation formulas. These formulas are first order logical formulas in one variable [Formula: see text], generalising sign sequences of polynomials used in Descartes rule of signs.