Related papers: Strong bounds on required resources for quantum ch…
We describe a general approach to proving the impossibility of implementing a quantum channel by local operations and classical communication (LOCC), even with an infinite number of rounds, and find that this can often be demonstrated by…
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 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…
In this paper, we study the number of rounds of communication needed to implement certain tasks by local quantum operations and classical communication (LOCC). We find that the class of LOCC operations becomes strictly more powerful as more…
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…
We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…
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…
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)…
We give a necessary condition that a separable measurement can be implemented by local quantum operations and classical communication (LOCC) in any finite number of rounds of communication, generalizing and strengthening a result obtained…
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…
We start with the task of discriminating finitely many multipartite quantum states using LOCC protocols, with the goal to optimize the probability of correctly identifying the state. We provide two different methods to show that finitely…
A powerful operational paradigm for distributed quantum information processing involves manipulating pre-shared entanglement by local operations and classical communication (LOCC). The LOCC round complexity of a given task describes how…
Measurements that can be implemented via local operations and classical communication (LOCC) constitute a class of operations that is available in future quantum networks in which parties share entangled resource states. We characterise the…
In this paper we study the subset of generalized quantum measurements on finite dimensional systems known as local operations and classical communication (LOCC). While LOCC emerges as the natural class of operations in many important…
Following initial work by Gregoratti and Werner [J. Mod. Optics 50, 913-933, 2003 and quant-ph/0403092] and Hayden and King [quant-ph/0409026], we study the problem of the capacity of a quantum channel assisted by a "friendly (channel)…
Classical communication plays a crucial role to distinguish locally a class of quantum states. Despite considerable advances, we have very little knowledge about the number of measurement and communication rounds needed to implement a…
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…
We prove that there is a trade-off relation between the entanglement cost and the number of rounds of communication, for two distant parties to accomplish a bidirectional quantum information task by local operations and classical…
In a seminal work [PRL85.4972], Walgate, Short, Hardy, and Vedral prove in finite dimensions that for every pair of pure multipartite orthogonal quantum states, there exists a one-way local operations and classical communication (LOCC)…
We present a method to detect lower bounds to the classical capacity of quantum communication channels by means of few local measurements (i.e. without complete process tomography), reconstruction of sets of conditional probabilities, and…