Tsirelson's problem asks a question about modeling locality in quantum mechanics; roughly speaking, whether the tensor product and commuting models for specifying bipartite correlations are equivalent. Ozawa showed that Tsirelson's problem is equivalent to Connes' Embedding Problem In the talk I will start from Tsirelson's problem and outline a possible approach to its resolution that goes through the theory of nonlocal games in quantum information and interactive proofs in complexity theory. The talk will be introductory and largely based on the work of others, including Navascues, Pironio and Acin, and Doherty, Liang, Toner, and Wehner. I will not assume any background in complexity theory.