Peter Loeber
This paper is on identification of classical information by the use of quantum channels. We focus on simultaneous ID codes which use measurements being useful to identify an arbitrary message. We give a direct and a converse part of the appropriate coding theorem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We present a dense coding scheme between one sender and two receivers, which guarantees that the receivers simultaneously obtain their respective messages. In our scheme, the quantum entanglement channel is first locked by the sender so that the receivers cannot learn their messages unless they collaborate to perform the unlocking operation. We also show that the quantum Fourier transform can act as the locking operator both in simultaneous dense coding and teleportation.
Simultaneous dense coding guarantees that Bob and Charlie simultaneously receive their respective information from Alice in their respective processes of dense coding. The idea is to use the so-called locking operation to "lock" the entanglement channels, thus requiring a joint unlocking operation by Bob and Charlie in order to simultaneously obtain the information sent by Alice. We present some new results on simultaneous dense coding: (1) We propose three simultaneous dense coding protocols, which use different $N$-dimensional entanglement (Bell state, W state and GHZ state). (2) Besides the…
Capacity of dense coding via correlated noisy channel is greater than that in uncorrelated noisy channel. It is shown that weak measurement and reversal measurement can make further effort to improve quantum dense coding capacity in correlated amplitude damping channel, but this effort is very small in correlated phase damping channel and correlated depolarizing channel.
We study the super dense coding capacity in the presence of quantum channels with correlated noise. We investigate both the cases of unitary and non-unitary encoding. Pauli channels for arbitrary dimensions are treated explicitly. The super dense coding capacity for some special channels and resource states is derived for unitary encoding. We also provide an example of a memory channel where non-unitary encoding leads to an improvement in the super dense coding capacity.
The weak converse coding theorems have been proved for the quantum source and channel. The results give the lower bound for capacity of source and the upper bound for capacity of channel. The monotonicity of mutual quantum information have also been proved. PACS numbers: 03.65.Bz
We investigate probabilistic dense coding in non-symmetric Hilbert spaces of the sender's and the receiver's particles. The sender and the receiver share the multipartite non-maximally quantum channel. We also discuss the average information.
This paper has been withdrawn by the author because Lemma 3 is incorrect. This mistake is crucial in this paper.
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.
A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept for the difficulty due to non-commutativity.
The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~\cite{HCT}. The proof of coding theorems is given for the classical capacity and entanglement-assisted classical capacity of the measurement channel with arbitrary output alphabet, without assuming that the channel is given by a bounded operator-valued density.
A new proof of the direct part of the quantum channel coding theorem is shown based on a standpoint of quantum hypothesis testing. A packing procedure of mutually noncommutative operators is carried out to derive an upper bound on the error probability, which is similar to Feinstein's lemma in classical channel coding. The upper bound is used to show the proof of the direct part along with a variant of Hiai-Petz's theorem in quantum hypothesis testing.
A two-receiver quantum dense coding scheme and an $N$-receiver quantum dense coding scheme, in the case of non-symmetric Hilbert spaces of the particles of the quantum channel, are investigated in this paper. A sender can send his messages to many receivers simultaneously. The scheme can be applied to quantum secret sharing and controlled quantum dense coding.
The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper culminates in the derivation of the dense coding capacity for a noiseless quantum channel, assisted by arbitrary shared entanglement, using this approach. We also review the currently known coding theorems, and their converses, for protocols such as data compression for arbitrary quantum sources and transmission of classical information through arbitrary quantum cha…
In a network, a channel introduces correlations to the parties that aim to establish a communication protocol. In this work, we present a framework of non-local network coding by exploiting a Bell scenario and show the usefulness of non-local and quantum resources in network coding. Two-sender and two-receiver interference channels are considered, for which network coding is characterized by two-input and four-outcome Bell scenarios. It is shown that non-signaling (quantum) correlations lead to strictly higher channel capacities in general than quantum (local) correlations. It is also shown th…
In this paper we consider the transmission of classical information through a class of quantum channels with long-term memory, which are given by convex combinations of product channels. Hence, the memory of such channels is given by a Markov chain which is aperiodic but not irreducible. We prove the coding theorem and weak converse for this class of channels. The main techniques that we employ, are a quantum version of Feinstein's Fundamental Lemma and a generalization of Helstrom's Theorem.
We study multipartite super dense coding in the presence of a covariant noisy channel. We investigate the case of many senders and one receiver, considering both unitary and non-unitary encoding. We study the scenarios where the senders apply local encoding or global encoding. We show that, up to some pre-processing on the original state, the senders cannot do better encoding than local, unitary encoding. We then introduce general Pauli channels as a significant example of covariant maps. Considering Pauli channels, we provide examples for which the super dense coding capacity is explicitly de…
We investigate super dense coding in the presence of noise, i.e. the subsystems of the entangled resource state have to pass a noisy unital quantum channel between the sender and the receiver. We discuss explicitly the case of Pauli channels in arbitrary dimension and derive the super dense coding capacity (i.e. the optimal information transfer) for some given resource states. We also study the case that the initial resource state can be chosen: for the qubit depolarizing channel we show that there is a threshold value for the noise parameter, below which the super dense coding protocol is opt…
We consider the problem of coding for quantum channels with side information that is available ahead of time at the transmitter but not at the receiver. We find a single-letter expression for the entanglement-assisted quantum capacity of such channels which closely parallels Gel'fand and Pinsker's solution to the classical version of the same problem. This theorem can also be used to find a lower bound on the unassisted quantum capacity of these channels.
Capacity Enhancement of n-GHZ State Super-dense Coding Channels by Purification and Quantum Neural Network
提出基于n-GHZ态的超密编码协议，结合纠缠纯化与量子神经网络提升信道容量，实验验证二者叠加增强效果显著。
A set of protocols for teleportation and dense coding tasks with the use of a N particle quantum channel, presented by entangled states of the GHZ class, is introduced, when N>2. Using a found representation for the multiparticle entangled states of the GHZ class, it has shown, that for dense coding schemes enhancement of the classical capacity of the channel due from entanglement is N/N-1. If N>2 there is no one - to -one correspondence between teleportation and dense coding schemes in comparison with the EPR channel is exploited. A set of schemes, for which two additional operations as entan…
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of channel uses, even when we allow code states which are entangled across several uses of the channel. Such a statement was previously only known for classical channels and the quantum identity channel. By relating the problem to the additivity of minimum output entropies, we show that a strong converse holds for a large class of channels, including all unital qubi…
In this work, we consider the preservation of a measurement for quantum systems interacting with an environment. Namely, a method of preserving an optimal measurement over a channel is devised, what we call channel coding of a quantum measurement in that operations are applied before and after a channel in order to protect a measurement. A protocol that preserves a quantum measurement over an arbitrary channel is shown only with local operations and classical communication without the use of a larger Hilbert space. Therefore, the protocol is readily feasible with present day's technologies. Ch…
We investigate the dense coding in the case of non-symmetric Hilbert spaces of the sender and receiver's particles sharing the quantum maximally entangled state. The efficiency of classical information gain is also considered. We conclude that when a more level particle is with the sender, she can get a non-symmetric quantum channel from a symmetric one by entanglement transfer. Thus the efficiency of information transmission is improved.
We study the performance of the super dense coding protocol in the presence of quantum channels with covariant noise. We first consider the bipartite case and review in a unified way the case of general Pauli channels. We discuss both the cases of unitary and non-unitary encoding. We also study the multipartite scenario and investigate the case of many senders and one receiver.
The additivity problem asks if the use of entanglement can boost the information-carrying capacity of a given channel beyond what is achievable by coding with simple product states only. This has recently been shown not to be the case for phase-insensitive one-mode Gaussian channels, but remains unresolved in general. Here we consider two general classes of bosonic noise channels, which include phase-insensitive Gaussian channels as special cases: these are beamsplitters with general, potentially non-Gaussian environment states and classical noise channels with general probabilistic noise. We …
The more than thirty years old issue of the (classical) information capacity of quantum communication channels was dramatically clarified during the last years, when a number of direct quantum coding theorems was discovered. The present paper gives a self contained treatment of the subject, following as much in parallel as possible with classical information theory and, on the other side, stressing profound differences of the quantum case. An emphasis is made on recent results, such as general quantum coding theorems including cases of infinite (possibly continuous) alphabets and constrained i…
In this paper, we establish an interesting duality between two different quantum information-processing tasks, namely, classical source coding with quantum side information, and channel coding over c-q channels. The duality relates the optimal error exponents of these two tasks, generalizing the classical results of Ahlswede and Dueck. We establish duality both at the operational level and at the level of the entropic quantities characterizing these exponents. For the latter, the duality is given by an exact relation, whereas for the former, duality manifests itself in the following sense: an …
Suppose that two senders each obtain one share of the output of a classical, bivariate, correlated information source. They would like to transmit the correlated source to a receiver using a quantum multiple access channel. In prior work, Cover, El Gamal, and Salehi provided a combined source-channel coding strategy for a classical multiple access channel which outperforms the simpler "separation" strategy where separate codebooks are used for the source coding and the channel coding tasks. In the present paper, we prove that a coding strategy similar to the Cover-El Gamal-Salehi strategy and …
We consider the fundamental protocol of dense coding of classical information assuming that noise affects both the forward and backward communication lines between Alice and Bob. Assuming that this noise is described by the same quantum channel, we define its dense coding capacity by optimizing over all adaptive strategies that Alice can implement, while Bob encodes the information by means of Pauli operators. Exploiting techniques of channel simulation and protocol stretching, we are able to establish the dense coding capacity of Pauli channels in arbitrary finite dimension, with simple formu…
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…
We study the hybrid classical-quantum version of the channel coding problem for the famous Gel'fand-Pinsker channel. In the classical setting for this channel the conditional distribution of the channel output given the channel input is a function of a random parameter called the channel state. We study this problem when a rate limited version of the channel state is available at the encoder for the classical-quantum Gel'fand-Pinsker channel. We establish the capacity region for this problem in the information-spectrum setting. The capacity region is quantified in terms of spectral-sup classic…
We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans. Info. Theory 56, 2307-2359 (2010)] for classical channel coding, and also enjoys the saddle point property enabling the order of optimizations to be interchanged. Equivalently, the bound can be formulated as a semidefinite program satisfying strong duality. The convex nature of the bound implies channel symmetries can substantially simplify the optimization,…
Universal classical-quantum channel resolvability and private channel coding
本研究针对经典-量子信道完全通用私有编码的构造难题，利用关联Schreier图的谱扩展性质构建了首个确定性信道无关可解性码本，结合基于Schur-Weyl对偶的通用编码实现了已知最优速率，为安全通信中的图扩展器性质研究提供了新视角。
Classical-Quantum Channel Resolvability Using Matrix Multiplicative Weight Update Algorithm
本文提出使用矩阵乘法权重更新算法通过确定性编码证明经典-量子信道的可分辨性，首次实现了该领域的突破性进展。
Quantum channel coding: Approximation algorithms and strong converse exponents
该研究通过证明非信号辅助与元逆松弛的等价性，并给出舍入近似算法，为纠缠辅助量子信道编码提供了强逆指数的紧刻画。
We consider ergodic causal classical-quantum channels (cq-channels) which additionally have a decaying input memory. In the first part we develop some structural properties of ergodic cq-channels and provide equivalent conditions for ergodicity. In the second part we prove the coding theorem with weak converse for causal ergodic cq-channels with decaying input memory. Our proof is based on the possibility to introduce joint input-output state for the cq-channels and an application of the Shannon-McMillan theorem for ergodic quantum states. In the last part of the paper it is shown how this res…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。