I'm excited to share two GPT-fuelled results from this month! The first, with Aparna Gupte, shows under a plausible number-theoretic conjecture that there exists s-server private information retrieval for database size n with communication exp(\tilde{O}((log n)^{1/s})). (1/3)
I'm happy to see the unclonable encryption problem solved; Prabhanjan Ananth and Amit Sahai report their findings, with the help of the UCLA harness (link below). This was a challenge for the quantum crypto community for the last 6 years.
In some sense, we only had one bullet in the gun, and that was the monogamy of entanglement analysis of Tomamichel, Fehr, Kaniewski, and Wehner (https://t.co/V7l5ddizlR). ChatGPT, apparently found a different way of analyzing unclonable encryption that did not reduce to TFKW.
Foxconn Quantum Seminar | Jul 24, 2026 10:00 Taipei / Jul 23 22:00 ET / 19:00 PT
Leo Orshansky (Columbia)
How To Track Qubits Through Space and Time (Or: Sailing in a Quantum Boat)
Join online: https://t.co/xc6YhzAH43
Paper: https://t.co/JsgEp6frFp
#Foxconn#QuantumComputing
Is there a way to distinguish between whether somebody is traveling between points in space time, or there are just identical, stationary clones at each of those points? The talented Leo Orshansky will explain how! (Hint: use quantum information)
Foxconn Quantum Seminar | Jul 10, 2026 16:00 Taipei / Jul 10 04:00 ET / 01:00 PT
Leo Orshansky (Columbia)
How To Track Qubits Through Space and Time (Or: Sailing in a Quantum Boat)
Join online: https://t.co/rsyuTHbHv7
Paper: https://t.co/JsgEp6frFp
#Foxconn#QuantumComputing