Appreciation and memories of Jim Simons (1938–2024), from the Simons Institute community. Featuring contributions from Avi Wigderson, Dick Karp, Shafi...
Simons Institute Senior Scientist Venkatesan Guruswami, along with Bingkai Lin, Yican Sun, and Berkeley theory graduate students Xuandi Ren and Kewen...
We are heartbroken by the loss of Luca Trevisan, who served as senior scientist at the Institute from 2014 to 2019.
This summer, the Simons Institute hosted our first indoor research activity in sixteen months, the 2021 Summer Cluster in Quantum Computation. In this episode of Polylogues, cluster organizer and Research Director for Quantum Computing Umesh Vazirani sits down with the other members of the organizing team to discuss some of the themes of the cluster: quantum complexity theory, quantum protocols and the nature of entanglement, quantum algorithms, and quantum chemistry.
The 13th Innovations in Theoretical Computer Science (ITCS) conference invites paper submissions through September 9.
This month, we are sharing once more our short documentary about computational complexity, which will open the Heidelberg Laureate Forum's mathematics and computer science film festival in November.
The Simons Institute is currently holding our first indoor research activity since the closure of the university due to the coronavirus in March 2020. The Summer Cluster in Quantum Computation is taking place at the Simons Institute from June 28 through August 6, 2021.
"Quantum computers aren’t the next generation of supercomputers — they’re something else entirely. Before we can even begin to talk about their potential applications, we need to understand the fundamental physics that drives the theory of quantum computing."
Our Spring 2021 programs on Satisfiability and on Theoretical Foundations of Computer Systems drew to a close earlier this month. It has been an unusual and challenging year in so many ways, brightened by the wide range of people around the world who have been able to participate in our workshops and lectures.
The world of cryptography saw a fundamental breakthrough this August, the beginning of an end for a very exciting period in the area of cryptography, one that began with the construction of candidate indistinguishability obfuscation schemes by Garg et. al. in 2013.
The Simons Institute is delighted to announce the launch of Breakthroughs, a lecture series highlighting major new developments in theoretical computer science. The Breakthroughs series will kick off on June 16 with a talk by Virginia Vassilevska Williams from MIT, who recently developed the fastest method to date for multiplying two matrices, in collaboration with Josh Alman from Harvard.