It is believed that quantum communication is not possible with a pure ensemble of states because quantum entropy of pure state is zero. This is indeed possible due to geometric consequence of entanglement.
The newfound importance of ``entanglement as a resource'' in quantum computation and quantum communication compels us to quantify it in as many distinct ways as possible. Here we explore a new measure of entanglement for mixed quantum states of bipartite systems, which we name the Entanglement of Assistance. We show it to be the maximum average entanglement of all pure-state ensembles consistent with the given density matrix. In this sense, the Entanglement of Assistance is a quantity directly dual to the more standard Entanglement of Formation. With the help of lower and upper bounds, we calculate the Entanglement of Assistance for a few cases and use these results to show that it possesses the surprising property of superadditivity. We believe that this may shed some light on the question of additivity for the Entanglement of Formation.
We show that the possible ensembles produced when a separable operation acts on a single pure bipartite entangled state are completely characterized by a majorization condition, a collection of inequalities for Schmidt coefficients, which is identical to that already known for the particular case of local operations and classical communication (LOCC). As a consequence, various known results for LOCC, including some involving monotonicity of entanglement, can be extended to the class of all separable operations.
Any given density matrix can be represented as an infinite number of ensembles of pure states. This leads to the natural question of how to uniquely select one out of the many, apparently equally-suitable, possibilities. Following Jaynes' information-theoretic perspective, this can be framed as an inference problem. We propose the Maximum Geometric Quantum Entropy Principle to exploit the notions of Quantum Information Dimension and Geometric Quantum Entropy. These allow us to quantify the entropy of fully arbitrary ensembles and select the one that maximizes it. After formulating the principle mathematically, we give the analytical solution to the maximization problem in a number of cases and discuss the physical mechanism behind the emergence of such maximum entropy ensembles.