2 citations · 3 across the 7 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
quant-ph2024★ 2 cited
On the Equivalence between Classical Position Verification and Certified Randomness
Fatih Kaleoglu, Minzhao Liu, Kaushik Chakraborty +4
Gate-based quantum computers hold enormous potential to accelerate classically intractable computational tasks. Random circuit sampling (RCS) is the only known task that has been a…
quant-ph2024
Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography
Prabhanjan Ananth, Fatih Kaleoglu, Henry Yuen
Unclonable cryptography is concerned with leveraging the no-cloning principle to build cryptographic primitives that are otherwise impossible to achieve classically. Understanding…