Counterexamples to additivity of minimum output p-Renyi entropy for p close to 0

Abstract

Complementing recent progress on the additivity conjecture of quantum information theory, showing that the minimum output p-Renyi entropies of channels are not generally additive for p>1, we demonstrate here by a careful random selection argument that also at p=0, and consequently for sufficiently small p, there exist counterexamples. An explicit construction of two channels from 4 to 3 dimensions is given, which have non-multiplicative minimum output rank; for this pair of channels, numerics strongly suggest that the p-Renyi entropy is non-additive for all p < 0.11. We conjecture however that violations of additivity exist for all p<1.

arXiv comment7 pages, revtex4; v2 added correct ref. [15]; v3 has more information on the numerical violation as well as 1 figure (2 graphs) - note that the explicit example was changed and the more conservative estimate of the bound up to which violations occur, additionally some other small issues are straightened out

References in corpus (6)

• Aspects of generic entanglement
• Additivity for a class of unital qubit channels
• Additivity of the Classical Capacity of Entanglement-Breaking Quantum Channels
• On entanglement-assisted classical capacity
• On the dimension of subspaces with bounded Schmidt rank
• Entanglement between Two Uses of a Noisy Multipartite Quantum Channel Enables Perfect Transmission of Classical Information

Cited by in corpus (27)

• Superadditivity of communication capacity using entangled inputs
• Quantum channels and their entropic characteristics
• Counterexamples to the maximal p-norm multiplicativity conjecture for all p > 1
• Random matrix techniques in quantum information theory
• Correlating thermal machines and the second law at the nanoscale
• Comments on Hastings' Additivity Counterexamples
• Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
• Testing product states, quantum Merlin-Arthur games and tensor optimisation
• An Infinite Sequence of Additive Channels: the Classical Capacity of Cloning Channels
• Nonadditivity effects in classical capacities of quantum multiple-access channels
• 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
• RTNI - A symbolic integrator for Haar-random tensor networks
• Almost one bit violation for the additivity of the minimum output entropy
• Revisiting additivity violation of quantum channels
• Distillable entanglement under dually non-entangling operations
• Capacities of the covariant Pauli channel
• Entanglement can completely defeat quantum noise
• Optimal input states for quantifying the performance of continuous-variable unidirectional and bidirectional teleportation
• Computable entanglement cost under positive partial transpose operations
• Additive bounds of minimum output entropies for unital channels and an exact qubit formula
• Photon losses depending on polarization mixedness
• An upper bound on quantum capacity of unital channels
• New constructive counterexamples to additivity of minimum output Rényi p-entropy of quantum channels
• Convex Trace Functions on Quantum Channels and the Additivity Conjecture