CS/Ph120 Homework 4 Solutions
|
|
- Mitchell Smith
- 5 years ago
- Views:
Transcription
1 CS/Ph10 Homework 4 Solutions November 3, 016 Problem 1: Robustness of GHZ and W states, part Solution: Due to Bolton Bailey a For the GHZ state, we have T r N GHZ N GHZ N = 1 0 N 1 0 N N 1 1 N 1 So therefore, the rank is r GHZ =. For the W state, we have N 1 W N = N W N N 1 1 N So we get T r N W N W N = N 1 N W N 1 W N N 0 N 1 0 N 1 And so the rank is r W =. b The minimum purity for a density matrix ρ on a d-dimensional vector space is 1. To see that this d can be attained, consider ρ = 1 d I d This matrix is positive semidefinite as a postive multiple of the identiy, and it has trace 1, since the I d has trace d. Note that And so ρ = 1 d I d = 1 d I d T rρ = 1 d d = 1 d 1
2 To see it is impossible to have a density matrix of this dimension with a smaller purity, note that T rρ = i ρ i 1 i d To see it is impossible to have a density matrix of this dimension with a smaller purity, let ρ = i p i ψ i ψ i And so therefore ρ = i,j p i p j ψ i ψ i ψ j ψ j By linearity of the trace T rρ = T r p i p j ψ i ψ i ψ j ψ j i,j T rρ = p i p j T r ψ i ψ i ψ j ψ j i,j By invariance of trace under cyclic permutations T rρ = i,j p i p j T r ψ j ψ i ψ i ψ j T rρ = i,j p i p j ψ j ψ i ψ i ψ j T rρ = i,j p i p j ψ i ψ j Now, we separate the sum into the cases where i = j and i j T rρ = i p i ψ i ψ i + i j p i p j ψ i ψ j Since ψ i ψ i = 1, we get T rρ = i p i + i j p i p j ψ i ψ j Now, since the p i sum to 1, the minimum value of the sum of the p i is 1 by the Cauchy-Schwarz d inequality. The minimum value of ψ i ψ j is 0 since the norm squared is nonnegative. T rρ 1 d As we claimed. The maximum value of the purity of a density matrix on d dimensions is 1. To see that this can be attained, consider ρ = 0 0
3 Which is a pure density matrix, and satisfies T rρ = T r = T r = 1 To see that this is maximal, recall that we have shown for arbitrary ρ = p i ψ i ψ i i That T rρ = i,j p i p j ψ i ψ j And since 0 ψ i ψ j 1, and p i, p j are positive T rρ = i,j p i p j ψ i ψ j i,j p i p j 1 1 = 1 So 1 is the maximum purity. c As a state gets more entangled, we expect the purity to decrease. We think of a state being more entangled as the partial state being more heavily correlated with the other half of the bipartite state. Thus, if we trace out the other state, the partial state will be more mixed. d Again, we have T r N GHZ N GHZ N = 1 0 N 1 0 N N 1 1 N 1 And the purity of this state is T r T r N GHZ N GHZ N 1 = T r 0 N 1 0 N N 1 1 N = T r 0 N 1 0 N N 1 1 N 1 4 = 1 So in the limit as N, the purity of this state is 1 e Evaluating the purity T r T r N W N W N N 1 = T r W N 1 W N N 0 N 1 0 N 1 N N 1 = T r W N 1 W N 1 + N N 1 1 = + N N = N N + N 1 0 N 1 0 N 1 N 3
4 So in the limit as N, the purity of this state is 1. Since this value is higher than that for the GHZ states, we can conclude the W states are more robust, as they remain mostly pure even when a bit is traced out. f We now repeat the analysis tracing out n qubits instead of 1, which we will indicate by T r B, Again, we have T r B GHZ N GHZ N = 1 0 N n 0 N n + 1 N n 1 N n And the purity of this state is T r T r B GHZ N GHZ N 1 = T r 0 N n 0 N n + 1 N n 1 N n 4 1 = T r 0 N n 0 N n + 1 N n 1 N n 4 = 1 So no matter how many bits are traced out of the GHZ density matrix, the purity is 1 and so in the limit as N, the purity is 1. Evaluating the purity for the W density matrix T r T r B W N W N N n = T r N W N 1 W N 1 + n N 0 N n 0 N n N n n = T r W N n W N n + 0 N n 0 N n N N N n n = + N N = N Nn + n N So in the limit as N, the purity of this state still goes to 1 although slower for larger N. Since this value is higher than that for the GHZ states, we can again conclude the W states are more robust, as they remain mostly pure even when many bits are traced out. Problem : Dimension of a purifying system Solution: Due to De Huang a Let r be the Schmidt rank of Ψ AB, then D r. On the other hand, given ρ A = , 4
5 we have r = ranktr B Ψ Ψ AB = rankρ A =. Therefore D, the minimum value of D is no less than. In particular, if we let B be the space of single qubitd =, and take Ψ AB = 1 0 A 0 B + 3 A 1 B, then we have tr B Ψ Ψ AB = ρ A. Thus the minimum of D is. b We can rewrite ρ A as ρ A = Notice that 1, 1 + 3, are orthogonal to each other, we have Agian we have rankρ A = 3. D ranktr B Ψ Ψ AB = rankρ A = 3. In particular, if we let B be a 3 dimensional qudit space, and take Ψ AB = A 0 B A 1 B A B, then we have tr B Ψ Ψ AB = ρ A. Thus the minimum of D is 3. c For a general ρ A, let r be the rank of ρ A. Consider the eigenvalue decomposition of ρ A, r 1 ρ A = λ i φ i φ i, where φ i, i = 0, 1,..., r 1, are normalized orthogonal eigen states, λ i > 0, i = 0, 1,..., r 1, and r 1 λ i = 1. If tr B Ψ Ψ AB = ρ A, then D Schmidt rank Ψ AB = ranktr B Ψ Ψ AB = rankρ A = r. In particular, let B be a r dimensional qudit space with standard baisi { i, i = 0, 1,..., r 1}, and take r 1 Ψ AB = λi φ i A i B, then we have tr B Ψ Ψ AB = ρ A, and thus the minimum of D is r. d Still, consider the eigenvalue decomposition of ρ A with rank r, r 1 ρ A = λ i φ i φ i, 5
6 where { φ i, i = 0, 1,..., d 1} is a orthogonal basis of the qudit space A, λ i > 0, i = 0, 1,..., r 1, and r 1 λ i = 1. Also consider the eigenvalue decomposition of σ AB, r 1 σ AB = s k Ψ k Ψ k AB, k=0 where r = rankσ AB, and s k > 0, k = 0, 1,..., r 1. i First we find the lowest attainable rank of σ AB. For each Ψ k AB, we have ranktr B Ψ k Ψ k AB = Schmidt rank Ψ k AB m, since the dimension of B system is m Then we have ranktr B σ AB = rank r 1 s k tr B Ψ k Ψ k AB r 1 rank tr B Ψ k Ψ k AB r m. k=0 But since tr B σ AB = ρ A, we have k=0 ranktr B σ AB = rankρ A = r, and thus we get r m r, i.e. r r m, since r is an integer. Let p = r, q = r mp, then we can take m s k = λ mk+i, Ψ k AB = 1 sk λmk+i φ mk+i A i B, k = 1,,..., p 1, q 1 s p = λ mp+i, Ψ p AB = 1 q 1 λmp+i φ mp+i A i B, if q > 0. sp It s easy to check that Ψ k, k = 0, 1,..., p, are orthogonal to each other, and that tr B σ AB = ρ A, r = rankσ AB = p + signq 1 = p + r m r m = r m. In this case the lower-bound is achieved. Thus the minimum attainable rank of σ AB is r m. ii Next we find the highest attainable purity of σ AB, i.e. the maximum of r 1 trσab = s k. We now should find out the constraints on s = s 0, s,..., s rnotice the we now have no upper bound on r, even though there is indeed one as r m r. Let Ω be the 6 k=0
7 feasible set for s, and that s be an optimal solution that achieves the maximum of attainable purity. The first constraints on s are s k 0, k = 0, 1,..., r, r 1 s k = 1, since σ AB is a density matrix. Before we go further, we give a Lemma: if a b 0, c d 0, a + b = c + d = e, a c, then a + b c + d. Proof: Now we inductively definde k=0 a + b c + d = a ca + c + b db + d 0. = a ca + c + c ae a c = a ca + c e g 0 = max s Ω s 0, g k = max s Ω,s i =g i,,...,k 1 s k, k = 1,,..., r 1, then using the lemma, we can always make s k = g k, k = 0, 1,..., r 1it s not a hard proof, and we skip it here. We should find out what g k are. Let s assume that in the expression of σ AB we give above, where r 1 j=0 r 1 Ψ k AB = j=0 α k i,j φ i A j B, α k i,j = Ψ k Ψ k = 1, k = 0, 1,..., r 1, r 1 j=0 α k i,jα l i,j = Ψ l Ψ k = 0, k l, since Ψ k AB are normalized and orthogonal to each other. The condition tr B σ AB = ρ A gives that r 1 λ i = s k αi,j k, i = 0, 1,..., r 1. k=0 Now define matrices A k C r m as j=0 A k i,j = s k a k i,j, k = 0, 1,..., r 1, then all the constraints above can be summarized as λ 0 r 1 A k A k = Λ = λ 1.. k=0., λ r 1 7
8 tra k A k = s k, k = 0, 1,..., r 1; tra k A l = 0, k l. We first give a lemma without proof: if m r, then max trp P 1,P Ω 1 MP = m σ i M, M C r r, i=1 where Ω = {P C r m : P P = I m }, and σ i M denote the i th large singular value of M. Assume that λ 0 λ 1... λ r > 0. Then for our case, the lemma above reduces to max trp P 1,P Ω 1 ΛP = λ m. Consider the reduced eigenvalue decomposition of A 0 A k 0, A 0 A k 0 = QΣQ, where Q Ω, and Σ C m m is a positive diagonal matrix. Then since we have r 1 A 0 A k 0 A k A k = Λ, = Σ = Q A 0 A k 0Q Q ΛQ, k=0 s 0 = tra 0 A k 0 = trσ trq ΛQ max trp P 1,P Ω 1 ΛP = λ m, thus g0 λ m. Recall that in di we provided an example in which s 0 = λ m, therefore we indeed have g0 = λ m. Let p = r, q = r mp. Then similarly we can prove that m g k = λ mk+i, k = 0, 1,..., p 1, and if q > 0, g p = q 1 λ mp+i. Now using the previous result, we can always make s k = g k = q 1 λ mk+i, k = 0, 1,..., p 1; s p = gp = λ mp+i, if q > 0, and therefore the highest attainable purity of σ AB is p 1 p 1 q 1, s k + signqs p = λ mk+i + signq λ mp+i k=0 k=0 where signq = 1, if q > 0; signq = 0, if q = 0. Indeed the example in di, s k = λ mk+i, Ψ k AB = 1 sk λmk+i φ mk+i A i B, k = 1,,..., p 1, q 1 s p = λ mp+i, Ψ p AB = 1 q 1 λmp+i φ mp+i A i B, if q > 0, sp achieves this maximum of attainable purity.
9 Problem 3: Secret sharing among three people Solution: Due to Bolton Bailey a We compute the reduced density matrix ρ A Ψ Ψ = 1 0 A 0 B 0 C + 1 b 1 A 1 B 1 C 1 0 A 0 B 0 t C + 1 b 1 A 1 B 1 t C Ψ Ψ = ABC + 1 b ABC + 1 b ABC ABC + Ψ Ψ = A BC + 1 b 0 1 A BC + 1 b 1 0 A BC A B T r BC Ψ Ψ = A A = 1 I So ρ A is the maximally mixed state, no matter the value of b. Thus, A alone gains no information about the secret. By the symmetry of the state Ψ, we see that the other density matrices are the same T r AC Ψ Ψ = T r AB Ψ Ψ = 1 I ρ A = ρ B = ρ C = 1 I So none of the three can recover the secret on their own. b We compute the two-party reduced density matrix ρ BC, from part b Ψ Ψ = A BC + 1 b 0 1 A BC + 1 b 1 0 A BC A B So T r A Ψ Ψ = A A So ρ BC is the same mixed state, no matter the value of b. Thus, B and C together gain no information about the secret. By the symmetry of the state Ψ, we see that the other two-party density matrices are again the same T r B Ψ Ψ = T r C Ψ Ψ = A A So these pairs also do not have any information about the secret. c Consider the following LOCC protocol. Alice, Bob and Charlie all apply local Hadamard transformations to their qubit. This yields the state H H H = 1 [ b ] = 1 [ b ] 9
10 So if b = 0, the state is now And if b = 1, the state is now Now, Alice, Bob, and Charlie measure in the standard basis. We note that these three measurements are equivalent to a measurement in the computational in the product space. Thus, if b = 0, the only possible measurements for Alice, Bob, and, Charlie are 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0. If b = 1, the only possible measurements for Alice, Bob, and, Charlie are 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1 Thus, to determine b, Bob and CHarlie send the bits from their measurements to Alice and Alice computes the parity of the three measurements, which is then equal to b. Problem 4: Non-local boxes Solution: Due to De Huang a U For any input x, y A 1 A, we have pa, b x, y = = 1. PR If x, y 1, 1, pa, b x, y = p0, 0 x, y + p1, 1 x, y = = 1, if x, y = 1, 1, pa, b x, y = p1, 0 x, y + p0, 1 x, y = = 1. CH If x, y 1, 1, pa, b x, y = 1 π cos + 1 π cos + 1 π sin + 1 π sin = 1, if x, y = 1, 1, pa, b x, y = 1 π sin + 1 π sin + 1 π cos + 1 π cos = 1. 10
11 SIG For any input x, y A 1 A, we have pa, b x, y = py, x x, y = 1. b Let pa, x, y = b {0,1} pa, b x, y denote the marginal probability of the first output being a given the input x, y, and p, b x, y = pa, b x, y a {0,1} the marginal probability of the second output being b given the input x, y. U It s non-signaling, because pa, x, 0 = pa, x, 1 = 1, x {0, 1}, a {0, 1}, PR It s non-signaling, because p, b 0, y = p, b 1, y = 1, y {0, 1}, b {0, 1}. pa, x, y = pa, a x y x, y = 1, x, y {0, 1}, a {0, 1}, p, b x, y = pb x y, b x, y = 1, x, y {0, 1}, b {0, 1}. CH It s non-signaling, because given any input x, y, we always have p0, 0 x, y = p1, 1 x, y = x y cos π + x y sin π, and thus p1, 0 x, y = p0, 1 x, y = x y cos π + x y sin π, pa, x, y = pa, 0 x, y + pa, 1 x, y = 1, x, y {0, 1}, a {0, 1}, p, b x, y = p0, b x, y + p1, b x, y = 1, x, y {0, 1}, b {0, 1}. SIG It s not non-signaling, because p1, 0, 0 = 0, p1, 0, 1 = p1, 0 0, 1 = 1, p1, 0, 0 p1, 0, 1. 11
12 c We always have p win = x,y {0,1} px, y a b=x y pa, b x, y = 1 4 p0, 0 0, 0 + p1, 1 0, p0, 0 0, 1 + p1, 1 0, p0, 0 1, 0 + p1, 1 1, p0, 1 1, 1 + p1, 0 1, 1. 4 We just need to specify each probability for each cases. U Everything is 1 4, thus p win = = 1. PR p win = = 1. CH SIG p win = cos π + 1 cos π 4 = cos π = p win = 1 4 p0, 0 0, 0 = 1 4. d U Can. Let ρ AB = I I, A 0 0 = B 0 0 = 0 0, A 1 0 = B 1 0 = 1 1, A 0 1 = B 0 1 = + +, A 1 1 = B 1 1 =. It s easy to check that tr A a x Byρ b 1 AB =, x, y, a, b {0, 1}. 4 PR Can not. We will prove by contradiction. For any POVM {A 0 x, A 1 x} a, x {0, 1}, {B 0 y, B 1 y} b, y {0, 1}, and any density matrix ρ AB, consider the folloing formula A 0 0 A 1 0 B 0 0 B A 0 0 A 1 0 B 0 1 B A 0 1 A 1 1 B 0 0 B 1 0 A 0 1 A 1 1 B 0 1 B 1 1 = M 0 N 0 + M 0 N 1 + M 1 N 0 M 1 N 1, where M i = A 0 i A 1 i I, N i = I B 0 i B 1 i, i {0, 1}. It s easy to check that I 4 M i I 4, I 4 N i I 4,, i = {0, 1}, M i N j = N j M i, i, j {0, 1}. 1
13 Now define the we have i {0,1} XY = trxy ρ AB, X = XX, M i N j = N j M i, i, j {0, 1}, α i M i + β j N j 0, α 0, α 1, β 0, β 1. j {0,1} Then by direct calculation 1, we have tr M 0 N 0 + M 0 N 1 + M 1 N 0 M 1 N 1 ρ AB = M 0 N 0 + M 0 N 1 + M 1 N 0 M 1 N 1 = 1 M 0 + M1 + N0 + N M 0 + M1 + N0 + N M 0 N 0 + M 1 N 1 + 1M 0 N 1 M 1 N M 1 N 0 + M 0 + N 1 + 1M 1 + N 1 M 0 N 0 1 I4 + I 4 + I 4 + I 4 =. However, if there exist such a quantum strategy that can implement PR box, than it s easy to check that tr M 0 N 0 + M 0 N 1 + M 1 N 0 M 1 N 1 ρ AB = tr A 0 0 A 1 0 B 0 0 B 1 0ρ AB + tr A 0 0 A 1 0 B 0 1 B 1 1ρ AB = 4, + tr A 0 1 A 1 1 B 0 0 B 1 0ρ AB tr A 0 1 A 1 1 B 0 1 B 1 1ρ AB which violates the upper bound we obtain above. This contradiction implies that we can not use quantum strategy to implement PR box. CH Can. Let ρ AB = EP R EP R AB = AB = AB, A 0 0 = 0 0, A 1 0 = 1 1, A 0 1 = + +, A 1 1 =, B.S. Cirel son, Quantum generalizations of Bell s inequality. Letters in Mathematical Physics 4,
14 where B 0 0 = φ 0 φ 0, B 1 0 = φ 1 φ 1, B 0 1 = ψ 0 ψ 0, B 1 1 = ψ 1 ψ 1, φ 0 = cos π 0 + sin π 1, φ 1 = sin π 0 + cos π 1, It s easy to check that ψ 0 = cos π 0 sin π 1, ψ 1 = sin π 0 + cos π 1. tr A a x Byρ b 1 π AB = cos, ifa b = x y, tr A a x Byρ b 1 π AB = sin, ifa b x y. SIG Can not. We will show this by contradiction. Assume that there is such a strategy, then tr A 0 0 B 0 0ρ AB = tr A 1 1 B 1 1ρ AB = 1, tr A 1 0 B 0 1ρ AB = tr A 0 1 B 1 0ρ AB = 1. In my HW3 problem, I have shown a lemma that if X Y, Z 0, then trxz try Z. We will use this lemma here again. Since {A a x} a and {B b y} b are POVMs for all x, y, we have I B 0 0 0, I B 1 0 0, A 0 0 0, A 1 0 0, A A 1 0 = I, = A 0 0 I A 0 0 B 0 0 0, A 1 0 I A 1 0 B 0 1 0, = I 4 = I I = A 0 0 I + A 1 0 I A 0 0 B A 1 0 B 0 1 0, then using the lemma, we have 1 = tri 4 ρ AB tr A 0 0 B 0 0+A 1 0 B 0 1ρ AB = tr A 0 0 B 0 0ρ AB +tr A 1 0 B 0 1ρ AB =. This contradiction implies that we can not find such a quantum strategy. e Consider an non-signaling extension {q,, x, y, z} of the PR box. Using non-signaling condition, we have qa, b, c x, y, z = qa, b, c x, y, z, c, z, x, y, x, y {0, 1}, therefore we can define p c z = qa, b, c 0, 0, z 0, c, z, then we have p c z = qa, b, c x, y, z, x, y {0, 1}. 14
15 Also we can check that for all z, p c, z = c qa, b, c 0, 0, z = c pa, b 0, 0 = 1, thus {p c z} z is a family of well defined distributions. Now using the properties of PR box, we have q0, 1, c x, y, z = p0, 1 x, y = 0, z, if x, y 1, 1, c q1, 0, c x, y, z = p1, 0 x, y = 0, z, if x, y 1, 1, c q0, 0, c x, y, z = p0, 0 x, y = 0, z, if x, y = 1, 1, c q1, 1, c x, y, z = p1, 1 x, y = 0, z. if x, y = 1, 1, c Since all probabilities are non negative, we have q0, 1, c x, y, z = 0 = p0, 1 x, yp c z, c, z, if x, y 1, 1, q1, 0, c x, y, z = 0 = p1, 0 x, yp c z, c, z, if x, y 1, 1, q0, 0, c x, y, z = 0 = p0, 0 x, yp c z, c, z, if x, y = 1, 1, q1, 1, c x, y, z = 0 = p1, 1 x, yp c z, c, z, if x, y = 1, 1. Then using the non-signaling condition for fixing two inputs and outputs, we have q0, 0, c 0, 0, z = q0, 0, c 0, 1, z = q1, 0, c 1, 1, z = q1, 1, c 1, 0, z = q1, 1, c 0, 0, z, c, z, and since we also have qa, b, c 0, 0, z = q0, 0, c 0, 0, z + q1, 1, c 0, 0, z = p c z, c, z, thus Similarly we can also prove that q0, 0, c 0, 0, z = 1 p c z = p0, 0 0, 0p c, z, c, z, q1, 1, c 0, 0, z = 1 p c z = p1, 1 0, 0p c, z, c, z. q0, 0, c x, y, z = 1 p c z = p0, 0 x, yp c, z, c, z, if x, y 1, 1, q1, 1, c x, y, z = 1 p c z = p1, 1 x, yp c, z, c, z, if x, y 1, 1, q0, 1, c x, y, z = 1 p c z = p0, 1 x, yp c, z, c, z, if x, y = 1, 1, q1, 0, c x, y, z = 1 p c z = p1, 0 x, yp c, z, c, z, if x, y = 1, 1. Therefore the extension {q,, x, y, z} is in a product form. 15
16 f Let c X 3 = {0, 1}, z A 3 = {0}. Let q0, 0, 0 x, y, z = q1, 1, 0 x, y, z = 1, 4 q0, 0, 1 x, y, z = q1, 1, 1 x, y, z = 1 cos π sin π, q1, 0, 1 x, y, z = q0, 1, 1 x, y, z = 1 4 sin π, q1, 0, 0 x, y, z = q0, 1, 0 x, y, z = 1 4 sin π, q0, 0, 0 x, y, z = q1, 1, 0 x, y, z = 1 4 sin π, if x, y 1, 1, q0, 0, 1 x, y, z = q1, 1, 1 x, y, z = 1 4 sin π, q1, 0, 1 x, y, z = q0, 1, 1 x, y, z = 1 cos π, sin π, q1, 0, 0 x, y, z = q0, 1, 0 x, y, z = 1 4, if x, y = 1, 1. It s easy to check that this {q,, x, y, z} defines a tripartite non local box. Also, using the fact that 1 + cos π sin π = π cos, and noticing that z is always 0, we can check that qa, b, c x, y, 0 = qa, b, c x, y, 0, a, x, y, y, b,c b,c qa, b, c x, y, 0 = qa, b, c x, y, 0, b, x, y, x, a,c a,c qa, b, c x, y, 0 = qa, b, c x, y, 0, a, x, y, x, y, a,b a,b qa, b, c x, y, 0 = qa, b, c x, y, 0, a, c, x, y, y, b b qa, b, c x, y, 0 = qa, b, c x, y, 0, b, c, x, y, x, a a therefore it s non-signaling. Moreover, if x, y 1, 1 we have q0, 0, c x, y, z = 1 cos π q1, 0, c x, y, z = 1 sin π if x, y = 1, 1 we have q0, 0, c x, y, z = 1 sin π = p0, 0 x, y, = p1, 0 x, y, = p0, 0 x, y, 16 q1, 1, c x, y, z = 1 cos π q0, 1, c x, y, z = 1 sin π q1, 1, c x, y, z = 1 sin π = p1, 1 x, y, = p0, 1 x, y, = p1, 1 x, y,
17 q1, 0, c x, y, z = 1 π cos = p1, 0 x, y, q0, 1, c x, y, z = 1 cos π Therefore this {q,, x, y, z} is a non-signaling extension of CH box. However, if this {q,, x, y, z} has a product form, then we have = p0, 1 x, y. q0, 0, 0 0, 0, z = p0, 0 0, 0p 0 z = p 0 z = q0, 0, 0 1, 1, z = p0, 0 1, 1p 0 z = p 0 z = q0, 0, 0 0, 0, z p0, 0 0, 0 = q0, 0, 0 1, 1, z p0, 0 1, 1 1 cos π, = 1. This contraction implies that this {q,, x, y, z} is a non-product, non-signaling extension of CH box. g Given that each pair is chosen uniformly and x, y, z is generated uniformly, the success probability is Pr win = 1 1 pa, b, c x, y, z + pa, b, c x, y, z + pa, b, c x, y, z 3 x,y,z {0,1} a b=x y a c=x z b c=y z = 1 pa, b, c x, y, z + pa, b, c x, y, z + pa, b, c x, y, z 4 = 1 4 x,y,z {0,1} x,y,z {0,1} a b=x y a c=x z I 1 x, y, z + I x, y, z + I 3 x, y, z, b c=y z where I i x, y, z, i = 1,, 3 denote the success probability under the condition that the input is x, y, z and the i th pair is chosen. Here the first, second and third pair means A, B, A, C and B, C respectively. The following table gives occurrence number of each term pa, b, c x, y, z in the summation I 1 x, y, z + I x, y, z + I 3 x, y, z. xyz abc
18 Using this table and the condition that pa, b, c x, y, z = 1, x, y, z, we can easily see that a,b,c{0,1} Pr win = p0, 0, 0 0, 0, 0 + p0, 0, 0 1, 0, 0 + p0, 0, 0 0, 1, 0 + p0, 0, 0 0, 0, 1 + p1, 1, 1 0, 0, 0 + p1, 1, 1 1, 0, 0 + p1, 1, 1 0, 1, 0 + p1, 1, 1 0, 0, 1 p1, 0, 0 0, 1, 1 p0, 1, 0 1, 0, 1 p0, 0, 1 1, 1, 0 p0, 0, 0 1, 1, 1 p0, 1, 1 0, 1, 1 p1, 0, 1 1, 0, 1 p1, 1, 0 1, 1, 0 p1, 1, 1 1, 1, p0, 0, 0 0, 0, 0 + p0, 0, 0 1, 0, 0 + p0, 0, 0 0, 1, 0 + p0, 0, 0 0, 0, 1 + p1, 1, 1 0, 0, 0 + p1, 1, 1 1, 0, 0 + p1, 1, 1 0, 1, 0 + p1, 1, 1 0, 0, 1 p0, 0, 0 1, 1, 1 p1, 1, 1 1, 1, 1. Notice that whichever pair of players is chosen, a, b, c is a valid answer to the input x, y, z if and only if a 1, b 1, c 1 is a valid answer to x, y, z. Therefore, given a tripartite box {p,, x, y, z}, if we define a new tripartite {q,, x, y, z} box like qa, b, c x, y, z = 1 pa, b, c x, y, z + pa 1, b 1, c 1 x, y, z, a, b, c, x, y, z, then it s easy to check that we will have Pr win p = Pr win q, that is to say such transformation preserves the success probability. Also if {p,, x, y, z} is non-signaling, then for any a, x, we have b, qa, b, c x, y, z = 1 = 1 b, b, = b, pa, b, c x, y, z + pa 1, b 1, c 1 x, y, z pa, b, c x, y, z + pa 1, b 1, c 1 x, y, z qa, b, c x, y, z, y, z, y z, and this is also true for any b, y or any c, z. Also for any a, b, x, y, we have qa, b, c x, y, z = 1 = 1 = pa, b, c x, y, z + pa 1, b 1, c 1 x, y, z pa, b, c x, y, z + pa 1, b 1, c 1 x, y, z qa, b, c x, y, z, z, z, 1
19 and this is true for any a, c, x, z or any b, c, y, z. Therefor {q,, x, y, z} is also nonsignaling. Thus this transformation transformation also preserves the non-signaling property. Out of this reason, from now on we can alwasy assume that pa, b, c x, y, z = pa 1, b 1, c 1 x, y, z, a, b, c, x, y, z, otherwise we can do this transformation to {p,, x, y, z} to make it so. Now we continue our task of finding the upper bound of success probability, Pr win p0, 0, 0 0, 0, 0 + p0, 0, 0 1, 0, 0 + p0, 0, 0 0, 1, 0 + p0, 0, 0 0, 0, 1 + p1, 1, 1 0, 0, 0 + p1, 1, 1 1, 0, 0 + p1, 1, 1 0, 1, 0 + p1, 1, 1 0, 0, 1 p0, 0, 0 1, 1, 1 p1, 1, 1 1, 1, 1 = p0, 0, 0 0, 0, 0 + 4p0, 0, 0 1, 0, 0 + 4p0, 0, 0 0, 1, 0 + 4p0, 0, 0 0, 0, 1 4p0, 0, 0 1, 1, 1 = p0, 0, 0 0, 0, 0 + p0, 0, 0 1, 0, 0 + p0, 0, 0 0, 1, 0 + p0, 0, 0 0, 0, 1 p0, 0, 0 1, 1, 1, where we have used the condition. Next we will have to do some painful calculation. Using condition and non-signaling condition for fixing two inputs, we can show that p0, 0, 1 0, 1, 1 + p0, 1, 0 0, 1, 1 = p0, 0, 1 1, 1, 1 + p0, 1, 0 1, 1, 1, p0, 0, 1 1, 0, 1 + p1, 0, 0 1, 0, 1 = p0, 0, 1 1, 1, 1 + p1, 0, 0 1, 1, 1, p0, 1, 0 1, 1, 0 + p1, 0, 0 1, 1, 0 = p0, 1, 0 1, 1, 1 + p1, 0, 0 1, 1, 1, = p0, 0, 1 0, 1, 1 + p0, 1, 0 0, 1, 1 + p0, 0, 1 1, 0, 1 + p1, 0, 0 1, 0, 1 + p0, 1, 0 1, 1, 0 + p1, 0, 0 1, 1, 0 = p0, 0, 1 1, 1, 1 + p0, 1, 0 1, 1, 1 + p1, 0, 0 1, 1, 1 = 1 p0, 0, 0 1, 1, 1. On the other hand, still using condition and non-signaling condition for fixing two inputs, we can check that p0, 0, 1 1, 0, 0 + p0, 1, 0 1, 0, 0 + p1, 0, 0 1, 0, 0 + p0, 0, 1 0, 1, 0 + p0, 1, 0 0, 1, 0 + p1, 0, 0 0, 1, 0 + p0, 0, 1 0, 0, 1 + p0, 1, 0 0, 0, 1 + p1, 0, 0 0, 0, 1 = p0, 0, 1 0, 1, 1 + p0, 1, 0 0, 1, 1 + p0, 0, 1 1, 0, 1 + p1, 0, 0 1, 0, 1 + p0, 1, 0 1, 1, 0 + p1, 0, 0 1, 1, 0 + p1, 0, 0 0, 1, 1 + p0, 1, 0 1, 0, 1 + p0, 0, 1 1, 1, 0 = 1 p0, 0, 0 1, 1, 1 + p1, 0, 0 0, 1, 1 + p0, 1, 0 1, 0, 1 + p0, 0, 1 1, 1, 0 19
20 Notice that condition gives thus p0, 0, 0 1, 0, 0 + p0, 0, 0 0, 1, 0 + p0, 0, 0 0, 0, 1 + p0, 0, 1 1, 0, 0 + p0, 1, 0 1, 0, 0 + p1, 0, 0 1, 0, 0 + p0, 0, 1 0, 1, 0 + p0, 1, 0 0, 1, 0 + p1, 0, 0 0, 1, 0 + p0, 0, 1 0, 0, 1 + p0, 1, 0 0, 0, 1 + p1, 0, 0 0, 0, 1 3, p0, 0, 0 1, 0, 0 + p0, 0, 0 0, 1, 0 + p0, 0, 0 0, 0, p0, 0, 0 1, 1, 1 + p1, 0, 0 0, 1, 1 + p0, 1, 0 1, 0, 1 + p0, 0, 1 1, 1, 0 3, = p0, 0, 0 1, 0, 0 + p0, 0, 0 0, 1, 0 + p0, 0, 0 0, 0, 1 p0, 0, 0 1, 1, 1 1 p1, 0, 0 0, 1, 1 p0, 1, 0 1, 0, 1 p0, 0, 1 1, 1, 0 1. Finally we have Pr win p0, 0, 0 0, 0, 0 + p0, 0, 0 1, 0, 0 + p0, 0, 0 0, 1, 0 + p0, 0, 0 0, 0, 1 6 p0, 0, 0 1, 1, p0, 0, 0 0, 0, = 3 4. Here we have used the condition, so p0, 0, 0 0, 0, 0 1. Now we have proved that 3 4 is a upper bound of the success probability. Indeed if we take p0, 0, 0 x, y, z = p1, 1, 1 x, y, z = 1, x, y, z, and all unspecified probabilities being 0, then we can check that this {p,, x, y, z} is a non-signaling tripartite nonlocal box, and we have Pr win = p0, 0, 0 0, 0, 0 + p0, 0, 0 1, 0, 0 + p0, 0, 0 0, 1, 0 + p0, 0, 0 0, 0, 1 = p1, 1, 1 0, 0, 0 + p1, 1, 1 1, 0, 0 + p1, 1, 1 0, 1, 0 + p1, 1, 1 0, 0, 1 p0, 0, 0 1, 1, 1 p1, 1, 1 1, 1, 1 Therefore the optimum success probability achieved by any non-signaling tripartite box in this game is
MP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
More informationLecture 20: Bell inequalities and nonlocality
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 0: Bell inequalities and nonlocality April 4, 006 So far in the course we have considered uses for quantum information in the
More informationPh 219/CS 219. Exercises Due: Friday 3 November 2006
Ph 9/CS 9 Exercises Due: Friday 3 November 006. Fidelity We saw in Exercise. that the trace norm ρ ρ tr provides a useful measure of the distinguishability of the states ρ and ρ. Another useful measure
More informationLecture Notes. Quantum Cryptography Week 2: The Power of Entanglement
Lecture Notes Quantum Cryptography Week : The Power of Entanglement This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Licence. Contents.1 Entanglement
More informationCompression and entanglement, entanglement transformations
PHYSICS 491: Symmetry and Quantum Information April 27, 2017 Compression and entanglement, entanglement transformations Lecture 8 Michael Walter, Stanford University These lecture notes are not proof-read
More informationGrothendieck Inequalities, XOR games, and Communication Complexity
Grothendieck Inequalities, XOR games, and Communication Complexity Troy Lee Rutgers University Joint work with: Jop Briët, Harry Buhrman, and Thomas Vidick Overview Introduce XOR games, Grothendieck s
More informationLecture: Quantum Information
Lecture: Quantum Information Transcribed by: Crystal Noel and Da An (Chi Chi) November 10, 016 1 Final Proect Information Find an issue related to class you are interested in and either: read some papers
More informationPh 219/CS 219. Exercises Due: Friday 20 October 2006
1 Ph 219/CS 219 Exercises Due: Friday 20 October 2006 1.1 How far apart are two quantum states? Consider two quantum states described by density operators ρ and ρ in an N-dimensional Hilbert space, and
More informationCS/Ph120 Homework 8 Solutions
CS/Ph0 Homework 8 Solutions December, 06 Problem : Thinking adversarially. Solution: (Due to De Huang) Attack to portocol : Assume that Eve has a quantum machine that can store arbitrary amount of quantum
More informationExplicit bounds on the entangled value of multiplayer XOR games. Joint work with Thomas Vidick (MIT)
Explicit bounds on the entangled value of multiplayer XOR games Jop Briët Joint work with Thomas Vidick (MIT) Waterloo, 2012 Entanglement and nonlocal correlations [Bell64] Measurements on entangled quantum
More informationEntanglement Measures and Monotones
Entanglement Measures and Monotones PHYS 500 - Southern Illinois University March 30, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones March 30, 2017 1 / 11 Quantifying
More informationAsymptotic Pure State Transformations
Asymptotic Pure State Transformations PHYS 500 - Southern Illinois University April 18, 2017 PHYS 500 - Southern Illinois University Asymptotic Pure State Transformations April 18, 2017 1 / 15 Entanglement
More informationCS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games
CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games Scribe: Zeyu Guo In the first lecture, we saw three equivalent variants of the classical PCP theorems in terms of CSP, proof checking,
More informationCS/Ph120 Homework 1 Solutions
CS/Ph0 Homework Solutions October, 06 Problem : State discrimination Suppose you are given two distinct states of a single qubit, ψ and ψ. a) Argue that if there is a ϕ such that ψ = e iϕ ψ then no measurement
More informationLecture 11 September 30, 2015
PHYS 7895: Quantum Information Theory Fall 015 Lecture 11 September 30, 015 Prof. Mark M. Wilde Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike
More informationThe CHSH game as a Bell test thought experiment
The CHSH game as a Bell test thought experiment Logan Meredith December 10, 2017 1 Introduction The CHSH inequality, named after John Clauser, Michael Horne, Abner Shimony, and Richard Holt, provides an
More informationSquashed entanglement
Squashed Entanglement based on Squashed Entanglement - An Additive Entanglement Measure (M. Christandl, A. Winter, quant-ph/0308088), and A paradigm for entanglement theory based on quantum communication
More informationMATRIX ALGEBRA. or x = (x 1,..., x n ) R n. y 1 y 2. x 2. x m. y m. y = cos θ 1 = x 1 L x. sin θ 1 = x 2. cos θ 2 = y 1 L y.
as Basics Vectors MATRIX ALGEBRA An array of n real numbers x, x,, x n is called a vector and it is written x = x x n or x = x,, x n R n prime operation=transposing a column to a row Basic vector operations
More informationHomework 3 - Solutions
Homework 3 - Solutions The Transpose an Partial Transpose. 1 Let { 1, 2,, } be an orthonormal basis for C. The transpose map efine with respect to this basis is a superoperator Γ that acts on an operator
More information1. Basic rules of quantum mechanics
1. Basic rules of quantum mechanics How to describe the states of an ideally controlled system? How to describe changes in an ideally controlled system? How to describe measurements on an ideally controlled
More informationarxiv: v2 [quant-ph] 21 Oct 2013
Genuine hidden quantum nonlocality Flavien Hirsch, 1 Marco Túlio Quintino, 1 Joseph Bowles, 1 and Nicolas Brunner 1, 1 Département de Physique Théorique, Université de Genève, 111 Genève, Switzerland H.H.
More informationEntanglement: concept, measures and open problems
Entanglement: concept, measures and open problems Division of Mathematical Physics Lund University June 2013 Project in Quantum information. Supervisor: Peter Samuelsson Outline 1 Motivation for study
More informationCS120, Quantum Cryptography, Fall 2016
CS10, Quantum Cryptography, Fall 016 Homework # due: 10:9AM, October 18th, 016 Ground rules: Your homework should be submitted to the marked bins that will be by Annenberg 41. Please format your solutions
More informationb) (5 points) Give a simple quantum circuit that transforms the state
C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationCS286.2 Lecture 13: Quantum de Finetti Theorems
CS86. Lecture 13: Quantum de Finetti Theorems Scribe: Thom Bohdanowicz Before stating a quantum de Finetti theorem for density operators, we should define permutation invariance for quantum states. Let
More informationPrinciples of Quantum Mechanics Pt. 2
Principles of Quantum Mechanics Pt. 2 PHYS 500 - Southern Illinois University February 9, 2017 PHYS 500 - Southern Illinois University Principles of Quantum Mechanics Pt. 2 February 9, 2017 1 / 13 The
More informationIntroduction to Quantum Information Hermann Kampermann
Introduction to Quantum Information Hermann Kampermann Heinrich-Heine-Universität Düsseldorf Theoretische Physik III Summer school Bleubeuren July 014 Contents 1 Quantum Mechanics...........................
More informationarxiv: v3 [quant-ph] 9 Jul 2018
Operational nonclassicality of local multipartite correlations in the limited-dimensional simulation scenario arxiv:70.0363v3 [quant-ph] 9 Jul 08 C. Jebaratnam E-mail: jebarathinam@bose.res.in S. N. Bose
More informationDECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS
DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS SCOTT HOTTOVY Abstract. Quantum networks are used to transmit and process information by using the phenomena of quantum mechanics.
More informationNonlocal Quantum XOR Games for Large Number of Players
onlocal Quantum XOR Games for Large umber of Players Andris Ambainis, Dmitry Kravchenko, ikolajs ahimovs, Alexander Rivosh Faculty of Computing, University of Latvia Abstract onlocal games are used to
More informationQuantum Mechanics II: Examples
Quantum Mechanics II: Examples Michael A. Nielsen University of Queensland Goals: 1. To apply the principles introduced in the last lecture to some illustrative examples: superdense coding, and quantum
More informationCS286.2 Lecture 15: Tsirelson s characterization of XOR games
CS86. Lecture 5: Tsirelson s characterization of XOR games Scribe: Zeyu Guo We first recall the notion of quantum multi-player games: a quantum k-player game involves a verifier V and k players P,...,
More informationProblem Set: TT Quantum Information
Problem Set: TT Quantum Information Basics of Information Theory 1. Alice can send four messages A, B, C, and D over a classical channel. She chooses A with probability 1/, B with probability 1/4 and C
More informationOn the Relation between Quantum Discord and Purified Entanglement
On the Relation between Quantum Discord and Purified Entanglement by Eric Webster A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics
More informationLecture 4: Purifications and fidelity
CS 766/QIC 820 Theory of Quantum Information (Fall 2011) Lecture 4: Purifications and fidelity Throughout this lecture we will be discussing pairs of registers of the form (X, Y), and the relationships
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
More informationSUPERDENSE CODING AND QUANTUM TELEPORTATION
SUPERDENSE CODING AND QUANTUM TELEPORTATION YAQIAO LI This note tries to rephrase mathematically superdense coding and quantum teleportation explained in [] Section.3 and.3.7, respectively (as if I understood
More informationChapter 2 The Density Matrix
Chapter 2 The Density Matrix We are going to require a more general description of a quantum state than that given by a state vector. The density matrix provides such a description. Its use is required
More informationHilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.
CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as
More informationEntanglement Measures and Monotones Pt. 2
Entanglement Measures and Monotones Pt. 2 PHYS 500 - Southern Illinois University April 8, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones Pt. 2 April 8, 2017 1 / 13 Entanglement
More informationLinear Algebra and Dirac Notation, Pt. 3
Linear Algebra and Dirac Notation, Pt. 3 PHYS 500 - Southern Illinois University February 1, 2017 PHYS 500 - Southern Illinois University Linear Algebra and Dirac Notation, Pt. 3 February 1, 2017 1 / 16
More informationUnitary Process Discrimination with Error Margin
Unitary Process Discrimination with Error Margin DEX-SMI Workshop on Quantum Statistical Inference March 2-4, 2009, National Institute of Informatics (NII), Tokyo A. Hayashi (Fukui) T. Hashimoto (Fukui),
More informationarxiv: v4 [quant-ph] 28 Feb 2018
Tripartite entanglement detection through tripartite quantum steering in one-sided and two-sided device-independent scenarios arxiv:70086v [quant-ph] 8 Feb 08 C Jebaratnam,, Debarshi Das,, Arup Roy, 3
More information2. Introduction to quantum mechanics
2. Introduction to quantum mechanics 2.1 Linear algebra Dirac notation Complex conjugate Vector/ket Dual vector/bra Inner product/bracket Tensor product Complex conj. matrix Transpose of matrix Hermitian
More informationarxiv: v3 [quant-ph] 5 Jun 2015
Entanglement and swap of quantum states in two qubits Takaya Ikuto and Satoshi Ishizaka Graduate School of Integrated Arts and Sciences, Hiroshima University, Higashihiroshima, 739-8521, Japan (Dated:
More informationSuperqubits. Leron Borsten Imperial College, London
Superqubits Leron Borsten Imperial College, London in collaboration with: K. Brádler, D. Dahanayake, M. J. Duff, H. Ebrahim, and W. Rubens Phys. Rev. A 80, 032326 (2009) arxiv:1206.6934 24 June - 3 July
More informationA Holevo-type bound for a Hilbert Schmidt distance measure
Journal of Quantum Information Science, 205, *,** Published Online **** 204 in SciRes. http://www.scirp.org/journal/**** http://dx.doi.org/0.4236/****.204.***** A Holevo-type bound for a Hilbert Schmidt
More informationMatrix Theory. A.Holst, V.Ufnarovski
Matrix Theory AHolst, VUfnarovski 55 HINTS AND ANSWERS 9 55 Hints and answers There are two different approaches In the first one write A as a block of rows and note that in B = E ij A all rows different
More informationAQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013
AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013 Lecturer: Dr. Mark Tame Introduction With the emergence of new types of information, in this case
More informationRank minimization via the γ 2 norm
Rank minimization via the γ 2 norm Troy Lee Columbia University Adi Shraibman Weizmann Institute Rank Minimization Problem Consider the following problem min X rank(x) A i, X b i for i = 1,..., k Arises
More informationLecture 21: HSP via the Pretty Good Measurement
Quantum Computation (CMU 5-859BB, Fall 205) Lecture 2: HSP via the Pretty Good Measurement November 8, 205 Lecturer: John Wright Scribe: Joshua Brakensiek The Average-Case Model Recall from Lecture 20
More informationChapter 5. Density matrix formalism
Chapter 5 Density matrix formalism In chap we formulated quantum mechanics for isolated systems. In practice systems interect with their environnement and we need a description that takes this feature
More informationQuantum Entanglement and the Bell Matrix
Quantum Entanglement and the Bell Matrix Marco Pedicini (Roma Tre University) in collaboration with Anna Chiara Lai and Silvia Rognone (La Sapienza University of Rome) SIMAI2018 - MS27: Discrete Mathematics,
More information9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.
9. Distance measures 9.1 Classical information measures How similar/close are two probability distributions? Trace distance Fidelity Example: Flipping two coins, one fair one biased Head Tail Trace distance
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 3: Basic Quantum Mechanics 26th September 2016 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information
More informationEnsembles and incomplete information
p. 1/32 Ensembles and incomplete information So far in this course, we have described quantum systems by states that are normalized vectors in a complex Hilbert space. This works so long as (a) the system
More informationQuantum Entanglement- Fundamental Aspects
Quantum Entanglement- Fundamental Aspects Debasis Sarkar Department of Applied Mathematics, University of Calcutta, 92, A.P.C. Road, Kolkata- 700009, India Abstract Entanglement is one of the most useful
More informationQuantum Information & Quantum Computing
Math 478, Phys 478, CS4803, February 9, 006 1 Georgia Tech Math, Physics & Computing Math 478, Phys 478, CS4803 Quantum Information & Quantum Computing Problems Set 1 Due February 9, 006 Part I : 1. Read
More informationKapitza Fall 2017 NOISY QUANTUM MEASUREMENT
Kapitza Fall 2017 NOIY QUANTUM MEAUREMENT Ben altzman Q.I.T. TERM PAPER Professor arada Raeev December 10 th 2017 1 Introduction Not only does God play dice but... where they can t be seen. he sometimes
More information. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.
CS 94- Hilbert Spaces, Tensor Products, Quantum Gates, Bell States 1//07 Spring 007 Lecture 01 Hilbert Spaces Consider a discrete quantum system that has k distinguishable states (eg k distinct energy
More informationBit-Commitment and Coin Flipping in a Device-Independent Setting
Bit-Commitment and Coin Flipping in a Device-Independent Setting J. Silman Université Libre de Bruxelles Joint work with: A. Chailloux & I. Kerenidis (LIAFA), N. Aharon (TAU), S. Pironio & S. Massar (ULB).
More informationApproximation norms and duality for communication complexity lower bounds
Approximation norms and duality for communication complexity lower bounds Troy Lee Columbia University Adi Shraibman Weizmann Institute From min to max The cost of a best algorithm is naturally phrased
More informationShared Purity of Multipartite Quantum States
Shared Purity of Multipartite Quantum States Anindya Biswas Harish-Chandra Research Institute December 3, 2013 Anindya Biswas (HRI) Shared Purity December 3, 2013 1 / 38 Outline of the talk 1 Motivation
More informationQuantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139
Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense
More informationIntroduction to Quantum Mechanics
Introduction to Quantum Mechanics R. J. Renka Department of Computer Science & Engineering University of North Texas 03/19/2018 Postulates of Quantum Mechanics The postulates (axioms) of quantum mechanics
More informationInformation-theoretic treatment of tripartite systems and quantum channels. Patrick Coles Carnegie Mellon University Pittsburgh, PA USA
Information-theoretic treatment of tripartite systems and quantum channels Patrick Coles Carnegie Mellon University Pittsburgh, PA USA ArXiv: 1006.4859 a c b Co-authors Li Yu Vlad Gheorghiu Robert Griffiths
More informationLecture Notes 1: Vector spaces
Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector
More informationLecture 11: Quantum Information III - Source Coding
CSCI5370 Quantum Computing November 25, 203 Lecture : Quantum Information III - Source Coding Lecturer: Shengyu Zhang Scribe: Hing Yin Tsang. Holevo s bound Suppose Alice has an information source X that
More informationSTAT200C: Review of Linear Algebra
Stat200C Instructor: Zhaoxia Yu STAT200C: Review of Linear Algebra 1 Review of Linear Algebra 1.1 Vector Spaces, Rank, Trace, and Linear Equations 1.1.1 Rank and Vector Spaces Definition A vector whose
More informationBaltic Way 2003 Riga, November 2, 2003
altic Way 2003 Riga, November 2, 2003 Problems and solutions. Let Q + be the set of positive rational numbers. Find all functions f : Q + Q + which for all x Q + fulfil () f ( x ) = f (x) (2) ( + x ) f
More informationSome upper and lower bounds on PSD-rank
Noname manuscript No (will be inserted by the editor) 1 Some upper and lower bounds on PSD-rank 2 Troy Lee Zhaohui Wei Ronald de Wolf 3 4 Received: date / Accepted: date 5 6 7 8 9 10 11 12 13 Abstract
More informationABSOLUTELY FLAT IDEMPOTENTS
ABSOLUTELY FLAT IDEMPOTENTS JONATHAN M GROVES, YONATAN HAREL, CHRISTOPHER J HILLAR, CHARLES R JOHNSON, AND PATRICK X RAULT Abstract A real n-by-n idempotent matrix A with all entries having the same absolute
More informationLecture 18: Quantum Information Theory and Holevo s Bound
Quantum Computation (CMU 1-59BB, Fall 2015) Lecture 1: Quantum Information Theory and Holevo s Bound November 10, 2015 Lecturer: John Wright Scribe: Nicolas Resch 1 Question In today s lecture, we will
More informationGenuine three-partite entangled states with a hidden variable model
Genuine three-partite entangled states with a hidden variable model Géza Tóth 1,2 and Antonio Acín 3 1 Max-Planck Institute for Quantum Optics, Garching, Germany 2 Research Institute for Solid State Physics
More informationMatrix Algebra, part 2
Matrix Algebra, part 2 Ming-Ching Luoh 2005.9.12 1 / 38 Diagonalization and Spectral Decomposition of a Matrix Optimization 2 / 38 Diagonalization and Spectral Decomposition of a Matrix Also called Eigenvalues
More information1 More on the Bloch Sphere (10 points)
Ph15c Spring 017 Prof. Sean Carroll seancarroll@gmail.com Homework - 1 Solutions Assigned TA: Ashmeet Singh ashmeet@caltech.edu 1 More on the Bloch Sphere 10 points a. The state Ψ is parametrized on the
More informationEinstein-Podolsky-Rosen correlations and Bell correlations in the simplest scenario
Einstein-Podolsky-Rosen correlations and Bell correlations in the simplest scenario Huangjun Zhu (Joint work with Quan Quan, Heng Fan, and Wen-Li Yang) Institute for Theoretical Physics, University of
More informationMax-Planck-Institut für Mathematik in den Naturwissenschaften Leipzig
Max-Planck-Institut für Mathematik in den aturwissenschaften Leipzig Bell inequality for multipartite qubit quantum system and the maximal violation by Ming Li and Shao-Ming Fei Preprint no.: 27 2013 Bell
More informationMATH 532: Linear Algebra
MATH 532: Linear Algebra Chapter 5: Norms, Inner Products and Orthogonality Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2015 fasshauer@iit.edu MATH 532 1 Outline
More informationSome Bipartite States Do Not Arise from Channels
Some Bipartite States Do Not Arise from Channels arxiv:quant-ph/0303141v3 16 Apr 003 Mary Beth Ruskai Department of Mathematics, Tufts University Medford, Massachusetts 0155 USA marybeth.ruskai@tufts.edu
More informationarxiv: v2 [quant-ph] 26 Mar 2012
Optimal Probabilistic Simulation of Quantum Channels from the Future to the Past Dina Genkina, Giulio Chiribella, and Lucien Hardy Perimeter Institute for Theoretical Physics, 31 Caroline Street North,
More informationLittle Orthogonality Theorem (LOT)
Little Orthogonality Theorem (LOT) Take diagonal elements of D matrices in RG * D R D R i j G ij mi N * D R D R N i j G G ij ij RG mi mi ( ) By definition, D j j j R TrD R ( R). Sum GOT over β: * * ( )
More informationQuantum and non-signalling graph isomorphisms
Quantum and non-signalling graph isomorphisms Albert Atserias 1, Laura Mančinska 2, David E. Roberson 3, Robert Šámal4, Simone Severini 5, and Antonios Varvitsiotis 6 1 Universitat Politècnica de Catalunya,
More informationEntanglement and information
Ph95a lecture notes for 0/29/0 Entanglement and information Lately we ve spent a lot of time examining properties of entangled states such as ab è 2 0 a b è Ý a 0 b è. We have learned that they exhibit
More informationLecture 14: Quantum information revisited
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 4: Quantum information revisited March 4, 006 So far, this course has focused almost entirely on quantum algorithms The next
More informationDirect product theorem for discrepancy
Direct product theorem for discrepancy Troy Lee Rutgers University Joint work with: Robert Špalek Direct product theorems Knowing how to compute f, how can you compute f f f? Obvious upper bounds: If can
More information5. Communication resources
5. Communication resources Classical channel Quantum channel Entanglement How does the state evolve under LOCC? Properties of maximally entangled states Bell basis Quantum dense coding Quantum teleportation
More informationFidelity and trace norm
Fidelity and trace norm In this lecture we will see two simple examples of semidefinite programs for quantities that are interesting in the theory of quantum information: the first is the trace norm of
More informationEntanglement, games and quantum correlations
Entanglement, and quantum M. Anoussis 7th Summerschool in Operator Theory Athens, July 2018 M. Anoussis Entanglement, and quantum 1 2 3 4 5 6 7 M. Anoussis Entanglement, and quantum C -algebras Definition
More informationQuantum information and quantum computing
Middle East Technical University, Department of Physics January 7, 009 Outline Measurement 1 Measurement 3 Single qubit gates Multiple qubit gates 4 Distinguishability 5 What s measurement? Quantum measurement
More informationQuantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2
Quantum Computing 1 Multi-Qubit System Quantum Computing State Space of Bits The state space of a single bit is {0,1}. n-bit state space is {0,1} n. These are the vertices of the n-dimensional hypercube.
More informationDistinguishing different classes of entanglement for three qubit pure states
Distinguishing different classes of entanglement for three qubit pure states Chandan Datta Institute of Physics, Bhubaneswar chandan@iopb.res.in YouQu-2017, HRI Chandan Datta (IOP) Tripartite Entanglement
More informationMassachusetts Institute of Technology Department of Economics Statistics. Lecture Notes on Matrix Algebra
Massachusetts Institute of Technology Department of Economics 14.381 Statistics Guido Kuersteiner Lecture Notes on Matrix Algebra These lecture notes summarize some basic results on matrix algebra used
More informationProbabilistic exact cloning and probabilistic no-signalling. Abstract
Probabilistic exact cloning and probabilistic no-signalling Arun Kumar Pati Quantum Optics and Information Group, SEECS, Dean Street, University of Wales, Bangor LL 57 IUT, UK (August 5, 999) Abstract
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
More informationLecture 6: Quantum error correction and quantum capacity
Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde The quantum capacity theorem is one of the most important theorems in quantum hannon theory. It is a fundamentally quantum theorem
More informationarxiv: v3 [quant-ph] 6 Sep 2014
Unambiguous discrimination of linearly independent pure quantum states: Optimal average probability of success Somshubhro Bandyopadhyay Department of Physics and Center for Astroparticle Physics and Space
More informationDetection of photonic Bell states
LECTURE 3 Detection of photonic Bell states d a c Beam-splitter transformation: b ˆB ˆB EXERCISE 10: Derive these three relations V a H a ˆB Detection: or V b H b or Two photons detected in H a, H b, V
More informationQubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,
Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable, A qubit: a sphere of values, which is spanned in projective sense by two quantum
More information