寻求无分支算法实现特定4位整数集的转换

以下是两组4位整数的对比，共存在6处差异（标注在每行末尾）：

0000 0000 diff: []
0101 0001 diff: [2]
1000 0010 diff: [3, 1]
0011 0011 diff: []
0110 0100 diff: [1]
0100 0101 diff: [0]
0111 0110 diff: [0]

要求仅使用以下算术（加法类）和位运算符实现左列到右列的转换：+、-、>>、<<、|、&、^。

目前尚未找到满足所有情况的可行方案。曾尝试结合模运算与加法的4位组合，上述差异结果是当前能达到的最优尝试。

内容的提问来源于stack exchange，提问作者YurichBRO