How to learn a 2^n times 2^n matrix by asking approximately log n questions? Of course there is no way. But if we know the matrix is a d-local Hamiltonian, then this becomes possible by a recent result of Lars Becker, Joe Slote, Ohad Klein, myself, and Haonan Zhang. The result is a certain dimension-free discrete Remez inequality. Its proof is probabilistic.