LOCC

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

* 1 Mathematical properties
* 2 Examples
* 2.1 State preparation
* 2.2 State discrimination
* 2.3 Entanglement transformations
* 2.3.1 Entanglement conversion
* 2.3.2 Going beyond LOCC: Catalytic conversion
* 3 See also
* 4 References
* 5 Further reading

## Mathematical properties

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 r≥1 one can define LOCCr, the set of LOCC operations that can be achieved with r rounds of classical communication. The set becomes strictly larger whenever r 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 LOCC1 is a quantum instrument {ℰx}, for which the trace-non-increasing completely positive maps (CPMs) ℰx are local for all measurement results x, i.e., ℰx=⨂j(ℰxj) and there is one site j=K such that only at K the map ℰxK ℰx=⨂j=K(𝒯𝒿𝓍)⊗ℰK is not trace-preserving. This means that the instrument can be realized by the party at site K applying the (local) instrument {ℰxK} and communicating the classical result x to all other parties, which then each perform (conditioned on x) trace-preserving (deterministic) local quantum operations 𝒯xj.

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

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

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

LOCCr⊂LOCCr+1⊂LOCCℕ⊂LOCC‾ℕ

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

ℰ(ρ)=∑lK1l⊗K2l…⊗KNρ(K1l⊗K2l…⊗KN)†,

with ∑lK1l⊗K2l…⊗KN(K1l⊗K2l…⊗KN)†=1. Not all operations in SEP are LOCC,

LOCC‾ℕ⊂SEP⁡,

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

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

### State preparation

Alice and Bob are given a quantum system in the product state |00⟩=|0⟩A⊗|0⟩B. Their task is to produce the separable state ρ=12|00⟩⟨00|+12|11⟩⟨11|. With local operations alone this cannot be achieved, since they cannot produce the (classical) correlations present in ρ. However, 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 |1⟩A) 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

Given two quantum states ψ on a bi- or multipartite Hilbert space ℋ=ℋA⊗ℋB⊗…ℋZ, the task is to determine which one of two (or more) possible states ψ1,ψ2 it is. As a simple example, consider the two Bell states

|ψ1⟩=12(|0⟩A⊗|0⟩B+|1⟩A⊗|1⟩B)

|ψ2⟩=12(|0⟩A⊗|1⟩B+|1⟩A⊗|0⟩B)

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 |ψ1⟩, since only this allows for a joint measurement outcome |0⟩A⊗|0⟩B. 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

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

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 d with particle states |ψ⟩ and |ϕ⟩ with Schmidt decompositions

|ψ⟩=∑iωi|iA⟩⊗|iB⟩

|ϕ⟩=∑iωi′|iA′⟩⊗|iB′⟩

The ωi's are known as Schmidt coefficients. If they are ordered largest to smallest (i.e., with ω1>ωd) then |ψ⟩ can only be transformed into |ϕ⟩ using only local operations if and only if for all k in the range 1≤k≤d

∑i=1kωi≤∑i=1kωi′

In more concise notation:

|ψ⟩->|ϕ⟩iffω≺ω′

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 d if all Schmidt coefficients are non-zero then the probability of one set of coefficients majorising the other becomes negligible. Therefore, for large d 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

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). Such 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" |c⟩ 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,

|ψ⟩=0.4|00⟩+0.4|11⟩+0.1|22⟩+0.1|33⟩
|ϕ⟩=0.5|00⟩+0.25|11⟩+0.25|22⟩
|c⟩=0.6∣↑↑⟩+0.4∣↓↓⟩

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

k | |ψ⟩ | |ϕ⟩

|
|

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 ∑i=0kωi>∑i=0kω'i, green color is put if ∑i=0kωi<∑i=0kω'i, and white color is remained if ∑i=0kωi=∑i=0kω'i. After building up the table, one can easily to find out whether |ψ⟩ and |ϕ⟩ are convertible by looking at the color in the k 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 |ψ⟩|c⟩ and |ϕ⟩|c⟩：

|ψ⟩|c⟩=0.24|00⟩∣↑↑⟩+0.24|11⟩∣↑↑⟩+0.16|00⟩∣↓↓⟩+0.16|11⟩∣↓↓⟩+0.06|22⟩∣↑↑⟩+0.06|33⟩∣↑↑⟩+0.04|22⟩∣↓↓⟩+0.04|33⟩∣↓↓⟩
|ϕ⟩|c⟩=0.30|00⟩∣↑↑⟩+0.20|00⟩∣↓↓⟩+0.15|11⟩∣↑↑⟩+0.15|22⟩∣↑↑⟩+0.10|11⟩∣↓↓⟩+0.10|22⟩∣↓↓⟩

Similarly, we make up the table:

k | |ψ⟩|c⟩ | |ϕ⟩|c⟩

|
|

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 k direction are all green or white, therefore, according to the Nielsen's theorem, |ψ⟩|c⟩ is possible to be converted into |ϕ⟩|c⟩ by the LOCC. The catalyst state |c⟩ is taken away after the conversion. Finally we find |ψ⟩->|c⟩|ϕ⟩ by the LOCC.

If correlations between the system and the catalyst are allowed, catalytic transformations between bipartite pure states are characterized via the entanglement entropy.[7] In more detail, a pure state |ψ⟩ can be converted into another pure state |ϕ⟩ via catalytic LOCC if and only if

S(ψA)≥S(ϕA),

where S is the von Neumann entropy, and ψA and ϕA are the reduced states of |ψ⟩ and |ϕ⟩, respectively. In general, the conversion is not exact, but can be performed with an arbitrary accuracy. The amount of correlations between the system and the catalyst can also be made arbitrarily small.

A broader class of transformations can be achieved through the use of quantum batteries.[8][9] These are ancillary systems introduced during the transformation process, akin to quantum catalysts, with the condition that they retain their entanglement upon completion of the procedure. The incorporation of quantum batteries significantly extends the scope of LOCC, enhancing the ability to manipulate quantum states. In the asymptotic regime, where a large number of identical copies of the initial state are available, this approach enables reversible interconversion between any two entangled states.[9] This leads to the formulation of a second law of entanglement manipulation,[9] analogous to the second law of thermodynamics. Previously, the existence of a framework leading to the second law of entanglement manipulation has been identified as a major open problem in quantum information science.[10]

## See also

* Quantum teleportation
* Unextendible product basis

## References

1. ↑ 1.0 1.1 1.2 1.3 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 (1): 303. doi:10.1007/s00220-014-1953-9. Bibcode: 2014CMaPh.328..303C.
2. ↑ Charles H. Bennett; David P. DiVincenzo; Christopher A. Fuchs; Tal Mor; Eric Rains; Peter W. Shor; John A. Smolin; William K. Wootters (1999). "Quantum nonlocality without entanglement". Phys. Rev. A 59 (2): 1070–1091. doi:10.1103/PhysRevA.59.1070. Bibcode: 1999PhRvA..59.1070B.
3. ↑ M. A. Nielsen (1999). "Conditions for a Class of Entanglement Transformations". Phys. Rev. Lett. 83 (2): 436–439. doi:10.1103/PhysRevLett.83.436. Bibcode: 1999PhRvL..83..436N.
4. ↑ Guifré Vidal (2000). "Entanglement Monotones". J. Mod. Opt. 47 (2–3): 355. doi:10.1080/09500340008244048. Bibcode: 2000JMOp...47..355V.
5. ↑ G. Gour; N. R. Wallach (2013). "Classification of Multipartite Entanglement of All Finite Dimensionality". Phys. Rev. Lett. 111 (6). doi:10.1103/PhysRevLett.111.060502. PMID 23971544. Bibcode: 2013PhRvL.111f0502G.
6. ↑ D. Jonathan; M. B. Plenio (1999). "Entanglement-assisted local manipulation of pure quantum states". Phys. Rev. Lett. 83 (17): 3566–3569. doi:10.1103/PhysRevLett.83.3566. Bibcode: 1999PhRvL..83.3566J.
7. ↑ Kondra, Tulja Varun; Datta, Chandan; Streltsov, Alexander (2021-10-05). "Catalytic Transformations of Pure Entangled States". Physical Review Letters 127 (15). doi:10.1103/PhysRevLett.127.150503. PMID 34678004. Bibcode: 2021PhRvL.127o0503K.
8. ↑ Alhambra, Álvaro M. (2019). "Entanglement fluctuation theorems". Physical Review A 100 (1). doi:10.1103/PhysRevA.100.012317. Bibcode: 2019PhRvA.100a2317A. https://journals.aps.org/pra/abstract/10.1103/PhysRevA.100.012317.
9. ↑ 9.0 9.1 9.2 Ganardi, Ray; Kondra, Tulja Varun; Ng, Nelly H. Y.; Streltsov, Alexander (2025-07-02). "Second Law of Entanglement Manipulation with Entanglement Battery". Physical Review Letters 135 (1). doi:10.1103/kl56-p2vb. PMID 40743098. Bibcode: 2025PhRvL.135a0202G.
10. ↑ "Reversible entanglement manipulation – Open Quantum Problems" (in en-US). https://oqp.iqoqi.oeaw.ac.at/reversible-entanglement-manipulation.

## Further reading

* https://quantiki.org/wiki/locc-operations
* Nielsen M. A. (1999). "Conditions for a class of entanglement transformations". Phys. Rev. Lett. 83 (2): 436–439. doi:10.1103/physrevlett.83.436. Bibcode: 1999PhRvL..83..436N.

* v
* t
* e

Quantum information science

General|

* Quantum computing
* Qubit
* physical vs. logical
* DiVincenzo's criteria
* Quantum information
* Quantum programming
* Quantum processors
* Cloud-based quantum computing
* Timeline of quantum computing

Theorems|

* Bell's theorem
* Gleason's theorem
* Gottesman–Knill theorem
* Holevo's theorem
* Margolus–Levitin theorem
* No-broadcast theorem
* No-cloning theorem
* No-communication theorem
* No-deleting theorem
* No-hiding theorem
* No-teleportation theorem
* PBR theorem
* Quantum threshold theorem

Quantum
communication|

* Quantum capacity
* Classical capacity
* Entanglement-assisted classical capacity
* Quantum channel
* Quantum network
* Quantum cryptography
* Quantum key distribution
* BB84
* SARG04
* Three-stage quantum cryptography protocol
* Quantum teleportation
* Superdense coding
* LOCC
* Entanglement distillation

Quantum algorithms|

* Universal quantum simulator
* Deutsch–Jozsa algorithm
* Grover's algorithm
* Quantum Fourier transform
* Shor's algorithm
* Simon's problem
* Quantum phase estimation algorithm
* Quantum counting algorithm
* Quantum annealing
* Quantum algorithm for linear systems of equations
* Amplitude amplification

Quantum
complexity theory|

* Quantum Turing machine
* EQP
* BQP
* QMA
* PostBQP
* QIP

Quantum
computing models|

* Quantum circuit
* Quantum logic gate
* One-way quantum computer
* cluster state
* Adiabatic quantum computation
* Topological quantum computer

Quantum
error correction|

* Stabilizer codes
* Entanglement-Assisted Quantum Error Correction
* Shor code
* Steane code
* CSS code
* Quantum convolutional codes
* Toric code

Physical
implementations|

| Quantum optics|

* Cavity QED
* Circuit QED
* Linear optical quantum computing
* KLM protocol
* Boson sampling

|

Ultracold atoms|

* Trapped ion quantum computer
* Optical lattice

Spin-based|

* Nuclear magnetic resonance QC
* Kane QC
* Loss–DiVincenzo QC
* Nitrogen-vacancy center

Superconducting
quantum computing|

* Charge qubit
* Flux qubit
* Phase qubit
* Transmon

Software|

* libquantum
* OpenQASM
* Q#
* Qiskit
* IBM Q Experience

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/LOCC. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=LOCC&oldid=4228388"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template