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:0804.0022

Quantum Bit Strings and Prefix-Free Hilbert Spaces

Markus P. Müller, Caroline Rogers

Published Mar 31, 2008• 6 citations
arXivHTMLPDF

Abstract

We give a mathematical framework for manipulating indeterminate-length quantum bit strings. In particular, we define prefixes, fragments, tensor products and concatenation of such strings of qubits, and study their properties and relationships. The results are then used to define prefix-free Hilbert spaces in a more general way than in previous work, without assuming the existence of a basis of length eigenstates. We prove a quantum analogue of the Kraft inequality, illustrate the results with some examples and discuss the relevance of prefix-free Hilbert spaces for lossless compression.

DOI
10.48550/arxiv.0804.0022

Related papers

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.

arXiv:0808.2003•Physical Review A•Jan 6, 2009•7 citations

Indeterminate-length quantum coding

Benjamin W. Schumacher, Michael D. Westmoreland

The quantum analogues of classical variable-length codes are indeterminate-length quantum codes, in which code words may exist in superpositions of different lengths. This paper explores some of their properties. The length observable for such codes is governed by a quantum version of the Kraft--McMillan inequality. Indeterminate-length quantum codes also provide an alternate approach to quantum data compression.

arXiv:quant-ph/0011014•Physical Review A•Sep 10, 2001•37 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.

arXiv:1904.05402•Physical Review A•Sep 3, 2019•3 citations

Quantum Kolmogorov Complexity and the Quantum Turing Machine

Markus P. Müller

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 similar to that by Berthiaume, van Dam, and Laplante. It defines the QC of some indeterminate-length qubit string ρas the minimum base length of any quantum input which makes a quantum Turing machine (QTM) halt and output ρ, up to some error tolerance. First, we prove that there is a QTM which is universal in the sense of input base length. Furthermore, we show several general properties of QTMs, including a result on mutually orthogonal ``halting spaces'', and a way to transform every almost-halting input into a deterministically-halting input by adding at most a constant number of qubits. Afterwards, we apply these results to QC. In particular, we show that QC is invariant, incompressible, agrees with classical Kolmogorov complexity for classical strings, and is closely related to von Neumann entropy for ergodic quantum information sources.

arXiv:0712.4377•Dec 28, 2007•17 citations

On Lossless Quantum Data Compression and Quantum Variable–Length Codes

Rudolf Ahlswede, Ning Cai

This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References

Quantum Information Processing•Feb 21, 2003•2 citations

On Lossless Quantum Data Compression and Quantum Variable‐Length Codes

Rudolf Ahlswede, Ning Cai

This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References

Quantum Information Processing•Feb 17, 2005•0 citations
We give a mathematical framework for manipulating indeterminate-length quantum bit strings. In particular, we define prefixes, fragments, tensor products and concatenation of such strings of qubits, and study their properties and relationships. The results are then used to define prefix-free Hilbert spaces in a more general way than in previous work, without assuming the existence of a basis of length eigenstates. We prove a quantum analogue of the Kraft inequality, illustrate the results with some examples and discuss the relevance of prefix-free Hilbert spaces for lossless compression.
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.
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.
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 similar to that by Berthiaume, van Dam, and Laplante. It defines the QC of some indeterminate-length qubit string ρas the minimum base length of any quantum input which makes a quantum Turing machine (QTM) halt and output ρ, up to some error tolerance. First, we prove that there is a QTM which is universal in the sense of input base length. Furthermore, we show several general properties of QTMs, including a result on mutually orthogonal ``halting spaces'', and a way to transform every almost-halting input into a deterministically-halting input by adding at most a constant number of qubits. Afterwards, we apply these results to QC. In particular, we show that QC is invariant, incompressible, agrees with classical Kolmogorov complexity for classical strings, and is closely related to von Neumann entropy for ergodic quantum information sources.
This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References
This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References