Simple entanglement example.
Posted by peeterjoot on October 4, 2011
On the quiz we were given a three state system and , and a two state system , and were asked to show that the composite system can be entangled. I had trouble with this, having not seen any examples of this and subsequently filing away entanglement in the “abstract stuff that has no current known application” bit bucket, and then forgetting about it. Let’s generate a concrete example of entanglement, and consider the very simplest direct product spaces.
What’s the simplest composite state that we can create? Suppose we have a pair of two state systems, say,
We can now enumerate the space of possible operators
We can also enumerate all the possible states, some of these can be entangled
And finally, we can enumerate all the possible product states
In this simpler example, we have the same dimensionality for both the sets of direct product kets and the ones formed by arbitrary superposition of the composite ket basis elements, but that doesn’t mean that this rules out entanglement.
Suppose that, as the product of some operator, we end up with a ket
Does this have a product representation, of the following form
For this to be true we would require
However, we can’t find a solution to this set of equations. We require one of or for the third equality, but such zeros generate contradictions for one of the first pair of equations.