Related papers: Quantum Coding with Finite Resources
The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of information which can be transmitted reliably over that channel. To evaluate the strong capacity of a particular channel one must prove both…
We analyze different aspects of multiparty communication over quantum memoryless channels and generalize some of key results known from bipartite channels to that of multiparty scenario. In particular, we introduce multiparty versions of…
Losses in quantum communication lines severely affect the rates of reliable information transmission and are usually considered to be state-independent. However, the loss probability does depend on the system state in general, with the…
The implementation of realistic quantum devices requires a solid understanding of the nonlocal resources present in quantum channels, and the effects of decoherence on them. Here we quantify nonlocality of bipartite quantum channels and…
An important distinction in our understanding of capacities of classical versus quantum channels is marked by the following question: is there an algorithm which can compute (or even efficiently compute) the capacity? While there is…
We introduce potential capacities of quantum channels in an operational way and provide upper bounds for these quantities, which quantify the ultimate limit of usefulness of a channel for a given task in the best possible context.…
With steady progress in the development of quantum networks, the question on how to best provide end-to-end characterization of such networks (Quantum Network Tomography) is quickly becoming more pressing. Initial results demonstrated how…
The optimal rate at which information can be sent through a quantum channel when the transmitted signal must simultaneously carry some minimum amount of energy is characterized. To do so, we introduce the quantum-classical analogue of the…
Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and…
The qubit depolarizing channel with noise parameter $\eta$ transmits an input qubit perfectly with probability $1-\eta$, and outputs the completely mixed state with probability $\eta$. We show that its complementary channel has positive…
We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of…
Polar coding, introduced 2008 by Arikan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the…
Quantum information processing exploits the quantum nature of information. It offers fundamentally new solutions in the field of computer science and extends the possibilities to a level that cannot be imagined in classical communication…
We determine the capacity of compound classical-quantum channels. As a consequence we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical…
With the rapid developments in quantum hardware comes a push towards the first practical applications on these devices. While fully fault-tolerant quantum computers may still be years away, one may ask if there exist intermediate forms of…
We consider how randomness can be made to play a useful role in quantum information processing - in particular, for decoherence control and the implementation of quantum algorithms. For a two-level system in which the decoherence channel is…
We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective…
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, decoherence (a physical channel acting on qubits in the codeword) and recovery can be represented exactly by an effective channel acting…
The trade-off capacity region of a quantum channel characterizes the optimal net rates at which a sender can communicate classical, quantum, and entangled bits to a receiver by exploiting many independent uses of the channel, along with the…
This paper establishes the capacity region of a class of broadcast channels with random state in which each channel component is selected from two possible functions and each receiver knows its state sequence. This channel model does not…