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

verifiable by efficient verifiers if the provers are quantum and they are entangled and whatever.

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

But it's a weird proof system, very weird, but it does something that looks totally ridiculous.

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

Things that are uncomputable by any class of computer are verifiable in this interactive probabilistic sense by efficient verifier.

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

So what I like to say in talking about this is that it seems that the best reaction, the best hypothetical reaction of anybody who hears this

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

Okay, you complexity theorists, you play in your sandbox and you build all these sand casters and make up all these models that have nothing to do with anything just because you can.

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

And once you're weird enough, you get weird enough consequences.

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

So one message, which I think is very powerful,

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

is that this result has absolutely fundamental impact on math and physics.

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

It turns out that it implies, and this was already done in the initial paper,

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

It implies resolution of well-known conjectures in math and physics.

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

It turns out that, you know, weird as it is, it's a new mathematical technique to solve problems that nobody had any idea.

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

Famous problems, important problems that fields were dedicated to are resolved by this result, by the techniques of this result.

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

So you ask the impact of quantum... You see, the impact is...

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

many generations over for different motivations and developments, but all of them following the methodology of complexity theory, of understanding the power of computational models, proof systems, and so on, has magically led to such a consequence.

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

And this is just, we are in the beginning of this.

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

This type of proof technique is now being explored and used, and there are more results using this type of techniques to learn long-standing problems.

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

Pretty amazing.

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

It's a 200-page paper.

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

It builds on 10 years of understanding, which is both a lot of development in the quantum algorithms and quantum proof systems sphere, but also relying on techniques from classical proof systems, which have to do with coding theory and various algebraic stuff that is used to prove, for example, the PCP theorem that I mentioned.

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

It's, you know, it's a huge body of work.