English
Related papers

Related papers: Strong Converse to the Quantum Channel Coding Theo…

200 papers

We study the robustness of quantum computers under the influence of errors modelled by strictly contractive channels. A channel $T$ is defined to be strictly contractive if, for any pair of density operators $\rho,\sigma$ in its domain, $\|…

Quantum Physics · Physics 2007-05-23 Maxim Raginsky

Though the theory of quantum error correction is intimately related to the classical coding theory, in particular, one can construct quantum error correction codes (QECCs) from classical codes with the dual containing property, this does…

Quantum Physics · Physics 2011-09-08 Min-Hsiu Hsieh , Francois Le Gall

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

We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum system, multiple identical copies of which are shared between…

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

We show that it is possible for the so-called weak locking capacity of a quantum channel [Guha et al., PRX 4:011016, 2014] to be much larger than its private capacity. Both reflect different ways of capturing the notion of reliable…

Quantum Physics · Physics 2017-01-06 Andreas Winter

We prove that the Gaussian broadcast channel with two destinations admits the strong converse property. This implies that for every sequence of block codes operated at a common rate pair with an asymptotic average error probability $<1$,…

Information Theory · Computer Science 2017-06-09 Silas L. Fong , Vincent Y. F. Tan

The Quantum Reverse Shannon Theorem has been a milestone in quantum information theory. It states that asymptotically reliable simulation of a quantum channel, assisted by unlimited shared entanglement, requires a rate of classical…

Quantum Physics · Physics 2025-02-18 Ke Li , Yongsheng Yao

Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly…

Quantum Physics · Physics 2024-04-15 Paula Belzig , Matthias Christandl , Alexander Müller-Hermes

Coded source compression, also known as source compression with helpers, has been a major variant of distributed source compression, but has hitherto received little attention in the quantum regime. This work treats and solves the…

Information Theory · Computer Science 2019-03-08 Min-Hsiu Hsieh , Shun Watanabe

We investigate a quantum coding for quantum communication over a PD (partially degradable) degradable quantum channel. For a PD channel, the degraded environment state can be expressed from the channel output state up to a degrading map. PD…

Quantum Physics · Physics 2016-11-18 Laszlo Gyongyosi

This paper considers quantum network coding, which is a recent technique that enables quantum information to be sent on complex networks at higher rates than by using straightforward routing strategies. Kobayashi et al. have recently showed…

Quantum Physics · Physics 2015-06-05 Takahiko Satoh , Francois Le Gall , Hiroshi Imai

The fundamental limit of Semantic Communications (joint source-channel coding) is established when the transmission needs to be kept covert from an external warden. We derive information-theoretic achievability and matching converse results…

Information Theory · Computer Science 2024-06-21 Abdelaziz Bounhar , Mireille Sarkiss , Michèle Wigger

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…

Quantum operations, or quantum channels cannot be inverted in general. An arbitrary state passing through a quantum channel looses its fidelity with the input. Given a quantum channel ${\cal E}$, we introduce the concept of its…

Quantum Physics · Physics 2020-03-25 Vahid Karimipour , Fabio Benatti , Roberto Floreanini

We propose a method to detect lower bounds to quantum capacities of a noisy quantum communication channel by means of few measurements. The method is easily implementable and does not require any knowledge about the channel. We test its…

Quantum Physics · Physics 2016-04-12 Chiara Macchiavello , Massimiliano F. Sacchi

Due to the impossibility results of Mayers and Lo/Chau it is generally thought that a quantum channel is cryptographically strictly weaker than oblivious transfer. In this paper we prove that in a three party scenario a quantum channel can…

Quantum Physics · Physics 2007-05-23 J. Mueller-Quade , H. Imai

We consider the reverse problem to the distinguishability of two quantum channels, which we call the disguising problem. Given two quantum channels, the goal here is to make the two channels identical by mixing with some other channels with…

Quantum Physics · Physics 2014-02-25 Chi-Hang Fred Fung , H. F. Chau

Quantum coherence is a fundamental aspect of quantum physics and plays a central role in quantum information science. This essential property of the quantum states could be fragile under the influence of the quantum operations. The extent…

Quantum Physics · Physics 2018-10-18 Fereshte Shahbeigi , Seyed Javad Akhtarshenas

We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer…

Quantum Physics · Physics 2019-04-29 Holger Boche , Christian Deppe , Janis Nötzel , Andreas Winter

In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x =(x_1,...,x_n) in {0,1}^n bit by bit via a channel limited to at most pn corruptions. The channel is online in the sense…

Information Theory · Computer Science 2015-03-17 Ishay Haviv , Michael Langberg