English
Related papers

Related papers: Quantum superadditivity in linear optics networks:…

200 papers

Gaussian quantum channels are well understood and have many applications, e.g., in Quantum Information Theory and in Quantum Optics. For more general quantum channels one can in general use semiclassical approximations or perturbation…

Quantum Physics · Physics 2023-05-16 Daniel Speed , Wenyang Lyu , Roman Schubert

Additivity violation of minimum output entropy, which shows non-classical properties in quantum communication, had been proved in most cases for random quantum channels defined by Haar-distributed unitary matrices. In this paper, we…

Mathematical Physics · Physics 2021-05-03 Motohisa Fukuda , Takahiro Hasebe , Shinya Sato

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

We explore complementarity between output and environment of a quantum channel (or, more generally, CP map), making an observation that the output purity characteristics for complementary CP maps coincide. Hence, validity of the…

Quantum Physics · Physics 2007-07-05 A. S. Holevo

We investigate the classical and quantum networking regimes of the butterfly network and a group of larger networks constructed with butterfly network blocks. By considering simultaneous multicasts from a set of senders to a set of…

Quantum Physics · Physics 2020-04-03 Kieran N. Wilkinson , Thomas P. W. Cope , Stefano Pirandola

We explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the…

Quantum Physics · Physics 2017-12-18 Wei Xie , Xin Wang , Runyao Duan

Quantum channels can be activated by a kind of channels whose quantum capacity is zero. This activation effect might be useful to overcome noise of channels by attaching other channels which can enhance the capacity of a given channel. In…

Quantum Physics · Physics 2018-07-26 Youngrong Lim , Soojoon Lee

Prior entanglement between sender and receiver, which exactly doubles the classical capacity of a noiseless quantum channel, can increase the classical capacity of some noisy quantum channels by an arbitrarily large constant factor…

Quantum Physics · Physics 2009-01-23 Charles H. Bennett , Peter W. Shor , John A. Smolin , Ashish V. Thapliyal

Entanglement and quantum information lie at the root of quantum theory. These remarkable resources are generally believed to diminish when systems carrying them interact with their environment. By contrast, we find that engaging a system…

Quantum Physics · Physics 2025-05-28 Vikesh Siddhu

We consider the problem of transmitting classical and quantum information reliably over an entanglement-assisted quantum channel. Our main result is a capacity theorem that gives a three-dimensional achievable rate region. Points in the…

Quantum Physics · Physics 2010-08-23 Min-Hsiu Hsieh , Mark M. Wilde

An expression is derived characterizing the set of admissible rate pairs for simultaneous transmission of classical and quantum information over a given quantum channel, generalizing both the classical and quantum capacities of the channel.…

Quantum Physics · Physics 2007-05-23 I. Devetak , P. W. Shor

A crucial step towards the 6th generation (6G) of networks would be a shift in communication paradigm beyond the limits of Shannon's theory. In both classical and quantum Shannon's information theory, communication channels are generally…

Quantum Physics · Physics 2023-10-24 Marcello Caleffi , Kyrylo Simonov , Angela Sara Cacciapuoti

We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their…

Quantum Physics · Physics 2013-10-09 Holger Boche , Janis Noetzel

We investigate the capacity of bosonic quantum channels for the transmission of quantum information. Achievable rates are determined from measurable moments of the channel by showing that every channel can asymptotically simulate a Gaussian…

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

The multi-access channels in quantum information theory are considered. Classical messages from independent sources, which are represented as some quantum states, are transported by a channel to one address. The messages can interact with…

Quantum Physics · Physics 2007-05-23 A. E. Allahverdyan , D. B. Saakian

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…

Quantum Physics · Physics 2025-05-20 D. -S. Wang

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…

The purpose of this work is to extend the result of previous papers quant-ph/9611023, quant-ph/9703013 to quantum channels with additive constraints onto the input signal, by showing that the capacity of such channel is equal to the…

Quantum Physics · Physics 2007-05-23 A. S. Holevo

We experimentally probe the interplay of the quantum switch with the laws of thermodynamics. The quantum switch places two channels in a superposition of orders and may be applied to thermalizing channels. Quantum-switching thermal channels…

A class of diamond networks are studied where the broadcast component is modelled by two independent bit-pipes. New upper and low bounds are derived on the capacity which improve previous bounds. The upper bound is in the form of a max-min…

Information Theory · Computer Science 2014-01-24 Shirin Saeedi Bidokhti , Gerhard Kramer