Checkpoint: Compute Entropies
This checkpoint pulls the module together. You will take a pure bipartite state, read off its reduced density matrix, and compute its entanglement entropy — the same number whether you call it the von Neumann entropy of the part or the entanglement of the whole.
What you have learned
By now you can:
- compute the Shannon entropy of a distribution;
- compute the von Neumann entropy from the eigenvalues of a density operator;
- distinguish pure () from mixed () states, with the maximally mixed state of levels reaching ;
- form a reduced state by partial trace and read off the entanglement entropy of a pure bipartite state as ;
- find Schmidt coefficients as the singular values of the coefficient matrix, so that the squared coefficients are exactly the eigenvalues of .
The checkpoint state
Consider the pure two-qubit state already written in Schmidt form,
Because the -labels pair one-to-one with the -labels , the Schmidt coefficients are and . Tracing out qubit ,
The entanglement entropy is the von Neumann entropy of this reduced state:
It lies between (product state) and (maximally entangled Bell state), confirming partial entanglement — closer to maximal than the example from the entanglement-entropy lesson, because the Schmidt coefficients here are more nearly equal.
Try it
For , form the reduced state , and return its von Neumann entropy — the entanglement entropy in bits.
Sign in on the full site to ask questions and join the discussion.