2000 character limit reached
On small set of one-way LOCC indistinguishability of maximally entangled states
Published 25 Jan 2015 in quant-ph | (1501.06100v2)
Abstract: In this paper, we study the one-way local operations and classical communication (LOCC) problem. In $\mathbb{C}d\otimes\mathbb{C}d$ with $d\geq4$, we construct a set of $3\lceil\sqrt{d}\rceil-1$ one-way LOCC indistinguishable maximally entangled states which are generalized Bell states. Moreover, we show that there are four maximally entangled states which cannot be perfectly distinguished by one-way LOCC measurements for any dimension $d\geq 4$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.