Related papers: Constant Compositions in the Sphere Packing Bound …
Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in…
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…
A new method, dual-space cluster expansion, is proposed to study classical phases transitions in the continuum. It relies on replacing the particle positions as integration variables by the momenta of the relative displacements of particle…
We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
At large quantum numbers, the probability densities for particle-in-a-box or simple harmonic oscillator converge to the classical result upon coarse-graining the quantum mechanical probability densities by introducing a finite resolution in…
We present a proof for the quantum channel coding theorem which relies on the fact that a randomly chosen code space typically is highly suitable for quantum error correction. In this sense, the proof is close to Shannon's original…
We consider the transmission of classical information over a quantum channel by two senders. The channel capacity region is shown to be a convex hull bound by the Von Neumann entropy and the conditional Von Neumann entropy. We discuss some…
A density matrix formulation of classical bipartite correlations is constructed. This leads to an understanding of the appearance of classical statistical correlations intertwined with the quantum correlations as well as a physical…
The auxiliary function of a classical channel appears in two fundamental quantities that upper and lower bound the error probability, respectively. A crucial property of the auxiliary function is its concavity, which leads to several…
This paper continues the analysis of bound quantum systems started in (T. Yarman, A.L. Kholmetskii and O.V. Missevitch. Going from classical to quantum description of bound charged particles. Part 1: basic concepts and assertions), based on…
Quantum channels describe subsystem or open system evolution. Using the classical Koopman operator that evolves functions on phase space, 4 classical Koopman channels are identified that are analogs of the 4 possible quantum channels in a…
Finding the optimal encoding strategies can be challenging for communication using quantum channels, as classical and quantum capacities may be superadditive. Entanglement assistance can often simplify this task, as the…
Superadditivity effects in the classical capacity of discrete multi-access channels (MACs) and continuous variable (CV) Gaussian MACs are analysed. New examples of the manifestation of superadditivity in the discrete case are provided…
We introduce a new quantum decoder based on a variant of the pretty good measurement, but defined via an alternative matrix quotient. We use this decoder to show new lower bounds on the error exponent both in the one-shot and asymptotic…
Channel resolvability concerns the minimum resolution for approximating the channel output. We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed…
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…
We propose a novel approach for bounding the probability of error of discrete memoryless channels with a zero-error capacity based on a combination of Lov\'asz' and Gallager's ideas. The obtained bounds are expressed in terms of a function…
A packing lemma is proved using a setting where the channel is a binary-input discrete memoryless channel $(\mathcal{X},w(y|x),\mathcal{Y})$, the code is selected at random subject to parity-check constraints, and the decoder is a joint…
Establishing the sphere packing bound for block codes on the discrete stationary product channels with feedback ---which are commonly called the discrete memoryless channels with feedback--- was considered to be an open problem until…