首页/论文/quant-ph/0209124

arXiv quant-ph/02091242002-09quant-ph

Simple construction of quantum universal variable-length source coding

Masahito Hayashi, Keiji Matsumoto

备注：: We add Section 5 "Compression of entangled states"
发表信息：: Quantum Information and Computation, Vol.2, Special Issue, pp.519-529 (2002).

英文摘要：

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 the input state. Our protocol can be used not only for the Schumacher's scheme but also for the compression of entangled states.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Universal coding for classical-quantum channel

We construct a universal code for stationary and memoryless classical-quantum channel as a quantum version of the universal coding by Csiszár and Körner. Our code is constructed by the combination of irreducible representation, the decoder introduced through quantum information spectrum, and the packing lemma.

2008-07-18quant-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

Indeterminate-length quantum coding

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.

2000-11-02quant-ph

Universal coding for transmission of private information

We consider the scenario in which Alice transmits private classical messages to Bob via a classical-quantum channel, part of whose output is intercepted by an eavesdropper, Eve. We prove the existence of a universal coding scheme under which Alice's messages can be inferred correctly by Bob, and yet Eve learns nothing about them. The code is universal in the sense that it does not depend on specific knowledge of the channel. Prior knowledge of the probability distribution on the input alphabet of the channel, and bounds on the corresponding Holevo quantities of the output ensembles at Bob's an…

2011-01-01quant-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

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

Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding

We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets. Our universal classical-quantum multiple access channel codes have two types of codes. One is a code with joint decoding and the other is a code with separate decoding. The former universally achieves corner points of the capacity region and the latter u…

2021-05-06cs.ITmath.ITquant-ph

Asymptotic Redundancies for Universal Quantum Coding

We investigate the question of whether or not there exists a noncommutative/ quantum extension of a recent (commutative probabilistic) result of Clarke and Barron. They demonstrated that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy - the excess of the encoding cost over the source entropy - of universal data compression in a parametric setting. We study certain probability distributions for the two-level quantum systems. We are able to compute exact formulas for the corresponding redundancies, for which we find the asymptotic li…

1999-03-25quant-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

量子网络上的组播量子网络编码作为最优对称通用克隆

Multicast quantum network coding as optimal symmetric universal cloning over a quantum network

Advanced ICT Research Institute, NICT（先进ICT研究所）；The University of Tokyo（东京大学）；Shizuoka University（静冈大学）

该研究扩展Kobayashi等人的量子网络编码协议，建立单源量子网络完美组播对称通用克隆的充分条件，为量子网络的完美组播提供了理论支撑。

2026-08-20quant-ph

通用量子编码

Universal quantum coding

Freie Universität Berlin（柏林自由大学）；Scuola Normale Superiore（比萨高等师范学院）；Università degli Studi di Salerno（萨莱诺大学）；INFN, Sezione di Napoli（意大利国家核物理研究所那不勒斯分部）

通过Schur-Weyl对偶性建立通用量子纠错原理，实现无需先验知识的纠缠提取与量子通信，达到最优速率与样本复杂度。

2026-09-30quant-ph

Privacy amplification scheme based on composite coding

Privacy amplification is an indispensable step in the post-processing of quantum key distribution, which can be used to compress the redundancy of shared key and improve the security level of the key. The commonly used privacy amplification is based on the random selection of universal hash functions, which needs the help of an additional random source, while it does not exist in general. In this paper, we propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. Compared with the universal hashing function, the prop…

2021-09-15quant-ph

通用经典-量子信道可解性与私有信道编码

Universal classical-quantum channel resolvability and private channel coding

本研究针对经典-量子信道完全通用私有编码的构造难题，利用关联Schreier图的谱扩展性质构建了首个确定性信道无关可解性码本，结合基于Schur-Weyl对偶的通用编码实现了已知最优速率，为安全通信中的图扩展器性质研究提供了新视角。

2025-10-03cs.ITmath-phmath.IT

经典-量子信道编码中普适性牺牲可靠性

Universality Sacrifices Reliability in Classical-Quantum Channel Coding

The University of Tokyo（东京大学）；RIKEN Center for Quantum Computing (RQC)（理化学研究所量子计算中心）；The Chinese University of Hong Kong, Shenzhen（香港中文大学（深圳））；International Quantum Academy（国际量子学院）；Nagoya University（名古屋大学）；National Taiwan University（台湾大学）；National Center for Theoretical Sciences, Taiwan（台湾理论科学中心）；Hon Hai (Foxconn) Quantum Computing Center（鸿海（富士康）量子计算中心）

研究表明，经典-量子信道中普适编码无法达到已知信道的最优可靠性，其最优普适可靠性由夹逼Rényi散度刻画，揭示了普适性的可靠性代价。

2026-10-02cs.ITmath.ITquant-ph

Asymptotic Redundancies for Universal Quantum Coding

Clarke and Barron have recently shown that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy of universal data compression in a parametric setting. We seek a possible analogue of this result for the two-level {\it quantum} systems. We restrict our considerations to prior probability distributions belonging to a certain one-parameter family, $q(u)$, $-\infty < u < 1$. Within this setting, we are able to compute exact redundancy formulas, for which we find the asymptotic limits. We compare our quantum asymptotic redundancy formulas to …

1997-05-02math.PRquant-ph

Entanglement transmission and generation under channel uncertainty: Universal quantum channel coding

We determine the optimal rates of universal quantum codes for entanglement transmission and generation under channel uncertainty. In the simplest scenario the sender and receiver are provided merely with the information that the channel they use belongs to a given set of channels, so that they are forced to use quantum codes that are reliable for the whole set of channels. This is precisely the quantum analog of the compound channel coding problem. We determine the entanglement transmission and entanglement-generating capacities of compound quantum channels and show that they are equal. Moreov…

2009-05-25math-phmath.MPquant-ph

用于3量子比特通用量子计算方案的反相干$k$-平面与编码技术

Anticoherent $k$-planes and coding techniques for a 3-qubit scheme of universal quantum computing

该研究利用反相干$k$-平面与编码技术，在3量子比特系统中实现Hadamard门和广义Toffoli门，提出抗任意路径形变的通用量子计算方案。

2025-09-27math-phmath.MPquant-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

Trade-off coding for universal qudit cloners motivated by the Unruh effect

A "triple trade-off" capacity region of a noisy quantum channel provides a more complete description of its capabilities than does a single capacity formula. However, few full descriptions of a channel's ability have been given due to the difficult nature of the calculation of such regions---it may demand an optimization of information-theoretic quantities over an infinite number of channel uses. This work analyzes the d-dimensional Unruh channel, a noisy quantum channel which emerges in relativistic quantum information theory. We show that this channel belongs to the class of quantum channels…

2011-09-28gr-qchep-thmath-ph