1. ENTROPIC CHARACTERISTICS OF QUANTUM CHANNELS AND THE ADDITIVITY PROBLEM A. S. Holevo Steklov Mathematical Institute, Moscow

2. Introduction: quantum information theory The classical capacity of quantum channel Hierarchy of additivity conjectures Global equivalence Partial results

3. INTRODUCTION A brief history of quantum information theory

4. Information Theory Born: middle of XX century, 1940-1950s (Shannon,…) Concepts: random source, entropy, typicality, code, channel, capacity: Tools: probability theory, discrete math, group theory,… Impact: digital data processing, data compression, error correction,…

5. Quantum Information Theory Born: second half of XX century Physics of quantum communication, 1950-60s (Gabor, Gordon, Helstrom,…): FUNDAMENTAL QUANTUM LIMITATIONS ON INFORMATIOM TRANSMISSION ? Mathematical framework: 1970-80s

6. Quantum Information Theory The early age (1970-1980s) Understanding quantum limits Concepts: random source, entropy, channel, capacity, coding theorem, …, entanglement Tools: noncommutative probability, operator algebra, random matrices (large deviations)… Implications: …, the upper bound for classical capacity of quantum channel: χ -capacity C ≤ C χ An overview in the book “Statistical structure of quantum theory” (Springer, 2001)‏

7. Quantum Information Theory (“Quantum Shannon theory”)‏ The new age (1990-2000s)‏ From quantum limitations to quantum advantages Q. data compression (Schumacher-Josza,…)‏ The quantum coding theorem for c-q channels: C = C χ (Holevo; Schumacher-Westmoreland)‏ Variety of quantum channel capacities/coding theorems (Shor, Devetak, Winter, ‏Hayden,…)‏ Summarized in recent book by Hayashi (Springer, 2006)‏

8. Additivity of channel capacity CLASSICAL INFORMATION CLASSICAL INFORMATION 01001011 11011010 ? ? MEMORYLESS encodingdecoding

9. The χ -CAPACITY and the CLASSICAL CAPACITY of QUANTUM CHANNEL

10. Finite quantum system

11. Composite quantum systems – entanglement

12. Quantum channel Completely positive (CP) map, Σ( H )→ Σ( H ’): ρρ’

13. Product of channels

14. The minimal output entropy ?

15. The χ -capacity ensemble average conditional output entropy output entropy

16. The Additivity Conjecture ?

17. Separate encodings/ separate decodings CLASSICAL INFORMATION CLASSICAL INFORMATION.. n. separate q. encodings decodings ACCESSIBLE (SHANNON) INFORMATION

18. Separate encodings/ entangled decodings CLASSICAL INFORMATION CLASSICAL INFORMATION.. n. separate q. entangled encodings decodings HSW-theorem: χ - CAPACITY ! !

19. Entangled encodings/ entangled decodings CLASSICAL INFORMATION CLASSICAL INFORMATION.. n. entangled encodings decodings The full CLASSICAL CAPACITY ? ?

20. HIERARCHY of ADDITIVITY CONJECTURES - minimal output entropy - χ- capacity – convex closure/ constrained χ- capacity/EoF

21. Additivity of the minimal output entropy ?

22. Rényi entropies and p-norms

23. Rényi entropies for p<1

24. The χ -capacity ensemble average conditional output entropy output entropy convex closure

25. Convex closure EoF

26. Constrained capacity

27. Additivity with constraints ?

28. Equivalent forms of (CA )‏ THM

29. Partial results Qubit unital channel (King)‏ Entanglement-breaking channel (Shor) Depolarizing channel (King)‏ Lieb-Thirring inequality:

30. Recent work on special channels (2003-…) Alicki-Fannes; Datta-Fukuda-Holevo-Suhov; Giovannetti-Lloyd-Maccone-Shapiro-Yen; Hayashi-Imai-Matsumoto-Ruskai-Shimono; King-Nathanson-Ruskai; King-Koldan; Matsumoto-Yura; Macchiavello-Palma; Wolf-Eisert,… ALL ADDITIVE!

31. Transpose-depolarizing channel Numerical search for counterexamples

32. Breakthrough 2007 Multiplicativity breaks: p>2, large d (Winter); 1<p<2, large d (Hayden); p=0, large d (Winter); p close to 0. Method: random unitary (non-constructive)‏ It remains 0<p<1 and p=1 (the additivity!)‏... And many other questions

33. Random unitary channels

34. The basic Additivity Conjecture remains open

35. GLOBAL EQUIVALENCE of additivity conjectures (Shor, Audenaert-Braunstein, Matsumoto- Shimono-Winter, Pomeranski, Holevo- Shirokov)

36. “Global” proofs involving Shor’s channel extensions Discontinuity of In infinite dimensions

37. THM Proof: Uses Shor’s trick: extension of the original channel which has capacity obtained by the Lagrange method with a linear constraint

38. Channel extension 1 0

39. Lagrange Function

41. Set of states is separable metric space, not locally compact Entropy is “almost always” infinite and everywhere discontinuous BUT Entropy is lower semicontinuous Entropy is finite and continuous on “useful” compact subset of states (of bounded “mean energy”)‏

42. The χ -capacity ensemble average conditional output entropy output entropy Generalized ensemble (GE)=Borel probability measure on state space

43. THM In particular, for all Gaussian channels with energy constraints

44. Gaussian channels Canonical variables (CCR) Gaussian environment Gaussian states Gaussian states Energy constraint PROP For arbitrary Gaussian channel with energy constraint an optimal generalized ensemble (GE) exists. CONJ Optimal GE is a Gaussian probability measure supported by pure Gaussian states with fixed correlation matrix. (GAUSSIAN CHANNELS HAVE GAUSSIAN OPTIMIZERS?)‏ Holds for c-c, c-q, q-c Gaussian channels ------------------------------------------------------------

45. CLASSES of CHANNELS

46. Complementary channels (AH, Matsumoto et al.,2005)‏ Observation: additivity holds for very classical channels; for very quantum channels Example:

47. Complementary channels

49. Entanglement-breaking channels

50. Entanglement-breaking channels -- additivity

51. Symmetric channels ?