Related papers: On the best lattice quantizers

Consider the integer best approximations of a linear form in $n\ge 2$ real variables. While it is well-known that any tail of this sequence always spans a lattice is sharp for any $n\ge 2$. In this paper, we determine the exact Hausdorff…

Scalar quantization of large language models (LLMs) is fundamentally limited by information-theoretic bounds. While vector quantization (VQ) overcomes these limits by encoding blocks of parameters jointly, practical implementations must…

A genie-aided decoder for finite dimensional lattice codes is considered. The decoder may exhaustively search through all possible scaling factors $\alpha \in \mathbb{R}$. We show that this decoder can achieve lower word error rate (WER)…

This paper partially addresses the problem of characterizing the lengths of vectors in a family of Euclidean lattices that arise from any CM number field. We define a modified quadratic form on these lattices, the weighted norm, that…

We identify a universal structural principle underlying the smoothing of classical divergences: the optimizer of the smoothing problem is a clipped probability vector, independently of the specific divergence. This yields a…

The most scalable proposed methods of simulating lattice fermions on noisy quantum computers employ encodings that eliminate nonlocal operators using a constant factor more qubits and a nontrivial stabilizer group. In this work, we…

Post-training quantization (PTQ) has emerged as a critical technique for efficient deployment of large language models (LLMs). This work proposes NestQuant, a novel PTQ scheme for weights and activations that is based on self-similar nested…

All approaches currently used to study finite baryon density lattice QCD suffer from uncontrolled systematic uncertainties in addition to the well-known sign problem. We formulate and test an algorithm, sign reweighting, that works directly…

Lattice refinement in LQC, its meaning and its necessity are discussed. The r\^ole of lattice refinement for the realisation of a successful inflationary model is explicitly shown. A simple and effective numerical technique to solve the…

We derive by lattice theory a universal quantum certainty relation for arbitrary $M$ observables in $N$-dimensional system, which provides a state-independent maximum lower bound on the direct-sum of the probability vectors in terms of…

Canonical quantization relies on Cartesian, canonical, phase-space coordinates to promote to Hermitian operators, which also become the principal ingredients in the quantum Hamiltonian. While generally appropriate, this procedure can also…

Matrix factorization techniques compute low-rank product approximations of high dimensional data matrices and as a result, are often employed in recommender systems and collaborative filtering applications. However, many algorithms for this…

The factorization norms of the lower-triangular all-ones $n \times n$ matrix, $\gamma_2(M_{count})$ and $\gamma_{F}(M_{count})$, play a central role in differential privacy as they are used to give theoretical justification of the accuracy…

We consider a high dimensional linear regression problem where the goal is to efficiently recover an unknown vector $\beta^*$ from $n$ noisy linear observations $Y=X\beta^*+W \in \mathbb{R}^n$, for known $X \in \mathbb{R}^{n \times p}$ and…

It is expected that the statistical fluctuations of local observables in large quantum systems obey the central limit theorem, and approximate a normal distribution as their size grows. Here, we prove a version of the Berry-Esseen theorem…

Quantization of neural networks has become common practice, driven by the need for efficient implementations of deep neural networks on embedded devices. In this paper, we exploit an oft-overlooked degree of freedom in most networks - for a…

We propose a general numerical method to study the Casimir effect in lattice gauge theories. We illustrate the method by calculating the energy density of zero-point fluctuations around two parallel wires of finite static permittivity in…

Consider a distributed control problem with a communication channel connecting the observer of a linear stochastic system to the controller. The goal of the controller is to minimize a quadratic cost function in the state variables and…

This paper describes a constant-time lattice encoder for the National Institute of Standards and Technology (NIST) recommended post-quantum encryption algorithm: Kyber. The first main contribution of this paper is to refine the analysis of…

A crucial step in the history of General Relativity was Einstein's adoption of the principle of general covariance which demands a coordinate independent formulation for our spacetime theories. General covariance helps us to disentangle a…