[ANGLÈS] We study restricted models of measurement-based quantum computation; and we investigate whether their output probability distributions can be sampled from efficiently on a classical computer. We find that even for non-adaptive models of MBQC, if this task were feasible then a major conjecture of computational complexity theory would be violated. Finally, we show that our results coincide with previous work that is based on the quantum circuit model.