For complex matrices $A, B$ of the same size, there are simple counterexamples to the question, "Does $e^{A+B} = e^A e^B$ imply that $AB = BA$?''; but they do not involve matrices that have very small (Euclidean) norm. See for example, one of the responses to this question, in which $e^{A+B} = e^A = e^B = I$, where $I$ is the identity matrix, but $A$ and $B$ do not commute.
If there are counterexamples with $|A|, |B|$ being arbitrarily small then that settles the question. In the alternative, here is the small progress that I have made, in case the following line of reasoning can be continued to a solution.
First, by "very small'', I mean that the Campbell-Baker-Hausdorff (CBH) series expansion is valid for both $\log(e^A e^B)$ and $\log(e^B e^A)$. The CBH series expansion for $\log(e^X e^Y)$ is $e^X e^Y = \exp( \sum_{m=1}^{\infty} F_m(X, Y) )$, where $F_m(X, Y)$ is a homogeneous polynomial of degree $m$ in the (generally, non-commuting) variables $X, Y$ (complex matrices of equal size, $n$, say); and $F_m(X, Y)$ contains neither the term $X^m$ nor the term $Y^m$, except for $m=1$: $F_1(X, Y) = X + Y$. Each $F_m(X, Y)$ is moreover a linear combination of nested Lie brackets of $X$ and $Y$. Also, we have the elementary property, $F_m(Y, X) = (-1)^{m+1} F_m(X, Y)$.
Next, it suffices to show that $e^{A+B} = e^A e^B$ implies that $e^{A+B} = e^B e^A$, for then $e^B e^A = e^B e^A$, which does imply that $AB = BA$, under the assumption that $|A|, |B|$ are sufficiently small. Indeed, setting $X = e^A$ and $Y = e^B$, so that $A = \log X$ and $B = \log Y$, then $AB = BA$ because
$\qquad A = (X−I) − \frac{1}{2}(X−I)^2 + \frac{1}{3}(X−I)^3 − \cdots$,
$\qquad B = (Y−I) − \frac{1}{2}(Y−I)^2 + \frac{1}{3}(Y−I)^3 − \cdots$,
and the series commute since $X$ and $Y$ do.
The assumed equality, $e^A e^B = e^{A+B}$, implies that $\sum_{m=2}^{\infty} F_m(A, B) = 0$; but $A$ and $B$ are specific matrices, so we can't (immediately) conclude that each $F_m(A, B) = 0$, for $m \geq 2$. Using the property, $F_m(B, A) = (-1)^{m+1} F_m(A, B)$, we have $$ e^B e^A = \exp\left( \sum_{m=1}^{\infty} (-1)^{m+1} F_m(A, B) \right) = \exp\left( X + Y + \sum_{m=2}^{\infty} (-1)^{m+1} F_m(A, B) \right). $$ Based only on the equality, $\sum_{m=2}^{\infty} F_m(A, B) = 0$, I don't see why $\sum_{m=2}^{\infty} (-1)^{m+1} F_m(A, B)$ should equal $0$.
Another approach might be to consider $e^A e^B e^{-A} e^{-B}$.