Jump to content

Multiple-Qubit Systems


Genady

Recommended Posts

(From Rieffel, Eleanor G.; Polak, Wolfgang H.. Quantum Computing: A Gentle Introduction.)

image.png.044c4b1d66e6296f32396b7accdd8ba3.png

Let's call vectors a=(1,0,0), b=(0,1,0), and c=(0,0,1)

One answer is the basis {aa,ab,ac,ba,bb,bc,ca,cb,cc}.

Let's take two different vectors in V: d=(0,sqrt(1/2),sqrt(1/2)) and e=(0,sqrt(1/2),-sqrt(1/2)). a, d, and e are orthonormal.

The second answer is the basis {aa,ad,ae,da,dd,de,ea,ed,ee}.

 

Of course, there are many other bases.

Link to comment
Share on other sites

image.png.7de3cdd9e07bfa1d2c2f1e07ba3d8c7b.png

 

Let's assume it is not entangled with respect to such decomposition. Then it can be factorized (I skip the normalization factors for simplicity):

|Wn> = (a|0>+b|1>)...(y|0>+z|1>)

Then, this state would have a term, a...y|0...0>. But there is no such term. It means that a...y=0. Let's say, a=0. Then,

|Wn> = b|1>(...)...(y|0>+z|1>).

Then, every term would have |1> for the first qubit, which is not so. Contradiction. Thus, such factorization is impossible, and the state is entangled with respect to such decomposition.

Edited by Genady
Link to comment
Share on other sites

image.png.cac8036ad4f7170add27b106e8cdf0a6.png

|0>|+> + |1>|- > = |0>(|0>+|1>) + |1>(|0>-|1>) =

|00>+|01>+|10>-|11> =(assume) (|0>+x|1>)(|0>+y|1>) =

|00>+y|01>+x|10>+xy|11>

This requires x=1, y=1, xy=-1, which is impossible.

Thus, the state is entangled.

 

Edited by Genady
Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.