Lower bound on the dimension of a quantum system given measured data

We imagine an experiment on an unknown quantum mechanical system in which the system is prepared in various ways and a range of measurements are performed. For each measurement M and preparation the experimenter can determine, given enough time, the probability of a given outcome a: p (a, ). How large does the Hilbert space of the quantum system have to be in order to allow us to find density matrices and measurement operators that will reproduce the given probability distribution? In this paper, we prove a simple lower bound for the dimension of the Hilbert space. The main insight is to relate this problem to the construction of quantum random access codes, for which interesting bounds on the Hilbert space dimension already exist. We discuss several applications of our result to hidden-variable or ontological models, to Bell inequalities, and to properties of the smooth min-entropy.