2

Separation Between Quantum Lovász Number and Entanglement-Assisted Zero-Error Classical Capacity
Quantum Lovász number, as a natural generalization of the celebrated Lovśz number in graph theory, is the best known efficiently …
PDF Cite DOI
Tripartite-to-Bipartite Entanglement Transformation by Stochastic Local Operations and Classical Communication and the Structure of Matrix Spaces
We study the problem of transforming a tripartite state to a bipartite one using stochastic local operations and classical …
PDF Cite DOI
Irreversibility of Asymptotic Entanglement Manipulation Under Quantum Operations Completely Preserving Positivity of Partial Transpose
We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve positivity …
Cite DOI
Approximate broadcasting of quantum correlations
Broadcasting quantum and classical information is a basic task in quantum information processing, and is also a useful model in the …
Cite DOI
Nonadditivity of Rains' bound for distillable entanglement
Rains’ bound is arguably the best known upper bound of the distillable entanglement by operations completely preserving …
PDF Cite DOI
Indistinguishability of bipartite states by positive-partial-transpose operations in the many-copy scenario
A bipartite subspace $S$ is called strongly positive-partial-transpose-unextendible (PPT-unextendible) if for every positive integer …
PDF Cite DOI
Improved semidefinite programming upper bound on distillable entanglement
© 2016 American Physical Society.An additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper …
PDF Cite DOI