English
Related papers

Related papers: On the classical capacity of quantum Gaussian chan…

200 papers

Quantum entropy inequalities are studied. Some quantum entropy inequalities are obtained by several methods. For entanglement breaking channel, we show that the entanglement-assisted classical capacity is upper bounded by $\log d$. A…

Quantum Physics · Physics 2009-11-07 Heng Fan

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 study multi-qubit quantum channels that can be represented as a product of one-mode fermionic attenuation channels. An explicit formula for the classical capacity $C_1$ and for the minimum output entropy $S_{min}$ of these channels is…

Quantum Physics · Physics 2007-05-23 Sergey Bravyi

A generic quantum channel can be represented in terms of a unitary interaction between the information-carrying system and a noisy environment. Here, the minimal number of quantum Gaussian environmental modes required to provide a unitary…

Quantum Physics · Physics 2015-05-19 Filippo Caruso , Jens Eisert , Vittorio Giovannetti , Alexander S. Holevo

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 Physics · Physics 2025-01-10 Bishal Kumar Das , Lav R. Varshney , Vaibhav Madhok

Upper bounds for private communication over quantum channels can be derived by adopting channel simulation, protocol stretching, and relative entropy of entanglement. All these ingredients have led to single-letter upper bounds to the…

Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within one bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users.…

Information Theory · Computer Science 2016-11-17 Guy Bresler , Abhay Parekh , David Tse

Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus, a vast amount of literature is devoted to finding tight and computable bounds on these…

Quantum Physics · Physics 2023-03-02 Christoph Hirche , Felix Leditzky

New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain…

Information Theory · Computer Science 2008-01-04 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

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

In this paper we prove two results related to the Gaussian optimizers conjecture for multimode bosonic system with gauge symmetry. First, we argue that the classical capacity of a Gaussian observable is attained on a Gaussian ensemble of…

Quantum Physics · Physics 2020-08-31 A. S. Holevo

In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary…

Information Theory · Computer Science 2019-01-24 Ather Gattami

In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is,…

Quantum Physics · Physics 2010-07-19 Ciara Morgan

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

We prove that whenever the coherent information of a one-mode Gaussian channel is non-zero its supremum is achieved for the infinite input power. This is a well established fact for the zero added classical noise, whereas the nonzero case…

Quantum Physics · Physics 2016-02-08 Kamil Bradler

The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we…

Quantum Physics · Physics 2013-01-29 Ligong Wang , Renato Renner

We investigate the capacity of three symmetric quantum states in three real dimensions to carry classical information. Several such capacities have already been defined, depending on what operations are allowed in the sending and receiving…

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

The process of quantum teleportation can be considered as a quantum channel. The exact classical capacity of the continuous variable teleportation channel is given. Also, the channel fidelity is derived. Consequently, the properties of the…

Quantum Physics · Physics 2015-06-26 Tao Qin , Meisheng Zhao , Yongde Zhang

We define syntax and semantics of quantum circuits, allowing measurement gates and classical channels. We define circuit-based quantum algorithms and prove that, semantically, any such algorithm is equivalent to a single measurement that…

Quantum Physics · Physics 2021-07-20 Yuri Gurevich , Andreas Blass

A quantum version of the action principle is formulated in terms of real parameters of a wave functional. The classical limit of the quantum action of a harmonic oscillator is obtained.

Quantum Physics · Physics 2008-10-14 Natalya Gorobey , Alexander Lukyanenko