# SimonsTV

Our videos can also be found on YouTube.
Apr. 2021

Ignacio Cirac (Max Planck Institute, Munich)

Quantum Colloquium, Apr. 13th, 2021

https://simons.berkeley.edu/events/quantum-colloquium

Quantum many-body systems are very hard to simulate, as computational resources (time and memory) typically grow exponentially with system size. However, quantum computers or analog quantum simulators may perform that task in a much more efficient way. In this talk, I will review some of the quantum algorithms that have been proposed for this task and then explain the advantages and disadvantages of analog quantum simulators. In particular, I will describe methods to simulate the dynamics, to find ground states, or compute physical properties at finite temperatures.

Quantum Colloquium, Apr. 13th, 2021

https://simons.berkeley.edu/events/quantum-colloquium

Quantum many-body systems are very hard to simulate, as computational resources (time and memory) typically grow exponentially with system size. However, quantum computers or analog quantum simulators may perform that task in a much more efficient way. In this talk, I will review some of the quantum algorithms that have been proposed for this task and then explain the advantages and disadvantages of analog quantum simulators. In particular, I will describe methods to simulate the dynamics, to find ground states, or compute physical properties at finite temperatures.

Playlist: 22 videos

May. 2020

The Women of Theory of Computer Science rock to our version of I Will Survive!

WIT: https://womenintheory.wordpress.com/

I Will Survive

Lyrics: Avi Wigderson (IAS)

At first I was afraid, I was petrified

I worried I could never fit this proof on just one slide

But then I spent so many nights thinking why it is so long

And I grew strong

And learned exactly what went wrong

A problem wor-thy, of attack

Just proves its worth by vigorously fighting back

I should have used error correction, should have sampled yet again

I should have stayed the course and found there is so much that I can gain

So do come back, problems galore

I am much more ready to attack you than I was before

I’ll fight you guiltless when at work, forget you guiltless when at home

And if you’re fun then in the pastures of the TCS we’ll roam

So I’ll survive, and I will thrive,

By Nash’s equilibrium, there must be balance to my life

I’ve got all my life to live,

And I’ve got all my Math to give

So I’ll survive,

and I will thrive, hey, hey

It took all the strength I had, I was nearly spent,

Trying hard to mend, the errors, in my argument

I put each pigeon in its hole, consulted every oracle

My upper bound

Turned up below my lower bound

Then I came up, with something new

I thought outside the blackbox, found what others never knew

That polynomials with a small degree have small number of roots

That few cryptogra-phic assumptions no one’s likely to dispute

So do come back, problems galore

I am much more ready to attack you than I was before

As I have wit and I have WIT and having both is pretty neat

Indeed a convex combination that is very hard to beat

So I’ll survive, and I will thrive,

Because (in theory, at least) this is a perfect life

You pick the problems that you love

To fit your brain just like a glove

So I’ll survive,

and I will thrive, hey, hey

Singers:

Dahlia Malkhi (Calibra, Facebook)

Elette Boyle (IDC, Israel)

Irit Dveer Dinur (Weizmann Institute, Israel)

Julia Chuzhoy (Toyota Technological Institute at Chicago, USA)

Katrina Ligett (Hebrew University, Israel)

Keren Censor-Hillel (Technion, Israel)

Lisa Zhang (Bell-Labs, USA)

Mary Wooters (Stanford University, USA)

Michal Feldman (Tel-Aviv University, Israel)

Nicole Immorlica (Microsoft Research, New England, USA)

Orna Kupferman (Hebrew University, Israel)

Rebecca Wright (Barnard College, USA)

Ronitt Rubinfeld (MIT, USA)

Shafi Goldwasser (Simons Institute at UC Berkeley, USA)

Shubhangi Saraf (Rutgers University, USA)

Shuchi Chawla (University of Wisconsin, Madison, USA)

Sofya Raskhodnikova (Boston University, USA)

Tal Malkin (Columbia University, USA)

Tal Rabin (Algorand Foundation, USA)

Yael Tauman Kalai (Microsoft Research, New England, USA)

WIT: https://womenintheory.wordpress.com/

I Will Survive

Lyrics: Avi Wigderson (IAS)

At first I was afraid, I was petrified

I worried I could never fit this proof on just one slide

But then I spent so many nights thinking why it is so long

And I grew strong

And learned exactly what went wrong

A problem wor-thy, of attack

Just proves its worth by vigorously fighting back

I should have used error correction, should have sampled yet again

I should have stayed the course and found there is so much that I can gain

So do come back, problems galore

I am much more ready to attack you than I was before

I’ll fight you guiltless when at work, forget you guiltless when at home

And if you’re fun then in the pastures of the TCS we’ll roam

So I’ll survive, and I will thrive,

By Nash’s equilibrium, there must be balance to my life

I’ve got all my life to live,

And I’ve got all my Math to give

So I’ll survive,

and I will thrive, hey, hey

It took all the strength I had, I was nearly spent,

Trying hard to mend, the errors, in my argument

I put each pigeon in its hole, consulted every oracle

My upper bound

Turned up below my lower bound

Then I came up, with something new

I thought outside the blackbox, found what others never knew

That polynomials with a small degree have small number of roots

That few cryptogra-phic assumptions no one’s likely to dispute

So do come back, problems galore

I am much more ready to attack you than I was before

As I have wit and I have WIT and having both is pretty neat

Indeed a convex combination that is very hard to beat

So I’ll survive, and I will thrive,

Because (in theory, at least) this is a perfect life

You pick the problems that you love

To fit your brain just like a glove

So I’ll survive,

and I will thrive, hey, hey

Singers:

Dahlia Malkhi (Calibra, Facebook)

Elette Boyle (IDC, Israel)

Irit Dveer Dinur (Weizmann Institute, Israel)

Julia Chuzhoy (Toyota Technological Institute at Chicago, USA)

Katrina Ligett (Hebrew University, Israel)

Keren Censor-Hillel (Technion, Israel)

Lisa Zhang (Bell-Labs, USA)

Mary Wooters (Stanford University, USA)

Michal Feldman (Tel-Aviv University, Israel)

Nicole Immorlica (Microsoft Research, New England, USA)

Orna Kupferman (Hebrew University, Israel)

Rebecca Wright (Barnard College, USA)

Ronitt Rubinfeld (MIT, USA)

Shafi Goldwasser (Simons Institute at UC Berkeley, USA)

Shubhangi Saraf (Rutgers University, USA)

Shuchi Chawla (University of Wisconsin, Madison, USA)

Sofya Raskhodnikova (Boston University, USA)

Tal Malkin (Columbia University, USA)

Tal Rabin (Algorand Foundation, USA)

Yael Tauman Kalai (Microsoft Research, New England, USA)

Apr. 2020

Theory Shorts is a documentary web series that explores topics from the Simons Institute’s research programs.

Episode 1, “Perception as Inference: The Brain and Computation,” explores the computational processes by which the brain builds visual models of the external world, based on noisy or incomplete data from patterns of light sensed on the retinae.

HOST

Bruno Olshausen

DIRECTOR

Christoph Drösser

EDITOR

Michaelle McGaraghan

PRODUCERS

Kristin Kane

Michaelle McGaraghan

SCIENTIFIC ADVISOR

Shafi Goldwasser

ANIMATORS

Caresse Haaser

Christoph Drösser

Lukas Engelhardt

GRAPHIC DESIGNER

Barry Bödeker

VIDEOGRAPHERS

Drew Mason

Omied Far

Michaelle McGaraghan

Matt Beardsley

PRODUCTION ASSISTANTS

Christine Wang

Bexia Shi

Lior Shavit

THEME MUSIC

“Plastic” by Purple Moons

Courtesy of Marmoset in Portland, Oregon

OTHER MEDIA COURTESY OF

Bruce Damonte

Arash Fazl

Anders Garm

Jean Lorenceau and Maggie Shiffrar

Beau Lotto

A. L. Yarbus

Bruno Olshausen

videocobra / Pond5

BlackBoxGuild / Pond5

nechaevkon / Pond5

DaveWeeks / Pond5

CinematicStockVideo / Pond5

BananaRepublic / Pond5

MicroStockTube / Pond5

shelllink / Pond5

AudioQuattro / Envato Market

HitsLab / Envato Market

FlossieWood / Envato Market

plaincask / Envato Market

MusicDog / Envato Market

Loopmaster / Envato Market

Ryokosan / Envato Market

Images used under license from Shutterstock.com

© Simons Institute for the Theory of Computing, 2019

Episode 1, “Perception as Inference: The Brain and Computation,” explores the computational processes by which the brain builds visual models of the external world, based on noisy or incomplete data from patterns of light sensed on the retinae.

HOST

Bruno Olshausen

DIRECTOR

Christoph Drösser

EDITOR

Michaelle McGaraghan

PRODUCERS

Kristin Kane

Michaelle McGaraghan

SCIENTIFIC ADVISOR

Shafi Goldwasser

ANIMATORS

Caresse Haaser

Christoph Drösser

Lukas Engelhardt

GRAPHIC DESIGNER

Barry Bödeker

VIDEOGRAPHERS

Drew Mason

Omied Far

Michaelle McGaraghan

Matt Beardsley

PRODUCTION ASSISTANTS

Christine Wang

Bexia Shi

Lior Shavit

THEME MUSIC

“Plastic” by Purple Moons

Courtesy of Marmoset in Portland, Oregon

OTHER MEDIA COURTESY OF

Bruce Damonte

Arash Fazl

Anders Garm

Jean Lorenceau and Maggie Shiffrar

Beau Lotto

A. L. Yarbus

Bruno Olshausen

videocobra / Pond5

BlackBoxGuild / Pond5

nechaevkon / Pond5

DaveWeeks / Pond5

CinematicStockVideo / Pond5

BananaRepublic / Pond5

MicroStockTube / Pond5

shelllink / Pond5

AudioQuattro / Envato Market

HitsLab / Envato Market

FlossieWood / Envato Market

plaincask / Envato Market

MusicDog / Envato Market

Loopmaster / Envato Market

Ryokosan / Envato Market

Images used under license from Shutterstock.com

© Simons Institute for the Theory of Computing, 2019

Apr. 2020

Henry Yuen (University of Toronto)

Richard M. Karp Distinguished Lecture Series, Spring 2020

https://simons.berkeley.edu/events/rmklectures2020-spring-3

In a recent result known as "MIP* = RE," ideas from three disparate fields of study — computational complexity theory, quantum information, and operator algebras — have come together to simultaneously resolve long-standing open problems in each field, including a 44-year old mystery in mathematics known as Connes’ Embedding Problem. In this talk, I will describe the evolution and convergence of ideas behind MIP* = RE: it starts with three landmark discoveries from the 1930s (Turing’s notion of a universal computing machine, the phenomenon of quantum entanglement, and von Neumann’s theory of operators), and ends with some of the most cutting-edge developments from theoretical computer science and quantum computing.

This talk is aimed at a general scientific audience, and will not assume any specialized background in complexity theory, quantum physics, or operator algebras.

Richard M. Karp Distinguished Lecture Series, Spring 2020

https://simons.berkeley.edu/events/rmklectures2020-spring-3

In a recent result known as "MIP* = RE," ideas from three disparate fields of study — computational complexity theory, quantum information, and operator algebras — have come together to simultaneously resolve long-standing open problems in each field, including a 44-year old mystery in mathematics known as Connes’ Embedding Problem. In this talk, I will describe the evolution and convergence of ideas behind MIP* = RE: it starts with three landmark discoveries from the 1930s (Turing’s notion of a universal computing machine, the phenomenon of quantum entanglement, and von Neumann’s theory of operators), and ends with some of the most cutting-edge developments from theoretical computer science and quantum computing.

This talk is aimed at a general scientific audience, and will not assume any specialized background in complexity theory, quantum physics, or operator algebras.

Playlist: 6 videos

Playlist: 24 videos

Playlist: 7 videos

Playlist: 9 videos

Jun. 2018

John Martinis, UC Santa Barbara

https://simons.berkeley.edu/talks/john-martinis-06-12-18

Challenges in Quantum Computation

https://simons.berkeley.edu/talks/john-martinis-06-12-18

Challenges in Quantum Computation

This workshop will focus on the problem of inferring structure from neuroscience data, including the following specific themes:

Playlist: 13 videos

May. 2017

David Blei, Columbia University

Computational Challenges in Machine Learning

https://simons.berkeley.edu/talks/david-blei-2017-5-1

Computational Challenges in Machine Learning

https://simons.berkeley.edu/talks/david-blei-2017-5-1

Mar. 2017

Robert Schapire, Microsoft Research

Simons Institute Open Lecture Series

https://simons.berkeley.edu/events/openlectures2017-spring-2

Simons Institute Open Lecture Series

https://simons.berkeley.edu/events/openlectures2017-spring-2

Jan. 2017

Tamara Broderick, MIT

https://simons.berkeley.edu/talks/tamara-broderick-michael-jordan-01-25-2017-1

Foundations of Machine Learning Boot Camp

https://simons.berkeley.edu/talks/tamara-broderick-michael-jordan-01-25-2017-1

Foundations of Machine Learning Boot Camp

Apr. 11 – Apr. 15, 2016

Playlist: 28 videos

Nov. 2015

Eric Sodomka, Facebook

Algorithmic Game Theory and Practice

https://simons.berkeley.edu/talks/eric-sodomka-2015-11-17

Algorithmic Game Theory and Practice

https://simons.berkeley.edu/talks/eric-sodomka-2015-11-17

May. 2015

Dan Boneh, Stanford University

Theoretically Speaking Series

http://simons.berkeley.edu/events/theoretically-speaking-dan-boneh

Theoretically Speaking is produced by the Simons Institute for the Theory of Computing, with sponsorship from the Mathematical Sciences Research Institute (MSRI) and Berkeley City College. These presentations are supported in part by an award from the Simons Foundation.

Theoretically Speaking Series

http://simons.berkeley.edu/events/theoretically-speaking-dan-boneh

Theoretically Speaking is produced by the Simons Institute for the Theory of Computing, with sponsorship from the Mathematical Sciences Research Institute (MSRI) and Berkeley City College. These presentations are supported in part by an award from the Simons Foundation.

May 4 – May 8, 2015

Playlist: 6 videos