Identifies conditions and explicit constructions allowing polynomial-size quantum circuits to implement geometry oracles for pseudorandom textured materials, in contrast to Grover-hard unstructured cases.
Progress in Cryptology – INDOCRYPT 2020, 21st International Conference on Cryptology in India, Banga- lore, India, December 13–16
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
How to make quantum cheese: efficient geometry oracles for exponentially many pseudorandom microstructures
Identifies conditions and explicit constructions allowing polynomial-size quantum circuits to implement geometry oracles for pseudorandom textured materials, in contrast to Grover-hard unstructured cases.