- Source: Entanglement distillation
Entanglement distillation (also called entanglement purification) is the transformation of N copies of an arbitrary entangled state
ρ
{\displaystyle \rho }
into some number of approximately pure Bell pairs, using only local operations and classical communication.
Quantum entanglement distillation can in this way overcome the degenerative influence of noisy quantum channels by transforming previously shared less entangled pairs into a smaller number of maximally entangled pairs.
History
The limits for entanglement dilution and distillation are due to C. H. Bennett, H. Bernstein, S. Popescu, and B. Schumacher, who presented the first distillation protocols for pure states in 1996; entanglement distillation protocols for mixed states were introduced by Bennett, Brassard, Popescu, Schumacher, Smolin and Wootters the same year. Bennett, DiVincenzo, Smolin and Wootters established the connection to quantum error-correction in a ground-breaking paper published in August 1996, also in the journal of Physical Review, which has stimulated a lot of subsequent research.
Quantifying entanglement
A two qubit system can be written as a superposition of possible computational basis qubit states:
|
00
⟩
,
|
01
⟩
,
|
10
⟩
,
|
11
⟩
{\displaystyle |00\rangle ,|01\rangle ,|10\rangle ,|11\rangle }
, each with an associated complex coefficient
α
{\displaystyle \alpha \,\!}
:
|
ψ
⟩
=
α
00
|
00
⟩
+
α
01
|
01
⟩
+
α
10
|
10
⟩
+
α
11
|
11
⟩
{\displaystyle |\psi \rangle =\alpha _{00}|00\rangle +\alpha _{01}|01\rangle +\alpha _{10}|10\rangle +\alpha _{11}|11\rangle }
As in the case of a single qubit, the probability of measuring a particular computational basis state
|
x
⟩
{\displaystyle |x\rangle }
is the square of the modulus of its amplitude, or associated coefficient,
|
α
x
|
2
{\displaystyle |\alpha _{x}|^{2}\,\!}
, subject to the normalization condition
∑
x
∈
0
,
1
|
α
x
|
2
=
1
{\textstyle \sum _{x\in {0,1}}|\alpha _{x}|^{2}=1}
. The normalization condition guarantees that the sum of the probabilities add up to 1, meaning that upon measurement, one of the states will be observed.
The Bell state is a particularly important example of a two qubit state:
1
2
(
|
00
⟩
+
|
11
⟩
)
{\textstyle {\frac {1}{\sqrt {2}}}(|00\rangle +|11\rangle )}
Bell states possess the property that measurement outcomes on the two qubits are correlated. As can be seen from the expression above, the two possible measurement outcomes are zero and one, both with probability of 50%. As a result, a measurement of the second qubit always gives the same result as the measurement of the first qubit.
Bell states can be used to quantify entanglement. Let m be the number of high-fidelity copies of a Bell state that can be produced using local operations and classical communication (LOCC). Given a large number of Bell states the amount of entanglement present in a pure state
|
ψ
⟩
{\displaystyle |\psi \rangle }
can then be defined as the ratio of
n
/
m
{\displaystyle n/m}
, called the distillable entanglement of a particular state
|
ϕ
⟩
{\displaystyle |\phi \rangle }
, which gives a quantified measure of the amount of entanglement present in a given system. The process of entanglement distillation aims to saturate this limiting ratio. The number of copies of a pure state that may be converted into a maximally entangled state is equal to the von Neumann entropy
S
(
p
)
{\displaystyle S(p)}
of the state, which is an extension of the concept of classical entropy for quantum systems. Mathematically, for a given density matrix
p
{\displaystyle p}
, the von Neumann entropy
S
(
p
)
{\displaystyle S(p)}
is
S
(
p
)
=
−
T
r
(
p
ln
p
)
{\displaystyle S(p)=-\mathrm {Tr} (p\ln p)}
. Entanglement can then be quantified as the entropy of entanglement, which is the von Neumann entropy of either
p
A
{\displaystyle p_{A}}
or
p
B
{\displaystyle p_{B}}
as:
E
=
−
T
r
(
p
A
ln
p
A
)
=
−
T
r
(
p
B
ln
p
B
)
,
{\displaystyle E=-\mathrm {Tr} (p_{A}\ln p_{A})=-\mathrm {Tr} (p_{B}\ln p_{B}),}
Which ranges from 0 for a product state to
ln
2
{\displaystyle \ln 2}
for a maximally entangled state (if the
ln
{\displaystyle \ln }
is replaced by
log
2
{\displaystyle \log _{2}}
then maximally entangled has a value of 1).
Motivation
Suppose that two parties, Alice and Bob, would like to communicate classical information over a noisy quantum channel. Either classical or quantum information can be transmitted over a quantum channel by encoding the information in a quantum state. With this knowledge, Alice encodes the classical information that she intends to send to Bob in a (quantum) product state, as a tensor product of reduced density matrices
p
1
⊗
p
2
⊗
⋯
{\displaystyle p_{1}\otimes p_{2}\otimes \cdots }
where each
p
{\displaystyle p}
is diagonal and can only be used as a one time input for a particular channel
ϵ
{\displaystyle \epsilon }
.
The fidelity of the noisy quantum channel is a measure of how closely the output of a quantum channel resembles the input, and is therefore a measure of how well a quantum channel preserves information. If a pure state
ψ
{\displaystyle \psi }
is sent into a quantum channel emerges as the state represented by density matrix
p
{\displaystyle p}
, the fidelity of transmission is defined as
F
=
⟨
ψ
|
p
|
ψ
⟩
{\displaystyle F=\langle \psi |p|\psi \rangle }
.
The problem that Alice and Bob now face is that quantum communication over large distances depends upon successful distribution of highly entangled quantum states, and due to unavoidable noise in quantum communication channels, the quality of entangled states generally decreases exponentially with channel length as a function of the fidelity of the channel. Entanglement distillation addresses this problem of maintaining a high degree of entanglement between distributed quantum states by transforming N copies of an arbitrary entangled state
ρ
{\displaystyle \rho }
into approximately
S
(
ρ
)
N
{\displaystyle S(\rho )N}
Bell pairs, using only local operations and classical communication. The objective is to share strongly correlated qubits between distant parties (Alice and Bob) in order to allow reliable quantum teleportation or quantum cryptography.
Entanglement concentration
= Pure states
=Given n particles in the singlet state shared between Alice and Bob, local actions and classical communication will suffice to prepare m arbitrarily good copies of
ϕ
{\displaystyle \phi }
with a yield
Let an entangled state
|
ψ
⟩
{\displaystyle |\psi \rangle }
have a Schmidt decomposition:
|
ψ
⟩
=
∑
x
p
(
x
)
|
x
A
⟩
|
x
B
⟩
{\displaystyle |\psi \rangle =\sum _{x}{\sqrt {p(x)}}|x_{A}\rangle |x_{B}\rangle }
where coefficients p(x) form a probability distribution, and thus are positive valued and sum to unity. The tensor product of this state is then,
|
ψ
⟩
⊗
m
=
∑
x
1
,
x
2
,
…
,
x
m
p
(
x
1
)
p
(
x
2
)
…
p
(
x
m
)
|
x
1
A
x
2
A
…
x
m
A
⟩
|
x
1
B
x
2
B
…
x
m
B
⟩
{\displaystyle |\psi \rangle ^{\otimes m}=\sum _{x_{1},x_{2},\dots ,x_{m}}{\sqrt {p(x_{1})p(x_{2})\dots p(x_{m})}}|x_{1A}x_{2A}\dots x_{mA}\rangle |x_{1B}x_{2B}\dots x_{mB}\rangle }
Now, omitting all terms
x
1
,
…
,
x
m
{\displaystyle x_{1},\dots ,x_{m}}
which are not part of any sequence which is likely to occur with high probability, known as the typical set:
A
ϵ
(
n
)
{\displaystyle A_{\epsilon }^{(n)}}
the new state is
|
ϕ
m
⟩
=
∑
x
ϵ
A
ϵ
(
n
)
p
(
x
1
)
p
(
x
2
)
…
p
(
x
m
)
|
x
1
A
x
2
A
…
x
m
A
⟩
|
x
1
B
x
2
B
…
x
m
B
⟩
{\displaystyle |\phi _{m}\rangle =\sum _{x\epsilon A_{\epsilon }^{(n)}}{\sqrt {p(x_{1})p(x_{2})\dots p(x_{m})}}|x_{1A}x_{2A}\dots x_{mA}\rangle |x_{1B}x_{2B}\dots x_{mB}\rangle }
And renormalizing,
|
ϕ
m
′
⟩
=
|
ϕ
m
⟩
⟨
ϕ
m
|
ϕ
m
⟩
{\displaystyle |\phi _{m}'\rangle ={\frac {|\phi _{m}\rangle }{\sqrt {\langle \phi _{m}|\phi _{m}\rangle }}}}
Then the fidelity
Suppose that Alice and Bob are in possession of m copies of
|
ψ
⟩
{\displaystyle |\psi \rangle }
. Alice can perform a measurement onto the typical set
A
ϵ
(
n
)
{\displaystyle A_{\epsilon }^{(n)}}
subset of
p
ψ
{\displaystyle p_{\psi }\,\!}
, converting the state
|
ψ
⟩
⊗
m
→
|
ϕ
m
⟩
{\displaystyle |\psi \rangle ^{\otimes m}\rightarrow |\phi _{m}\rangle }
with high fidelity. The theorem of typical sequences then shows us that
1
−
δ
{\displaystyle 1-\delta }
is the probability that the given sequence is part of the typical set, and may be made arbitrarily close to 1 for sufficiently large m, and therefore the Schmidt coefficients of the renormalized Bell state
|
ϕ
m
′
⟩
{\displaystyle |\phi _{m}'\rangle }
will be at most a factor
1
/
1
−
δ
{\textstyle {1}/{\sqrt {1-\delta }}}
larger. Alice and Bob can now obtain a smaller set of n Bell states by performing LOCC on the state
|
ϕ
m
′
⟩
{\displaystyle |\phi _{m}'\rangle }
with which they can overcome the noise of a quantum channel to communicate successfully.
= Mixed states
=Many techniques have been developed for doing entanglement distillation for mixed states, giving a lower bounds on the value of the distillable entanglement
D
(
p
)
{\displaystyle D(p)}
for specific classes of states
p
{\displaystyle p}
.
One common method involves Alice not using the noisy channel to transmit source states directly but instead preparing a large number of Bell states, sending half of each Bell pair to Bob. The result from transmission through the noisy channel is to create the mixed entangled state
p
{\displaystyle p}
, so that Alice and Bob end up sharing
m
{\displaystyle m}
copies of
p
{\displaystyle p}
. Alice and Bob then perform entanglement distillation, producing
m
⋅
D
(
p
)
{\displaystyle m\cdot D(p)}
almost perfectly entangled states from the mixed entangled states
p
{\displaystyle p}
by performing local unitary operations and measurements on the shared entangled pairs, coordinating their actions through classical messages, and sacrificing some of the entangled pairs to increase the purity of the remaining ones. Alice can now prepare an
m
⋅
D
(
p
)
{\displaystyle m\cdot D(p)}
qubit state and teleport it to Bob using the
m
⋅
D
(
p
)
{\displaystyle m\cdot D(p)}
Bell pairs which they share with high fidelity. What Alice and Bob have then effectively accomplished is having simulated a noiseless quantum channel using a noisy one, with the aid of local actions and classical communication.
Let
M
{\displaystyle M}
be a general mixed state of two spin-1/2 particles which could have resulted from the transmission of an initially pure singlet state
ψ
−
=
(
↑↓
−
↓↑
)
/
2
{\displaystyle \psi ^{-}=(\uparrow \downarrow -\downarrow \uparrow )/{\sqrt {2}}}
through a noisy channel between Alice and Bob, which will be used to distill some pure entanglement. The fidelity of M
F
=
⟨
ψ
−
|
M
|
ψ
−
⟩
{\displaystyle F=\langle \psi ^{-}|M|\psi ^{-}\rangle }
is a convenient expression of its purity relative to a perfect singlet. Suppose that M is already a pure state of two particles
M
=
|
ϕ
⟩
⟨
ϕ
|
{\displaystyle M=|\phi \rangle \langle \phi |}
for some
ϕ
{\displaystyle \phi }
. The entanglement for
ϕ
{\displaystyle \phi }
, as already established, is the von Neumann entropy
E
(
ϕ
)
=
S
(
p
A
)
=
S
(
p
B
)
{\displaystyle E(\phi )=S(p_{A})=S(p_{B})}
where
p
A
=
tr
B
(
|
ϕ
⟩
⟨
ϕ
|
)
,
{\displaystyle p_{A}=\operatorname {tr} _{B}^{}(|\phi \rangle \langle \phi |),}
and likewise for
p
B
{\displaystyle p_{B}}
, represent the reduced density matrices for either particle. The following protocol is then used:
Performing a random bilateral rotation on each shared pair, choosing a random SU(2) rotation independently for each pair and applying it locally to both members of the pair transforms the initial general two-spin mixed state M into a rotationally symmetric mixture of the singlet state
ψ
−
{\displaystyle \psi ^{-}}
and the three triplet states
ψ
+
{\displaystyle \psi ^{+}}
and
ϕ
±
{\displaystyle \phi ^{\pm }}
:
W
F
=
F
⋅
|
ψ
−
⟩
⟨
ψ
−
|
+
1
−
F
3
|
ϕ
+
⟩
⟨
ϕ
+
|
+
1
−
F
3
|
ψ
+
⟩
⟨
ψ
+
|
+
1
−
F
3
|
ϕ
−
⟩
⟨
ϕ
−
|
{\displaystyle W_{F}=F\cdot |\psi ^{-}\rangle \langle \psi ^{-}|+{\frac {1-F}{3}}|\phi ^{+}\rangle \langle \phi ^{+}|+{\frac {1-F}{3}}|\psi ^{+}\rangle \langle \psi ^{+}|+{\frac {1-F}{3}}|\phi ^{-}\rangle \langle \phi ^{-}|}
The Werner state
W
F
{\displaystyle W_{F}}
has the same purity F as the initial mixed state M from which it was derived due to the singlet's invariance under bilateral rotations.
Each of the two pairs is then acted on by a unilateral rotation, which we can call
σ
y
{\displaystyle \sigma _{y}}
, which has the effect of converting them from mainly
ψ
−
{\displaystyle \psi ^{-}}
Werner states to mainly
ϕ
+
{\displaystyle \phi ^{+}}
states with a large component
F
>
1
2
{\displaystyle F>{\frac {1}{2}}}
of
ϕ
+
{\displaystyle \phi ^{+}}
while the components of the other three Bell states are equal.
The two impure
ϕ
+
{\displaystyle \phi ^{+}}
states are then acted on by a bilateral XOR, and afterwards the target pair is locally measured along the z axis. The unmeasured source pair is kept if the target pair's spins come out parallel as in the case of both inputs being true
ϕ
+
{\displaystyle \phi ^{+}}
states; and it is discarded otherwise.
If the source pair has not been discarded it is converted back to a predominantly
ψ
−
{\displaystyle \psi ^{-}}
state by a unilateral
σ
y
{\displaystyle \sigma _{y}}
rotation, and made rotationally symmetric by a random bilateral rotation.
Repeating the outlined protocol above will distill Werner states whose purity may be chosen to be arbitrarily high
F
out
<
1
{\displaystyle F_{\text{out}}<1}
from a collection M of input mixed states of purity
F
in
>
1
2
{\textstyle F_{\text{in}}>{\frac {1}{2}}}
but with a yield tending to zero in the limit
F
out
→
1
{\displaystyle F_{\text{out}}\to 1}
. By performing another bilateral XOR operation, this time on a variable number
k
(
F
)
≈
1
1
−
F
{\textstyle k(F)\approx {\frac {1}{\sqrt {1-F}}}}
of source pairs, as opposed to 1, into each target pair prior to measuring it, the yield can be made to approach a positive limit as
F
out
→
1
{\displaystyle F_{\text{out}}\to 1}
. This method can then be combined with others to obtain an even higher yield.
Procrustean method
The Procrustean method of entanglement concentration can be used for as little as one partly entangled pair, being more efficient than the Schmidt projection method for entangling less than 5 pairs, and requires Alice and Bob to know the bias (
θ
{\displaystyle \theta }
) of the n pairs in advance. The method derives its name from Procrustes because it produces a perfectly entangled state by chopping off the extra probability associated with the larger term in the partial entanglement of the pure states:
cos
θ
|
↑
A
⟩
⊗
|
↓
B
⟩
−
sin
θ
|
↓
A
⟩
⊗
|
↑
B
⟩
{\displaystyle \cos \theta \left|\uparrow _{A}\right\rangle \otimes \left|\downarrow _{B}\right\rangle -\sin \theta \left|\downarrow _{A}\right\rangle \otimes \left|\uparrow _{B}\right\rangle }
Assuming a collection of particles for which
θ
{\displaystyle \theta }
is known as being either less than or greater than
π
/
4
{\displaystyle \pi /4}
the Procrustean method may be carried out by keeping all particles which, when passed through a polarization-dependent absorber, or a polarization-dependent-reflector, which absorb or reflect a fraction
tan
2
θ
{\displaystyle \tan ^{2}\theta }
of the more likely outcome, are not absorbed or deflected. Therefore, if Alice possesses particles for which
θ
≠
π
/
4
{\displaystyle \theta \neq \pi /4}
, she can separate out particles which are more likely to be measured in the up/down basis, and left with particles in maximally mixed state of spin up and spin down. This treatment corresponds to a POVM (positive-operator-valued measurement). To obtain a perfectly entangled state of two particles, Alice informs Bob of the result of her generalized measurement while Bob doesn't measure his particle at all but instead discards his if Alice discards hers.
Stabilizer protocol
The purpose of an
[
n
,
k
]
{\displaystyle \left[n,k\right]}
entanglement distillation protocol is to distill
k
{\displaystyle k}
pure ebits from
n
{\displaystyle n}
noisy ebits where
0
≤
k
≤
n
{\displaystyle 0\leq k\leq n}
. The yield of such a protocol is
k
/
n
{\displaystyle k/n}
. Two parties can then use the noiseless ebits for quantum communication protocols.
The two parties establish a set of shared noisy ebits in the following way. The sender Alice first prepares
n
{\displaystyle n}
Bell states
|
Φ
+
⟩
⊗
n
{\displaystyle \left\vert \Phi ^{+}\right\rangle ^{\otimes n}}
locally. She sends the second qubit of each pair over a noisy quantum channel to a receiver Bob. Let
|
Φ
n
+
⟩
{\displaystyle \left\vert \Phi _{n}^{+}\right\rangle }
be the state
|
Φ
+
⟩
⊗
n
{\displaystyle \left\vert \Phi ^{+}\right\rangle ^{\otimes n}}
rearranged so that all of Alice's qubits are on the left and all of Bob's qubits are on the right. The noisy quantum channel applies a Pauli error in the error set
E
⊂
Π
n
{\displaystyle {\mathcal {E}}\subset \Pi ^{n}}
to the set of
n
{\displaystyle n}
qubits sent over the channel. The sender and receiver then share a set of
n
{\displaystyle n}
noisy ebits of the form
(
I
⊗
A
)
|
Φ
n
+
⟩
{\displaystyle \left(\mathbf {I} \otimes \mathbf {A} \right)\left\vert \Phi _{n}^{+}\right\rangle }
where the identity
I
{\displaystyle \mathbf {I} }
acts on Alice's qubits and
A
{\displaystyle \mathbf {A} }
is some Pauli operator in
E
{\displaystyle {\mathcal {E}}}
acting on Bob's qubits.
A one-way stabilizer entanglement distillation protocol uses a stabilizer code for the distillation procedure. Suppose the stabilizer
S
{\displaystyle {\mathcal {S}}}
for an
[
n
,
k
]
{\displaystyle \left[n,k\right]}
quantum error-correcting code has generators
g
1
,
…
,
g
n
−
k
{\displaystyle g_{1},\ldots ,g_{n-k}}
. The distillation procedure begins with Alice measuring the
n
−
k
{\displaystyle n-k}
generators in
S
{\displaystyle {\mathcal {S}}}
. Let
{
P
i
}
{\displaystyle \left\{\mathbf {P} _{i}\right\}}
be the set of the
2
n
−
k
{\displaystyle 2^{n-k}}
projectors that project onto the
2
n
−
k
{\displaystyle 2^{n-k}}
orthogonal subspaces corresponding to the generators in
S
{\displaystyle {\mathcal {S}}}
. The measurement projects
|
Φ
n
+
⟩
{\displaystyle \left\vert \Phi _{n}^{+}\right\rangle }
randomly onto one of the
i
{\displaystyle i}
subspaces. Each
P
i
{\displaystyle \mathbf {P} _{i}}
commutes with the noisy operator
A
{\displaystyle \mathbf {A} }
on Bob's side so that
(
P
i
⊗
I
)
(
I
⊗
A
)
|
Φ
n
+
⟩
=
(
I
⊗
A
)
(
P
i
⊗
I
)
|
Φ
n
+
⟩
.
{\displaystyle \left(\mathbf {P} _{i}\otimes \mathbf {I} \right)\left(\mathbf {I} \otimes \mathbf {A} \right)\left\vert \Phi _{n}^{+}\right\rangle =\left(\mathbf {I} \otimes \mathbf {A} \right)\left(\mathbf {P} _{i}\otimes \mathbf {I} \right)\left\vert \Phi _{n}^{+}\right\rangle .}
The following important Bell-state matrix identity holds for an arbitrary matrix
M
{\displaystyle \mathbf {M} }
:
(
M
⊗
I
)
|
Φ
n
+
⟩
=
(
I
⊗
M
T
)
|
Φ
n
+
⟩
.
{\displaystyle \left(\mathbf {M} \otimes \mathbf {I} \right)\left\vert \Phi _{n}^{+}\right\rangle =\left(\mathbf {I} \otimes \mathbf {M} ^{T}\right)\left\vert \Phi _{n}^{+}\right\rangle .}
Then the above expression is equal to the following:
(
I
⊗
A
)
(
P
i
⊗
I
)
|
Φ
n
+
⟩
=
(
I
⊗
A
)
(
P
i
2
⊗
I
)
|
Φ
n
+
⟩
=
(
I
⊗
A
)
(
P
i
⊗
P
i
T
)
|
Φ
n
+
⟩
.
{\displaystyle \left(\mathbf {I} \otimes \mathbf {A} \right)\left(\mathbf {P} _{i}\otimes \mathbf {I} \right)\left\vert \Phi _{n}^{+}\right\rangle =\left(\mathbf {I} \otimes \mathbf {A} \right)\left(\mathbf {P} _{i}^{2}\otimes \mathbf {I} \right)\left\vert \Phi _{n}^{+}\right\rangle =\left(\mathbf {I} \otimes \mathbf {A} \right)\left(\mathbf {P} _{i}\otimes \mathbf {P} _{i}^{T}\right)\left\vert \Phi _{n}^{+}\right\rangle .}
Therefore, each of Alice's projectors
P
i
{\displaystyle \mathbf {P} _{i}}
projects Bob's qubits onto a subspace
P
i
T
{\displaystyle \mathbf {P} _{i}^{T}}
corresponding to Alice's projected subspace
P
i
{\displaystyle \mathbf {P} _{i}}
. Alice restores her qubits to the simultaneous +1-eigenspace of the generators in
S
{\displaystyle {\mathcal {S}}}
. She sends her measurement results to Bob. Bob measures the generators in
S
{\displaystyle {\mathcal {S}}}
. Bob combines his measurements with Alice's to determine a syndrome for the error. He performs a recovery operation on his qubits to reverse the error. He restores his qubits
S
{\displaystyle {\mathcal {S}}}
. Alice and Bob both perform the decoding unitary corresponding to stabilizer
S
{\displaystyle {\mathcal {S}}}
to convert their
k
{\displaystyle k}
logical ebits to
k
{\displaystyle k}
physical ebits.
Entanglement-assisted stabilizer code
Luo and Devetak provided a straightforward extension of the above protocol (Luo and Devetak 2007). Their method converts an entanglement-assisted stabilizer code into an entanglement-assisted entanglement distillation protocol.
Luo and Devetak form an entanglement distillation protocol that has entanglement assistance from a few noiseless ebits. The crucial assumption for an entanglement-assisted entanglement distillation protocol is that Alice and Bob possess
c
{\displaystyle c}
noiseless ebits in addition to their
n
{\displaystyle n}
noisy ebits. The total state of the noisy and noiseless ebits is
(
I
A
⊗
(
A
⊗
I
)
B
)
|
Φ
n
+
c
+
⟩
{\displaystyle \left(\mathbf {I} ^{A}\otimes \left(\mathbf {A\otimes I} \right)^{B}\right)\left\vert \Phi _{n+c}^{+}\right\rangle }
where
I
A
{\displaystyle \mathbf {I} ^{A}}
is the
2
n
+
c
×
2
n
+
c
{\displaystyle 2^{n+c}\times 2^{n+c}}
identity matrix acting on Alice's qubits and the noisy Pauli operator
(
A
⊗
I
)
B
{\displaystyle \left(\mathbf {A\otimes I} \right)^{B}}
affects Bob's first
n
{\displaystyle n}
qubits only. Thus the last
c
{\displaystyle c}
ebits are noiseless, and Alice and Bob have to correct for errors on the first
n
{\displaystyle n}
ebits only.
The protocol proceeds exactly as outlined in the previous section. The only difference is that Alice and Bob measure the generators in an entanglement-assisted stabilizer code. Each generator spans over
n
+
c
{\displaystyle n+c}
qubits where the last
c
{\displaystyle c}
qubits are noiseless.
We comment on the yield of this entanglement-assisted entanglement distillation protocol. An entanglement-assisted code has
n
−
k
{\displaystyle n-k}
generators that each have
n
+
c
{\displaystyle n+c}
Pauli entries. These parameters imply that the entanglement distillation protocol produces
k
+
c
{\displaystyle k+c}
ebits. But the protocol consumes
c
{\displaystyle c}
initial noiseless ebits as a catalyst for distillation. Therefore, the yield of this protocol is
k
/
n
{\displaystyle k/n}
.
Entanglement dilution
The reverse process of entanglement distillation is entanglement dilution, where large copies of the Bell state are converted into less entangled states using LOCC with high fidelity. The aim of the entanglement dilution process, then, is to saturate the inverse ratio of n to m, defined as the distillable entanglement.
Applications
Besides its important application in quantum communication, entanglement purification also plays a crucial role in error correction for quantum computation, because it can significantly increase the quality of logic operations between different qubits. The role of entanglement distillation is discussed briefly for the following applications.
= Quantum error correction
=Entanglement distillation protocols for mixed states can be used as a type of error-correction for quantum communications channels between two parties Alice and Bob, enabling Alice to reliably send mD(p) qubits of information to Bob, where D(p) is the distillable entanglement of p, the state that results when one half of a Bell pair is sent through the noisy channel
ϵ
{\displaystyle \epsilon }
connecting Alice and Bob.
In some cases, entanglement distillation may work when conventional quantum error-correction techniques fail. Entanglement distillation protocols are known which can produce a non-zero rate of transmission D(p) for channels which do not allow the transmission of quantum information due to the property that entanglement distillation protocols allow classical communication between parties as opposed to conventional error-correction which prohibits it.
= Quantum cryptography
=The concept of correlated measurement outcomes and entanglement is central to quantum key exchange, and therefore the ability to successfully perform entanglement distillation to obtain maximally entangled states is essential for quantum cryptography.
If an entangled pair of particles is shared between two parties, anyone intercepting either particle will alter the overall system, allowing their presence (and the amount of information they have gained) to be determined so long as the particles are in a maximally entangled state. Also, in order to share a secret key string, Alice and Bob must perform the techniques of privacy amplification and information reconciliation to distill a shared secret key string. Information reconciliation is error-correction over a public channel which reconciles errors between the correlated random classical bit strings shared by Alice and Bob while limiting the knowledge that a possible eavesdropper Eve can have about the shared keys. After information reconciliation is used to reconcile possible errors between the shared keys that Alice and Bob possess and limit the possible information Eve could have gained, the technique of privacy amplification is used to distill a smaller subset of bits maximizing Eve's uncertainty about the key.
= Quantum teleportation
=In quantum teleportation, a sender wishes to transmit an arbitrary quantum state of a particle to a possibly distant receiver. Quantum teleportation is able to achieve faithful transmission of quantum information by substituting classical communication and prior entanglement for a direct quantum channel. Using teleportation, an arbitrary unknown qubit can be faithfully transmitted via a pair of maximally-entangled qubits shared between sender and receiver, and a 2-bit classical message from the sender to the receiver. Quantum teleportation requires a noiseless quantum channel for sharing perfectly entangled particles, and therefore entanglement distillation satisfies this requirement by providing the noiseless quantum channel and maximally entangled qubits.
See also
Quantum channel
Quantum cryptography
Quantum entanglement
Quantum state
Quantum teleportation
LOCC
Purification theorem
Notes and references
Kata Kunci Pencarian:
- Entanglement distillation
- Quantum entanglement
- William Wootters
- Quantum teleportation
- Quantum network
- Bell's theorem
- Quantum information science
- Gottesman–Knill theorem
- Gilles Brassard
- Qubit
