English
Related papers

Related papers: Partial orders and contraction for BISO channels

200 papers

We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…

Quantum Physics · Physics 2008-08-28 Graeme Smith , John A. Smolin , Andreas Winter

In 2018, Renes [IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 577-592 (2018)] (arXiv:1701.05583) developed a general theory of channel duality for classical-input quantum-output (CQ) channels. That result showed that a number of well-known…

Information Theory · Computer Science 2021-03-17 Narayanan Rengaswamy , Henry D. Pfister

In this paper, a novel robust beamforming scheme is proposed in three dimensional multi-input multi-output (3D-MIMO) systems. As one of the typical deployments of massive MIMO, a 3D-MIMO system owns sparse channels in angular domain. Thus,…

Signal Processing · Electrical Eng. & Systems 2018-12-19 Kai Liu , Hui Feng , Tao Yang , Bo Hu

We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the epsilon-capacity as well as necessary and sufficient conditions for the…

Information Theory · Computer Science 2014-07-16 Marco Tomamichel , Vincent Y. F. Tan

Evaluating the quantum capacity of quantum channels is an important but difficult problem, even for channels of low input and output dimension. Smith and Smolin showed that the quantum capacity of the Clifford-twirl of a qubit amplitude…

Quantum Physics · Physics 2021-10-12 Yingkai Ouyang

We show that $T$ rounds of interaction over the binary symmetric channel $BSC_{1/2-\epsilon}$ with feedback can be simulated with $O(\epsilon^2 T)$ rounds of interaction over a noiseless channel. We also introduce a more general "energy…

Information Theory · Computer Science 2014-09-16 Mark Braverman , Jieming Mao

In the first part of this work we show how certain techniques from quantum information theory can be used in order to obtain very sharp embeddings between noncommutative $L_p$-spaces. Then, we use these estimates to study the classical…

Operator Algebras · Mathematics 2014-07-30 Marius Junge , Carlos Palazuelos

The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum…

This paper concerns the maximum-likelihood channel estimation for MIMO systems with orthogonal space-time block codes when the finite alphabet constraint of the signal constellation is relaxed. We study the channel coefficients estimation…

Information Theory · Computer Science 2020-05-26 Kamran Kalbasi , S. Jamaloddin Golestani

We consider transmission of stationary and ergodic sources over non-ergodic composite channels with channel state information at the receiver (CSIR). Previously we introduced alternate capacity definitions to Shannon capacity, including the…

Information Theory · Computer Science 2009-02-27 Yifan Liang , Andrea Goldsmith , Michelle Effros

We address the question of finding the most effective convex decompositions into boundary elements (so-called boundariness) for sets of quantum states, observables and channels. First we show that in general convex sets the boundariness…

Quantum Physics · Physics 2015-09-28 Zbigniew Puchała , Anna Jencova , Michal Sedlak , Mario Ziman

This work proposes lossless and near-lossless compression algorithms for multi-channel biomedical signals. The algorithms are sequential and efficient, which makes them suitable for low-latency and low-power signal transmission…

Information Theory · Computer Science 2016-05-17 Ignacio Capurro , Federico Lecumberry , Álvaro Martín , Ignacio Ramírez , Eugenio Rovira , Gadiel Seroussi

This work studies distributed compression for the uplink of a cloud radio access network where multiple multi-antenna base stations (BSs) are connected to a central unit, also referred to as cloud decoder, via capacity-constrained backhaul…

Information Theory · Computer Science 2012-06-19 Seok-Hwan Park , Osvaldo Simeone , Onur Sahin , Shlomo Shamai

We investigate the duality of the binary erasure channel (BEC) and the binary defect channel (BDC). This duality holds for channel capacities, capacity achieving schemes, minimum distances, and upper bounds on the probability of failure to…

Information Theory · Computer Science 2018-03-09 Yongjune Kim , B. V. K. Vijaya Kumar

We consider the transmission of classical information through a degraded broadcast channel, whose outputs are two quantum systems, with the state of one being a degraded version of the other. Yard et al. proved that the capacity region of…

Quantum Physics · Physics 2019-05-03 Hao-Chung Cheng , Nilanjana Datta , Cambyse Rouzé

We give a criterion to differentiate between dissipative and diffusive quantum operations. It is based on the classical idea that dissipative processes contract volumes in phase space. We define a quantity that can be regarded as ``quantum…

Quantum Physics · Physics 2010-03-31 Ignacio Garcia-Mata , Marcos Saraceno , Maria Elena Spina , Gabriel Carlo

Dynamics of coded information over Bloch channels is investigated for different values of the channel's parameters. We show that, the suppressing of the travelling coded information over Bloch channel can be increased by decreasing the…

Quantum Physics · Physics 2015-05-19 Nasser Metwally

We derive exact analytical expressions for the quantum capacity of a broad subclasses of generalized dephasing channels of the form $\Lambda(\rho)=(1-x)\rho + x D(\rho)$, where $D(\rho)$ represents a structured decoherence process. These…

Quantum Physics · Physics 2025-11-26 Shayan Roofeh , Vahid Karimipour

In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an…

Information Theory · Computer Science 2016-05-10 Yonglong Li , Guangyue Han

For a singular and symmetric discrete memoryless channel with positive dispersion, the third-order term in the normal approximation is shown to be upper bounded by a constant. This finding completes the characterization of the third-order…

Information Theory · Computer Science 2013-09-23 Yucel Altug , Aaron B. Wagner
‹ Prev 1 8 9 10 Next ›