Speaker: David Yang (Harvard) Title: Data-intensive Innovation and the State: Evidence from AI Firms in China Abstract: Data-intensive technologies such as AI may reshape the modern world. We propose that two features of data interact to shape innovation in data-intensive economies: first, states are key collectors and repositories of data; second, data is a non-rival input in innovation. We document the importance of state-collected data for innovation using comprehensive data on Chinese facial recognition AI firms and government contracts. […]

Speaker: Scott Aaronson (University of Texas at Austin) Title: Gentle Measurement of Quantum States and Differential Privacy Abstract: I'll discuss a recent connection between two seemingly unrelated problems: how to measure a collection of quantum states without damaging them too much ("gentle measurement"), and how to provide statistical data without leaking too much about individuals ("differential privacy," an area of classical […]

Speaker: Scott Duke Kominers (Harvard) Title: A Compact, Logical Approach to Large-Market Analysis Abstract: In game theory, we often use infinite models to represent "limit" settings, such as markets with a large number of agents or games with a long time horizon. Yet many game-theoretic models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. Here, we show […]

Speaker: Daniel Wise (McGill University) Title: The Cubical Route to Understanding Groups Abstract: Cube complexes have come to play an increasingly central role within geometric group theory, as their connection to right-angled Artin groups provides a powerful combinatorial bridge between geometry and algebra. This talk will introduce nonpositively curved cube complexes, and then describe the developments that culminated in the resolution of the virtual […]

Speaker: Peter Shor (MIT) Title: Quantum Money from Lattices Abstract: Quantum money is a cryptographic protocol for quantum computers. A quantum money protocol consists of a quantum state which can be created (by the mint) and verified (by anybody with a quantum computer who knows what the "serial number" of the money is), but which cannot be duplicated, even by somebody with a copy of the quantum state who knows the verification protocol. Several previous proposals have […]

Speaker: Salil Vadhan (Harvard) Title: Derandomizing Algorithms via Spectral Graph Theory Abstract: Randomization is a powerful tool for algorithms; it is often easier to design efficient algorithms if we allow the algorithms to "toss coins" and output a correct answer with high probability.  However, a longstanding conjecture in theoretical computer science is that every randomized algorithm can be efficiently "derandomized" […]