English
Related papers

Related papers: Universal Compression of Ergodic Quantum Sources

200 papers

This paper is a continuation of Poiret-Robert-Thomann (2013) where we studied a randomisation method based on the Laplacian with harmonic potential. Here we extend our previous results to the case of any polynomial and confining potential…

Analysis of PDEs · Mathematics 2015-06-18 Didier Robert , Laurent Thomann

B. Schumacher and M. Westmoreland have established a quantum analog of a well-known classical information theory result on a role of relative entropy as a measure of non-optimality in (classical) data compression. In this paper, we provide…

Quantum Physics · Physics 2008-08-08 Alexei Kaltchenko

It is shown that an i.i.d. binary source sequence $X_1, \ldots, X_n$ can be losslessly compressed at any rate above entropy such that the individual decoding of any $X_i$ reveals \emph{no} information about the other bits $\{X_j : j \neq…

Information Theory · Computer Science 2025-11-19 Venkat Chandar , Aslan Tchamkerten , Shashank Vatedka

The general stable quantum memory unit is a hybrid consisting of a classical digit with a quantum digit (qudit) assigned to each classical state. The shape of the memory is the vector of sizes of these qudits, which may differ. We determine…

Quantum Physics · Physics 2019-09-16 Greg Kuperberg

As it is known, universal codes, which estimate the entropy rate consistently, exist for stationary ergodic sources over finite alphabets but not over countably infinite ones. We generalize universal coding as the problem of universal…

Information Theory · Computer Science 2023-08-01 Łukasz Dębowski

Based on the concept of many-letter theory, an observable is defined measuring the raw quantum information content of single messages. A general characterization of quantum codes using the Kraus representation is given. Compression codes…

Quantum Physics · Physics 2007-05-23 Kim J. Bostroem

We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asymptotical fundamental limits of the problem - the minimal…

Information Theory · Computer Science 2014-05-13 Fabian Steiner , Steffen Dempfle , Amir Ingber , Tsachy Weissman

This short note proves that a Laplacian cannot be quantum uniquely ergodic if it possesses a quasimode of order zero which (i) has a singular limit, and (ii) is a linear combination of a uniformly bounded number of eigenfunctions (modulo an…

Mathematical Physics · Physics 2011-11-10 Steve Zelditch

We introduce a model of non-unitary quantum dynamics that exhibits infinitely long-lived discrete spatiotemporal order robust against any unitary or dissipative perturbation. Ergodicity is evaded by combining a sequence of projective…

Quantum Physics · Physics 2022-08-31 Max McGinley , Sthitadhi Roy , S. A. Parameswaran

We report an experimental demonstration of Schumacher's quantum noiseless coding theorem. Our experiment employs a sequence of single photons each of which represents three qubits. We initially prepare each photon in one of a set of 8…

Quantum Physics · Physics 2009-11-10 Y. Mitsumori , J. A. Vaccaro , S. M. Barnett , E. Andersson , A. Hasegawa , M. Takeoka , M. Sasaki

In this paper, we consider the one-shot version of the classical Wyner-Ziv problem where a source is compressed in a lossy fashion when only the decoder has access to a correlated side information. Following the entropy-constrained…

Information Theory · Computer Science 2024-05-06 Oğuzhan Kubilay Ülger , Elza Erkip

By employing at recent proposal (R. Filip, P. Marek and U.L. Andersen, Phys. Rev. A {\bf 71}, 042308 (2005) \cite{Filip05.pra}), we experimentally demonstrate a universal, deterministic and high-fidelity squeezing transformation of an…

We discuss the quantitative ergodicity of quantum Markov semigroups in terms of the trace distance from the stationary state, providing a general criterion based on the spectral decomposition of the Lindblad generator. We then apply this…

Mathematical Physics · Physics 2024-02-06 Lorenzo Bertini , Alberto De Sole , Gustavo Posta

We consider the problem of joint universal variable-rate lossy coding and identification for parametric classes of stationary $\beta$-mixing sources with general (Polish) alphabets. Compression performance is measured in terms of…

Information Theory · Computer Science 2016-11-15 Maxim Raginsky

We prove that quantum expander codes can be combined with quantum fault-tolerance techniques to achieve constant overhead: the ratio between the total number of physical qubits required for a quantum computation with faulty hardware and the…

Quantum Physics · Physics 2022-07-13 Omar Fawzi , Antoine Grospellier , Anthony Leverrier

We demonstrate the onset of strong on-site localization in a one-dimensional many-particle system. The localization is obtained by constructing, in an explicit form, a bounded sequence of on-site energies that eliminates resonant hopping…

Quantum Physics · Physics 2009-11-10 L. F. Santos , M. I. Dykman , M. Shapiro , F. M. Izrailev

We investigate entropy transport for universal scaling phenomena in closed quantum many-body systems far from equilibrium. From spatially resolved experimental data of a spinor Bose gas, we demonstrate that entropy decreases on…

Quantum Gases · Physics 2025-11-03 J. Marijan , H. Strobel , M. K. Oberthaler , J. Berges

We prove that the quantum relative entropy decreases monotonically under the application of any positive trace-preserving linear map, for underlying separable Hilbert spaces. This answers in the affirmative a natural question that has been…

Quantum Physics · Physics 2017-04-21 Alexander Müller-Hermes , David Reeb

This paper considers the problem of data compression for dependent quantum systems. It is the second in a series under the same title. As in the previous paper, we are interested in Lempel--Ziv encoding for quantum Gibbs ensembles. Here, we…

Mathematical Physics · Physics 2011-11-09 Oliver Johnson , Yuri Suhov

Quantum systems with more than two levels $-$ so-called qudits $-$ offer increased computational density and reduced circuit complexity compared to qubit-based architectures, but achieving universal and scalable control remains challenging.…

Quantum Physics · Physics 2026-05-12 Johannes K. Krondorfer , Matthias Diez , Andreas Kruckenhauser , Andreas W. Hauser
‹ Prev 1 4 5 6 7 8 10 Next ›