English
Related papers

Related papers: Asymptotic optimality of scalar Gersho quantizers

200 papers

We say A is a quasi-normal subgroup of the group G if the commensurator of A in G is all of G. We develop geometric versions of commensurators in finitely generated groups. In particular, g is an element of the commensurator of A in G iff…

Group Theory · Mathematics 2009-12-31 Gregory R. Conner , Michael L. Mihalik

We consider the problem of rate/distortion with side information available only at the decoder. For the case of jointly-Gaussian source X and side information Y, and mean-squared error distortion, Wyner proved in 1976 that the…

Information Theory · Computer Science 2007-07-16 Sergio D. Servetto

In device-independent quantum information processing Bell inequalities are not only used as detectors of nonlocality, but also as certificates of relevant quantum properties. In order for these certificates to work, one very often needs…

Quantum Physics · Physics 2019-11-06 Remigiusz Augusiak , Alexia Salavrakos , Jordi Tura , Antonio Acín

We consider the one-bit quantizer that minimizes the mean squared error for a source living in a real Hilbert space. The optimal quantizer is a projection followed by a thresholding operation, and we provide methods for identifying the…

Information Theory · Computer Science 2022-02-14 Sourbh Bhadane , Aaron B. Wagner

We define an asymptotic symmetry algebra for three-dimensional Goedel spacetimes supported by a gauge field which turns out to be the semi-direct sum of the diffeomorphisms on the circle with two loop algebras. A class of fields admitting…

High Energy Physics - Theory · Physics 2010-10-27 Geoffrey Compere , Stephane Detournay

Subsampling is an efficient method to deal with massive data. In this paper, we investigate the optimal subsampling for linear quantile regression when the covariates are functions. The asymptotic distribution of the subsampling estimator…

Numerical Analysis · Mathematics 2022-05-06 Qian Yan , Hanyu Li , Chengmei Niu

We consider N-tensor powers of a positive Hermitian line bundle L over a non-compact complex manifold X. In the compact case, B. Shiffman and S. Zelditch proved that the zeros of random sections become asymptotically uniformly distributed…

Complex Variables · Mathematics 2012-10-23 Tien-Cuong Dinh , George Marinescu , Viktoria Schmidt

The main aim of this short paper is to advertize the Koosis theorem in the mathematical community, especially among those who study orthogonal polynomials. We (try to) do this by proving a new theorem about asymptotics of orthogonal…

Mathematical Physics · Physics 2007-05-23 F. Nazarov , A. Volberg , P. Yuditskii

We demonstrate that it is possible to construct operators that stabilize the constraint-satisfying subspaces of computational problems in their Ising representations. We provide an explicit recipe to construct unitaries and associated…

We generalize the notions of asymptotic dimension and coarse embeddings from metric spaces to quantum metric spaces in the sense of Kuperberg and Weaver. We show that quantum asymptotic dimension behaves well with respect to metric…

Operator Algebras · Mathematics 2020-06-08 Javier Alejandro Chávez-Domínguez , Andrew T. Swift

A non trace-preserving map describing a probabilistic but heralded noiseless linear amplifier has recently been proposed and experimentally demonstrated. Here, we exhibit another remarkable feature of this peculiar transformation, namely…

Quantum Physics · Physics 2013-01-29 C. N. Gagatsos , E. Karpov , N. J. Cerf

Geometrically local quantum codes, which are error correction codes embedded in $\mathbb{R}^D$ with checks acting only on qubits within a fixed spatial distance, have garnered significant interest. Recently, it has been demonstrated how to…

Quantum Physics · Physics 2025-07-04 Quinten Eggerickx , Adam Wills , Ting-Chun Lin , Kristiaan De Greve , Min-Hsiu Hsieh

In this paper we revisit the exsistence theorem for $L^r$-optimal quantization, $r\ge 2$, with respect to a Bregman divergence: we establish the existence of optimal quantizaers under lighter assumptions onthe strictly convex function which…

Probability · Mathematics 2025-06-03 Guillaume Boutoille , Gilles Pagès

We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem…

Quantum Physics · Physics 2007-07-13 Salah A. Aly , Andreas Klappenecker , Pradeep Kiran Sarvepalli

We study asymptotic distribution of zeros of random holomorphic sections of high powers of positive line bundles defined over projective homogenous manifolds. We work with a wide class of distributions that includes real and complex…

Complex Variables · Mathematics 2026-05-22 Turgay Bayraktar

Many sparse linear discriminant analysis (LDA) methods have been proposed to overcome the major problems of the classic LDA in high-dimensional settings. However, the asymptotic optimality results are limited to the case that there are only…

Statistics Theory · Mathematics 2015-08-06 Ruiyan Luo , Xin Qi

We provide the conditions for complete asymptotic freedom for chiral gauge theories including scalars, as motivated by grand unified models. These are generalised Georgi-Glashow and Bars-Yankielowicz theories that feature a scalar field…

High Energy Physics - Theory · Physics 2026-05-12 Giacomo Cacciapaglia , Francesco Sannino , Sophie Wagner

An analog communication channel typically achieves its full capacity when the distribution of inputs is discrete, composed of just K symbols, such as voltage levels or wavelengths. As the effective noise level goes to zero, for example by…

Statistical Mechanics · Physics 2019-05-07 Michael C. Abbott , Benjamin B. Machta

Asymptotic optimality is a key theoretical property in model averaging. Due to technical difficulties, existing studies rely on restricted weight sets or the assumption that there is no true model with fixed dimensions in the candidate set.…

Statistics Theory · Mathematics 2024-11-15 Wenchao Xu , Xinyu Zhang

It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their…

Information Theory · Computer Science 2015-08-21 Gerardo Vega