相关论文: Asymptotic Redundancies for Universal Quantum Codi…
Current performance bounds for randomized iterative methods are often considered tight under per-iteration analyses, yet they are notoriously loose in practice. We derive asymptotic performance bounds that narrow this theory-practice gap,…
In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on…
In this paper, we analyze the asymptotics of the normalized remaining uncertainty of a source when a compressed or hashed version of it and correlated side-information is observed. For this system, commonly known as Slepian-Wolf source…
We present a technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit, as opposite to reaching a normal form in a finite number of steps. Asymptotic termination occurs in several settings,…
In [Temme N.M., Special functions. An introduction to the classical functions of mathematical physics, A Wiley-Interscience Publication, John Wiley & Sons, Inc., New York, 1996, Section 11.3.3.1] a uniform asymptotic expansion for the…
We derive convenient uniform concentration bounds and finite sample multivariate normal approximation results for quadratic forms, then describe some applications involving variance components estimation in linear random-effects models.…
Answering a question of Clark and Ehrenborg (2010), we determine asymptotics for the number of permutations of size n that admit the most common excedance set. In fact, we provide a more general bivariate asymptotic using the multivariate…
Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum R\'enyi entropies. In order to do this, we appeal to a very general quantum encoding scheme that…
Universal compression of patterns of sequences generated by independently identically distributed (i.i.d.) sources with unknown, possibly large, alphabets is investigated. A pattern is a sequence of indices that contains all consecutive…
We establish some asymptotic expansions for infinite weighted convolutions of distributions having light subexponential tails. Examples are presented, some showing that in order to obtain an expansion with two significant terms, one needs…
We consider symmetric hypothesis testing in quantum statistics, where the hypotheses are density operators on a finite-dimensional complex Hilbert space, representing states of a finite quantum system. We prove a lower bound on the…
We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…
Quantum neural networks (QNNs) provide expressive probabilistic models by leveraging quantum superposition and entanglement, yet their practical training remains challenging due to highly oscillatory loss landscapes and noise inherent to…
We obtain structural theorems for the so-called S-asymptotic and quasiasymptotic boundedness of ultradistributions. Using these results, we then analyze the moment asymptotic expansion (MAE), providing a full characterization of those…
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a…
We report on recent results of the authors concerning calculations of quantum invariants of Seifert 3-manifolds. These results include a derivation of the Reshetikhin-Turaev invariants of all oriented Seifert manifolds associated with an…
The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…
We study the distribution of the order of a random permutation of $[n]$ through the lens of R\'enyi entropy. In particular, we obtain an asymptotic for the R\'enyi $q$-entropy of the order in the full range $1 \leq q \leq \infty$. For $q >…
The well-known Heisenberg--Robertson uncertainty relation for a pair of noncommuting observables, is expressed in terms of the product of variances and the commutator among the operators, computed for the quantum state of a system.…
The ultimate limits of quantum state discrimination are often thought to be captured by asymptotic bounds that restrict the achievable error probabilities, notably the quantum Chernoff and Hoeffding bounds. Here we study hypothesis testing…