A Deterministic Polynomial--Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks

We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the well-known multicast network coding scheme of Jaggi et al. to linear deterministic relay networks and is based on the notion of flow for a unicast session that was introduced by the authors in earlier work. We present randomized and deterministic polynomial--time versions of our algorithm and show that for a network with $g$ destinations, our deterministic algorithm can achieve the capacity in $\left\lceil \log(g+1)\right\rceil$ uses of the network.Comment: 12 pages, 2 figures, submitted to CISS 201

Coarse Graining Makes It Hard to See Micro-Macro Entanglement

Observing quantum effects such as superpositions and entanglement in macroscopic systems requires not only a system that is well protected against environmental decoherence, but also sufficient measurement precision. Motivated by recent experiments, we study the effects of coarse-graining in photon number measurements on the observability of micro-macro entanglement that is created by greatly amplifying one photon from an entangled pair. We compare the results obtained for a unitary quantum cloner, which generates micro-macro entanglement, and for a measure-and-prepare cloner, which produces a separable micro-macro state. We show that the distance between the probability distributions of results for the two cloners approaches zero for a fixed moderate amount of coarse-graining. Proving the presence of micro-macro entanglement therefore becomes progressively harder as the system size increases.Comment: 5 pages, 3 figure