Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Structure of local quantum operations and classical communication: Finite versus infinite rounds

Scott M. Cohen

Published Apr 8, 2015• 5 citations
Publisher

Abstract

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, where each measurement in the sequence requires only a finite number of rounds. This rather obvious and well-known fact is nonetheless of interest as it shows that these infinite-round measurements can be approximated arbitrarily closely simply by using more and more rounds of communication. Here we demonstrate the perhaps less obvious result that (at least) for bipartite systems, the reverse relationship also holds. Specifically, we show that every finite-round bipartite LOCC measurement is the limit of a continuous sequence of LOCC measurements, where each measurement in that sequence can be implemented by LOCC, but only with the use of an infinite number of rounds. Thus, the set of LOCC measurements that require an infinite number of rounds is dense in the entirety of LOCC, as is the set of finite-round LOCC measurements. This means there exist measurements that can only be implemented by LOCC by using an infinite number of rounds, but can nonetheless be approximated closely by using one round of communication, and actually in some cases, no communication is needed at all. These results follow from a necessary condition presented here for finite-round LOCC, which is extremely simple to check, is very easy to prove, and which can be violated by utilizing an infinite number of rounds.

DOI
10.1103/physreva.91.042106

Related papers

On the structure of LOCC: finite vs. infinite rounds

Scott M. Cohen

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. This rather obvious and well-known fact is nonetheless of interest as it shows that these infinite-round measurements can be approximated arbitrarily closely simply by using more and more rounds of communication. Here we demonstrate the perhaps less obvious result that (at least) for bipartite systems, the reverse relationship also holds. Specifically, we show that every finite-round bipartite LOCC measurement is the limit of a continuous sequence of LOCC measurements, where each measurement in that sequence can be implemented by LOCC, but only with the use of an infinite number of rounds. Thus, the set of LOCC measurements that require an infinite number of rounds is dense in the entirety of LOCC, as is the set of finite-round LOCC measurements. This means there exist measurements that can only be implemented by LOCC by using an infinite number of rounds, but can nonetheless be approximated closely by using one round of communication, and actually in some cases, no communication is needed at all. These results follow from a new necessary condition for finite-round LOCC, which is extremely simple to check, is very easy to prove, and which can be violated by utilizing an infinite number of rounds.

arXiv:1409.4807•Sep 16, 2014•0 citations

Everything you always wanted to know about LOCC (but were afraid to ask

Eric Chitambar, Debbie Leung, Māris Ozols +1 more

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 quantum information tasks, its mathematical structure is complex and difficult to characterize. Here we provide a precise description of LOCC and related operational classes in terms of quantum instruments. Our formalism captures both finite round protocols as well as those that utilize an unbounded number of communication rounds. While the set of LOCC is not topologically closed, we show that finite round LOCC constitutes a compact subset of quantum operations. Additionally we show the existence of an open ball around the completely depolarizing map that consists entirely of LOCC implementable maps. Finally, we demonstrate a two-qubit map whose action can be approached arbitrarily close using LOCC, but nevertheless cannot be implemented perfectly.

•Aug 17, 2016•181 citations

Asymptotic implementation of multipartite quantum channels and other quantum instruments using local operations and classical communication

Scott M. Cohen

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 applies to all quantum instruments, which range from the most refined case, a generalized measurement, to the most coarse-grained, which is a quantum channel. We illustrate these results by a detailed analysis of a quantum instrument that is known not to be implementable by LOCC, but which can be arbitrarily closely approximated within that framework. As one outgrowth of this analysis, we find a quantum measurement that falls into the same category: it cannot be implemented exactly by LOCC, but can be approximated by LOCC arbitrarily closely. This measurement has an infinite number of outcomes, leaving open the question as to whether or not there exists a measurement within this same category but having only a finite number of outcomes.

arXiv:2310.05362•Oct 9, 2023•0 citations

General Approach to Quantum Channel Impossibility by Local Operations and Classical Communication

Scott M. Cohen

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 solving a set of linear equations. The method also allows one to design a LOCC protocol to implement the channel whenever such a protocol exists in any finite number of rounds. Perhaps surprisingly, the computational expense for analyzing LOCC channels is not much greater than that for LOCC measurements. We apply the method to several examples, two of which provide numerical evidence that the set of quantum channels that are not LOCC is not closed and that there exist channels that can be implemented by LOCC either in one round or in three rounds that are on the boundary of the set of all LOCC channels. Although every LOCC protocol must implement a separable quantum channel, it is a very difficult task to determine whether or not a given channel is separable. Fortunately, prior knowledge that the channel is separable is not required for application of our method.

arXiv:1606.00029•Physical Review Letters•Jan 9, 2017•12 citations

Local approximation of multipartite quantum measurements

Scott M. Cohen

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 infinite number of rounds, a case referred to as asymptotic LOCC. Our condition unifies, extends, and provides an intuitive, geometric justification for previous results on asymptotic LOCC. We use our condition to answer a variety of long-standing, unsolved problems, including for distinguishability of certain sets of states by LOCC. These include various classes of unextendible product bases, for which we prove they cannot be distinguished by LOCC even when infinite resources are available and an asymptotically vanishing error is allowed.

arXiv:1912.02330•Physical Review A•Feb 14, 2022•3 citations

Geometric and topological considerations for the closure of LOCC

Scott M. Cohen

We point out 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 in the limit of an infinite number of rounds. A generalization of this condition is then proven to hold for any measurement that is in the closure of that set, ${\bar{\textrm{LOCC}}}$. This generalization unifies, extends, and provides a geometric justification for previously known results on ${\bar{\text{LOCC}}}$, reproducing their consequences with regard to practical applications. We have also used our condition to answer a variety of long-standing, unsolved problems, including for distinguishability of certain sets of states by LOCC. These include various classes of unextendible product bases, for which we prove they cannot be distinguished by LOCC even when infinite resources are available and vanishing error is allowed.

•Dec 5, 2019•0 citations
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, where each measurement in the sequence requires only a finite number of rounds. This rather obvious and well-known fact is nonetheless of interest as it shows that these infinite-round measurements can be approximated arbitrarily closely simply by using more and more rounds of communication. Here we demonstrate the perhaps less obvious result that (at least) for bipartite systems, the reverse relationship also holds. Specifically, we show that every finite-round bipartite LOCC measurement is the limit of a continuous sequence of LOCC measurements, where each measurement in that sequence can be implemented by LOCC, but only with the use of an infinite number of rounds. Thus, the set of LOCC measurements that require an infinite number of rounds is dense in the entirety of LOCC, as is the set of finite-round LOCC measurements. This means there exist measurements that can only be implemented by LOCC by using an infinite number of rounds, but can nonetheless be approximated closely by using one round of communication, and actually in some cases, no communication is needed at all. These results follow from a necessary condition presented here for finite-round LOCC, which is extremely simple to check, is very easy to prove, and which can be violated by utilizing an infinite number of rounds.
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. This rather obvious and well-known fact is nonetheless of interest as it shows that these infinite-round measurements can be approximated arbitrarily closely simply by using more and more rounds of communication. Here we demonstrate the perhaps less obvious result that (at least) for bipartite systems, the reverse relationship also holds. Specifically, we show that every finite-round bipartite LOCC measurement is the limit of a continuous sequence of LOCC measurements, where each measurement in that sequence can be implemented by LOCC, but only with the use of an infinite number of rounds. Thus, the set of LOCC measurements that require an infinite number of rounds is dense in the entirety of LOCC, as is the set of finite-round LOCC measurements. This means there exist measurements that can only be implemented by LOCC by using an infinite number of rounds, but can nonetheless be approximated closely by using one round of communication, and actually in some cases, no communication is needed at all. These results follow from a new necessary condition for finite-round LOCC, which is extremely simple to check, is very easy to prove, and which can be violated by utilizing an infinite number of rounds.
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 quantum information tasks, its mathematical structure is complex and difficult to characterize. Here we provide a precise description of LOCC and related operational classes in terms of quantum instruments. Our formalism captures both finite round protocols as well as those that utilize an unbounded number of communication rounds. While the set of LOCC is not topologically closed, we show that finite round LOCC constitutes a compact subset of quantum operations. Additionally we show the existence of an open ball around the completely depolarizing map that consists entirely of LOCC implementable maps. Finally, we demonstrate a two-qubit map whose action can be approached arbitrarily close using LOCC, but nevertheless cannot be implemented perfectly.
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 applies to all quantum instruments, which range from the most refined case, a generalized measurement, to the most coarse-grained, which is a quantum channel. We illustrate these results by a detailed analysis of a quantum instrument that is known not to be implementable by LOCC, but which can be arbitrarily closely approximated within that framework. As one outgrowth of this analysis, we find a quantum measurement that falls into the same category: it cannot be implemented exactly by LOCC, but can be approximated by LOCC arbitrarily closely. This measurement has an infinite number of outcomes, leaving open the question as to whether or not there exists a measurement within this same category but having only a finite number of outcomes.
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 solving a set of linear equations. The method also allows one to design a LOCC protocol to implement the channel whenever such a protocol exists in any finite number of rounds. Perhaps surprisingly, the computational expense for analyzing LOCC channels is not much greater than that for LOCC measurements. We apply the method to several examples, two of which provide numerical evidence that the set of quantum channels that are not LOCC is not closed and that there exist channels that can be implemented by LOCC either in one round or in three rounds that are on the boundary of the set of all LOCC channels. Although every LOCC protocol must implement a separable quantum channel, it is a very difficult task to determine whether or not a given channel is separable. Fortunately, prior knowledge that the channel is separable is not required for application of our method.
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 infinite number of rounds, a case referred to as asymptotic LOCC. Our condition unifies, extends, and provides an intuitive, geometric justification for previous results on asymptotic LOCC. We use our condition to answer a variety of long-standing, unsolved problems, including for distinguishability of certain sets of states by LOCC. These include various classes of unextendible product bases, for which we prove they cannot be distinguished by LOCC even when infinite resources are available and an asymptotically vanishing error is allowed.
We point out 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 in the limit of an infinite number of rounds. A generalization of this condition is then proven to hold for any measurement that is in the closure of that set, LOCCˉ{\bar{\textrm{LOCC}}}LOCCˉ. This generalization unifies, extends, and provides a geometric justification for previously known results on LOCCˉ{\bar{\text{LOCC}}}LOCCˉ, reproducing their consequences with regard to practical applications. We have also used our condition to answer a variety of long-standing, unsolved problems, including for distinguishability of certain sets of states by LOCC. These include various classes of unextendible product bases, for which we prove they cannot be distinguished by LOCC even when infinite resources are available and vanishing error is allowed.