The proof of the deduction theorem (for a system including Hilbert Calculus) that I am familiar with uses modus ponens to prove the result one way, and mathematical induction the other way.
Robinson's Arithmetic, $Q$, is defined as $PA$ without the induction scheme. Does this entail that the deduction theorem does not hold in $Q$? Or is there another proof?
Yes, deduction theorem holds in Robinson arithmetic $Q$. Let us prove it, relying on the fact that deduction theorem holds for the Hilbert calculus $H$.
Suppose that $\vdash_Q A \to B$, i.e. that $A \to B$ is provable in the system $Q$. System $Q$ is nothing but Hilbert calculus $H$ (its axioms and its inference rules) plus the axioms $Q_1, \dots, Q_7$ of Robinson arithmetic. Therefore, $\vdash_Q A \to B$, means that $Q_1, \dots, Q_7 \vdash_H A \to B$, i.e. $A \to B$ is provable in the system $H$ under the assumptions $Q_1, \dots, Q_7$. By the deduction theorem for the system $H$, we have that $Q_1, \dots, Q_7, A \vdash_H B$, i.e. $B$ is provable in the system $H$ under the assumptions $Q_1, \dots, Q_7, A$. But this exactly means that $A \vdash_Q B$, i.e. $B$ is provable in the system $Q$ under the assumption $A$.
Therefore, we proved that if $\vdash_Q A \to B$ then $A \vdash_Q B$, i.e. the deduction theorem holds for the system $Q$ (Robinson arithmetic).