English
Related papers

Related papers: Capacities of classical compound quantum wiretap a…

200 papers

We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a…

Quantum Physics · Physics 2011-10-25 Jon Yard , Patrick Hayden , Igor Devetak

Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be…

Quantum Physics · Physics 2009-02-20 Graeme Smith , Jon Yard

We find a tight upper bound for the classical capacity of quantum thermal noise channels that is within $1/\ln 2$ bits of Holevo's lower bound. This lower bound is achievable using unentangled, classical signal states, namely displaced…

Quantum Physics · Physics 2013-02-05 Robert Koenig , Graeme Smith

The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~\cite{HCT}. The proof of coding theorems is given for the classical capacity and…

Quantum Physics · Physics 2014-08-15 A. A. Kuznetsova , A. S. Holevo

For a partially degradable (PD) channel, the channel output state can be used to simulate the degraded environment state. The quantum capacity of a PD channel has been proven to be additive. Here, we show that the private classical capacity…

Quantum Physics · Physics 2015-06-16 Laszlo Gyongyosi

We calculate and analyze the bounds of the Holevo capacity and classical capacity for the generalized Pauli channels. In particular, we obtain the lower and upper bounds of the Holevo capacity and show that if these bounds coincide, the…

Quantum Physics · Physics 2020-10-28 Katarzyna Siudzińska

In this paper, we calculate the entanglement-assisted classical information capacity of amplitude damping channel and compare it with the particular mutual information which is considered as the entanglement-assisted classical information…

Quantum Physics · Physics 2009-11-10 Xian-Ting Liang

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…

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region is comprised of the rates at which it…

Quantum Physics · Physics 2011-10-25 Jon Yard , Igor Devetak , Patrick Hayden

We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the…

Quantum Physics · Physics 2007-05-23 Peter W. Shor

We study mixed unitary quantum channels generated by irreducible projective unitary representations of finite groups. Under some assumptions on the probability distribution determining a mixture the classical capacity of the channel is…

Quantum Physics · Physics 2022-05-26 Grigori Amosov

We analyze the quantum binary adder channel, i.e. the quantum generalization of the classical, and well-studied, binary adder channel: in this model qubits rather than classical bits are transmitted. This of course is as special case of the…

Quantum Physics · Physics 2007-05-23 Gleb V. Klimovitch , Andreas Winter

The quantum channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known.…

Quantum Physics · Physics 2011-03-31 Markus Grassl , Zhengfeng Ji , Zhaohui Wei , Bei Zeng

Finding the optimal encoding strategies can be challenging for communication using quantum channels, as classical and quantum capacities may be superadditive. Entanglement assistance can often simplify this task, as the…

Quantum Physics · Physics 2017-08-01 Elton Yechao Zhu , Quntao Zhuang , Peter W. Shor

Capacity bounds for waveform channels under square-law detection of time-limited complex-valued signals are derived. The upper bound is the capacity of the channel under (complex-valued) coherent detection. The lower bound is one bit less,…

Information Theory · Computer Science 2021-05-31 Amir Tasbihi , Frank R. Kschischang

The information capacities and ``distillability'' of a quantum channel are studied in the presence of auxiliary resources. These include prior entanglement shared between the sender and receiver and free classical bits of forward and…

Quantum Physics · Physics 2009-11-10 Vittorio Giovannetti

The classical capacity of a quantum channel with arbitrary Markovian correlated noise is evaluated. For the general case of a channel with long-term memory, which corresponds to a Markov chain which does not converge to equilibrium, the…

Quantum Physics · Physics 2015-05-13 Nilanjana Datta , Tony Dorlas

We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, that we define similarly to the Holevo capacity,…

Quantum Physics · Physics 2009-07-24 Milan Mosonyi , Nilanjana Datta

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the…

Quantum Physics · Physics 2010-03-19 Francesco Buscemi , Nilanjana Datta

We consider the additivity of the minimal output entropy and the classical information capacity of a class of quantum channels. For this class of channels the norm of the output is maximized for the output being a normalized projection. We…

Quantum Physics · Physics 2009-11-10 M. M. Wolf , J. Eisert