English
Related papers

Related papers: Strong Converse for Classical-Quantum Degraded Bro…

200 papers

Using unreliable or noisy components for reliable communication requires error correction. But which noise processes can support information transmission, and which are too destructive? For classical systems any channel whose output depends…

Quantum Physics · Physics 2013-02-05 Graeme Smith , John A. Smolin

The Quantum Reverse Shannon Theorem has been a milestone in quantum information theory. It states that asymptotically reliable simulation of a quantum channel, assisted by unlimited shared entanglement, requires a rate of classical…

Quantum Physics · Physics 2025-02-18 Ke Li , Yongsheng Yao

We analyse the role of entanglement for transmission of classical information through a memoryless depolarising channel. Using the isotropic character of this channel we prove analytically that the mutual information cannot be increased by…

Quantum Physics · Physics 2015-06-26 D. Bruss , L. Faoro , C. Macchiavello , M. Palma

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)…

Quantum Physics · Physics 2026-04-17 Kaiyuan Ji , Seth Lloyd , Mark M. Wilde

This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn whether the legitimate parties are using the…

Information Theory · Computer Science 2017-03-08 Ligong Wang

We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…

Following initial work by Gregoratti and Werner [J. Mod. Optics 50, 913-933, 2003 and quant-ph/0403092] and Hayden and King [quant-ph/0409026], we study the problem of the capacity of a quantum channel assisted by a "friendly (channel)…

Quantum Physics · Physics 2017-08-01 Andreas Winter

A phase reference has been a standard requirement in continuous-variable quantum sensing and communication protocols. However, maintaining a phase reference is challenging due to environmental fluctuations, preventing quantum phenomena such…

Quantum Physics · Physics 2021-02-12 Quntao Zhuang

A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence, the transmitters have access to partial…

Information Theory · Computer Science 2010-12-10 Giacomo Como , Serdar Yüksel

In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical…

Quantum Physics · Physics 2009-11-13 I. Bjelakovic , H. Boche , J. Noetzel

The unavoidable presence of noise is thought to be one of the major problems to solve in order to pave the way for implementing quantum information technologies in realistic physical platforms. However, here we show a clear example in which…

Quantum Physics · Physics 2010-11-03 Filippo Caruso , Susana F. Huelga , Martin B. Plenio

We establish a universal complementarity relation between the capacity of classical information transmission by employing a multiparty quantum state as a multiport quantum channel, and the genuine multipartite entanglement of the quantum…

Quantum Physics · Physics 2013-10-30 R. Prabhu , Aditi Sen De , Ujjwal Sen

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…

Quantum Physics · Physics 2024-08-21 Albert Rico , Moisés Bermejo Morán , Fereshte Shahbeigi , Karol Życzkowski

We study the symmetric-side-channel-assisted private capacity of a quantum channel, for which we provide a single-letter formula. This capacity is additive, convex, and, for degradable channels, equal to the unassisted private capacity.…

Quantum Physics · Physics 2008-08-07 Graeme Smith

An upper limit is given to the amount of quantum information that can be transmitted reliably down a noisy, decoherent quantum channel. A class of quantum error-correcting codes is presented that allow the information transmitted to attain…

Quantum Physics · Physics 2009-10-30 Seth Lloyd

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…

Quantum Physics · Physics 2008-02-03 A. E. Allahverdyan , D. B. Saakian

We show that standard teleportation with an arbitrary mixed state resource is equivalent to a generalized depolarizing channel with probabilities given by the maximally entangled components of the resource. This enables the usage of any…

Quantum Physics · Physics 2009-11-07 G. Bowen , S. Bose

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…

Quantum Physics · Physics 2009-11-13 Maciej Demianowicz , Pawel Horodecki

For any quantum transmission line, with smaller output dimension than its input, the number of classical symbols that can be reliably encoded is strictly suboptimal. In other words, if the channel outputs a lesser number of symbols than it…

Quantum Physics · Physics 2025-09-12 Snehasish Roy Chowdhury , Sutapa Saha , Subhendu B. Ghosh , Ranendu Adhikary , Tamal Guha

We consider the problem of decoding corrupted error correcting codes with NC$^0[\oplus]$ circuits in the classical and quantum settings. We show that any such classical circuit can correctly recover only a vanishingly small fraction of…

Computational Complexity · Computer Science 2024-01-25 Jop Briët , Harry Buhrman , Davi Castro-Silva , Niels M. P. Neumann
‹ Prev 1 8 9 10 Next ›