Eskenazis, Nayar and Tkocz have shown recently some resilience of Ball's celebrated cube slicing theorem, namely its analogue in $l^n_p$ for large $p$. We show that the complex analogue, i.e. resilience of the polydisc slicing theorem proven by Oleszkiewicz and Pelczyński, holds for large $p$ and small $n$, but does not hold for any $p > 2$ and large $n$.