many isometries so that each isometry encodes one of these blocks into the Fock space, followed by the concatenation of their images. We only consider certain sequences of such isometries that we call “special block codes” in order to ensure that the string of encoded states is uniquely decodable. We compute the minimum average codeword length of these encodings which depends on the quantum source and the integers m, l, among all possible special block codes. Our result extends the result of [Bellomo, Bosyk, Holik and Zozor, Scientific Reports 7.1 (2017): 14765] where the minimum was computed for one block, i.e. for m = 1.

DOI: 10.1109/isit57864.2024.10619558

Related papers

Optimal lower bound for lossless quantum block encoding

George Androulakis, Rabins Wosti

Consider a general quantum stochastic source that emits at discrete time steps quantum pure states which are chosen from a finite alphabet according to some probability distribution which may depend on the whole history. Also, fix two positive integers $m$ and $l$ . We encode any tensor product of $m$ many states emitted by the quantum stochastic source by breaking the tensor product into $m$ many blocks where each block has length $l$ , and considering sequences of $m$ many isometries so that each isometry encodes one of these blocks into the Fock space, followed by the concatenation of their images. We only consider certain sequences of such isometries that we call \lq\lq special block codes\rq\rq\ in order to ensure that the string of encoded states is uniquely decodable. We compute the minimum average codeword length of these encodings which depends on the quantum source and the integers $m$ , $l$ , among all possible special block codes. Our result extends the result of [Bellomo, Bosyk, Holik and Zozor, Scientific Reports 7.1 (2017): 14765] where the minimum was computed for one block, i.e.\ for $m=1$ . Lastly, we give a simplified non-adaptive compression technique based on constrained special block codes for general quantum stochastic sources. For quantum stationary sources in particular, we show that the minimum average codeword length per symbol computed over all constrained special block codes is equal to the von-Neumann entropy rate of the source for an asymptotically long block size.Consider a general quantum stochastic source that emits at discrete time steps quantum pure states which are chosen from a finite alphabet according to some probability distribution which may depend on the whole history. Also, fix two positive integers $m$ and $l$. We encode any tensor product of $m$ many states emitted by the quantum stochastic source by breaking the tensor product into $m$ many blocks where each block has length $l$, and considering sequences of $m$ many isometries so that each isometry encodes one of these blocks into the Fock space, followed by the concatenation of their images. We only consider certain sequences of such isometries that we call \lq\lq special block codes\rq\rq\ in order to ensure that the string of encoded states is uniquely decodable. We compute the minimum average codeword length of these encodings which depends on the quantum source and the integers $m$, $l$, among all possible special block codes. Our result extends the result of [Bellomo, Bosyk, Holik and Zozor, Scientific Reports 7.1 (2017): 14765] where the minimum was computed for one block, i.e.\ for $m=1$. Lastly, we give a simplified non-adaptive compression technique based on constrained special block codes for general quantum stochastic sources. For quantum stationary sources in particular, we show that the minimum average codeword length per symbol computed over all constrained special block codes is equal to the von-Neumann entropy rate of the source for an asymptotically long block size.

arXiv:2305.18748Quantum Information and ComputationNov 1, 20240 citations

New Approaches on Source Coding for Quantum Stochastic Sources and Implementation of Quantum Fanout Gate

Rabins Wosti

The accurate computation of advanced quantum algorithms like Shor’s integer factorization, quantum phase estimation (QPE), and the quantum Fourier transform (QFT) requires quantum circuits of considerable size and depth. It is difficult to achieve reliable computation with deep quantum circuits due to the limited coherence times of the current noisy quantum devices. The quantum fanout gate is known to be a powerful primitive for reducing the depth of many quantum circuits (Høyer and Špalek 2003; Gottesman and Chuang 1999). Shallow or constant-depth quantum circuits are desirable for both near-term and fault-tolerant quantum computations as they reduce noise and allow faster execution of quantum algorithms, potentially skirting the effects of short coherence times. In this work, we show new approaches towards implementation of quantum fanout gate. In particular, we show that by analogue time-evolving the quantum systems according to two well-studied Hamiltonians, namely, quantum Ising and quantum Heisenberg models, we can implement the quantum fanout operator using constantly many layers of digital quantum gates. Important foundations to the area of quantum encoding were provided by Schumacher who proved the quantum analog of Shannon’s noiseless coding theorem for an independent and identically distributed (i.i.d.) quantum source, (Schumacher 1995). In this work, we show a lossless, variable-length block encoding scheme of quantum information emitted from a completely general stochastic quantum source, and it is encoded into the Fock space. While doing so, we extend the notion of uniquely decodable (or completely lossless) quantum codes to be used for quantum block data compression. As our main result, for a fixed mlmany pure states emitted by a given quantum stochastic source, we derive the optimal lower bound of the average codeword length over a subset of uniquely decodable quantum codes called “special block codes,” which are applied to encode the pure states of m many blocks each of block size l. Additionally, we show that for quantum stationary sources in particular, the optimal lower bound of the average codeword length per symbol computed over a subset of special block codes called “constrained special block codes” equals the von Neumann entropy rate of the source for an asymptotically long block size.The accurate computation of advanced quantum algorithms like Shor’s integer factorization, quantum phase estimation (QPE), and the quantum Fourier transform (QFT) requires quantum circuits of considerable size and depth. It is difficult to achieve reliable computation with deep quantum circuits due to the limited coherence times of the current noisy quantum devices. The quantum fanout gate is known to be a powerful primitive for reducing the depth of many quantum circuits (Høyer and Špalek 2003; Gottesman and Chuang 1999). Shallow or constant-depth quantum circuits are desirable for both near-term and fault-tolerant quantum computations as they reduce noise and allow faster execution of quantum algorithms, potentially skirting the effects of short coherence times. In this work, we show new approaches towards implementation of quantum fanout gate. In particular, we show that by analogue time-evolving the quantum systems according to two well-studied Hamiltonians, namely, quantum Ising and quantum Heisenberg models, we can implement the quantum fanout operator using constantly many layers of digital quantum gates. Important foundations to the area of quantum encoding were provided by Schumacher who proved the quantum analog of Shannon’s noiseless coding theorem for an independent and identically distributed (i.i.d.) quantum source, (Schumacher 1995). In this work, we show a lossless, variable-length block encoding scheme of quantum information emitted from a completely general stochastic quantum source, and it is encoded into the Fock space. While doing so, we extend the notion of uniquely decodable (or completely lossless) quantum codes to be used for quantum block data compression. As our main result, for a fixed mlmany pure states emitted by a given quantum stochastic source, we derive the optimal lower bound of the average codeword length over a subset of uniquely decodable quantum codes called “special block codes,” which are applied to encode the pure states of m many blocks each of block size l. Additionally, we show that for quantum stationary sources in particular, the optimal lower bound of the average codeword length per symbol computed over a subset of special block codes called “constrained special block codes” equals the von Neumann entropy rate of the source for an asymptotically long block size.

Oct 1, 20250 citations

Optimality in quantum data compression using dynamical entropy

George Androulakis, Duncan Wright

In this article we study lossless compression of strings of pure quantum states of indeterminate-length quantum codes which were introduced by Schumacher and Westmoreland. Past work has assumed that the strings of quantum data are prepared to be encoded in an independent and identically distributed way. We discuss the notion of quantum stochastic ensembles, allowing us to consider strings of quantum states prepared in a general way. For any quantum stochastic ensemble we define an associated quantum dynamical system and prove that the optimal average codeword length via lossless coding is equal to the quantum dynamical entropy of the associated quantum dynamical system.In this article we study lossless compression of strings of pure quantum states of indeterminate-length quantum codes which were introduced by Schumacher and Westmoreland. Past work has assumed that the strings of quantum data are prepared to be encoded in an independent and identically distributed way. We discuss the notion of quantum stochastic ensembles, allowing us to consider strings of quantum states prepared in a general way. For any quantum stochastic ensemble we define an associated quantum dynamical system and prove that the optimal average codeword length via lossless coding is equal to the quantum dynamical entropy of the associated quantum dynamical system.

arXiv:1904.05402Physical Review ASep 3, 20192 citations

On Lossless Quantum Data Compression With a Classical Helper

Rudolf Ahlswede, N. Cai

After K. Bostro/spl uml/m and T. Felbinger observed that lossless quantum data compression does not exist unless decoders know the lengths of codewords, they introduced a classical noiseless channel to inform the decoder of a quantum source about the lengths of codewords. In this paper we analyze their codes and present: 1) a sufficient and necessary condition for the existence of such codes for given lists of lengths of codes; 2) a characterization of the optimal compression rate for their codes. However our main contribution is a more efficient way to use the classical channel. We propose a more general coding scheme. It turned out that the optimal compression can always be achieved by a code obtained by this scheme. A von Neumann entropy lower bound to rates of our codes and a necessary and sufficient condition to achieve the bound are obtained. The gap between this lower bound and the compression rates is also well analyzed. For a special family of quantum sources we provide a sharper lower bound in terms of Shannon entropy. Finally, we propose some problems for further research.After K. Bostro/spl uml/m and T. Felbinger observed that lossless quantum data compression does not exist unless decoders know the lengths of codewords, they introduced a classical noiseless channel to inform the decoder of a quantum source about the lengths of codewords. In this paper we analyze their codes and present: 1) a sufficient and necessary condition for the existence of such codes for given lists of lengths of codes; 2) a characterization of the optimal compression rate for their codes. However our main contribution is a more efficient way to use the classical channel. We propose a more general coding scheme. It turned out that the optimal compression can always be achieved by a code obtained by this scheme. A von Neumann entropy lower bound to rates of our codes and a necessary and sufficient condition to achieve the bound are obtained. The gap between this lower bound and the compression rates is also well analyzed. For a special family of quantum sources we provide a sharper lower bound in terms of Shannon entropy. Finally, we propose some problems for further research.

IEEE Transactions on Information TheoryJun 1, 200410 citations

Lossless quantum prefix compression for communication channels that are always open

Markus P. Müller, Caroline Rogers, Rajagopal Nagarajan

We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected base length of the output quantum bit string (the base length of a quantum string is the maximal length in the superposition). This complements work by Schumacher and Westmoreland who calculated the corresponding rate for minimizing the output's average length. Our compressed code words are prefix-free indeterminate-length quantum bit strings which can be concatenated in the case of multiple sources. Therefore, we generalize the known theory of prefix-free quantum codes to the case where strings have indeterminate length. Moreover, we describe a communication model which allows the lossless transmission of the compressed code words. The benefit of compression is then the reduction of transmission errors in the presence of noise.We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected base length of the output quantum bit string (the base length of a quantum string is the maximal length in the superposition). This complements work by Schumacher and Westmoreland who calculated the corresponding rate for minimizing the output's average length. Our compressed code words are prefix-free indeterminate-length quantum bit strings which can be concatenated in the case of multiple sources. Therefore, we generalize the known theory of prefix-free quantum codes to the case where strings have indeterminate length. Moreover, we describe a communication model which allows the lossless transmission of the compressed code words. The benefit of compression is then the reduction of transmission errors in the presence of noise.

arXiv:0808.2003Physical Review AJan 6, 20097 citations

Quantum State Redistribution for Ensemble Sources

Zahra Baghali Khanian, Andreas Winter

We consider a generalization of the quantum state redistribution task, where pure multipartite states from an ensemble source are distributed among an encoder, a decoder and a reference system. The encoder, Alice, has access to two quantum systems: system A which she compresses and sends to the decoder, Bob, and the side information system C which she wants to keep at her site. Bob has access to quantum side information in a system B, wants to decode the compressed information in such a way to preserve the correlations with the reference system on average. As figures of merit, we consider both block error (which is the usual one in source coding) and per-copy error (which is more akin to rate-distortion theory), and find the optimal compression rate for the second criterion, and achievable and converse bounds for the first. The latter almost match in general, up to an asymptotic error and an unbounded auxiliary system; for so-called irreducible sources they are provably the same. Full paper forthcoming [1].We consider a generalization of the quantum state redistribution task, where pure multipartite states from an ensemble source are distributed among an encoder, a decoder and a reference system. The encoder, Alice, has access to two quantum systems: system A which she compresses and sends to the decoder, Bob, and the side information system C which she wants to keep at her site. Bob has access to quantum side information in a system B, wants to decode the compressed information in such a way to preserve the correlations with the reference system on average. As figures of merit, we consider both block error (which is the usual one in source coding) and per-copy error (which is more akin to rate-distortion theory), and find the optimal compression rate for the second criterion, and achievable and converse bounds for the first. The latter almost match in general, up to an asymptotic error and an unbounded auxiliary system; for so-called irreducible sources they are provably the same. Full paper forthcoming [1].

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20205 citations

m

and l. We encode any tensor product of ml many states emitted by the given quantum source by breaking it into

m

many blocks where each block has length l, and considering sequences of

m

m

and

l

. We encode any tensor product of

m

many states emitted by the quantum stochastic source by breaking the tensor product into

m

many blocks where each block has length

l

, and considering sequences of

m

m

l

, among all possible special block codes. Our result extends the result of [Bellomo, Bosyk, Holik and Zozor, Scientific Reports 7.1 (2017): 14765] where the minimum was computed for one block, i.e.\ for

m=1

. Lastly, we give a simplified non-adaptive compression technique based on constrained special block codes for general quantum stochastic sources. For quantum stationary sources in particular, we show that the minimum average codeword length per symbol computed over all constrained special block codes is equal to the von-Neumann entropy rate of the source for an asymptotically long block size.