English
Related papers

Related papers: Fully Quantum Arbitrarily Varying Channels: Random…

200 papers

We consider the problem of communicating over a classical-quantum (CQ) multiple access channel with random classical states non-causally available at the transmitter, referred to as a QMSTx. QMSTx is a classical-quantum multiple access…

Information Theory · Computer Science 2022-03-15 Arun Padakandla

The primary objective of quantum Shannon theory is to evaluate the capacity of quantum channels. In spite of the existence of rigorous coding theorems that quantify the transmission of information through quantum channels, superadditivity…

Quantum Physics · Physics 2024-01-17 Rajiuddin Sk , Prasanta K. Panigrahi

The set of Multi-level Amplitude Damping (MAD) quantum channels is introduced as a generalization of the standard qubit Amplitude Damping Channel to quantum systems of finite dimension $d$. In the special case of $d=3$, by exploiting…

Quantum Physics · Physics 2021-03-03 Stefano Chessa , Vittorio Giovannetti

We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive direct and converse bounds for the one-shot capacity…

Quantum Physics · Physics 2023-02-14 Eyuri Wakakuwa , Yoshifumi Nakata

We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans.…

Quantum Physics · Physics 2015-06-01 Joseph M. Renes

We analyse families of codes for classical data transmission over quantum channels that have both a vanishing probability of error and a code rate approaching capacity as the code length increases. To characterise the fundamental tradeoff…

Quantum Physics · Physics 2017-08-23 Christopher T. Chubb , Vincent Y. F. Tan , Marco Tomamichel

Random access codes (RACs) are used by a party to despite limited communication access an arbitrary subset of information held by another party. Quantum resources are known to enable RACs that break classical limitations. Here, we study…

Quantum Physics · Physics 2015-06-11 Armin Tavakoli , Alley Hameedi , Breno Marques , Mohamed Bourennane

We demonstrate superadditivity of one-shot zero-error classical capacity in an asymmetric communication setting where a noisy classical channel is used in parallel with a perfect quantum channel. Each channel individually supports only a…

Quantum Physics · Physics 2026-02-10 Ambuj , Anushko Chattopadhyay , Kunika Agarwal , Rakesh Das , Amit Mukherjee

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

Current advancements in communication equipment demand the investigation of classical information transfer over quantum channels, by encompassing realistic scenarios in finite dimensions. To address this issue, we develop a framework for…

Quantum Physics · Physics 2026-01-08 Sudipta Mondal , Pritam Halder , Saptarshi Roy , Aditi Sen De

In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword $(x_1,...,x_n)$…

Information Theory · Computer Science 2016-11-17 Bikash Kumar Dey , Sidharth Jaggi , Michael Langberg , Anand D. Sarwate

In communication networks many different channels must share a limited amount of resources. In order to allow for multiple simultaneous communications, multiple access techniques are routinely employed. With quantum communication, it is…

Quantum Physics · Physics 2007-05-23 Juan Carlos Garcia-Escartin , Pedro Chamorro-Posada

This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is…

Quantum Physics · Physics 2016-05-30 Hirotada Kobayashi , François Le Gall , Harumichi Nishimura , Martin Roetteler

The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…

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

A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept…

Quantum Physics · Physics 2016-11-17 Tomohiro Ogawa , Hiroshi Nagaoka

A quantum communication channel can be put to many uses: it can transmit classical information, private classical information, or quantum information. It can be used alone, with shared entanglement, or together with other channels. For each…

Information Theory · Computer Science 2010-07-20 Graeme Smith

We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…

Information Theory · Computer Science 2020-01-10 Yihan Zhang , Shashank Vatedka , Sidharth Jaggi

Standard communication systems have transmission spectra that characterize their ability to perform frequency multiplexing over a finite bandwidth. Realistic quantum signals in quantum communication systems like transducers are inherently…

Quantum Physics · Physics 2025-02-14 Aditya Gandotra , Zhaoyou Wang , Aashish A. Clerk , Liang Jiang

We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost…

Information Theory · Computer Science 2022-05-16 Yihan Zhang , Sidharth Jaggi , Michael Langberg , Anand D. Sarwate
‹ Prev 1 4 5 6 7 8 10 Next ›