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:2310.05362

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

Scott M. Cohen

Published Oct 9, 2023• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2310.05362

Related papers

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•4 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.

arXiv:1409.4807•Physical Review A•Apr 8, 2015•5 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•11 citations

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

Scott M. Cohen

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.

arXiv:1410.6747•Physical Review A•Jun 24, 2015•2 citations

Devising local protocols for multipartite quantum measurements

Scott M. Cohen

A general method is devised to determine if any given measurement can be implemented by ``local operations and classical communication'' (LOCC) alone, leading to fundamental results in quantum measurement theory. The procedure proves the impossibility of a measurement by LOCC even when an infinite number of rounds of communication are allowed.

arXiv:1604.00093•Physical Review A•Apr 22, 2016•4 citations

Strong bounds on required resources for quantum channels by local operations and classical communication

Scott M. Cohen

Given a protocol $\mathcal{P}$ that implements multipartite quantum channel $\mathcal{E}$ by repeated rounds of local operations and classical communication (LOCC), we construct an alternate LOCC protocol for $\mathcal{E}$ in no more rounds than $\mathcal{P}$ and no more than a fixed, constant number of outcomes for each local measurement, the same constant number for every party and every round. We then obtain another upper bound on the number of outcomes that, under certain conditions, improves on the first. The latter bound shows that for LOCC channels that are extreme points of the convex set of all quantum channels, the parties can restrict the number of outcomes in their individual local measurements to no more than the square of their local Hilbert space dimension, ${d}_{\ensuremath{\alpha}}$, suggesting a possible link between the required resources for LOCC and the convex structure of the set of all quantum channels. Our bounds on the number of outcomes indicating the need for only constant resources per round, independent of the number of rounds $r$ including when that number is infinite, are a stark contrast to the exponential $r$ dependence in the only previously published bound of which we are aware. If a lower bound is known on the number of product operators needed to represent the channel, we obtain a lower bound on the number of rounds required to implement the given channel by LOCC. Finally, we show that when the quantum channel is not required but only that a given task be implemented deterministically, then no more than ${d}_{\ensuremath{\alpha}}^{2}$ outcomes are needed for each local measurement by party $\ensuremath{\alpha}$.

arXiv:1904.10980•Physical Review A•Oct 21, 2019•1 citation
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 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.
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 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.
Given a protocol P\mathcal{P}P that implements multipartite quantum channel E\mathcal{E}E by repeated rounds of local operations and classical communication (LOCC), we construct an alternate LOCC protocol for E\mathcal{E}E in no more rounds than P\mathcal{P}P and no more than a fixed, constant number of outcomes for each local measurement, the same constant number for every party and every round. We then obtain another upper bound on the number of outcomes that, under certain conditions, improves on the first. The latter bound shows that for LOCC channels that are extreme points of the convex set of all quantum channels, the parties can restrict the number of outcomes in their individual local measurements to no more than the square of their local Hilbert space dimension, ${d}_{\ensuremath{\alpha}}$, suggesting a possible link between the required resources for LOCC and the convex structure of the set of all quantum channels. Our bounds on the number of outcomes indicating the need for only constant resources per round, independent of the number of rounds rrr including when that number is infinite, are a stark contrast to the exponential rrr dependence in the only previously published bound of which we are aware. If a lower bound is known on the number of product operators needed to represent the channel, we obtain a lower bound on the number of rounds required to implement the given channel by LOCC. Finally, we show that when the quantum channel is not required but only that a given task be implemented deterministically, then no more than ${d}_{\ensuremath{\alpha}}^{2}$ outcomes are needed for each local measurement by party $\ensuremath{\alpha}$.