We derive sublinear-time quantum algorithms for computing the Nash
equilibrium of two-player zero-sum games, based on efficient Gibbs sampling
methods. We are able to achieve speed-ups for both dense and sparse payoff
matrices at the cost of a mildly increased dependence on the additiv