English
Related papers

Related papers: Asymptotic Redundancies for Universal Quantum Codi…

200 papers

We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…

Information Theory · Computer Science 2018-12-13 Eimear Byrne , Alberto Ravagnani

The theory of local asymptotic normality for quantum statistical experiments is developed in the spirit of the classical result from mathematical statistics due to Le Cam. Roughly speaking, local asymptotic normality means that the family…

Quantum Physics · Physics 2012-11-27 Madalin Guta , Anna Jencova

We study the variance and the Laplace transform of the probability law of linear eigenvalue statistics of unitary invariant Matrix Models of n-dimentional Hermitian matrices as n tends to infinity. Assuming that the test function of…

Probability · Mathematics 2015-06-26 L. Pastur

Suppose that a quantum source is known to have von Neumann entropy less than or equal to S but is otherwise completely unspecified. We describe a method of universal quantum data compression which will faithfully compress the quantum…

Quantum Physics · Physics 2009-10-31 Richard Jozsa , Michal Horodecki , Pawel Horodecki , Ryszard Horodecki

We analyze renormalization group (RG) flows in two-dimensional quantum field theories in the presence of redundant directions. We use the operator picture in which redundant operators are total derivatives. Our analysis has three levels of…

High Energy Physics - Theory · Physics 2014-02-17 Nicolas Behr , Anatoly Konechny

This paper describes universal lossless coding strategies for compressing sources on countably infinite alphabets. Classes of memoryless sources defined by an envelope condition on the marginal distribution provide benchmarks for coding…

Statistics Theory · Mathematics 2015-01-05 Stéphane Boucheron , Aurélien Garivier , Elisabeth Gassiat

The redundancy for universal lossless compression of discrete memoryless sources in Campbell's setting is characterized as a minimax R\'enyi divergence, which is shown to be equal to the maximal $\alpha$-mutual information via a generalized…

Information Theory · Computer Science 2019-03-12 Semih Yagli , Yücel Altuğ , Sergio Verdú

Wu and Verd\'u developed a theory of almost lossless analog compression, where one imposes various regularity conditions on the compressor and the decompressor with the input signal being modelled by a (typically infinite-entropy)…

Dynamical Systems · Mathematics 2022-12-29 Yonatan Gutman , Adam Śpiewak

We study the properties of the random quantum states induced from the uniformly random pure states on a bipartite quantum system by taking the partial trace over the larger subsystem. Most of the previous studies have adopted a viewpoint of…

Quantum Physics · Physics 2023-11-29 Eyuri Wakakuwa

In the problem of asymptotic binary i.i.d. state discrimination, the optimal asymptotics of the type I and the type II error probabilities is in general an exponential decrease to zero as a function of the number of samples; the set of…

Quantum Physics · Physics 2023-01-18 Gergely Bunth , Gábor Maróti , Milán Mosonyi , Zoltán Zimborás

We prove the two-dimensional analogue of the asymptotics for Toeplitz determinants with Fisher-Hartwig singularities, for general real symbols. This formula has applications to random normal matrices with complex spectra: (i) the…

Probability · Mathematics 2026-01-13 Paul Bourgade , Guillaume Dubach , Lisa Hartung , Ahmet Keles

An understanding of quantum theory in terms of new, underlying descriptions capable of explaining the existence of non-classical correlations, non-commutativity of measurements and other unique and counter-intuitive phenomena remains still…

Quantum Physics · Physics 2025-05-12 Yasmin Navarrete , Sergio Davis

In quantum information geometry, the curvature of von-Neumann entropy and relative entropy induce a natural metric on the space of mixed quantum states. Here we use this information metric to construct a random matrix ensemble for states…

Quantum Physics · Physics 2026-01-26 Harry J. D. Miller

We investigate how quantum coherence can be distributed among the several off-diagonal elements of an arbitrary density matrix. An easily computable quantity that captures this variability notion is proposed and it is argued that it…

Quantum Physics · Physics 2026-04-24 Fernando Parisio

A new technique towards finding asymptotic normalization coefficients in the complex-ranged Gaussian basis is presented. It is shown that a diagonalisation procedure for the total Hamiltonian matrix in the given basis results in…

Nuclear Theory · Physics 2019-10-29 D. A. Sailaubek , O. A. Rubtsova

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…

Information Theory · Computer Science 2016-09-28 Masahito Hayashi , Shun Watanabe

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…

Quantum Physics · Physics 2009-04-30 Michael Nussbaum , Arleta Szkoła

The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…

Probability · Mathematics 2013-10-28 Valentin Féray

We derive an analytical formula for the covariance $\mathrm{Cov}(A,B)$ of two smooth linear statistics $A=\sum_i a(\lambda_i)$ and $B=\sum_i b(\lambda_i)$ to leading order for $N\to\infty$, where $\{\lambda_i\}$ are the $N$ real eigenvalues…

Statistical Mechanics · Physics 2016-03-01 Fabio Deelan Cunden , Pierpaolo Vivo

The problem of joint detection and lossless source coding is considered. We derive asymptotically optimal decision rules for deciding whether or not a sequence of observations has emerged from a desired information source, and to compress…

Information Theory · Computer Science 2016-11-17 Neri Merhav