Same as QAM except Arthur sends Merlin polynomially many halves of EPR-pairs instead of random coinflips.
Trivially contains QMA and NIQSZK, and is contained in QIP[2].
Defined in [KGN19], where it was shown that estimating the maximum entropy and minimum trace distance to the maximally mixed state among all states in the image of a quantum channel are complete problems.
In [GK25] it was shown that determining if a local Hamiltonian has a low energy state with high entanglement entropy is complete for qq-QAM. It was also shown that additive approximation to the free energy (equivalently multiplicative approximation to the quantum partition function) can be computed in qq-QAM.
No class.