Related papers: On the reversible extraction of classical informat…
The causal structure of a stochastic process can be more efficiently transmitted via a quantum channel than a classical one, an advantage that increases with codeword length. While previously difficult to compute, we express the quantum…
The widely considered assertion is that the unitarity of quantum mechanical evolution assures the preservation of information. It is even promoted in popular literature as an established fact. (Susskind, 2008) Yet, a simple chain of…
Qubit readout is commonly performed by thresholding a collection of analog detector signals to obtain a sequence of single-shot bit values. The intrinsic irreversibility of the mapping from analog to digital signals discards soft…
The task of compressing classical information in the one-shot scenario is studied in the setting where the decompressor additionally has access to some given quantum side information. In this hybrid classical-quantum version of the famous…
By looking at quantum data compression in the second quantisation, we present a new model for the efficient generation and use of variable length codes. In this picture lossless data compression can be seen as the {\em minimum energy}…
Given an unknown quantum state distributed over two systems, we determine how much quantum communication is needed to transfer the full state to one system. This communication measures the "partial information" one system needs conditioned…
A classical coding across a block of logical qubits is presented. We characterize subgroups of the product stabilizer group on a block of logical qubits corresponding to dual codes of classical error correcting codes. We prove conditions on…
Machine learning tasks are an exciting application for quantum computers, as it has been proven that they can learn certain problems more efficiently than classical ones. Applying quantum machine learning algorithms to classical data can…
A new measure of information leakage for quantum encoding of classical data is defined. An adversary can access a single copy of the state of a quantum system that encodes some classical data and is interested in correctly guessing a…
The possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this…
A generic approach for compiling any classical block compression algorithm into a quantum block compression algorithm is presented. Using this technique, compression asymptoticaly approaching the von Neumann entropy of a qubit source can be…
In this paper we discuss the problem of splitting the total correlations for a bipartite quantum state described by the Von Neumann mutual information into classical and quantum parts. We propose a measure of the classical correlations as…
Random classical linear codes are widely believed to be hard to decode. While slightly sub-exponential time algorithms exist when the coding rate vanishes sufficiently rapidly, all known algorithms at constant rate require exponential time.…
Given a finite number of copies of an unknown qubit state that have already been measured optimally, can one still extract any information about the original unknown state? We give a positive answer to this question and quantify the…
We show that quantum-to-classical channels, i.e., quantum measurements, can be asymptotically simulated by an amount of classical communication equal to the quantum mutual information of the measurement, if sufficient shared randomness is…
Resource identification and quantification is an essential element of both classical and quantum information theory. Entanglement is one of these resources, arising when quantum communication and nonlocal operations are expensive to…
We consider the possibility of encoding m classical bits into much fewer n quantum bits so that an arbitrary bit from the original m bits can be recovered with a good probability, and we show that non-trivial quantum encodings exist that…
One of the most important properties of quantum information, and the one ultimately responsible for its cryptographic applications, is that it can't be copied. That statement, however, is not completely accurate. While the no-cloning…
When a measurement is made on a quantum system in which classical information is encoded, the measurement reduces the observers average Shannon entropy for the encoding ensemble. This reduction, being the {\em mutual information}, is always…
This work introduces the Schmidt quantum compressor, an innovative approach to quantum data compression that leverages the principles of Schmidt decomposition to encode quantum information efficiently. In contrast to traditional variational…