Menu
Sign In Search Podcasts Libraries Charts People & Topics Add Podcast API Blog Pricing

Ryan Peterman

๐Ÿ‘ค Speaker
2230 total appearances

Appearances Over Time

Podcast Appearances

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

are few.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

We don't know many, so we know this.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

I mentioned the factor in discrete log.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

In the 90s, Aytai and Dwork created another type of step or function from problems on lattices in high dimensions.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

I will not describe it, but it's another problem that people refined and got a few more of similar nature.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

And it turned out when Peter Shaw discovered this, people immediately tried to solve other problems with quantum computers.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

In fact, even today we cannot solve too many other problems with quantum computers.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

These are special.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

The special thing about them is that somehow you can reduce them to

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

finding periods in a signal, and periods is like Fourier transform.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

A Fourier transform turns out to be in exponential space, but Fourier transform you can do somehow with quantum computers with interference.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

The lattice problems and problems related to it, some called learning with arrows and similar, to this day nobody found an efficient quantum algorithm for them.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

So there's no even theory.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

Forget building random computers.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

We don't know how to solve them.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

And so what the world is not just complexity theory.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

The whole physical world of security systems

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

And also governments like the NSA is supporting or asking the world to produce assumptions that may be resilient to quantum attacks.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

And so this is a huge change.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

This is a major change in the interaction between computer scientists and physicists, which grew tremendously since this discovery.