I thought it might be instructive to present a way forward that does not rely on L'Hospital's Rule. Rather, it relies only on an elementary identity and tools.
To begin, note from THIS ANSWER, in which I showed using only the limit definition of the exponential function and Bernoulli's Inequality. that the logarithm function satisfies the inequality
$$\log(x)\le x-1 \tag 1$$
for $x>0$.
Next, for any $\alpha$, the logarithm satisfies $\log(x^\alpha)=\alpha \log(x)$. Using this in $(1)$, we obtain for any $\alpha >0$ and $n>1$
$$0\le \frac{\log^k(n)}{n^{\epsilon}}\le \left(\frac{n^\alpha -1}{\alpha \,n^{\epsilon/k}}\right)^k \tag 2$$
Finally, since $(2)$ is true for all $\alpha>0$, it is true for $0<\alpha<\epsilon/k$. Then, applying the squeeze theorem to $(2)$ for $0<\alpha <\epsilon/k$ reveals
$$\bbox[5px,border:2px solid #C0A000]{\lim_{n\to \infty} \frac{\log^k(n)}{n^{\epsilon}}=0}$$
as expected!
$$n^{\epsilon} = e^{\epsilon\log(n)}$$
Then you will be able to use Hopital (many times, maybe)
$$\frac{\log^k(x)}{e^{\epsilon\log(n)}}$$
– Enrico M. Mar 17 '16 at 23:27