Towards Data Science

Qdrant TurboQuant Explained: Is TurboQuant the Silver Bullet?

Most engineers see quantization as shrinking vectors. TurboQuant asks a harder question: can you shrink them without breaking their geometry?

arXiv AI
Oct 1

ShamAN-Q: Shampoo Augmented NanoQuant for Sub-1-bit LLM Weights

ShamAN-Q is a sub‑1‑bit post‑training quantization technique that builds on NanoQuant by replacing its diagonal reconstruction geometry with a dense curvature metric inspired by the Shampoo optimizer. For each linear weight, it fits a Kronecker product to the empirical Fisher information matrix of a small calibration set via Kullback–Leibler minimization, yielding a Mahalanobis reconstruction loss. The method updates continuous ADMM steps to Sylvester equations while keeping the discrete projection and deployment format unchanged, and it redistributes uniform rank across layers, achieving lower perplexity on Qwen3‑Base at roughly 1 bpw and matching or improving zero‑shot accuracy on the Eleuther LM Evaluation Harness.

By Jonathan Mei, Sang Hyub Kim, Oliver Knitter, Chi Chen, Martin Roetteler
arXiv AI
Oct 2

Exponential quantum advantage in processing massive classical data

The paper demonstrates that a small quantum computer of polylogarithmic size can achieve large‑scale classification and dimension reduction on massive classical data, while any classical machine achieving the same performance would need exponentially larger size. It shows that classical machines even if exponentially larger still require superpolynomially more samples and time. The authors provide evidence from real‑world applications such as single‑cell RNA sequencing and movie review sentiment analysis, achieving four to six orders of magnitude reduction in size with fewer than 60 logical qubits.

By Haimeng Zhao, Alexander Zlokapa, Hartmut Neven, Ryan Babbush, John Preskill, Jarrod R. McClean, Hsin-Yuan Huang