The well-known KLS conjecture about isotropic convex bodies was made alongside the search for fast algorithms to sample from a convex body. In this talk, I will give the details behind the connection between the KLS conjecture and the mixing time of a natural random walk; namely, how a positive resolution of the KLS conjecture implies an O(n^2) sampling algorithm for an isotropic convex body.