QMA(2) with Limited Shared Entanglement
The paper investigates how sharing a limited amount of entanglement affects QMA(2) computational power. It proves that if provers share logarithmically many EPR pairs (h = O(log n)), the computational power remains exactly QMA(2). This resolves an open question about the limits of unentangled witness power, showing that logarithmic entanglement is sufficient to preserve this class.