Quantum rejection sampling yields a quadratically faster discrete Gaussian sampler on lattices, enabling two improved versions of quantum dual attacks with trade-offs in speed and memory.
Lecture Notes in Computer Science, vol
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
-
Quantum algorithm for Discrete Gaussian Sampling
Quantum rejection sampling yields a quadratically faster discrete Gaussian sampler on lattices, enabling two improved versions of quantum dual attacks with trade-offs in speed and memory.