Does the following equality hold for $A,B$ ( both Hermitian matrices): $$\vert \text{tr}(AB) \vert \leq \displaystyle\left(\text{tr}(\vert A\vert^k) \text{tr}(\vert B \vert ^k)\right)^{\frac{1}{k}}?$$
I remember seeing this for $k=2$, which can be treated roughly as Cauchy-Schwartz for Hermitian operators. But I don't recall the proof for it. If it helps, you can assume k to be even.
$\def\tr{\operatorname{Tr}}$You run into all kind of problems if you omit absolute values. For instance with $k=1$ and $$A=B=\begin{bmatrix}0&1\\1&0\end{bmatrix}$$ you have $$ \tr(AB)=1>\tr(A)\,\tr(B)=0. $$ In fact, the inequality fails even if $A,B$ are positive and commute. For instance with $A=B=I_2$, and any $k>2$, $$ \tr(AB)=2>2^{2/k}= \tr(A^k)^{1/k}\tr(B^k)^{1/k}. $$ The inequality that does hold is Holder's. That is, for $p,q≥1$ with $\frac1p+\frac1q=1$, $$ |\tr(AB)|≤\tr(|A|^p)^{1/p}\tr(|B|^q)^{1/q}. $$