2013 · 83 citations · 15 references
Natural SciencesMathematicsProbability TheoryAdditive Combinatorics
Abstract. The goal of this note is to show that Hastings’s counterexample to the additivity of minimal output von Neumann entropy can be readily deduced from a sharp version of Dvoretzky’s theorem.
15
<i>Quantum Computation and Quantum Information</i>
Michael A. Nielsen, Isaac L. Chuang, Lov K. Grover · American Journal of Physics · 2002 · 22.7K citations
Quantum computation and quantum information
Jim Law · ACM SIGSOFT Software Engineering Notes · 2001 · 19.2K citations
Computing, Computer Science, Physics +13
Superadditivity of communication capacity using entangled inputs
M. B. Hastings · Nature Physics · 2009 · 611 citations · Full text