Related papers: The Quantum Reverse Shannon Theorem based on One-S…
Capacities of quantum channels are fundamental quantities in the theory of quantum information. A desirable property is the additivity for a capacity. However, this cannot be achieved for a few quantities that have been established as…
A fundamental quantity of interest in Shannon theory, classical or quantum, is the optimal error exponent of a given channel W and rate R: the constant E(W,R) which governs the exponential decay of decoding error when using ever larger…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…
Nonclassical correlations between the quadrature-phase amplitudes of two spatially separated optical beams are exploited to realize a two-channel quantum communication experiment with a high degree of immunity to interception. For this…
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…
Non-asymptotic quantum Shannon theory analyses how to transmit quantum information across a quantum channel as efficiently as possible within a specified error tolerance, given access to a finite, fixed, number of channel uses. In a recent…
Shannon in celebrated works had shown that n bits of shared key is necessary and sufficient to transmit n-bit classical information in an information-theoretically secure way. Ambainis, Mosca, Tapp and de Wolf in quant-ph/0003101 considered…
Network information theory is the study of communication problems involving multiple senders, multiple receivers and intermediate relay stations. The purpose of this thesis is to extend the main ideas of classical network information theory…
Channel simulation is to simulate a noisy channel using noiseless channels with unlimited shared randomness. This can be interpreted as the reverse problem to Shannon's noisy coding theorem. In contrast to previous works, our approach…
State redistribution allows one party to optimally send part of her state to another party. Here we show that this can be derived simply from two applications of coherent state-merging. This provides a protocol whereby a middle party acts…
We present a quantum information theory that allows for the consistent description of quantum entanglement. It parallels classical (Shannon) information theory but is based entirely on density matrices, rather than probability…
The classical sampling Nyquist-Shannon-Kotelnikov theorem states that a band-limited continuous time function can be uniquely recovered without error from a infinite two-sided sampling series taken with a sufficient frequency. This short…
Strong converse theorems refer to the study of impossibility results in information theory. In particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantum hypothesis testing [Comm. Math. Phys, 334(3), 2014], which…
Given one or more uses of a classical channel, only a certain number of messages can be transmitted with zero probability of error. The study of this number and its asymptotic behaviour constitutes the field of classical zero-error…
The capacity of a classical-quantum channel (or in other words the classical capacity of a quantum channel) is considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a…
A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward…
The circuit model of quantum computation is reformulated as a multilayer network theory [3] called a Quantum Multiverse Network (QuMvN). The QuMvN formulation allows us to interpret the quantum wave function as a combination of ergodic…
We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels $(\Xi^n)_{n \in \mathbb{N}}$ modelled as a discrete quantum Markov semigroup, long enough to generate…
As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…
We study the capacity of a quantum channel for retrocausal communication, where messages are transmitted backward in time, from a sender in the future to a receiver in the past, through a noisy postselected closed timelike curve (P-CTC)…