Almost every set of N≥d+1N\ge d+1 orthogonal states on d⊗nd^{\otimes n} is locally indistinguishable

preprint2008arXivOpen access

Abstract

I consider the problem of deterministically distinguishing the state of a multipartite system, from a set of N≥d+1N\ge d+1 orthogonal states, where dd is the dimension of each party's subsystem. It is shown that if the set of orthogonal states is chosen at random, then there is a vanishing probability that this set will be perfectly distinguishable under the restriction that the parties use only local operations on their subsystems and classical communication amongst themselves.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.