A ground station in a quantum network reports three figures at the end of one…
PHYSICS · Multi-part · Fermi University Physics · Quantum Information & Technology · Quantum information theory and communication · Quantum information theory and communication
Quantum Information and Technology, Ch Entropy and compression
Problem
A ground station in a quantum network reports three figures at the end of one operating cycle. Solve each part separately.
((a)) The station's classical control channel sends a block of n=200 independent bits, each equal to 1 with probability p=0.2 and 0 otherwise. Let H=h(p) be the binary entropy of the source and let ϵ=0.1 bits. Use Chebyshev's inequality applied to the per-symbol surprise −log2p(xi) to bound the probability δ that a block of n=200 symbols is not ϵ-typical, and hence bound the number ∣Tϵn∣ of ϵ-typical blocks between (1−δ)2n(H−ϵ) and 2n(H+ϵ). Give both bounds as powers of two, quoting the base-2 exponent to one decimal place.
((b)) In the same cycle the station shares N=500 copies of the two-qubit Werner state ρW=fs∣Ψ−⟩⟨Ψ−∣+31−fs(∣Φ+⟩⟨Φ+∣+∣Φ−⟩⟨Φ−∣+∣Ψ+⟩⟨Ψ+∣) with singlet fraction fs=⟨Ψ−∣ρW∣Ψ−⟩, so its eigenvalues are fs (once) and (1−fs)/3 (three times) and the hashing yield is −S(A∣B)=1−S(A,B) with S(A,B)=−fslog2fs−(1−fs)log2(31−fs). Solve S(A,B)=1 numerically for the singlet fraction fs at which the hashing yield falls to zero, quoting your answer to three decimal places. Then, for a batch with fs=0.90, find the hashing yield and the number of Bell pairs that hashing can asymptotically distil from the N copies.
((c)) A different sensor prepares, with equal probability 31 each, one of three trine states equally spaced around a great circle of the Bloch sphere: ∣0⟩, ∣ψ1⟩=cos60∘∣0⟩+sin60∘∣1⟩ (Bloch vector at polar angle 120∘ from +Z), and ∣ψ2⟩=cos120∘∣0⟩+sin120∘∣1⟩ (Bloch vector at polar angle 240∘ from +Z), and transmits 2000 such qubits per cycle. Find the eigenvalues of the ensemble density operator ρ=31∣0⟩⟨0∣+31∣ψ1⟩⟨ψ1∣+31∣ψ2⟩⟨ψ2∣, its von Neumann entropy S(ρ), and the number of qubits into which Schumacher compression can pack the 2000 letters. Compare this with the number of bits a classical record of which of the three letters was sent would need.