Let $A$ be a traceless $2\times 2$ complex matrix. Its SVD reads $A=UDV^\dagger$, or in dyadic notation, $$A=s_1 u_1 v_1^\dagger+s_2 u_2 v_2^\dagger,$$ with $\langle u_i,u_j\rangle=\langle v_i,v_j\rangle=\delta_{ij}$ and $s_i\ge0$. The left (right) singular vectors of $A$ are $(u_1,u_2)$ and $(v_1,v_2)$, and its singular values are $s_1,s_2$.
The trace condition $\operatorname{Tr}(A)=0$ translates, in terms of its SVD, into $$s_1\langle v_1,u_1\rangle+s_2\langle v_2,u_2\rangle=0.$$
However, numerically, I find that the stronger condition $\langle u_1,v_1\rangle=\langle u_2,v_2\rangle=0$ holds. In words, the left and right singular vectors corresponding to the same singular values are always orthogonal. You can use the following Mathematica snippet to verify it directly:
With[{mat = # - Tr[#]/2 IdentityMatrix@2 & @ RandomComplex[{-1 - I, 1 + I}, {2, 2}]},
SingularValueDecomposition@mat // Dot[ConjugateTranspose@#[[1]], #[[3]]] & // Chop // MatrixForm
]
This snippet generates random complex matrices $A$ by sampling the components from the uniform distribution in $[0,1]$, and then removing $\operatorname{Tr}(A) I/2$ to get a traceless matrix. The output is the inner product between the different left and right singular vectors, and the zeros on the diagonal correspond to the orthogonality that is the subject of this question.
At the same time, this is clearly false for many matrices, in particular normal ones, for which $u_i=v_i$. Still, is there a way to see why left and right singular vectors are "often" orthogonal for traceless matrices?