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

Physics Letters A

Who's afraid of not completely positive maps?

Anil Shaji, E. C. G. Sudarshan

Published Apr 24, 2005• 183 citations
Publisher
DOI
10.1016/j.physleta.2005.04.029

Related papers

Completely Positive Maps

Princeton University Press eBooks•Jan 10, 2009•0 citations

Completely Positive Maps

WORLD SCIENTIFIC eBooks•Feb 12, 2017•0 citations

Roots of completely positive maps

B. V. Rajarama Bhat, Robin Hillier, Nirupama Mallick +1 more

arXiv:1812.08123•Linear Algebra and its Applications•Nov 1, 2019•4 citations

Modules and extremal completely positive maps

Juha-Pekka Pellonpää

Positivity•Mar 21, 2013•8 citations

Positive maps that are not completely positive

Sixia Yu

The concept of the half density matrix is proposed. It unifies the quantum states that are described by density matrices and physical processes that are described by completely positive maps. With the help of the half-density-matrix representation of the Hermitian linear map, we show that every positive map that is not completely positive is a difference of two completely positive maps. A necessary and sufficient condition for a positive map that is not completely positive is also presented, which is illustrated by some examples.

arXiv:quant-ph/0001053•Physical Review A•Jul 20, 2000•19 citations

Implementing positive maps with multiple copies of an input state

Qingxiuxiong Dong, Marco Túlio Quintino, Akihito Soeda +1 more

Valid transformations between quantum states are necessarily described by completely positive maps, instead of just positive maps. Positive but not completely positive maps such as the transposition map cannot be implemented due to the existence of entanglement in composite quantum systems, but there are classes of states for which the positivity is guaranteed, e.g., states not correlated to other systems. this paper, we report on the concept of $N$-copy extension of maps to quantitatively analyze the difference between positive maps and completely positive maps. We consider implementations of the action of positive but not completely positive maps on uncorrelated states by allowing an extra resource of consuming multiple copies of the input state and characterize the positive maps in terms of implementability with multiple copies. We show that by consuming multiple copies, the set of implementable positive maps becomes larger, and almost all positive maps are implementable with finite copies of an input state. The number of copies of the input state required to implement a positive map quantifies the degree by which a positive map violates complete positivity. We then analyze the optimal $N$-copy implementability of a noisy version of the transposition map.

arXiv:1808.05788•Physical Review A•May 30, 2019•7 citations
The concept of the half density matrix is proposed. It unifies the quantum states that are described by density matrices and physical processes that are described by completely positive maps. With the help of the half-density-matrix representation of the Hermitian linear map, we show that every positive map that is not completely positive is a difference of two completely positive maps. A necessary and sufficient condition for a positive map that is not completely positive is also presented, which is illustrated by some examples.
Valid transformations between quantum states are necessarily described by completely positive maps, instead of just positive maps. Positive but not completely positive maps such as the transposition map cannot be implemented due to the existence of entanglement in composite quantum systems, but there are classes of states for which the positivity is guaranteed, e.g., states not correlated to other systems. this paper, we report on the concept of NNN-copy extension of maps to quantitatively analyze the difference between positive maps and completely positive maps. We consider implementations of the action of positive but not completely positive maps on uncorrelated states by allowing an extra resource of consuming multiple copies of the input state and characterize the positive maps in terms of implementability with multiple copies. We show that by consuming multiple copies, the set of implementable positive maps becomes larger, and almost all positive maps are implementable with finite copies of an input state. The number of copies of the input state required to implement a positive map quantifies the degree by which a positive map violates complete positivity. We then analyze the optimal NNN-copy implementability of a noisy version of the transposition map.