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• 0 citations
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

A Research on some Approaches and Properties of Quantum Graphs: an Introduction

Mithleshwari Ghormare, Alok Kumar

Journal of Advances and Scholarly Researches in Allied Education•Jul 1, 2018•0 citations

Parametrizations of Positive Matrices With Applications

H Zhou, M Tseng, V Ramakrishna

The purpose of this work is twofold.The first is to survey some parametrizations of positive matrices which have found applications in quantum information theory.The second is to provide some more applications of a parametrization of quantum states and channels introduced by T. Constantinescu and the last author, and thereby to provide further evidence of the utility of this parametrization.

Chapman & Hall/CRC applied mathematics and nonlinear science series•Sep 19, 2007•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
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.