Scribd
Upload
33 views1 page

Quantum Information Theory Series 11

The document discusses three exercises related to quantum information theory: 1) Proving that Alice cannot send n qubits to Bob using less than 2n bits of classical communication, even if they share unlimited entanglement. 2) Developing an entanglement criterion called the partial transpose test, which can detect entanglement in low-dimensional systems. 3) Defining the quantum relative entropy and proving several properties about it, including that it is not symmetric and therefore not a true metric.

Uploaded by

Chiranjib Mukhopadhyay
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views1 page

Quantum Information Theory Series 11

The document discusses three exercises related to quantum information theory: 1) Proving that Alice cannot send n qubits to Bob using less than 2n bits of classical communication, even if they share unlimited entanglement. 2) Developing an entanglement criterion called the partial transpose test, which can detect entanglement in low-dimensional systems. 3) Defining the quantum relative entropy and proving several properties about it, including that it is not symmetric and therefore not a true metric.

Uploaded by

Chiranjib Mukhopadhyay
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Quantum Information Theory Series 11

Exercise 11.1 Resource inequalities: teleportation and classical communication

HS 12 Prof. R. Renner

We saw a protocol, teleportation, to transmit one qubit using two bits of classical computation and one ebit,

g
1

(Section 6.1 of the script). Now suppose that Alice and Bob share unlimited entanglement: they can use up as many ebits as they want. Can Alice send n qubits to Bob using less than 2n bits of classical communication? In other words, we want to know if the following is possible:

g,

m < 2n.

Prove that this is not the case. Hint: Use superdense coding. Exercise 11.2 A sucient entanglement criterion

In general it is very hard to determine if a state is entangled or not. In this exercise we will construct a simple entanglement criterion that correctly identies all entangled states in low dimensions. Recall that we say that a bipartite state AB is separable (not entangled) if =
k

pk k k ,

k : pk 0, k S= (HA ), k S= (HB ),
k

pk = 1.

a) Let A : End(HA ) End(HA ) be a positive map. Show that A IB maps separable states to positive operators. This means that if we apply A IB to a bipartite state AB and obtain a non-positive operator, we know that AB is entangled. In other words, this is a sucient criterion for entanglement. b) Now we have to nd a suitable map A . Show that the transpose, T
ij

aij |i j | =
ij

aji |i j |,

is a positive map from End(HA ) to End(HA ), but is not completely positive. c) Apply the partial transpose, TA IB , to the -noisy Bell state
| + AB = (1 ) |

14
4

1 | = (|00 |11 ), 2

[0, 1].

For what values of can we be sure that is entangled? Remark: Indeed, it can be shown that the PPT criterion (positive partial transpose) is necessary and sucient for systems of dimension 2 2 and 2 3. Exercise 11.3 Relative Entropy

The quantum relative entropy is dened as D(|| ) = Tr( log log ). For two classical probability distributions p pj and q , this denition simplies to the expression for the Kullback-Leibler divergence j pj log qj . Similar to the classical case, the relative entropy serves as a kind of distance between quantum states (although it is not technically a metric). Show that a) H (A|B ) = D(||1A B ) b) D(|| ) 0, with equality if and only if = c) D(|| )
k

pk D(k || ), where = p1 1 + p2 2

d) For any CPTPM E , D(|| ) D(E ()||E ( )) e) D(|| ) is not a metric. Show this by proving that it is not symmetric.

You might also like