Hiding entanglement in classical bits
Entanglement and in particular bipartite entanglement is the key
resource for many
quantum information processing tasks. Thus, it is extremely important to
find secure
ways to distribute entanglement among distant parties. In this talk I
will discuss several
methods to hide entanglement in classical bits and focus on the hidden
entanglement,
the entanglement of assistance, the localizable entanglement and the
entanglement of
collaboration. In particular, I will show that one classical bit can
unlock at most one ebit.