Time-space lower bounds for breaking quantum cryptography
Researchers prove near-optimal time-space lower bounds for breaking quantum cryptography in the random oracle model.
2 stories, newest first · one card per story
Researchers prove near-optimal time-space lower bounds for breaking quantum cryptography in the random oracle model.
Researchers give the first succinct argument for QMA in the quantum random oracle model from unstructured hardness.
Today 277 readers · 292 views · 128 reads · all time 167K views