Implementing positive maps with multiple copies of an input state

Abstract

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. In this paper, we introduce 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 comment12 pages

References in corpus (18)

• Separability Criterion for Density Matrices
• Separability of Mixed States: Necessary and Sufficient Conditions
• Experimental Quantum State Tomography of Optical Fields and Ultrafast Statistical Sampling
• Unknown Quantum States and Operations, a Bayesian View
• Optimal Quantum Cloning Machines
• Optimal Cloning of Pure States
• A complete family of separability criteria
• Distinguishing separable and entangled states
• Direct detection of quantum entanglement
• One-and-a-half quantum de Finetti theorems
• The power of symmetric extensions for entanglement detection
• On the existence of physical transformations between sets of quantum states
• Extending quantum operations
• Optimal realization of the transposition maps
• Certifying quantumness: Benchmarks for the optimal processing of generalized coherent and squeezed states
• The Mathematics of Entanglement
• $k$-extendibility of high-dimensional bipartite quantum states
• Symmetric vs. bosonic extension for bipartite states

Cited by in corpus (5)

• Probabilistic exact universal quantum circuits for transforming unitary operations
• Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality
• Operational applications of the diamond norm and related measures in quantifying the non-physicality of quantum maps
• Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
• The quantum switch is uniquely defined by its action on unitary operations