1 citations · 2 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
quant-ph2026
Compressed Oracle Duality: A simple framework for knowing what quantum adversaries know
Matthew Ding, Mark Zhandry
Given a quantum adversary that queries a random oracle, how do we characterize the information that they "know"? The Compressed Oracle method of Zhandry (CRYPTO 2019) is one method…
quant-ph2026
Exponential quantum space advantage in random data streams
Adam Bouland, Matthew Ding, Siddhartha Jain
We show two unconditional quantum space advantages in the random-order streaming model. First, we show the Yamakawa-Zhandry Code Intersection problem admits exponential quantum adv…