I think there is not.
In order to proof this I've written all the element's order and I've seen that the possible orders in A4 were only 1,2 and 3 (3 elements whit order 2 and 8 elements whit order 3). The orders in D4 were 1,6, 3 and 2 but there were 7 elements with order 2. So because an isomorphism is first of all an homomorphism, my map have to respect this condition: ord(f(x)) divides ord(x), but in my exemple I have 8 elements whit order 3 in the domine and 3 elements whit order 3 or 1 in the codomine, so I'm forced to send seven elements in only three, so the map can't be injective, so can't be an isomorphism.
I think it is correct, but I would like to know if there is a smarter way to proof this involving generators.
Thanks!