Главная
Study mode:
on
1
Intro
2
Testing Quantum Computers
3
Verification through Interactive Proofs
4
Verification with Post Quantum Cryptography
5
Talk Outline
6
Standard Basis Measurements
7
How to create a superposition over a claw
8
Test for Quantumness
9
Trapdoor Claw-free Functions in Quantum Computing
10
Trapdoor Claw-free Functions in Verification
11
TCF Construction from LWE
12
Classical Commitment to a Quantum State
13
Linking the Commitment Protocol to Verifiability
14
Verifying Quantum Computations
15
How to Commit using a TCF
16
Classical Commitment to Quantum States
17
Delegating Hadamard Basis Measurements
18
Commitment Protocol So Far
19
Enforcing Structure with Cryptography
20
The Pauli Twirl in Interactive Proofs
21
The Computational Pauli Twirl
22
Conclusion
Description:
Explore a comprehensive lecture on quantum computing verification and cryptography delivered by Urmila Mahadev from Microsoft Research at the Quantum Wave in Computing Boot Camp. Delve into the concept of classical commitment to quantum states and its implications for verifying quantum computations. Learn about testing quantum computers, interactive proofs, and post-quantum cryptography. Examine the role of trapdoor claw-free functions in quantum computing and verification, including their construction from Learning With Errors (LWE). Discover how to create superpositions, test for quantumness, and implement classical commitment protocols for quantum states. Investigate the process of delegating Hadamard basis measurements and enforcing structure with cryptography. Gain insights into the Pauli twirl in interactive proofs and its computational counterpart. This 56-minute talk provides a deep dive into cutting-edge research at the intersection of quantum computing and cryptography.

Classical Commitment to Quantum States

Simons Institute
Add to list