• Keine Ergebnisse gefunden

Quantum Information Theory Problem Set 9

N/A
N/A
Protected

Academic year: 2022

Aktie "Quantum Information Theory Problem Set 9"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Quantum Information Theory Problem Set 9

Spring 2008 Prof. R. Renner

Problem 9.1 Some properties of von Neumann entropy

We will now derive some properties of the von Neumann entropy that will be useful in later exercises. The von Neumann entropy of a density operator ρ∈ S(H) is defined as

S(ρ) =−tr ρlogρ

=−X

i

λilogλi. (1)

where {λi}i are the eigenvalues of ρ. Given a composite system ρABC ∈ S(HA ⊗ HB ⊗ HC) and ρAB = trCABC) etc., we often writeS(AB) instead of S(ρAB) to denote the entropy of a subsystem. The strong sub-additivity property of the von Neumann entropy proves very useful:

S(ABC) +S(B)≤S(AB) +S(BC). (2) Prove the following properties of the von Neumann entropy:

a) IfρAB is pure, thenS(A) =S(B).

b) If two subsystem are independent ρABA⊗ρBthen S(AB) =S(A) +S(B).

c) If the system is classical on a subsystemZ, namelyρAZ=P

zpz|zihz|Z⊗ρzA for some basis {|zihz|Z}z ofHZ, then

S(AZ) =S(Z) +X

z

pzS(A|Z=z), (3)

whereS(A|Z=z) =S(ρzA).

d) Concavity:

X

z

pzS(A|Z=z)≤S(A). (4) e)

S(A)≤S(AZ). (5)

Problem 9.2 Upper bound on von Neumann entropy Given a stateρ∈ S(H), show that

S(ρ)≤log dimH. (6)

Consider the state ¯ρ=R

U ρ UdU, where the integral is over all unitaries U ∈ U(H) and dU is the Haar measure. Find ¯ρ and use concavity (4) to show (6). Hint: The Haar measure satisfies d(U V) = d(V U) = dU, whereV ∈ U(H) is any unitary.

Referenzen

ÄHNLICHE DOKUMENTE

Suppose that we roll a standard fair dice seventeen times (independently).. What is the probability that the sum is divisible

Tsirelson’s inequality (cf. Nielsen/Chuang, Problem 2.3) gives an upper bound on the possible violation of Bell’s inequality in Quantum

Let us consider the following thought experiment: Alice and Bob share a system that is comple- tely described by a random variable Z (the hidden variable). A Bell experiment is

Furthermore, classical communication between A and B is insecure in that everything broadca- sted over the channel will be heard by E. Prove the

We wish to show that entanglement does not increase under local operations and classical communication (LOCC). Classical communi- cation consists of a measurement on Alice’s

a) Look at the state of the system after Alice’s measurement but before she communicates her results to Bob. At this point, we know that Bob’s state is in one of four possible

(c) Calculate the time dependent reduced density matrix ˆ ρ red (t) which is defined by tracing out one of the sites of the

Chosen the number of edges, entropy is smaller for graphs with large cliques and short paths, i.e., graphs in which the vertices form an highly connected cluster.. The remainder of