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

AKCE International Journal of Graphs and Combinatorics

Completely positive graphs and entanglement of quantum states

Abraham Berman

Published May 4, 2023• 1 citation
Publisher

Abstract

We present a short survey on completely positive matrices and on their application to quantum information
DOI
10.1080/09728600.2023.2235393

Related papers

CP-preserving channels

Indu Bala, Sourav Das, Swapan Rana

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.

quant-pharXiv:2607.24682•Jul 28, 2026•0 citations

Entanglement in multipartite quantum systems in the context of graph states

Junyi WU

•Apr 22, 2015•0 citations

Pairwise completely positive matrices with applications in Quantum Information Theory

Olivia R. MacLean

This thesis introduces a generalization of the set of completely positive matrices that we call “pairwise completely positive” (PCP) matrices. PCP matrix pairs are defined so that one matrix in the pair is necessarily positive semidefinite while the other is necessarily entrywise non-negative. After PCP matrices are defined we explore their basic properties and establish numerous necessary and sufficient conditions that can help test whether or not a pair meets our definition of PCP. We then relate these matrix pairs to the separability of conjugate local diagonal unitary invariant (CLDUI) quantum states. In particular, we show that determining whether or not a pair of matrices is pairwise completely positive is equivalent to determining whether or not a corresponding CLDUI state is separable.

•Apr 8, 2019•0 citations

Entropy of Completely Positive Maps and Applications to Quantum Information Theory

Ichiro Fujimoto

Trends in mathematics•Jan 1, 2016•0 citations

Which Graph States are Useful for Quantum Information Processing?

Mehdi Mhalla, Mio Murao, Simon Perdrix +2 more

arXiv:1006.2616•Lecture notes in computer science•Jan 1, 2014•42 citations

Pairwise Completely Positive Matrices and Conjugate Local Diagonal Unitary Invariant Quantum States

Nathaniel Johnston, Olivia R. MacLean

A generalization of the set of completely positive matrices called pairwise completely positive (PCP) matrices is introduced. These are pairs of matrices that share a joint decomposition so that one of them is necessarily positive semidefinite while the other one is necessarily entrywise non-negative. Basic properties of these matrix pairs are explored and several testable necessary and sufficient conditions are developed to help determine whether or not a pair is PCP. A connection with quantum entanglement is established by showing that determining whether or not a pair of matrices is pairwise completely positive is equivalent to determining whether or not a certain type of quantum state, called a conjugate local diagonal unitary invariant state, is separable. Many of the most important quantum states in entanglement theory are of this type, including isotropic states, mixed Dicke states (up to partial transposition), and maximally correlated states. As a specific application of these results, a wide family of states that have absolutely positive partial transpose are shown to in fact be separable.

arXiv:1807.06897•Electronic Journal of Linear Algebra•Feb 1, 2019•15 citations
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.
This thesis introduces a generalization of the set of completely positive matrices that we call “pairwise completely positive” (PCP) matrices. PCP matrix pairs are defined so that one matrix in the pair is necessarily positive semidefinite while the other is necessarily entrywise non-negative. After PCP matrices are defined we explore their basic properties and establish numerous necessary and sufficient conditions that can help test whether or not a pair meets our definition of PCP. We then relate these matrix pairs to the separability of conjugate local diagonal unitary invariant (CLDUI) quantum states. In particular, we show that determining whether or not a pair of matrices is pairwise completely positive is equivalent to determining whether or not a corresponding CLDUI state is separable.
A generalization of the set of completely positive matrices called pairwise completely positive (PCP) matrices is introduced. These are pairs of matrices that share a joint decomposition so that one of them is necessarily positive semidefinite while the other one is necessarily entrywise non-negative. Basic properties of these matrix pairs are explored and several testable necessary and sufficient conditions are developed to help determine whether or not a pair is PCP. A connection with quantum entanglement is established by showing that determining whether or not a pair of matrices is pairwise completely positive is equivalent to determining whether or not a certain type of quantum state, called a conjugate local diagonal unitary invariant state, is separable. Many of the most important quantum states in entanglement theory are of this type, including isotropic states, mixed Dicke states (up to partial transposition), and maximally correlated states. As a specific application of these results, a wide family of states that have absolutely positive partial transpose are shown to in fact be separable.