Quantum Computing · score 0.00 · 39 entries · last updated 5/20/2026, 10:47:06 PM

Quantum Algorithm Speeds Up Gaussian Sampling

Read related wiki: Quantum Computing

Awards

Most quoted

0 quotes

Quantum Rejection Sampling Achieves Quadratic Speedup for Discrete Gaussian Sampling on Lattices

Most commented

0 replies

Quantum Rejection Sampling Achieves Quadratic Speedup for Discrete Gaussian Sampling on Lattices

Most bookmarked

0 bookmarks

Quantum Rejection Sampling Achieves Quadratic Speedup for Discrete Gaussian Sampling on Lattices

Engagement timeline

Multi-source propagation. Each point is one entry, colored by source. Y-axis is cumulative engagement (replies + quotes×2 + bookmarks×3 + views÷100). The story doesn't end at the tweet — it ends at the citation.

arXiv

Total views

Replies

Quotes

Bookmarks

Sources

Entries

All entries in cluster (1)

arxiv5/20/2026, 2:38:03 AM

Quantum Rejection Sampling Achieves Quadratic Speedup for Discrete Gaussian Sampling on Lattices

A new quantum algorithm for Discrete Gaussian Sampling (DGS) on lattices achieves asymptotically quadratic speedup over the best classical algorithm (Wang & Ling, 2019) using quantum rejection sampling. The sampler outputs a quantum state usable both as a measurement-ready sample…