Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2101.02277

Preprocessing operations and the reverse compression

Matheus Capela, Fabio Costa

Published Jan 6, 2021• 0 citations
arXivHTMLPDF

Abstract

The task of compression of data -- as stated by the source coding theorem -- is one of the cornerstones of information theory. Data compression usually exploits statistical redundancies in the data according to its prior distribution. Motivated by situations where one does not have access to the statistics of data, but has some information about a transformation that is going to be applied to it, we propose a novel method for data compression called reverse compression. It is defined in such a way that works for both classical and quantum information processes, and furthermore relies exclusively on the channel to be used: all input data leading to indistinguishable outputs is compressed to the same state, regardless of their prior distribution. Moreover, this process can be characterized as a higher order operation within the type of preprocessing. We also consider as an example the application of the method to the classical and quantum erasure channel. The examples suggest that noiseless reverse compression can take place only in trivial cases, although meaningful instances of noisy reverse compression can exist.

DOI
10.48550/arxiv.2101.02277

Related papers

Based on Quantum Entanglement: Non-Local Data Compression

Jincheng Zhang

This paper explores a novel approach to data compression leveraging the principles of quantum entanglement. Traditional data compression methods rely on identifying and eliminating redundancy within data, often achieving limitations in compression ratios. We propose a system that utilizes entangled quantum states to represent data, achieving potentially higher compression rates and, crucially, lossless reconstruction. The core idea involves decomposing data into a set of entangled quantum subsystems. By exploiting the inherent correlations present within entangled states, we can effectively reduce redundancy without losing information. The paper details the mathematical framework underlying this approach, focusing on the key concepts of entanglement, quantum measurement, and the reconstruction process. We outline the theoretical advantages of this method compared to conventional techniques and discuss the challenges associated with its practical implementation. The primary goal is to demonstrate the potential of quantum entanglement for fundamentally transforming data compression, moving beyond the constraints of classical redundancy reduction. ---

•Aug 31, 2026•0 citations

Aspects of Quantum Information Compression for Pure States

Richard Jozsa

Consider a source of pure quantum states with density matrix ρ and von Neumann entropy S . It is known that the quantum information of the source may be faithfully compressed to 5 qubits/signal (asymptotically for long sequences) and that this limit is optimal if we demand high fidelity for long strings of signals. The usual method for achieving this compression, based on the typical subspace of the source, requires knowledge of the density matrix. We describe a new “universal” compression scheme which does not even require knowledge of ρ. More precisely, suppose that the source is known to have von Neumann entropy less than some given bound S 0 but is otherwise completely unspecified. Our method will faithfully compress the quantum information of any such source to S 0 qubits/signal. It is known that S is always less than or equal to the Shannon entropy H of the prior distribution of the source. According to Shannon’s theorem, H provides the limit for compression of classical signals, so one may ask the question: what is the physical origin of the extra compression available in the quantum case compared to the classical case (where the prior probabilities are the same)? One may suggest that this effect is a consequence of possible non-orthogonality of signal states. However we demonstrate that it is possible to make each pair of signal states of a source more parallel (keeping the prior probabilities the same) while increasing the von Neumann entropy. This casts doubt on the conventional wisdom that overlap of quantum states is a measure of their (non-)distinguishability. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Dec 19, 2005•1 citation

On the Distributed Compression of Quantum Information

Charlene Ahn, Andrew C. Doherty, Patrick M. Hayden +1 more

The problem of distributed compression for correlated quantum sources is considered. The classical version of this problem was solved by Slepian and Wolf, who showed that distributed compression could take full advantage of redundancy in the local sources created by the presence of correlations. Here it is shown that, in general, this is not the case for quantum sources, by proving a lower bound on the rate sum for irreducible sources of product states which is stronger than the one given by a naive application of Slepian–Wolf. Nonetheless, strategies taking advantage of correlation do exist for some special classes of quantum sources. For example, Devetak and Winter demonstrated the existence of such a strategy when one of the sources is classical. Optimal nontrivial strategies for a different extreme, sources of Bell states, are presented here. In addition, it is explained how distributed compression is connected to other problems in quantum information theory, including information-disturbance questions, entanglement distillation and quantum error correction.

arXiv:quant-ph/0403042•IEEE Transactions on Information Theory•Sep 29, 2006•31 citations

Quantum Data Compression Based on Quantum Demixing

Jincheng Zhang

This paper explores a novel approach to classical data compression leveraging the principles of quantum demixing and measurement. The core idea is to transform classical data into a quantum state representation and subsequently exploit quantum demixing to effectively eliminate unwanted quantum correlations. This process allows for the selective extraction of information, ultimately leading to a compressed representation. We present a theoretical framework outlining this methodology, focusing on the mathematical underpinnings of the transformation, demixing, and measurement stages. The proposed method offers a potential pathway to achieve high compression ratios by exploiting the unique properties of quantum systems. We demonstrate, through theoretical analysis, the feasibility and potential advantages of this technique compared to conventional classical compression methods. The key elements involve mapping classical data to a quantum state, employing a demixing protocol to reduce redundancy, and finally, measuring the quantum state to recover the compressed information. This work lays the groundwork for future research into practical implementations of quantum data compression. ---

•Sep 2, 2026•0 citations

The decoupling approach to quantum information theory

Frédéric Dupuis

Quantum information theory studies the fundamental limits that physical laws impose on information processing tasks such as data compression and data transmission on noisy channels. This thesis presents general techniques that allow one to solve many fundamental problems of quantum information theory in a unified framework. The central theorem of this thesis proves the existence of a protocol that transmits quantum data that is partially known to the receiver through a single use of an arbitrary noisy quantum channel. In addition to the intrinsic interest of this problem, this theorem has as immediate corollaries several central theorems of quantum information theory. The following chapters use this theorem to prove the existence of new protocols for two other types of quantum channels, namely quantum broadcast channels and quantum channels with side information at the transmitter. These protocols also involve sending quantum information partially known by the receiver with a single use of the channel, and have as corollaries entanglement-assisted and unassisted asymptotic coding theorems. The entanglement-assisted asymptotic versions can, in both cases, be considered as quantum versions of the best coding theorems known for the classical versions of these problems. The last chapter deals with a purely quantum phenomenon called locking. We demonstrate that it is possible to encode a classical message into a quantum state such that, by removing a subsystem of logarithmic size with respect to its total size, no measurement can have significant correlations with the message. The message is therefore "locked" by a logarithmic-size key. This thesis presents the first locking protocol for which the success criterion is that the trace distance between the joint distribution of the message and the measurement result and the product of their marginals be sufficiently small.

arXiv:1004.1641•Apr 9, 2010•133 citations

Quantum Rate-Distortion Coding of Relevant Information

Sina Salek, Daniela Cadamuro, Philipp Kammerlander +1 more

Rate-distortion theory provides bounds for compressing data produced by an information source to a specified encoding rate that is strictly less than the source's entropy. This necessarily entails some loss, or distortion, between the original source data and the best approximation after decompression. The so-called Information Bottleneck Method is designed to compress only “relevant” information. Which information is relevant is determined by the correlation between the data being compressed and a variable of interest, so-called side information. In this paper, an Information Bottleneck Method is introduced for the compression of quantum data. The channel communication picture is used for compression and decompression. The rate of compression is derived using an entanglement-assisted protocol with classical communication, and under an unproved conjecture that the rate function is convex in the distortion parameter. The optimum channel achieving this rate for a given input state is characterized. The conceptual difficulties arising due to differences in the mathematical formalism between quantum and classical probability theory are discussed and solutions are presented.

arXiv:1704.02903•IEEE Transactions on Information Theory•Oct 30, 2018•23 citations
The task of compression of data -- as stated by the source coding theorem -- is one of the cornerstones of information theory. Data compression usually exploits statistical redundancies in the data according to its prior distribution. Motivated by situations where one does not have access to the statistics of data, but has some information about a transformation that is going to be applied to it, we propose a novel method for data compression called reverse compression. It is defined in such a way that works for both classical and quantum information processes, and furthermore relies exclusively on the channel to be used: all input data leading to indistinguishable outputs is compressed to the same state, regardless of their prior distribution. Moreover, this process can be characterized as a higher order operation within the type of preprocessing. We also consider as an example the application of the method to the classical and quantum erasure channel. The examples suggest that noiseless reverse compression can take place only in trivial cases, although meaningful instances of noisy reverse compression can exist.
This paper explores a novel approach to data compression leveraging the principles of quantum entanglement. Traditional data compression methods rely on identifying and eliminating redundancy within data, often achieving limitations in compression ratios. We propose a system that utilizes entangled quantum states to represent data, achieving potentially higher compression rates and, crucially, lossless reconstruction. The core idea involves decomposing data into a set of entangled quantum subsystems. By exploiting the inherent correlations present within entangled states, we can effectively reduce redundancy without losing information. The paper details the mathematical framework underlying this approach, focusing on the key concepts of entanglement, quantum measurement, and the reconstruction process. We outline the theoretical advantages of this method compared to conventional techniques and discuss the challenges associated with its practical implementation. The primary goal is to demonstrate the potential of quantum entanglement for fundamentally transforming data compression, moving beyond the constraints of classical redundancy reduction. ---
Consider a source of pure quantum states with density matrix ρ and von Neumann entropy S . It is known that the quantum information of the source may be faithfully compressed to 5 qubits/signal (asymptotically for long sequences) and that this limit is optimal if we demand high fidelity for long strings of signals. The usual method for achieving this compression, based on the typical subspace of the source, requires knowledge of the density matrix. We describe a new “universal” compression scheme which does not even require knowledge of ρ. More precisely, suppose that the source is known to have von Neumann entropy less than some given bound S 0 but is otherwise completely unspecified. Our method will faithfully compress the quantum information of any such source to S 0 qubits/signal. It is known that S is always less than or equal to the Shannon entropy H of the prior distribution of the source. According to Shannon’s theorem, H provides the limit for compression of classical signals, so one may ask the question: what is the physical origin of the extra compression available in the quantum case compared to the classical case (where the prior probabilities are the same)? One may suggest that this effect is a consequence of possible non-orthogonality of signal states. However we demonstrate that it is possible to make each pair of signal states of a source more parallel (keeping the prior probabilities the same) while increasing the von Neumann entropy. This casts doubt on the conventional wisdom that overlap of quantum states is a measure of their (non-)distinguishability. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The problem of distributed compression for correlated quantum sources is considered. The classical version of this problem was solved by Slepian and Wolf, who showed that distributed compression could take full advantage of redundancy in the local sources created by the presence of correlations. Here it is shown that, in general, this is not the case for quantum sources, by proving a lower bound on the rate sum for irreducible sources of product states which is stronger than the one given by a naive application of Slepian–Wolf. Nonetheless, strategies taking advantage of correlation do exist for some special classes of quantum sources. For example, Devetak and Winter demonstrated the existence of such a strategy when one of the sources is classical. Optimal nontrivial strategies for a different extreme, sources of Bell states, are presented here. In addition, it is explained how distributed compression is connected to other problems in quantum information theory, including information-disturbance questions, entanglement distillation and quantum error correction.
This paper explores a novel approach to classical data compression leveraging the principles of quantum demixing and measurement. The core idea is to transform classical data into a quantum state representation and subsequently exploit quantum demixing to effectively eliminate unwanted quantum correlations. This process allows for the selective extraction of information, ultimately leading to a compressed representation. We present a theoretical framework outlining this methodology, focusing on the mathematical underpinnings of the transformation, demixing, and measurement stages. The proposed method offers a potential pathway to achieve high compression ratios by exploiting the unique properties of quantum systems. We demonstrate, through theoretical analysis, the feasibility and potential advantages of this technique compared to conventional classical compression methods. The key elements involve mapping classical data to a quantum state, employing a demixing protocol to reduce redundancy, and finally, measuring the quantum state to recover the compressed information. This work lays the groundwork for future research into practical implementations of quantum data compression. ---
Quantum information theory studies the fundamental limits that physical laws impose on information processing tasks such as data compression and data transmission on noisy channels. This thesis presents general techniques that allow one to solve many fundamental problems of quantum information theory in a unified framework. The central theorem of this thesis proves the existence of a protocol that transmits quantum data that is partially known to the receiver through a single use of an arbitrary noisy quantum channel. In addition to the intrinsic interest of this problem, this theorem has as immediate corollaries several central theorems of quantum information theory. The following chapters use this theorem to prove the existence of new protocols for two other types of quantum channels, namely quantum broadcast channels and quantum channels with side information at the transmitter. These protocols also involve sending quantum information partially known by the receiver with a single use of the channel, and have as corollaries entanglement-assisted and unassisted asymptotic coding theorems. The entanglement-assisted asymptotic versions can, in both cases, be considered as quantum versions of the best coding theorems known for the classical versions of these problems. The last chapter deals with a purely quantum phenomenon called locking. We demonstrate that it is possible to encode a classical message into a quantum state such that, by removing a subsystem of logarithmic size with respect to its total size, no measurement can have significant correlations with the message. The message is therefore "locked" by a logarithmic-size key. This thesis presents the first locking protocol for which the success criterion is that the trace distance between the joint distribution of the message and the measurement result and the product of their marginals be sufficiently small.
Rate-distortion theory provides bounds for compressing data produced by an information source to a specified encoding rate that is strictly less than the source's entropy. This necessarily entails some loss, or distortion, between the original source data and the best approximation after decompression. The so-called Information Bottleneck Method is designed to compress only “relevant” information. Which information is relevant is determined by the correlation between the data being compressed and a variable of interest, so-called side information. In this paper, an Information Bottleneck Method is introduced for the compression of quantum data. The channel communication picture is used for compression and decompression. The rate of compression is derived using an entanglement-assisted protocol with classical communication, and under an unproved conjecture that the rate function is convex in the distortion parameter. The optimum channel achieving this rate for a given input state is characterized. The conceptual difficulties arising due to differences in the mathematical formalism between quantum and classical probability theory are discussed and solutions are presented.