16 problems
Positive–PPT composition conjecture. The composition
Let be linear maps. A map is PPT when both and are completely positive, and it is entanglement break…
Let denote the matrix algebra in the paper. A linear map is PPT if it is completely positive and completely copositive, meaning that both…
Minimal Rényi sufficiency conjecture. The family provides a sufficient family of divergences for interconversion of finite-dimensional density matrices via posi…
Let , and let be an IPT map, meaning that its Choi matrix is invariant under partial trans…
Tensor stable positivity conjecture. The set of yes-instances of tensor stable positivity, denoted , is not recursively enumerable.
Let be a matrix algebra, and let be states. Let denote their block Schur pro…
Let denote the algebra of complex matrices. Let be completely positive and completely copositi…
Let denote the algebra of complex matrices. Let … be linear maps, each completely positive and completely copositive. For a positive matrix…
Let denote the algebra of complex matrices, and let be a linear map. Its Choi matrix is denoted by , and…
Let denote the algebra of complex matrices, and let be a linear map. A map is completely positive if all its a…
Kye's conjecture. Every 2-positive, respectively 2-copositive, linear map in is decomposable.
Let be a positivity-improving Kraus map, meaning a Kraus map satisfying strict positivity, and let and be density matrices. Let…
Let denote the set of block-positive symmetries under consideration, and let be a partial symmetry for . Partial-symmetry conjecture. The r…
Optimality conjecture for . For , the positive maps are optimal.
Let be a normalized entanglement witness with , and define … The structural physical approximation (SPA) of is an operator satisfying…