Quantum mechanics can reduce the complexity of classical models

M Gu, K Wiesner, E Rieper, V Vedral - Nature communications, 2012 - nature.com
Mathematical models are an essential component of quantitative science. They generate
predictions about the future, based on information available in the present. In the spirit of …

Quantum rate distortion, reverse Shannon theorems, and source-channel separation

N Datta, MH Hsieh, MM Wilde - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
We derive quantum counterparts of two key theorems of classical information theory,
namely, the rate-distortion theorem and the source-channel separation theorem. The rate …

Efficient multi‐qubit quantum data compression

CR Fan, B Lu, XT Feng, WC Gao… - Quantum …, 2021 - Wiley Online Library
Quantum data compression is of great significance to both quantum computation and
quantum communication due to the limited resources for quantum storage. Here in this …

Strongly universal quantum Turing machines and invariance of Kolmogorov complexity

M Muller - IEEE Transactions on Information Theory, 2008 - ieeexplore.ieee.org
We show that there exists a universal quantum Turing machine (UQTM) that can simulate
every other QTM until the other QTM has halted and then halt itself with probability one. This …

Simple construction of quantum universal variable-length source coding

M Hayashi, K Matsumoto - arXiv preprint quant-ph/0209124, 2002 - arxiv.org
We simply construct a quantum universal variable-length source code in which, independent
of information source, both of the average error and the probability that the coding rate is …

Quantum Kolmogorov complexity and the quantum Turing machine

M Mueller - arXiv preprint arXiv:0712.4377, 2007 - arxiv.org
The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity
(QC), and rigorous mathematical proofs of its basic properties. The definition used here is …

Universal approximation of multi-copy states and universal quantum lossless data compression

M Hayashi - Communications in Mathematical Physics, 2010 - Springer
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 …

Lossless quantum data compression with exponential penalization: an operational interpretation of the quantum Rényi entropy

G Bellomo, GM Bosyk, F Holik, S Zozor - Scientific Reports, 2017 - nature.com
Based on the problem of quantum data compression in a lossless way, we present here an
operational interpretation for the family of quantum Rényi entropies. In order to do this, we …

Second quantised information distance

S Dai - IET Quantum Communication, 2023 - Wiley Online Library
The Kolmogorov complexity of a string is the minimum length of a programme that can
produce that string. Information distance between two strings based on Kolmogorov …

Second quantized Kolmogorov complexity

C Rogers, V Vedral, R Nagarajan - International Journal of Quantum …, 2008 - World Scientific
The Kolmogorov complexity of a string is the length of its shortest description. We define a
second quantized Kolmogorov complexity where the length of a description is defined to be …