Nothing wrong with the other methods (+1 to y'all). Just proffering a different track.
The multiplicative group of $\Bbb{F}_{16}$ is cyclic of order fifteen (your $a$ is one of the generators, but we won't need that). The multiplicative group of the subfield $\Bbb{F}_4$ is cyclic of order three. Because $15/3=5$ the elementary properties of the cyclic groups imply that the fifth power of any element of $z\in\Bbb{F}_{16}$ is in that subfield.
Let's calculate. Applying this to $z=a$ shows that
$$
a^5=a\cdot a^4=a(1+a^3)=a+a^4=a+(1+a^3)=a^3+a+1\in\Bbb{F}_4.
$$
If we had not been lucky on the first attempt, we could have done the same with $z=a^2$ or, more simply, used the fact that $\Bbb{F}_4$ is closed under addition as well.
I am not saying that this way would be better than the alternatives. Because there is only a single irreducible quadratic polynomial in $\Bbb{F}_2[x]$, namely $p(x)=x^2+x+1$, the other answerers knew that $p(x)$ has to be the minimal polynomial of $a^3+a+1$. So they took advantage. In a slightly bigger example we would have more choices for the minimal polynomial. Linear algebra could still be used to find the minimal polynomial. The method I used will always produce elements of the prescribed subfield, but the calculations become longer (even if you exploit the trusted square-and-multiply to the fullest).
There are many ways to skin this cat.