Simultaneous min-entropy smoothing on multiparty systems

We consider the multiparty typicality conjecture raised by Dutil from a one-shot perspective. Asking for a multipartite state close to the state of the system that is typical on different subsystems simultaneously, this conjecture serves as a placeholder for the general difficulty to transfer the concept of classical joint typicality to the quantum setting. In this work, we reformulate the multiparty typicality conjecture as an optimization problem for min-entropies of different marginals. We find that the resulting one-shot conjecture is satisfied whenever the marginals under consideration commute. In this case we provide an optimal bound on the distance of the optimal state that demonstrates that atypical correlations for different subsystems can form mutually exclusive events on the global system. We furthermore show that our conjecture also holds in the two party quantum case. The techniques are then generalized to a restricted case for more parties given that the marginals to optimize do not overlap. Finally, this leads to a proof of our conjecture for tripartite systems in a pure state.

[1]  Journal für die reine und angewandte Mathematik , 1893 .

[2]  Pranab Sen,et al.  Achieving the Han-Kobayashi inner bound for the quantum interference channel , 2011, 2012 IEEE International Symposium on Information Theory Proceedings.

[3]  Andreas J. Winter The capacity of the quantum multiple-access channel , 2001, IEEE Trans. Inf. Theory.

[4]  A. Uhlmann The Transition Probability for States of *‐Algebras , 1985 .

[5]  M. Tomamichel A framework for non-asymptotic quantum information theory , 2012, 1203.2142.

[6]  M. Horodecki,et al.  Quantum State Merging and Negative Information , 2005, quant-ph/0512247.

[7]  Pranab Sen,et al.  Classical Communication Over a Quantum Interference Channel , 2011, IEEE Transactions on Information Theory.

[8]  Ivan Savov,et al.  Network information theory for classical-quantum channels , 2012, ArXiv.

[9]  Chuanming Zong,et al.  The Cube-A Window to Convex and Discrete Geometry , 2006 .

[10]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[11]  D. Hensley,et al.  Slicing the cube in ⁿ and probability (bounds for the measure of a central cube slice in ⁿ by probability methods) , 1979 .

[12]  K. Ball Cube slicing in ⁿ , 1986 .

[13]  E. Ehrhardt,et al.  Sur un problème de géométrie diophantienne linéaire. II. , 1967 .

[14]  Renato Renner,et al.  Security of quantum key distribution , 2005, Ausgezeichnete Informatikdissertationen.

[15]  S. Robins,et al.  Computing the Continuous Discretely , 2015 .

[16]  Janis Notzel A solution to two party typicality using representation theory of the symmetric group , 2012 .

[17]  A. Klyachko Quantum marginal problem and N-representability , 2005, quant-ph/0511102.

[18]  Nicolas Dutil,et al.  Multiparty quantum protocols for assisted entanglement distillation , 2011, 1105.4657.

[19]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[20]  K. - A Comparison of Two Achievable Rate Regions for the Interference Channel , 2006 .