Unlocking Quantum State Commitments: Insights from Fermi Ma's Princeton Lecture ๐Ÿ”

Explore how minimal complexity assumptions can enhance cryptographic protocols in quantum computing, presented by Fermi Ma from Princeton University.

Unlocking Quantum State Commitments: Insights from Fermi Ma's Princeton Lecture ๐Ÿ”
Simons Institute for the Theory of Computing
591 views โ€ข May 6, 2023
Unlocking Quantum State Commitments: Insights from Fermi Ma's Princeton Lecture ๐Ÿ”

About this video

Fermi Ma (Princeton University)
https://simons.berkeley.edu/talks/fermi-ma-princeton-university-2023-05-05
Minimal Complexity Assumptions for Cryptography

What does it mean to commit to a quantum state? In this talk, I will present a simple, but perhaps counterintuitive answer: a quantum state commitment (QSC) is binding if sending the commitment erases the committed message from the senderโ€™s view. Using this new definition, I will show how to construct the first succinct QSCs, which can be seen as an analog of collision-resistant hashing for quantum messages.

Commitments to quantum states open the door to many new cryptographic possibilities. Our flagship application is a quantum-communication version of Kilian's succinct arguments for any language that has quantum PCPs with constant error and polylogarithmic locality. Plugging in the PCP theorem, this yields succinct arguments for NP under significantly weaker assumptions than required classically; moreover, if the quantum PCP conjecture holds, this extends to QMA. At the heart of our security proof is a new rewinding technique for extracting quantum information.

Joint work with Sam Gunn, Nathan Ju, and Mark Zhandry.
https://eprint.iacr.org/2022/1358.pdf

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

591

Likes

6

Duration

48:16

Published

May 6, 2023

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.