# LOCC

This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (January 2019) (Learn how and when to remove this template message) |

**LOCC**, or **local operations and classical communication**, is a method in quantum information theory where a local (product) operation is performed on part of the system, and where the result of that operation is "communicated" classically to another part where usually another local operation is performed conditioned on the information received.

## Contents

## Mathematical properties[edit]

The formal definition of the set of LOCC operations is complicated due to the fact that later local operations depend in general on all the previous classical communication and due to the unbounded number of communication rounds. For any finite number one can define , the set of LOCC operations that can be achieved with rounds of classical communication. The set becomes strictly larger whenever is increased and care has to be taken to define the limit of infinitely many rounds. In particular, the set LOCC is not topologically closed, that is there are quantum operations that can be approximated arbitrarily closely by LOCC but that are not themselves LOCC.^{[1]}

A *one-round LOCC* is a quantum instrument , for which the trace-non-increasing completely positive maps (CPMs) are local for all measurement results , i.e., and there is one site such that only at the map is not trace-preserving. This means that the instrument can be realized by the party at site applying the (local) instrument and communicating the classical result to all other parties, which then each perform (conditioned on ) trace-preserving (deterministic) local quantum operations .

Then are defined recursively as those operations that can be realized by following up a operation with a -operation. here it is allowed that the party, which performs the follow-up operations depends on the result of the previous rounds. Moreover, we allow also "coarse-graining", i.e., discarding some of the classical information encoded in the measurement results (of all rounds).

The union of all operations is denoted by and contains instruments that can be approximated better and better with more LOCC rounds. It topological closure contains *all* such operations.

It can be shown that all these sets are different^{[1]}:

The set of all LOCC operations is contained in the set of all *separable operations*. contains all operations that can be written using Kraus operators that have all product form, i.e.,

with . Not all operations in are LOCC,

i.e., there are examples that cannot be implemented locally even with infinite rounds of communication.^{[1]}

LOCC are the "free operations" in the resource theories of entanglement: Entanglement cannot be produced from separable states with LOCC and if the local parties in addition to being able to perform all LOCC operations are also furnished with some entangled states, they can realize more operations than with LOCC alone.

## Examples[edit]

LOCC operations are useful for *state preparation*, *state discrimination*, and *entanglement transformations*.

### State preparation[edit]

Alice and Bob are given a two quantum systems in the product state . Their task is to produce the separable state . With local operations alone this cannot be achieved, since they do not allow to produce the (classical) correlations present in . But with LOCC (with one round of communication) can be prepared: Alice throws an unbiased coin (that shows heads or tails each with 50% probability) and flips her qubit (to ) if the coin shows "tails", otherwise it is left unchanged. She then sends the result of the coin-flip (classical information) to Bob who also flips his qubit if he receives the message "tails". The resulting state is . In general, *all* separable states (and only these) can be prepared from a product states with LOCC operations alone.^{[1]}

### State discrimination[edit]

Given two quantum states on a bi- or multipartite Hilbert space , the task is to determine which one of two (or more) possible states it is. As a simple example, consider the two Bell states

Let's say the two-qubit system is separated, where the first qubit is given to Alice and the second is given to Bob. Without communication, Alice and Bob cannot distinguish the two states, since for all local measurements all measurement statistics are exactly the same (both states have the same reduced density matrix). E.g., assume that Alice measures the first qubit, and obtains the result 0. Since this result is equally likely to occur (with probability 50%) in each of the two cases, she does not gain any information on which Bell pair she was given and the same holds for Bob if he performs any measurement. But now let Alice send her result to Bob over a classical channel. Now Bob can compare his result to hers and if they are the same he can conclude that the pair given was , since only this allows for a joint measurement outcome . Thus with LOCC and two measurements these two states can be distinguished perfectly. Note that with global (nonlocal or entangled) measurements, a single measurement (on the joint Hilbert space) is sufficient to distinguish these two (mutually orthogonal) states.

There are quantum states that cannot be distinguished with LOCC operations.^{[2]}

### Entanglement transformations[edit]

While LOCC cannot *generate* entangled states out of product states, they can be used to transform entangled states into other entangled states. The restriction to LOCC severely limits which transformations are possible.

#### Entanglement conversion[edit]

Nielsen ^{[3]} has derived a general condition to determine whether one pure state of a bipartite quantum system may be transformed into another using only LOCC. Full details may be found in the paper referenced earlier, the results are sketched out here.

Consider two particles in a Hilbert space of dimension with particle states and with Schmidt decompositions

The 's are known as Schmidt coefficients. If they are ordered largest to smallest (i.e., with ) then can only be transformed into using only local operations if and only if for all in the range

In more concise notation:

This is a more restrictive condition than that local operations cannot increase entanglement measures. It is quite possible that and have the same amount of entanglement but converting one into the other is not possible and even that conversion in either direction is impossible because neither set of Schmidt coefficients majorises the other. For large if all Schmidt coefficients are non-zero then the probability of one set of coefficients majorising the other becomes negligible. Therefore, for large the probability of any arbitrary state being convertible into another via LOCC becomes negligible.

The operations described so far are deterministic, i.e., they succeed with probability 100%. If one is satisfied by *probabilistic* transformations, many more transformations are possible using LOCC.^{[4]} These operations are called *stochastic LOCC* (SLOCC). In particular for multi-partite states the convertibility under SLOCC is studied to gain a qualitative insight into the entanglement properties of the involved states.^{[5]}

#### Going beyond LOCC: Catalytic conversion[edit]

If entangled states are available as a resource, these together with LOCC allow a much larger class of transformations. This is the case even if these resource states are not consumed in the process (as they are, for example, in quantum teleportation). Thus transformations are called *entanglement catalysis*.^{[6]} In this procedure, the conversion of an initial state to a final state that is impossible with LOCC is made possible by taking a tensor product of the initial state with a "catalyst state" and requiring that this state is still available at the end of the conversion process. I.e., the catalyst state is left unchanged by the conversion and can then be removed, leaving only the desired final state. Consider the states,

These states are written in the form of Schmidt decomposition and in a descending order. We compare the sum of the coefficients of and

0 0.4 0.5 1 0.8 0.75 2 0.9 1.0 3 1.0 1.0

In the table, red color is put if , green color is put if , and white color is remained if . After building up the table, one can easily to find out whether and are convertible by looking at the color in the direction. can be converted into by LOCC if the color are all green or white, and can be converted into by LOCC if the color are all red or white. When the table presents both red and green color, the states are not convertible.

Now we consider the product states and ：

Similarly, we make up the table:

0 0.24 0.30 1 0.48 0.50 2 0.64 0.65 3 0.80 0.80 4 0.86 0.90 5 0.92 1.00 6 0.96 1.00 7 1.00 1.00

The color in the direction are all green or white, therefore, according to the Nielsen's theorem, is possible to be converted into by the LOCC. The *catalyst* state is taken away after the conversion. Finally we find by the LOCC.

## References[edit]

- ^
^{a}^{b}^{c}^{d}Chitambar, E.; Leung, D.; Mancinska, L.; Ozols, M. & Winter, A. (2012). "Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)".*Commun. Math. Phys*.**328**: 303. arXiv:1210.4583. Bibcode:2014CMaPh.328..303C. doi:10.1007/s00220-014-1953-9.CS1 maint: Uses authors parameter (link) **^**Charles H. Bennett, David P. DiVincenzo, Christopher A. Fuchs, Tal Mor, Eric Rains, Peter W. Shor, John A. Smolin, and William K. Wootters (1999). "Quantum nonlocality without entanglement".*Phys. Rev. A*.**59**: 1070. arXiv:quant-ph/9804053. Bibcode:1999PhRvA..59.1070B. doi:10.1103/PhysRevA.59.1070.CS1 maint: Uses authors parameter (link)**^**M. A. Nielsen (1999). "Conditions for a Class of Entanglement Transformations".*Phys. Rev. Lett*.**83**: 436–439. arXiv:quant-ph/9811053. Bibcode:1999PhRvL..83..436N. doi:10.1103/PhysRevLett.83.436.**^**Guifré Vidal (2000). "Entanglement Monotones".*J. Mod. Opt*.**47**: 355. arXiv:quant-ph/9807077. doi:10.1080/09500340008244048.**^**G. Gour and N. R. Wallach (2013). "Classification of Multipartite Entanglement of All Finite Dimensionality".*Phys. Rev. Lett*.**111**: 060502. arXiv:1304.7259. Bibcode:2013PhRvL.111f0502G. doi:10.1103/PhysRevLett.111.060502.CS1 maint: Uses authors parameter (link)**^**D. Jonathan and M. B. Plenio (1999). "Entanglement-assisted local manipulation of pure quantum states".*Phys. Rev. Lett*.**83**: 3566. arXiv:quant-ph/9905071. Bibcode:1999PhRvL..83.3566J. doi:10.1103/PhysRevLett.83.3566.CS1 maint: Uses authors parameter (link)

## Further reading[edit]

*https://quantiki.org/wiki/locc-operations*- M. A. Nielsen, “Conditions for a class of entanglement transformations”, Phys. Rev. Lett. 83 (2) 436-439 (1999) (
*https://arxiv.org/abs/quant-ph/9811053*)