The authors construct proofs of quantumness whose soundness is unconditional against memory-bounded classical adversaries, using Raz's parity-learning lower bound and bounded-storage interactive hashing.
Constructive post-quantum reductions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
How to Verify that a Small Device is Quantum, Unconditionally
The authors construct proofs of quantumness whose soundness is unconditional against memory-bounded classical adversaries, using Raz's parity-learning lower bound and bounded-storage interactive hashing.