Jump to content

Measurement of Multiple-Qubit States


Genady

Recommended Posts

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

image.png.acbc086353dc9170f735378f2f29fb8c.png

a. 

1 0
0 0

b. = (|0>+|1>)<0| - i(|0>-|1>)<1| = |0><0| + |1><0| - i|0><1| +i|1><1|

1    -i
1      i

c. 

1 0 0 0
0 1 0 0
0 0 0 0
0 0 0 0

d.  

1 0 0 0
0 1 0 0
0 0 0 1
0 1 0 0

e. = 1/2(|00>+|11>)(<00|+<11|) = 1/2(|00><00|+|00><11|+|11><00|+|11><11|)

1/2 0 0 1/2
0 0 0 0
0 0 0 0
1/2 0 0 1/2

 

All right?

Edited by Genady
Link to comment
Share on other sites

image.png.a1b027017471ae490aae5d74351053d9.png

a. 1/√2(|0><0|+|0><1|+|1><0|-|1><1|)

b. |0><1|+|1><0|

c. |0><1|-|1><0|

d. |0><0|-|1><1|

e. 23|00><00|-5|01><01|+9|11><11|

f. (|0><1|+|1><0|)⊗(|0><1|+|1><0|) = |00><11|+|01><10|+|10><01|+|11><00|

g. (|0><1|+|1><0|)⊗(|0><0|-|1><1|) = |00><10|-|01><11|+|10><00|-|11><01|

h. 1/2(|00><00|+|00><01|+|01><00|-|01><01|+|00><10|+|00><11|+|01><10|-|01><11|+

           |10><00|+|10><01|+|11><00|-|11><01|-|10><10|-|10><11|-|11><10|+|11><11|

i. P1 = |++><++| + |-- >< --|

   P2 = |+- ><+-| + |-+>< -+|

 

Correct?

Link to comment
Share on other sites

image.png.eecbdab8c47e1b8a6fd80ef63891765b.png

Let's consider a direct sum decomposition of the space V = S ⊕ S, where S and S are orthogonal, and let's consider a projection operator P of V onto S.

Take two vectors (|v〉+|v〉) and (|w〉+|w〉) in V, where |v〉 and |w〉 are in S and |v〉 and |w〉 are in S. By definition, P(|v〉+|v〉)=|v〉.

(〈w|+〈w|)(P(|v〉+|v〉)) = (〈w|+〈w|)(|v〉) = 〈w|v〉.

OTOH, by definition, P(|w〉+|w〉)=|w〉.

((〈w|+〈w|)P)(|v〉+|v〉) = (〈w|)(|v〉+|v〉) = 〈w|v〉.

Thus,

(〈w|+〈w|)(P(|v〉+|v〉)) = ((〈w|+〈w|)P)(|v〉+|v〉),

i.e., P is its own adjoint.

Edited by Genady
Link to comment
Share on other sites

10 hours ago, Genady said:

b. = (|0>+|1>)<0| - i(|0>-|1>)<1| = |0><0| + |1><0| - i|0><1| +i|1><1|

1    -i
1      i

Give me some time to check conventions. They differ from QC to "atoms-and-molecules" QM...

But arent you missing 1/sqrt(2) factors there? Plus and minus kets should be normalised.

Didn't get the time to check everything else yet. One of the most common mistakes is when taking the adjoint of |0> + i |1> which should be <0|-i<1|

but I'm guessing you didn't make that mistake.

Link to comment
Share on other sites

55 minutes ago, Genady said:

Yes, I am. Thank you.

Thank you for checking. The book does not give answers of the exercises, so I don't have a way to check myself.

You're most welcome.

The rest of the expansions seem right to me.

As to proof 4.3, I see what you're doing there, and it's correct too, AFAICS. The only glitch is for these kind of proofs is that it's perhaps best to drop Dirac's notation, because it kind of stands in the way of distinguishing the vector, the operator, and the action of the inner product more clearly, so you wouldn't have to use the --somewhat awkward, IMO-- double parenthesis on your last line.

So, for example, I would write something like,

for every \( w \), \( v \) in \( \mathscr{H} \) (the Hilbert space of states),

\[ \left( w, P\right) = \left( P^{\dagger}w,v \right) \]

(That is just a definition of \( P^{\dagger} \), of course)

I would also write,

\[ v=v_{perp}+v_{parallel} \]

etc, with,

\[ Pv_{perp}=0 \]

\[ Pv_{parallel}=v_{parallel} \]

 

for an arbitrary vector \( v \).

And then, as you say,

\[ \left( w, Pv \right) = \left( w,w_{\parallel} \right) = \left( w_{\parallel}, v_{\parallel} \right) = \left( w_{\parallel}, v \right) = \left( Pw, v \right) \]

 

So indeed \( P^{\dagger}=P.

To me, it's a bit more transparent with this notation, but I understood what you meant, and if you think about it we're saying the same thing.

The devil is in the details, as they say. In infinite dimension one would have to be much more careful than this, but I don't have the chops for it. 😊

 

Ok. Something got messed up in the LaTeX rendering, I'm afraid... I hope you can see what it is.

I always have to be very careful that my text is not interpreted as rich text at some point (eg, when the editor refreshes) so the rendering is messed up.

It might have to do with the software at my end. I dunno.

Link to comment
Share on other sites

1 hour ago, joigus said:

it's perhaps best to drop Dirac's notation, because it kind of stands in the way of distinguishing the vector, the operator, and the action of the inner product more clearly, so you wouldn't have to use the --somewhat awkward, IMO-- double parenthesis on your last line.

Yes, I think we do the same thing in different notations.

I use the Dirac's notation because it seems to be the standard in this book and maybe in QC. The nested parenthesis might be easier to read if I give more spaces, e.g.,

(〈w|+〈w|) (P (|v〉+|v〉) ) = ( (〈w|+〈w|) P ) (|v〉+|v〉).

Perhaps, I should've made the vectors |q> = |v〉+|v〉 and |r> = |w〉+|w〉, and the last line would be then

<r| (P|q>) = (<r|P) |q>

Edited by Genady
Link to comment
Share on other sites

Yes. On the one hand stating more clearly that what you're saying is that every \( \left| q \right\rangle) \) in the space can be written as \( \left| v \right\rangle + \left| v_{\perp} \right\rangle \) (what I've written as \( v=v_{\parallel}+v_{\perp} \) ), and on the other hand, noticing that taking the action of \( P \) from the second to the first factor in the scalar product is not simply "looking at it as acting on its left", but also complex conjugating.

In matrix notation: q⁺Pr=(P⁺q)⁺r

where "+" as a superindex means complex conjugate and transpose. It's only when P⁺=P that you can write, q⁺P=(P⁺q)⁺=(Pq)⁺

Otherwise, you can just say that q⁺P=(P⁺q)⁺, which is always true, because it's a definition.

This you cannot say clearly in Dirac notation, as Dirac notation automatically assumes that any operator "sandwiched" between both factors is Hermitian. Otherwise the notation is ambiguous. That's why someone as careful as Weinberg sometimes drops it in his proofs. Weinberg proved most everything he said, so he was very careful about these questions.

The point of the exercise being that the eigenvalues of any projector are always real. Something that is not true for any linear operator.

Another way of seeing it is by investigating the eigenvalue equation. As P²=P, the eigenvalues must satisfy p²=p, so either p=0 or 1.

Link to comment
Share on other sites

1 hour ago, joigus said:

Otherwise, you can just say that q⁺P=(P⁺q)⁺, which is always true, because it's a definition.

On this exact point:

image.png.f6aab58996249d416f4d3c2c6e3712b2.png

(A|x〉)+ = (A|x〉)*T = (A*|x〉*)T = |x〉*TA*T= 〈x|A+

Edited by Genady
Link to comment
Share on other sites

Exactly. As you see, Dirac's notation can handle it by using extra round braces. But it kind of becomes more awkward --or perhaps just uglier-- for those cases.

And it's a huge inconvenience when you want to talk about time inversion operation, because it's not even linear, but antilinear, so it has a complex conjugation in its guts that "interferes" with the complex conjugation involved in passing from ket to bra.

Link to comment
Share on other sites

image.png.ec8a688aabf083b29c9ae074fab39f5c.png

For the reference:

image.png.f49afe1692687f4b5e71d2c8ec1d3172.png

a. |01〉 = 1/√2 (|Φ+〉-|Φ-〉); 1/2 each

    |10〉 = 1/√2 (|Ψ+〉+|Ψ-〉); 1/2 each

    |11〉 = 1/√2 (|Ψ+〉-|Ψ-〉); 1/2 each

b. = 1/√2 (a00(|Φ+〉+|Φ-〉)+a01(|Φ+〉-|Φ-〉)+a10(|Ψ+〉+|Ψ-〉)+a11(|Ψ+〉-|Ψ-〉))

    = 1/√2 ((a00+a01)|Φ+〉+(a00-a01)|Φ-〉+(a10+a11)|Ψ+〉+(a10-a11)|Ψ-〉)

    Outcomes: |Φ+〉, |a00+a01|2/2; |Φ-〉, |a00-a01|2/2; |Ψ+〉, |a10+a11|2/2; |Ψ-〉, |a10-a11|2/2.

Link to comment
Share on other sites

image.png.2840ae3fa34cdad2614ed2de7df8e7c9.png

For the reference:

image.png.104bbd4f0bcef277995c25b941584b4c.png

a. B = (|0〉〈0|+π|1〉〈1|)⊗(|0〉〈0|+|1〉〈1|)

b. Subspace decomposition of Q is V=S0⊕S1 and subspace decomposition of I is V=S. Subspace decomposition of Q⊗I is V⊗V=S0⊗S⊕S1⊕S.

c. Subspace decomposition of Q is V=S0⊕S1 and subspace decomposition of I is V=S. Subspace decomposition of I⊗Q is V⊗V=S⊗S0⊕S⊕S1. It measures the second qubit.

Link to comment
Share on other sites

image.png.5715930049550353c95e13d75b852261.png

a. Rows of U are conjugate transposed columns of U. Multiplying them by other columns results in 0, thus they are orthogonal. Multiplying them by the same column results in 1, thus they are normalized.

b. (UOU-1) = (U-1)OU=UOU-1

c. The eigenvalue equation, (A-λI)v=0, constitutes n equations with n+1 unknowns. Hence it has at least one nontrivial solution.

d. Use induction. Any 1x1 matrix is upper triangular. Assume it's true for any nxn matrix and take A to be a (n+1)x(n+1) matrix.

Take the eigenvector v of A and choose any n orthonormal vectors orthogonal to v. Make matrix B, which has (λ,0,...0)T as its first column and the other chosen orthonormal vectors as its other columns. B is unitary. Make matrix C = B-1AB.

C(1,0,...0)T = B-1Av = B-1λv= λB-1v = (λ,0,...0)T. Thus, (λ,0,...0)T is the C matrix' first column.

The nxn matrix to the lower right of this column can be made upper triangular by the induction assumption. This completes the proof.

Link to comment
Share on other sites

(Finishing exercise 4.16 above)

e. Let's make an upper triangular matrix T=UAU-1. If A is Hermitian, then

T† = (U-1)AU = UAU-1 = T

Thus, T is upper triangular and T is upper triangular, i.e., T is diagonal. It has n orthonormal eigenvectors (1,0,...0), ... (0,...0,1) with the same eigenvalues as A. Then the columns of U-1 are eigenvectors of A. They are orthogonal. Thus, the direct sum of their corresponding eigenspaces gives the whole space.

Link to comment
Share on other sites

On 10/13/2023 at 12:30 AM, Genady said:

image.png.32ac7308826fa052289ef3a0b20fa938.png

|0><0|+|7><7|-(|1><1|+|2><2|+...+|6><6|)

I understand they're asking for a projector that embodies this measurement. You should not use a difference of projectors, as a difference of projectors is not a projector, even though the addition of two mutuallly orthogonal projectors is:

\[ \left(P+P^{\perp}\right)^{2}=P^{2}+\left(P^{\perp}\right)^{2}+PP^{\perp}+P^{\perp}P=P+P^{\perp} \]

But,

\[ \left(P-P^{\perp}\right)^{2}=P^{2}+\left(P^{\perp}\right)^{2}+PP^{\perp}+P^{\perp}P=P+P^{\perp} \]

But the operator you've written does commute with both \( P \) and \( P^{\perp} \), so it could implement such measurement, IMO.

People who work in QC are very old-school though, so I assume, for them, nothing but a projector will do.

Also, I don't remember the ordering of the computational basis. Clearly,

\[ \left|0\right\rangle :=\left|000\right\rangle \]

and,

\[ \left|7\right\rangle :=\left|111\right\rangle \]

But the rest I forget.

Sorry, there should be a couple of minus signs in the last equality, but it doesn't matter, as they are mutually orthogonal. That's why I was sloppy.

Link to comment
Share on other sites

47 minutes ago, joigus said:

I understand they're asking for a projector that embodies this measurement. You should not use a difference of projectors, as a difference of projectors is not a projector, even though the addition of two mutuallly orthogonal projectors is:

 

(P+P)2=P2+(P)2+PP+PP=P+P

 

But,

 

(PP)2=P2+(P)2+PP+PP=P+P

 

But the operator you've written does commute with both P and P , so it could implement such measurement, IMO.

People who work in QC are very old-school though, so I assume, for them, nothing but a projector will do.

Also, I don't remember the ordering of the computational basis. Clearly,

 

|0:=|000

 

and,

 

|7:=|111

 

But the rest I forget.

They are asking for an observable that embodies this measurement. That is the Hermitian operator built out of the combination of the projectors.

The other numbers are just decimal representations of the binary sequences, i.e. 1=001, 2=010, 3=011, ...

The observable

|0><0|+|7><7|-(|1><1|+|2><2|+...+|6><6|)

has an eigenspace with eigenvalue 1 of states with equal bit values, and another eigenspace with eigenvalue -1 of states with unequal bit values.

Edited by Genady
Link to comment
Share on other sites

image.png.ceb9b63166c6ff5f2620fddffe6fc30d.png

a. An unentangled state can be factorized by single-qubit states as v⊗w. A single-qubit measurement can be represented by an observable Q⊗I. The measurement with Q would change v into v'. The measurement with I would leave w unchanged. The result would be v'⊗w, which is unentangled.

b. Yes, e.g., a measurement with Bell states would produce an entangled state.

c. Yes, e.g., such a measuring of any Bell state.

Edited by Genady
Link to comment
Share on other sites

image.png.fe6cb131f5465114de335ca250fb69e8.png

Let's assume that the two qubits are unentangled. Then their state can be factorized, v⊗w. If the first qubit is measured by projecting its state onto the subspace spanned by v, its result will be certain contrary to the assumption that there is no such measurement. Thus, they are entangled.

Link to comment
Share on other sites

image.png.520b874ad9f0a07b5f4c8e7f5e909255.png

The reference:

image.png.db2b89db8a3ba4a7b9eaeabf5b7afafa.png

|v〉〈v|-|v〉〈v| = cos2θ|0〉〈0| + sin2θ|1〉〈1| + cosθsinθ|0〉〈1| + cosθsinθ|1〉〈0| - (sin2θ|0〉〈0| + cos2θ|1〉〈1| - cosθsinθ|0〉〈1| - cosθsinθ|1〉〈0|) =

cos2θ|0〉〈0| - cos2θ|1〉〈1| + sin2θ|0〉〈1| + sin2θ|1〉〈0|

 

  cos2θ   sin2θ
  sin2θ  -cos2θ

 

 

 

Edited by Genady
Link to comment
Share on other sites

image.png.b49db60a8268524bc488c9b599c0e3db.png

The reference:

image.png.099824c1f93339d02fa5332f97a0df35.png

 

a. Projector onto the subspace of agreeing measurements is |v1v2〉〈v1v2|+|v1v2〉〈v1v2|.

|v1v2〉 = (cos θ1 |0〉 + sin θ1 |1〉)⊗(cos θ2 |0〉 + sin θ2 |1〉)

When it acts on |ψ〉 only the terms |00〉 and |11〉 survive, i.e.,

v1v2|ψ〉 = 1/√2 (cos θ1 cos θ2 sin θ1 sin θ2) = 1/√2 cos (θ1 - θ2)

Similarly,

v1v2|ψ〉 = 1/√2 (cos θ1 cos θ2 sin θ1 sin θ2) = 1/√2 cos (θ1 - θ2).

Thus, the projection results in the state

1/c (1/√2 cos (θ1 - θ2|v1v2〉 + 1/√2 cos (θ1 - θ2|v1v2〉)

with the probability c2 = cos2 (θ1 - θ2).

 

b. θ1 = θ2

c. θ1 - θ2= π/2

d. θ1 - θ2= π/4

e. For these pairs, the θ1 - θ2 is either 600 or 1200 with cos2 (θ1 - θ2) = 1/4.

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.