Quantum Commitments and Black Hole Radiation Decoding

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,800
Published on ● Video Link: https://www.youtube.com/watch?v=4jcj9WfVQiM


Duration: 1:00:09
423 views
11

Fermi Ma (UC Berkeley)
https://simons.berkeley.edu/talks/fermi-ma-uc-berkeley-2023-07-13
Quantum Summer Cluster Workshop

Recently, Zvika Brakerski proved an equivalence between the existence of quantum cryptography and the hardness of the black-hole radiation decoding problem of Harlow and Hayden. In this talk, I’ll give a new perspective on this equivalence, based on a reformulation of the radiation decoding problem as a distinguishing game. I’ll show that this distinguishing game precisely captures the security of a quantum commitment to one half of an EPR pair; this turns out to be necessary and sufficient for commitment-based quantum cryptography.

No prior knowledge of quantum commitments or black hole physics required. This talk will be mostly non-technical.

(Based on discussions with Sam Gunn and Alex Lombardi)



Other Videos By Simons Institute for the Theory of Computing


2023-07-20Survey on Privacy/Security in FL
2023-07-20Session #1
2023-07-19Keynote
2023-07-19Another Round Of Breaking and Making Quantum Money: How to Not Build It From Lattices and More
2023-07-19Applications of Bit Commitments in a Quantum World
2023-07-19Pseudorandomness: From Quantum States to Binary Strings
2023-07-19Introduction to Quantum Cryptography Without One-Way Functions
2023-07-15Approaching the Quantum Singleton Bound with Approximate Error Correction
2023-07-14Improved Machine Learning Algorithm for Predicting Ground State Properties
2023-07-14Learning Beyond Stabilizer States
2023-07-14Quantum Commitments and Black Hole Radiation Decoding
2023-07-14Geometry, Entropy and Complexity in Quantum Gravity (Part II)
2023-07-14Geometry, Entropy and Complexity in Quantum Gravity (Part I)
2023-07-13Dissipative State Preparation and the Dissipative Quantum Eigensolver
2023-07-13QMA and the Power of “Positivity”
2023-07-13Compiled Nonlocal Games: From CHSH to BQP Verification
2023-07-12Making the Leap to Quantum PCPs
2023-07-12How Simulating Balls and Springs Captures the Power of Quantum Computing
2023-07-12Quantum Algorithms for Approximating Partition Functions
2023-07-12Quantum Gibbs Sampling
2023-07-11Quantum Advantage with Shallow Clifford Circuits


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Quantum Summer Cluster Workshop
Fermi Ma