The complexity class QMA(2) has no known upper bounds aside from NEXP.
It is unknown whether this class lies in BQEXP, which gives a quantum computer exponential time to decide a problem with $\ge 2/3$ accuracy.
If true, this makes it less likely that QMA(2) = NEXP, since it is unlikely that NEXP $\subseteq$ BQEXP.