Can we compute $X^n$ faster than $O(\log n)$?

Question

While reading, I come across a statement saying that $O(\log n)$ is the fastest algorithm for computing the nth power of a number followed by $O(n)$. So, is that possible to compute the $n^{th}$ power of a number in $O(1)$ time complexity?

Thanks for any clarification.