English
Related papers

Related papers: Optimality in Quantum Data Compression using Dynam…

200 papers

We present a new data structure called the \emph{Compressed Random Access Memory} (CRAM) that can store a dynamic string $T$ of characters, e.g., representing the memory of a computer, in compressed form while achieving asymptotically…

Data Structures and Algorithms · Computer Science 2015-03-17 Jesper Jansson , Kunihiko Sadakane , Wing-Kin Sung

We generalize recent work of Massar and Popescu dealing with the amount of classical data that is produced by a quantum measurement on a quantum state ensemble. In the previous work it was shown how spurious randomness generally contained…

Quantum Physics · Physics 2009-11-06 A. Winter , S. Massar

It has been shown recently that the framework of quantum sampling, as introduced by Bouman and Fehr, can lead to new entropic uncertainty relations highly applicable to finite-key cryptographic analyses. Here we revisit these so-called…

Quantum Physics · Physics 2020-12-09 Keegan Yao , Walter O. Krawec , Jiadong Zhu

According to quantum mechanics, the informational content of isolated systems does not change in time. However, subadditivity of entropy seems to describe an excess of information when we look at single parts of a composite systems and…

Quantum Physics · Physics 2019-11-12 Marco Roncaglia

We report universal statistical properties displayed by ensembles of pure states that naturally emerge in quantum many-body systems. Specifically, two classes of state ensembles are considered: those formed by i) the temporal trajectory of…

We develop techniques to analyse the statistics of completion times of non-deterministic elements in quantum entanglement generation, and how they affect the overall performance as measured by the secret key rate. By considering such…

Quantum Physics · Physics 2019-04-10 Scott E. Vinay , Pieter Kok

The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state.…

Quantum Physics · Physics 2026-05-15 Ludovico Lami , Bartosz Regula , Ryuji Takagi

We propose the improved decoy state quantum key distribution incorporating finite statistics due to the finite code length and report on its demonstration. In our experiment, four different intensities including the vacuum state for optimal…

Quantum Physics · Physics 2007-05-23 Jun Hasegawa , Masahito Hayashi , Tohya Hiroshima , Akihiro Tanaka , Akihisa Tomita

In this work, we use the theory of quantum states over time to define an entropy $S(\rho,\mathcal{E})$ associated with quantum processes $(\rho,\mathcal{E})$, where $\rho$ is a state and $\mathcal{E}$ is a quantum channel responsible for…

Quantum Physics · Physics 2023-07-24 James Fullwood , Arthur J. Parzygnat

Quantum entanglement plays a crucial role in quantum information, quantum teleportation and quantum computation. The information about the entanglement content between subsystems of the composite system is encoded in the Schmidt…

Statistical Mechanics · Physics 2013-05-07 Santosh Kumar , Akhilesh Pandey

This thesis addresses problems in the field of quantum information theory. The first part of the thesis is opened with concrete definitions of general quantum source models and their compression, and each subsequent chapter addresses the…

Quantum Physics · Physics 2020-12-29 Zahra Baghali Khanian

We investigate a scheme for implementing quantum dense coding via atomic ensembles, where prior distribution of the quantum entangled state is not needed. Our scheme also combines another two distinct advantages: atomic ensembles qubits…

Quantum Physics · Physics 2007-05-23 Zheng-Yuan Xue , Ping Dong , Ming Yang , You-Min Yi , Zhuo-Liang Cao

Compression also known as entropy coding has a rich and long history. However, a recent explosion of multimedia Internet applications (such as teleconferencing and video streaming for instance) renews an interest in fast compression that…

Information Theory · Computer Science 2023-05-10 Josef Pieprzyk , Jarek Duda , Marcin Pawlowski , Seyit Camtepe , Arash Mahboubi , Pawel Morawiecki

Min-entropy sampling gives a bound on the min-entropy of a randomly chosen subset of a string, given a bound on the min-entropy of the whole string. K\"onig and Renner showed a min-entropy sampling theorem that holds relative to quantum…

Quantum Physics · Physics 2011-07-18 Jürg Wullschleger

Emerging quantum algorithms that process data require that classical input data be represented as a quantum state. These data-processing algorithms often follow the gate model of quantum computing--which requires qubits to be initialized to…

Quantum Physics · Physics 2022-11-21 Aviraj Sinha , Elena R. Henderson , Jessie M. Henderson , Mitchell A. Thornton

We consider a quantum state shared between many distant locations, and define a quantum information processing primitive, state merging, that optimally merges the state into one location. As announced in [Horodecki, Oppenheim, Winter,…

Quantum Physics · Physics 2008-06-12 Michal Horodecki , Jonathan Oppenheim , Andreas Winter

The theory of noncommutative dynamical entropy and quantum symbolic dynamics for quantum dynamical systems is analised from the point of view of quantum information theory. Using a general quantum dynamical system as a communication channel…

Quantum Physics · Physics 2009-11-07 Robert Alicki

We have proven that there exists a quantum state approximating any multi-copy state universally when we measure the error by means of the normalized relative entropy. While the qubit case was proven by Krattenthaler and Slater (IEEE Trans.…

Quantum Physics · Physics 2011-06-24 Masahito Hayashi

Computing accessible information for an ensemble of quantum states is a basic problem in quantum information theory. We show that the recently obtained optimality criterion (A.S. Holevo, Lobachevskii J. Math., \textbf{43}:7 (2022),…

Quantum Physics · Physics 2026-01-30 A. S. Holevo , A. V. Utkin

We consider the lossless compression bound of any individual data sequence. If we fit the data by a parametric model, the entropy quantity $nH({\hat \theta}_n)$ obtained by plugging in the maximum likelihood estimate is an underestimate of…

Information Theory · Computer Science 2024-01-23 Lei M Li