Curator's Take
AI Commentary
This article sharpens the emerging resource‑theoretic view of completely positive (CP) matrices by delivering exact characterisations of CP‑preserving channels in low‑dimensional systems and identifying necessary constraints for higher dimensions, a step that bridges abstract linear‑algebra results with quantum information practice. By exposing a counterexample where the trace‑distance measure of non‑negativity fails strong monotonicity, it cautions against naïvely adopting classical distance metrics as resource quantifiers in quantum settings. The proofs that certain CP‑DNN maps are automatically completely positive and completely copositive further streamline verification of admissible operations, which could simplify algorithm design for optimisation problems that rely on CP structures. Together these insights tighten the theoretical foundations needed for reliable exploitation of CP resources across quantum algorithms and optimization pipelines.
— Mark Eatherly
Summary
Completely positive (CP) matrices are ubiquitous in modern science and technology with applications in optimization, graph theory, and quantum entanglement. Recently, Johnston \emph{et al.} [Linear Algebra and its Applications, 2022] have cast CP matrices into the framework of quantum resource theories, where CP states serve as free states and CP-preserving channels act as free operations. This work addresses several questions raised in their work. Specifically, we provide the necessary and sufficient conditions of CP-preserving channels in small dimensions, which are necessary in higher dimensions, and discuss the resource quantification via the trace distance of non-negativity. By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity. We also provide an alternative proof that every CPDNN channel $Φ:\MM_n\to \MM_2$ is CPCP. Additionally, we show that any unital CPDNN map $Φ:\MM_2\to \MM_n$ is also CPCP.