5.2: Entanglement
- Page ID
- 56550
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)Consider the following experiment: Alice and Bob each blindly draw a marble from a vase that contains one black and one white marble. Let’s call the state of the write marble \(|0\rangle\) and the state of the black marble \(|1\rangle\). If we describe this classical experiment quantum mechanically (we can always do this, because classical physics is contained in quantum physics), then there are two possible states, \(|1,0\rangle\) and \(|0,1\rangle\). Since blind drawing is a statistical procedure, the state of the marbles held by Alice and Bob is the mixed state
\[\rho=\frac{1}{2}|0,1\rangle\left\langle 0,1\left|+\frac{1}{2}\right| 1,0\right\rangle\langle 1,0|\tag{5.5}\]
From Alice’s perspective, the state of her marble is obtained by tracing over Bob’s marble:
\[\rho_{A}=\operatorname{Tr}_{B}(\rho)=\frac{1}{2}|0\rangle\left\langle 0\left|+\frac{1}{2}\right| 1\right\rangle\langle 1|\tag{5.6}\]
This is what we expect: Alice has a 50:50 probability of finding “white” or “black” when she looks at her marble (i.e., when she measures the colour of the marble).
Next, consider what the state of Bob’s marble is when Alice finds a white marble. Just from the setup we know that Bob’s marble must be black, because there was only one white and one black marble in the vase. Let’s see if we can reproduce this in our quantum mechanical description. Finding a white marble can be described mathematically by a projection operator \(|0\rangle\langle 0|\) (see Eq. (2.24)). We need to include this operator in the trace over Alice’s marble’s Hilbert space:
\[\rho_{B}=\frac{\operatorname{Tr}_{A}\left(|0\rangle_{A}\langle 0| \rho\right)}{\operatorname{Tr}\left(|0\rangle_{A}\langle 0| \rho\right)}=|1\rangle\langle 1|,\tag{5.7}\]
which we set out to prove: if Alice finds that when she sees that her marble is white, she describes the state of Bob’s marble as black. Based on the setup of this experiment, Alice knows instantaneously what the state of Bob’s marble is as soon as she looks at her own marble. There is nothing spooky about this; it just shows that the marbles held by Alice and Bob are correlated.
Next, consider a second experiment: By some procedure, the details of which are not important right now, Alice and Bob each hold a two-level system (a qubit) in the pure state
\[|\Psi\rangle_{A B}=\frac{|0,1\rangle+|1,0\rangle}{\sqrt{2}}\tag{5.8}\]
Since \(|1,0\rangle\) and \(|0,1\rangle\) are valid quantum states, by virtue of the first postulate of quantum mechanics \(|\Psi\rangle_{A B}\) is also a valid quantum mechanical state. It is not difficult to see that these systems are also correlated in the states \(|0\rangle\) and \(|1\rangle\): When Alice finds the value “0”, Bob must find the value “1”, and vice versa. We can write this state as a density operator
\[\begin{aligned}
\rho &=\frac{1}{2}(|0,1\rangle+|1,0\rangle)(\langle 0,1|+\langle 1,0|) \\
&=\frac{1}{2}(|0,1\rangle\langle 0,1|+| 0,1\rangle\langle 1,0|+| 1,0\rangle\langle 0,1|+| 1,0\rangle\langle 1,0|) .
\end{aligned}.\tag{5.9}\]
Notice the two extra terms with respect to Eq. (5.5). If Alice now traces out Bob’s system, she finds that the state of her marble is
\[\rho_{A}=\operatorname{Tr}_{B}(\rho)=\frac{1}{2}|0\rangle\left\langle 0\left|+\frac{1}{2}\right| 1\right\rangle\langle 1|.\tag{5.10}\]
In other words, even though the total system was in a pure state, the subsystem held by Alice (and Bob, check this) is mixed! We can try to put the two states back together:
\[\begin{aligned}
\rho_{A} \otimes \rho_{B} &=\left(\frac{1}{2}|0\rangle\left\langle 0\left|+\frac{1}{2}\right| 1\right\rangle\langle 1|\right) \otimes\left(\frac{1}{2}|0\rangle\left\langle 0\left|+\frac{1}{2}\right| 1\right\rangle\langle 1|\right) \\
&=\frac{1}{4}(|0,0\rangle\langle 0,0|+| 0,1\rangle\langle 0,1|+| 1,0\rangle\langle 1,0|+| 1,1\rangle\langle 1,1|)
\end{aligned},\tag{5.11}\]
but this is not the state we started out with! It is also a mixed state, instead of the pure state we started with. Since mixed states mean incomplete knowledge, there must be some information in the combined system that does not reside in the subsystems alone! This is called entanglement.
Entanglement arises because states like \((|0,1\rangle+|1,0\rangle) / \sqrt{2}\) cannot be written as a tensor product of two pure states \(|\psi\rangle \otimes|\phi\rangle\). These latter states are called separable. In general a state is separable if and only if it can be written as
\[\rho=\sum_{j} p_{j} \rho_{j}^{(A)} \otimes \rho_{j}^{(B)}\tag{5.12}\]
Classical correlations such as the black and white marbles above fall into the category of separable states.
So far, we have considered the quantum states in the basis \(\{|0\rangle,|1\rangle\}\). However, we can also describe the same system in the rotated basis \(\{|\pm\rangle\}\) according to
\[|0\rangle=\frac{|+\rangle+|-\rangle}{\sqrt{2}} \quad \text { and } \quad|1\rangle=\frac{|+\rangle-|-\rangle}{\sqrt{2}}\tag{5.13}\]
The entangled state \(|\Psi\rangle_{A B}\) can then be written as
\[\frac{|0,1\rangle+|1,0\rangle}{\sqrt{2}}=\frac{|+,+\rangle-|-,-\rangle}{\sqrt{2}},\tag{5.14}\]
which means that we have again perfect correlations between the two systems with respect to the states \(|+\rangle\) and \(|-\rangle\). Let’s do the same for the state \(\rho\) in Eq. (5.5) for classically correlated marbles. After a bit of algebra, we find that
\[\begin{aligned}
\rho=& \frac{1}{4}(|++\rangle\langle++|+|+-\rangle\langle+-|+|-+\rangle\langle-+|+|--\rangle\langle--|\\
&-|++\rangle\langle--|-|--\rangle\langle++|-|+-\rangle\langle-+|-|-+\rangle\langle+-|) .
\end{aligned}.\tag{5.15}\]
Now there are no correlations in the conjugate basis \(\{|\pm\rangle\}\), which you can check by calculating the conditional probabilities of Bob’s state given Alice’s measurement outcomes. This is another key difference between classically correlated states and entangled states. A good interpretation of entanglement is that entangled systems exhibit correlations that are stronger than classical correlations. We will shortly see how these stronger correlations can be used in information processing.
We have seen that operators, just like states, can be combined into tensor products:
\[A \otimes B|\phi\rangle \otimes|\psi\rangle=A|\phi\rangle \otimes B|\psi\rangle.\tag{5.16}\]
And just like states, some operators cannot be written as \(A \otimes B\):
\[C=\sum_{k} A_{k} \otimes B_{k}\tag{5.17}\]
This is the most general expression of an operator in the Hilbert space \(\mathscr{H}_{1} \otimes \mathscr{H}_{2}\). In Dirac notation this becomes
\[C=\sum_{j k l m} \phi_{j k l m}|\phi_{j}\rangle\langle\phi_{k}|\otimes| \phi_{l}\rangle\langle\phi_{m}|=\sum_{j k l m} \phi_{j k l m}| \phi_{j}, \phi_{l}\rangle\langle\phi_{k}, \phi_{m}|.\tag{5.18}\]
As an example, the Bell operator is diagonal on the Bell basis:
\[\left|\Phi^{\pm}\right\rangle=\frac{|0,0\rangle \pm|1,1\rangle}{\sqrt{2}} \text { and }\left|\Psi^{\pm}\right\rangle=\frac{|0,1\rangle \pm|1,0\rangle}{\sqrt{2}}.\tag{5.19}\]
The eigenvalues of the Bell operator are not important, as long as they are not degenerate (why?). A measurement of the Bell operator projects onto an eigenstate of the operator, which is an entangled state. Consequently, we cannot implement such composite measurements by measuring each subsystem individually, because those individual measurements would project onto pure states of the subsystems. And we have seen that the subsystems of pure entangled states are mixed states.
A particularly useful technique when dealing with two systems is the so-called Schmidt decomposition. In general, we can write any pure state over two systems as a superposition of basis states:
\[|\Psi\rangle=\sum_{j=1}^{d_{A}} \sum_{k=1}^{d_{B}} c_{j k}\left|\phi_{j}\right\rangle_{A}\left|\psi_{k}\right\rangle_{B},\tag{5.20}\]
where \(d_{A}\) and \(d_{B}\) are the dimensions of the Hilbert spaces of system \(A\) and \(B\), respectively, and we order the systems such that \(d_{B} \geq d_{A}\). It turns out that we can always simplify this description and write \(|\Psi\rangle\) as a single sum over basis states. We state it as a theorem:
Let \(|\Psi\rangle\) be a pure state of two systems, \(A\) and \(B\) with Hilbert spaces \(\mathscr{H}_{A}\) and \(\mathscr{H}_{B}\) of dimension \(d_{A}\) and \(d_{B} \geq d_{A}\), respectively. There exist orthonormal basis vectors \(\left|a_{j}\right\rangle_{A}\) for system \(A\) and \(\left|b_{j}\right\rangle_{B}\) for system B such that
\[|\Psi\rangle=\sum_{j} \lambda_{j}\left|a_{j}\right\rangle_{A}\left|b_{j}\right\rangle_{B},\tag{5.21}\]
with real, positive Schmidt coefficients \(\lambda_{j}\), and \(\sum_{j} \lambda_{j}^{2}=1\). This decomposition is unique, and the sum runs at most to \(d_{A}\), the dimension of the smallest Hilbert space. Traditionally, we order the Schmidt coefficients in descending order: \(\lambda_{1} \geq \lambda_{2} \geq \ldots\) The total number of non-zero \(\lambda_{i}\) is the Schmidt number.
- Proof
-
The proof can be found in many graduate texts on quantum mechanics and quantum information theory.
Given the Schmidt decomposition for a bi-partite system, we can immediately write down the reduced density matrices for the sub-systems:
\[\rho_{A}=\operatorname{Tr}_{B}(|\Psi\rangle\langle\Psi|)=\sum_{j} \lambda_{j}^{2}\left|a_{j}\right\rangle_{A}\left\langle a_{j}\right|,\tag{5.22}\]
and
\[\rho_{B}=\operatorname{Tr}_{A}(|\Psi\rangle\langle\Psi|)=\sum_{j} \lambda_{j}^{2}\left|b_{j}\right\rangle_{B}\left\langle b_{j}\right|.\tag{5.23}\]
The basis states \(\left|a_{j}\right\rangle_{A}\) and \(\left|b_{j}\right\rangle_{B}\) may have completely different physical meanings; here we care only that the states of the decomposition can be labelled with a single index, as opposed to two indices.
Conversely, when we have a single system in a mixed state
\[\rho=\sum_{j} p_{j}\left|a_{j}\right\rangle\left\langle a_{j}\right|,\tag{5.24}\]
we can always construct a pure state \(|\Psi\rangle\) that obeys \(\left(\lambda_{j}=\sqrt{p_{j}}\right)\)
\[|\Psi\rangle=\sum_{j} \lambda_{j}\left|a_{j}, b_{j}\right\rangle,\tag{5.25}\]
By virtue of the Schmidt decomposition. The state \(|\Psi\rangle\) is called the purification of \(\rho\). Since many theorems are easier to prove for pure states than for mixed states, purifications can make our work load significantly lighter.
When there is more than one non-zero \(\lambda_{j}\) in Eq. (5.25), the state \(|\Psi\rangle\) is clearly entangled: there is no alternative choice of \(\lambda_{j}\) due to the uniqueness of the Schmidt decomposition that would result in \(\lambda_{1}^{\prime}=1\) and all others zero. Moreover, the more uniform the values of \(\lambda_{j}\), the more the state is entangled. One possible measure for the amount of entanglement in \(|\Psi\rangle\) is the Shannon entropy H.
\[H=-\sum_{j} \lambda_{j}^{2} \log _{2} \lambda_{j}^{2}\tag{5.26}\]
This is identical to the von Neumann entropy \(S\) of the reduced density matrix \(\rho\) of \(|\Psi\rangle\) given in Eq. (5.24):
\[S(\rho)=-\operatorname{Tr}\left(\rho \log _{2} \rho\right)\tag{5.27}\]
Both entropies are measured in classical bits.
How do we find the Schmidt decomposition? Consider the state \(|\Psi\rangle\) from Eq. (5.20). The (not necessarily square) matrix \(C\) with elements \(c_{j k}\) needs to be transformed into a single array of numbers \(\lambda_{j}\). This is achieved by applying the singular-value decomposition:
\[c_{j k}=\sum_{i} u_{j i} d_{i i} v_{i k},\tag{5.28}\]
where \(u_{j i}\) and \(v_{i k}\) are elements of unitary matrices \(U\) and \(V\), respectively, and \(d_{i i}\) is a diagonal matrix with singular values \(\lambda_{i}\). The vectors in the Schmidt decomposition become
\[\left|a_{i}\right\rangle=\sum_{j} u_{j i}\left|\phi_{j}\right\rangle \quad \text { and } \quad\left|b_{i}\right\rangle=\sum_{k} v_{i k}\left|\psi_{k}\right\rangle.\tag{5.29}\]
This is probably a good time to remind ourselves about the singular-value decomposition. All we need to do is find \(U\) and \(V\), the rest is just matrix multiplication. To find \(U\), we diagonalize \(C C^{\dagger}\) and find its eigenvectors. These form the columns of \(U\). Similarly, we diagonalize \(C^{\dagger} C\) and arrange the eigenvectors in columns to find \(V\). If \(C\) is an \(n \times m\) matrix, \(U\) should be \(n \times n\) and \(V\) should be \(m× m\).