Indeterminate-length quantum coding

Benjamin Schumacher, Michael D. Westmoreland

备注：: 32 pages
DOI：: 10.1103/PhysRevA.64.042304

英文摘要：

The quantum analogues of classical variable-length codes are indeterminate-length quantum codes, in which codewords 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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Lossless Quantum Prefix Compression for Communication Channels that are Always Open

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 gen…

2009-01-19quant-ph

Exponents of quantum fixed-length pure state source coding

We derive the optimal exponent of the error probability of the quantum fixed-length pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Jozsa et al. (PRL, 81, 1714 (1998))'s universal code. In the direct part, a group representation theoretical type method is essential. In the converse part, Nielsen and Kempe (PRL, 86, 5184 (2001))'s lemma is essential.

2002-10-03quant-ph

Variable length universal entanglement concentration by local operations and its application to teleportation and dense coding

Using invariance of the $n$-th tensored state w.r.t. the $n$-th symmetric group, we propose a 'variable length' universal entanglement concentration without classical communication. Like variable length data compression, arbitrary unknown states are concentrated into perfect Bell states and not approximate Bell states and the number of Bell states obtained is equal to the optimal rate asymptotically with the probability 1. One of the point of our scheme is that we need no classical communication at all. Using this method, we can construct a universal teleportation and a universal dense coding.

2001-09-05quant-ph

Quantum universal variable-length source coding

We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0.

2002-06-05quant-ph

Simple construction of quantum universal variable-length source coding

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 greater than the entropy rate $H(rho_p)$, tend to 0. If $H(rho_p)$ is estimated, we can compress the coding rate to the admissible rate $H(rho_p)$ with a probability close to 1. However, when we perform a naive measurement for the estimation of $H(rho_p)$, the input state is demolished. By smearing the measurement, we successfully treat the trade-off between the estimation of $H(rho_p)$ and the non-demolition of t…

2002-11-28quant-ph

Lossless quantum data compression and variable-length coding

In order to compress quantum messages without loss of information it is necessary to allow the length of the encoded messages to vary. We develop a general framework for variable-length quantum messages in close analogy to the classical case and show that lossless compression is only possible if the message to be compressed is known to the sender. The lossless compression of an ensemble of messages is bounded from below by its von-Neumann entropy. We show that it is possible to reduce the number of qbits passing through a quantum channel even below the von-Neumann entropy by adding a classical…

2002-03-01quant-ph

更多相关论文收起更多论文

Tanner图的递归扩展：一种构造高编码率稳定子码的方法

Recursive expansion of Tanner graph: a method to construct stabilizer codes with high coding rate

针对量子稳定子码编码率低的问题，本文基于递归扩展Tanner图思路提出XZ-TGRE和TGRE-HP两种高编码率稳定子码，验证了其码距和噪声阈值性能，证明该思路在构造高性能量子码方面有潜力。

2024-04-12quant-ph

Optimality in Quantum Data Compression using Dynamical Entropy

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 introduce the notion of quantum stochastic ensembles, allowing us to consider strings of quantum states prepared in a more general way. For any identically distributed quantum stochastic ensemble we define an associated quantum Markov chain and prove that the optimal average codeword length …

2019-08-03cs.ITmath.ITquant-ph

Finite-Block-Length Analysis in Classical and Quantum Information Theory

Coding technology is used in several information processing tasks. In particular, when noise during transmission disturbs communications, coding technology is employed to protect the information. However, there are two types of coding technology: coding in classical information theory and coding in quantum information theory. Although the physical media used to transmit information ultimately obey quantum mechanics, we need to choose the type of coding depending on the kind of information device, classical or quantum, that is being used. In both branches of information theory, there are many e…

2017-02-10cs.CRcs.ITmath.IT

Quantum Bit Strings and Prefix-Free Hilbert Spaces

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.

2008-03-31math-phmath.MPquant-ph