The additivity of minimum output entropies is a central problem in quantum information theory. Nonadditivity is known for every Rényi order
p>1, at the von Neumann point
p=1, and for sufficiently small positive
p, while much of the interval
0<p<1 has remained open. In this work, we prove that for every
p>0 there exist finite-dimensional quantum channels whose minimum output
p-Rényi entropies violate additivity. Our proof combines two constructions: random projection-induced channels yield nonadditivity for
p>3/4, and antisymmetric postprocessing extends the violation to all positive Rényi orders. Our estimates also improve the output-dimension bound obtained by Belinschi, Collins, and Nechita for additivity violation of minimum output von Neumann entropy.
We prove that minimum-output Rényi-entropy additivity can fail by almost one bit simultaneously at every nonnegative order. For every
ε∈(0,log2), there exists a finite-dimensional quantum channel with a real Stinespring isometry such that the same maximally entangled input witnesses a tensor-square entropy gap of at least
log2−ε for all
p∈[0,∞]. The output dimension can be chosen to be
O(ε−3) as
ε↓0.
The construction uses direct products of free groups: tensorized Haagerup estimates control the one-copy outputs, while commutation between distinct factors forces exact Bell-branch collisions at two copies. Strong convergence gives both an existential realization through finite-dimensional representations of right-angled Artin groups followed by realification, and a Haar-orthogonal model whose success probability tends to one as the matrix dimension grows. We also determine the exact Bell quotient, prove asymptotically sharp regular-radius bounds, and show that the cubic output-dimension scale is optimal within the present purity--rank certificate.