The interplay between modern quantum cryptography and quantum physics

by Or Sattath

BGU, Department of Computer Science

at Physics Colloquium

Tue, 06 May 2025, 12:00
Ilse Katz Institute for Nanoscale Science & Technology (51), room 015

Abstract

Our understanding of the foundations of (quantum) cryptography has changed in the past couple of years.
Arguably, the most important problem in computer science, the P vs. NP problem (which I will explain in the talk), restricts our ability to prove the security of modern cryptographic schemes: If P=NP, there can't be any classical cryptography, such as encryption, digital signatures, commitments and much more.
Recently, it has been shown that quantum cryptography can exist even if P=NP.
In this talk, I will focus on these recent advancements, focusing on two surprising relations that may be of special interest to physicists:
* Pseudorandom states were used in the context of AdS/CFT to argue that the dictionary map is exponentially complex.
* Pseudo-entangled states demonstrate that entanglement entropy cannot be measured, even approximately.

*** Refreshments at 12:00, talk at 12:15.

Created on 06-03-2025 by Kats, Yevgeny (katsye)
Updaded on 28-04-2025 by Kats, Yevgeny (katsye)