English
Related papers

Related papers: A simple quantum channel having superadditivity of…

200 papers

We investigate multiparty communication scenarios where information is sent from several sender to several receivers. We establish a relation between the quantum capacity of multiparty communication channels and their distillability…

Quantum Physics · Physics 2009-11-10 W. Dür , J. I. Cirac , P. Horodecki

Information theory establishes the fundamental limits on data transmission, storage, and processing. Quantum information theory unites information theoretic ideas with an accurate quantum-mechanical description of reality to give a more…

Quantum Physics · Physics 2017-02-01 Andrew W. Cross , Ke Li , Graeme Smith

The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…

Quantum Physics · Physics 2009-09-24 Bill Rosgen

We investigate the quantum capacity of noisy quantum channels which can be represented by coupling a system to an effectively small environment. A capacity formula is derived for all cases where both system and environment are…

Quantum Physics · Physics 2009-11-13 Michael M. Wolf , David Perez-Garcia

The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real world communication channels…

Quantum Physics · Physics 2009-11-10 Garry Bowen , Igor Devetak , Stefano Mancini

We study subadditivity of the minimum output entropy ($H_{min}$) of quantum multiple access channels (MACs). We provide an example of violation of the additivity theorem for $H_{min}$ known in classical information theory. Our result is…

Quantum Physics · Physics 2012-03-14 Lukasz Czekaj

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

We prove that a broad array of capacities of a quantum channel are continuous. That is, two channels that are close with respect to the diamond norm have correspondingly similar communication capabilities. We first show that the classical…

Quantum Physics · Physics 2009-09-09 Debbie Leung , Graeme Smith

We derive universal codes for simultaneous transmission of classical messages and entanglement through quantum channels, possibly under attack of a malignant third party. These codes are robust to different kinds of channel uncertainty. To…

Mathematical Physics · Physics 2019-03-27 Holger Boche , Gisbert Janßen , Sajad Saeedinaeeni

We present an experimental approach to construct a dephrasure channel, which contains both dephasing and erasure noises, and can be used as an efficient tool to study the superadditivity of coherent information. By using a three-fold…

The unique and often-weird properties of quantum mechanics allow an information carrier to propagate through multiple trajectories of quantum channels simultaneously. This ultimately leads us to quantum trajectories with an indefinite…

Quantum Physics · Physics 2021-10-22 Daryus Chandra , Marcello Caleffi , Angela Sara Cacciapuoti

One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet there are ways of conveying information with exponentially…

Quantum Physics · Physics 2007-05-23 Ashwin Nayak , Amnon Ta-Shma , David Zuckerman

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information…

Quantum Physics · Physics 2021-10-26 Xin Wang

Long-distance optical quantum channels are necessarily lossy, leading to errors in transmitted quantum information, entanglement degradation and, ultimately, poor protocol performance. Quantum states carrying information in the channel can…

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…

Quantum Physics · Physics 2013-05-29 Robert Koenig , Stephanie Wehner

We investigate the classical capacity of two quantum channels with memory: a periodic channel with depolarizing channel branches, and a convex combination of depolarizing channels. We prove that the capacity is additive in both cases. As a…

Quantum Physics · Physics 2009-11-13 Tony Dorlas , Ciara Morgan

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…

Quantum Physics · Physics 2016-11-17 Masahito Hayashi , Hiroshi Nagaoka

This article provides an elementary introduction to Gaussian channels and their capacities. We review results on the classical, quantum, and entanglement assisted capacities and discuss related entropic quantities as well as additivity…

Quantum Physics · Physics 2009-05-15 J. Eisert , M. M. Wolf

We point out a contrasting role the entanglement plays in communication and estimation scenarios. In the first case it brings noticeable benefits at the measurement stage (output super-additivity), whereas in the latter it is the…

Quantum Physics · Physics 2017-07-31 Jan Czajkowski , Marcin Jarzyna , Rafal Demkowicz-Dobrzanski

We present two approaches for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum…

Quantum Physics · Physics 2015-11-12 Ivan Savov , Mark M. Wilde