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

arXiv:1410.6747 · Physical Review A

Extended necessary condition for local operations and classical communication: Tight bound for all measurements

Scott M. Cohen

Published Jun 24, 2015• 2 citations
arXivHTMLPDF

Abstract

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 previously. That earlier result involved a bound that is tight when the number of measurement operators defining the measurement is relatively small. The present results generalize that bound to one that is tight for any finite number of measurement operators, and we also provide an extension which holds when that number is infinite. We apply these results to the famous example on a $3\ifmmode\times\else\texttimes\fi{}3$ system known as ``domino states,'' which were the first demonstration of nonlocality without entanglement. Our extended necessary condition provides another way of showing that these states cannot be perfectly distinguished by (finite-round) LOCC. It directly shows that this conclusion also holds for their related rotated domino states. We also introduce a class of problems involving the unambiguous discrimination of quantum states, each of which is an example where the states can be optimally discriminated by a separable measurement, but according to our condition, cannot be optimally discriminated by LOCC. These examples nicely illustrate the usefulness of the present results, since our earlier necessary condition, which the present result generalizes, is not strong enough to reach a conclusion in any of these cases.

DOI
10.1103/physreva.91.062125

Related papers

Separable State Discrimination Using Local Quantum Operations and Classical Communication

Laura Mančinska

In this thesis we study the subset of quantum operations that can be implemented using only local quantum operations and classical communication (LOCC). This restricted paradigm serves as a tool to study not only quantum correlations and other nonlocal quantum effects, but also resource transformations such as channel capacities. \n \nThe mathematical structure of LOCC is complex and difficult to characterize. In the first part of this thesis 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. This perspective allows us to measure the distance between two LOCC instruments and hence discuss the closure of LOCC in a rigorous way. While the set of LOCC is not topologically closed, we show that the operations that can be implemented using some fixed number rounds of communication constitute a compact subset of all quantum operations. We also exhibit a subset of LOCC measurements that is closed. Additionally we establish the existence of an open ball around the completely depolarizing map consisting entirely of LOCC implementable maps. \n \nIn the second part of this thesis we focus on the task of discriminating states from some known set S by LOCC. Building on the work in the paper "Quantum nonlocality without entanglement", we provide a framework for lower bounding the error probability of any LOCC protocol aiming at discriminating the states from S. We apply our framework to an orthonormal product basis known as the domino states. This gives an alternative and simplified bound quantifying how well these states can be discriminated using LOCC. We generalize this result for similar bases in larger dimensions, as well as the "rotated" domino states, resolving a long-standing open question. These results give new examples of quantitative gaps between the classes of separable and LOCC operations. \n \nIn the last part of this thesis, we ask what differentiates separable from LOCC operations. Both of these classes play a key role in the study of entanglement. Separable operations are known to be strictly more powerful than LOCC ones, but no simple explanation of this phenomenon is known. We show that, in the case of bipartite von Neumann measurements, the ability to interpolate is an operational principle that separates LOCC and separable operations.

•Aug 30, 2013•1 citation

Necessary condition for local quantum operations and classical communication with extensive violation by separable operations

Scott M. Cohen

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 approach to understanding LOCC. This necessary condition applies to all LOCC protocols involving any number of parties and any finite number of rounds of communication. Furthermore, it demonstrates an extremely strong difference between separable operations and LOCC, in that there exist examples of the former for which the condition is extensively violated. More precisely, the violation by separable operations of our necessary condition for LOCC grows without limit as the number of parties increases.

arXiv:1311.2641•Physical Review A•Jul 29, 2014•7 citations

Class of unambiguous state discrimination problems achievable by separable measurements but impossible by local operations and classical communication

Scott M. Cohen

We consider an infinite class of unambiguous quantum state discrimination problems on multipartite systems, described by Hilbert space $\mathcal{H}$, of any number of parties. Restricting consideration to measurements that act only on $\mathcal{H}$, we find the optimal global measurement for each element of this class, achieving the maximum possible success probability of $1/2$ in all cases. This measurement turns out to be both separable and unique, and by our recently discovered necessary condition for local quantum operations and classical communication (LOCC) it is easily shown to be impossible by any finite-round LOCC protocol. We also show that, quite generally, if the input state is restricted to lie in $\mathcal{H}$, then any LOCC measurement on an enlarged Hilbert space is effectively identical to an LOCC measurement on $\mathcal{H}$. Therefore, our necessary condition for LOCC demonstrates directly that a higher success probability is attainable for each of these problems using general separable measurements as compared to that which is possible with any finite-round LOCC protocol.

arXiv:1408.1142•Physical Review A•Jan 14, 2015•13 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

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

Structure of local quantum operations and classical communication: Finite versus 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, 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.

Physical Review A•Apr 8, 2015•5 citations
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 previously. That earlier result involved a bound that is tight when the number of measurement operators defining the measurement is relatively small. The present results generalize that bound to one that is tight for any finite number of measurement operators, and we also provide an extension which holds when that number is infinite. We apply these results to the famous example on a 3\ifmmode×\else\texttimes\fi33\ifmmode\times\else\texttimes\fi{}33\ifmmode×\else\texttimes\fi3 system known as ``domino states,'' which were the first demonstration of nonlocality without entanglement. Our extended necessary condition provides another way of showing that these states cannot be perfectly distinguished by (finite-round) LOCC. It directly shows that this conclusion also holds for their related rotated domino states. We also introduce a class of problems involving the unambiguous discrimination of quantum states, each of which is an example where the states can be optimally discriminated by a separable measurement, but according to our condition, cannot be optimally discriminated by LOCC. These examples nicely illustrate the usefulness of the present results, since our earlier necessary condition, which the present result generalizes, is not strong enough to reach a conclusion in any of these cases.
In this thesis we study the subset of quantum operations that can be implemented using only local quantum operations and classical communication (LOCC). This restricted paradigm serves as a tool to study not only quantum correlations and other nonlocal quantum effects, but also resource transformations such as channel capacities. \n \nThe mathematical structure of LOCC is complex and difficult to characterize. In the first part of this thesis 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. This perspective allows us to measure the distance between two LOCC instruments and hence discuss the closure of LOCC in a rigorous way. While the set of LOCC is not topologically closed, we show that the operations that can be implemented using some fixed number rounds of communication constitute a compact subset of all quantum operations. We also exhibit a subset of LOCC measurements that is closed. Additionally we establish the existence of an open ball around the completely depolarizing map consisting entirely of LOCC implementable maps. \n \nIn the second part of this thesis we focus on the task of discriminating states from some known set S by LOCC. Building on the work in the paper "Quantum nonlocality without entanglement", we provide a framework for lower bounding the error probability of any LOCC protocol aiming at discriminating the states from S. We apply our framework to an orthonormal product basis known as the domino states. This gives an alternative and simplified bound quantifying how well these states can be discriminated using LOCC. We generalize this result for similar bases in larger dimensions, as well as the "rotated" domino states, resolving a long-standing open question. These results give new examples of quantitative gaps between the classes of separable and LOCC operations. \n \nIn the last part of this thesis, we ask what differentiates separable from LOCC operations. Both of these classes play a key role in the study of entanglement. Separable operations are known to be strictly more powerful than LOCC ones, but no simple explanation of this phenomenon is known. We show that, in the case of bipartite von Neumann measurements, the ability to interpolate is an operational principle that separates LOCC and separable operations.
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 approach to understanding LOCC. This necessary condition applies to all LOCC protocols involving any number of parties and any finite number of rounds of communication. Furthermore, it demonstrates an extremely strong difference between separable operations and LOCC, in that there exist examples of the former for which the condition is extensively violated. More precisely, the violation by separable operations of our necessary condition for LOCC grows without limit as the number of parties increases.
We consider an infinite class of unambiguous quantum state discrimination problems on multipartite systems, described by Hilbert space H\mathcal{H}H, of any number of parties. Restricting consideration to measurements that act only on H\mathcal{H}H, we find the optimal global measurement for each element of this class, achieving the maximum possible success probability of 1/21/21/2 in all cases. This measurement turns out to be both separable and unique, and by our recently discovered necessary condition for local quantum operations and classical communication (LOCC) it is easily shown to be impossible by any finite-round LOCC protocol. We also show that, quite generally, if the input state is restricted to lie in H\mathcal{H}H, then any LOCC measurement on an enlarged Hilbert space is effectively identical to an LOCC measurement on H\mathcal{H}H. Therefore, our necessary condition for LOCC demonstrates directly that a higher success probability is attainable for each of these problems using general separable measurements as compared to that which is possible with any finite-round LOCC protocol.
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.
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.
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.