2014
DOI: 10.1007/s00220-014-2101-2
|View full text |Cite
|
Sign up to set email alerts
|

Revisiting Additivity Violation of Quantum Channels

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… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
7
2

Relationship

4
5

Authors

Journals

citations
Cited by 18 publications
(13 citation statements)
references
References 31 publications
0
13
0
Order By: Relevance
“…On the other hand, in such an asymptotic regime, the violation of additivity was proven to be typical in [2], [7], [9], and [10] (see also [1], [5], [12]). That is, there exists some channel T 2 : M d 2 (C) → M n (C) that violates the additivity equation (11) for some ε > 0:…”
Section: Additivity Of Minimum Output Entropymentioning
confidence: 95%
“…On the other hand, in such an asymptotic regime, the violation of additivity was proven to be typical in [2], [7], [9], and [10] (see also [1], [5], [12]). That is, there exists some channel T 2 : M d 2 (C) → M n (C) that violates the additivity equation (11) for some ε > 0:…”
Section: Additivity Of Minimum Output Entropymentioning
confidence: 95%
“…An improved version of Dvoretzky's theorem was used in [ASW11] to show violations at p = 1. Later, Fukuda provided a simpler proof of violation [Fuk14], using this time ε-net arguments and Levy's lemma, the techniques used also in the pioneering work [HLW06]. In [BCN12,BCN13], the authors use free probability theory to compute exactly the minimum output entropy of a random quantum channel [BCN13, Theorem 5.2].…”
Section: 3mentioning
confidence: 99%
“…The interest in the study of random quantum channels comes mainly from the fact that, to date, violation of additivity is proved only through random techniques (typically with random unitary quantum channels generated by random unitary matrices), see [Has09,FKM10,FK10,ASW11,BCN12,Fuk14,BCN16,Col16]. Non-random counter-examples have been obtained only for p-Rényi minimum output entropies, see [WH02,GHP10].…”
Section: Introductionmentioning
confidence: 99%