Главная
Study mode:
on
1
Intro
2
Classical versus Quantum Computers
3
Verification through Interactive Proofs
4
Relaxations
5
Verification with Post Quantum Cryptography
6
Core Primitive
7
How to Create a Superposition Over a Claw
8
Verification Outline
9
Hadamard and Standard Basis Measurements
10
Measurement Protocol Definition
11
Measurement Protocol Soundness
12
Using the Measurement Protocol for Verification
13
Quantum Analogue of NP
14
Verification with a Quantum Verifier
15
Measurement Protocol Construction
16
Measurement Protocol Testing
17
Delegating Hadamard Basis Measurements
18
Measurement Protocol So Far
19
Delegating Standard Basis Measurements
20
Soundness Intuition: Example of Cheating Prover
21
Hardcore Bit Properties
22
How to Prove Soundness: Measurement Protocol
23
Conclusion
Description:
Explore a comprehensive lecture on the classical verification of quantum computations delivered by Urmila Mahadev from UC Berkeley. Delve into the challenges of quantum computation, comparing classical and quantum computers, and examine verification methods through interactive proofs. Learn about relaxations and verification using post-quantum cryptography, focusing on core primitives and superposition creation. Understand the verification outline, including Hadamard and standard basis measurements, and the measurement protocol definition and soundness. Investigate the quantum analogue of NP and verification with a quantum verifier. Study the measurement protocol construction, testing, and delegation of Hadamard and standard basis measurements. Gain insights into soundness intuition, hardcore bit properties, and the process of proving soundness in the measurement protocol.

Classical Verification of Quantum Computations

Simons Institute
Add to list