Related papers: When asymptotic LOCC offers no advantage over fini…
We provide a necessary condition that a quantum measurement can be implemented by the class of protocols known as Local Operations and Classical Communication, or LOCC, including when an error is allowed but must vanish in the limit of an…
We prove a necessary condition that a quantum channel on a multipartite system may be approximated arbitrarily closely using local operations and classical communication (LOCC). We then extend those arguments to obtain a condition that…
In this paper, we consider the problem of discriminating quantum states by local operations and classical communication (LOCC) when an arbitrarily small amount of error is permitted. This paradigm is known as asymptotic state…
We revisit the problem of discriminating orthogonal quantum states within the local quantum operation and classical communication (LOCC) paradigm. Our particular focus is on the asymptotic situation where the parties have infinite resources…
Quantum state discrimination involves identifying a given state out of a set of possible states. When the states are mutually orthogonal, perfect state discrimination is always possible using a global measurement. In the case of…
Every measurement that can be implemented by local quantum operations and classical communication (LOCC) using an infinite number of rounds is the limit of a sequence of measurements each of which requires only a finite number of rounds.…
We can only perform a finite rounds of measurements in protocols with local operations and classical communication (LOCC). In this paper, we propose a set of product states, which require infinite rounds of measurements in order to…
We consider the problem of local operations and classical communication (LOCC) discrimination between two bipartite pure states of fermionic systems. We show that, contrary to the case of quantum systems, for fermionic systems it is…
We provide rigorous, efficiently computable and tight bounds on the average error probability of multiple-copy discrimination between qubit mixed states by Local Operations assisted with Classical Communication (LOCC). In contrast to the…
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…
We provide a method of designing protocols for implementing multipartite quantum measurements when the parties are restricted to local operations and classical communication (LOCC). For each finite integer number of rounds, $r$, the method…
We examine the problem of using local operations and classical communication (LOCC) to distinguish a known pure state from an unknown (possibly mixed) state, bounding the error probability from above and below. We study the asymptotic rate…
We give a conceptually simple necessary condition such that a separable quantum operation can be implemented by local operations on subsystems and classical communication between parties (LOCC), a condition which follows from a novel…
In a recent paper \cite{mySEPvsLOCC}, we showed how to construct a quantum protocol for implementing a bipartite, separable quantum measurement using only local operations on subsystems and classical communication between parties (LOCC)…
The paper studies unambiguous discrimination of Fermionic states through local operations and classical communication (LOCC). In the task of unambiguous discrimination, no error is tolerated but an inconclusive result is allowed. We show…
We consider an infinite class of unambiguous quantum state discrimination problems on multipartite systems, described by Hilbert space $\cal{H}$, of any number of parties. Restricting consideration to measurements that act only on…
Local operations on subsystems and classical communication between parties (LOCC) constitute the most general protocols available on spatially separated quantum systems. Every LOCC protocol implements a separable generalized measurement --…
The problem behind this paper is, if the number of queries to unitary operations is fixed, say $k$, then when do local operations and classical communication (LOCC) suffice for optimally distinguishing bipartite unitary operations? We…
Two types of results are presented for distinguishing pure bipartite quantum states using Local Operations and Classical Communications. We examine sets of states that can be perfectly distinguished, in particular showing that any three…
We consider one copy of a quantum system prepared in one of two non-orthogonal pure product states of multipartite distributed among separated parties. We show that there exist protocols which obtain optimal probability in the sense of…