Lattice problems are in a unique position of enabling powerful cryptographic applications, and at the same time exhibiting resilience to quantum attacks. This potential has inspired exciting new advances in the study of algorithmic, cryptographic and complexity theoretic aspects of lattice problems in the quantum context. This talk will cover a number of these points of intersection as well as future outlook.