Remember that quantum computers contain, as a subset, the classical logic gates. So your assertion that "classical computer are way better at doing arithmetic operations" is not entirely clear. Unless you mean that the current state of the art quantum computers are not as good as classical computers.
That said, I can think of two reasons why we might want to implement simple arithmetic on a quantum computer:
it might be that the algorithms are more efficient. As I said, classical computation is a subset. So, we have something else as well, and if we're smart, perhaps we can improve the algorithms using that something extra.
if you want to use the result of the calculation within part of a larger computation. You cannot just farm this out to a classical computer due to linearity. Fine, if the QC is guaranteed to be in a basis state $|a\rangle|b\rangle|0\rangle$ then you might think you could prepare $|a\rangle|b\rangle|a\oplus b\rangle$ by computing $a\oplus b$ and just making the state. But if any of the registers are in a superposition, you would be unable to read all the values, and unable to prepare a suitable superposition. The calculation has to be done within the quantum computer to preserve the linearity of the operation. It might be defined on computational basis states, but must work just as well for superpositions.