pith. sign in

arxiv: quant-ph/0304027 · v3 · submitted 2003-04-03 · 🪐 quant-ph

Distinguishability of complete and unextendible product bases

Sergio De Rinaldis (NNL-National Nanotechnology Laboratory of INFM , ISUFI-Istituto Superiore Universitario per la Formazione Interdisciplinare , University of Lecce , Italy- IBM T.J. Watson Research Center , New York , USA) This is my paper
classification 🪐 quant-ph
keywords loccproductbasescompletedistinguishdistinguishabilityinfinitestates
0
0 comments X
read the original abstract

It is not always possible to distinguish multipartite orthogonal states if only local operation and classical communication (LOCC) are allowed. We prove that we cannot distinguish the states of an unextendible product basis (UPB) by LOCC even when infinite resources (infinite-dimensional ancillas, infinite number of operations). Moreover we give a necessary and sufficient condition for the LOCC distinguishability of complete product bases.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.