Revisiting additivity violation of quantum channels
arXiv:1307.0707 · doi:10.1007/s00220-014-2101-2
Abstract
We prove additivity violation of minimum output entropy of quantum channels by straightforward application of ε-net argument and Lévy's lemma. The additivity conjecture was disproved initially by Hastings. Later, a proof via asymptotic geometric analysis was presented by Aubrun, Szarek and Werner, which uses Dudley's bound on Gaussian process (or Dvoretzky's theorem with Schechtman's improvement). In this paper, we develop another proof along Dvoretzky's theorem in Milman's view showing additivity violation in broader regimes than the existing proofs. Importantly, Dvoretzky's theorem works well with norms to give strong statements but these techniques can be extended to functions which have norm-like structures - positive homogeneity and triangle inequality. Then, a connection between Hastings' method and ours is also discussed. Besides, we make some comments on relations between regularized minimum output entropy and classical capacity of quantum channels.
arXiv comment16 pages
References in corpus (16)
- Superadditivity of communication capacity using entangled inputs
- Aspects of generic entanglement
- Counterexamples to the maximal p-norm multiplicativity conjecture for all p > 1
- Random quantum channels I: graphical calculus and the Bell state phenomenon
- Simplifying additivity problems using direct sum constructions
- Hastings' additivity counterexample via Dvoretzky's theorem
- On Hastings' counterexamples to the minimum output entropy additivity conjecture
- Comments on Hastings' Additivity Counterexamples
- Counterexamples to additivity of minimum output p-Renyi entropy for p close to 0
- Random quantum channels II: Entanglement of random subspaces, Renyi entropy estimates and additivity problems
- Non-additivity of Renyi entropy and Dvoretzky's Theorem
- Entanglement of random subspaces via the Hastings bound
- Weak multiplicativity for random quantum channels
- Constructive counterexamples to additivity of minimum output Rényi entropy of quantum channels for all p>2
- Towards a state minimizing the output entropy of a tensor product of random quantum channels
- Asymptotically well-behaved input states do not violate additivity for conjugate pairs of random quantum channels
Cited by in corpus (10)
- Random matrix techniques in quantum information theory
- Almost one bit violation for the additivity of the minimum output entropy
- Beyond islands: A free probabilistic approach
- Quantum channels with polytopic images and image additivity
- Additivity rates and PPT property for random quantum channels
- Estimates for compression norms and additivity violation in quantum information
- Optimal input states for quantifying the performance of continuous-variable unidirectional and bidirectional teleportation
- Additive bounds of minimum output entropies for unital channels and an exact qubit formula
- On the minimum output entropy of random orthogonal quantum channels
- Fidelity and Entanglement of Random Bipartite Pure States: Insights and Applications