English
Related papers

Related papers: Optimality of meta-converse for channel simulation

200 papers

Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the Pauli channels, when the noise on consecutive uses of the channel has some partial correlations. In this Paper, we study…

Quantum Physics · Physics 2015-06-26 A. Fahmi , M. Golshani

Given a quantum channel -- that is, a completely positive trace-preserving linear map -- as the only communication resource available between two parties, we consider the problem of characterizing the set of classical noisy channels that…

Quantum Physics · Physics 2021-05-04 Michele Dall'Arno , Sarah Brandsen , Francesco Buscemi

Entanglement offers substantial advantages in quantum information processing, but loss and noise hinder its applications in practical scenarios. Although it has been well known for decades that the classical communication capacity over…

Quantum Physics · Physics 2020-03-16 Haowei Shi , Zheshen Zhang , Quntao Zhuang

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

We show that the communication cost of quantum broadcast channel simulation under free entanglement assistance between the sender and the receivers is asymptotically characterized by an efficiently computable single-letter formula in terms…

Quantum Physics · Physics 2023-05-05 Hao-Chung Cheng , Li Gao , Mario Berta

We address the problem of coding for classical broadcast channels, which entails maximizing the success probability that can be achieved by sending a fixed number of messages over a broadcast channel. For point-to-point channels, Barman and…

Information Theory · Computer Science 2024-12-10 Omar Fawzi , Paul Fermé

Quantum channels describe subsystem or open system evolution. Using the classical Koopman operator that evolves functions on phase space, 4 classical Koopman channels are identified that are analogs of the 4 possible quantum channels in a…

Quantum Physics · Physics 2024-07-22 Bidhi Vijaywargia , Arul Lakshminarayan

It is well known that quantum theory forbids the exact copying of an unknown quantum state. Therefore in broadcasting of classical information by a quantum channel an additional contribution to the error in the decoding is expected. We…

Quantum Physics · Physics 2007-05-23 A. E. Allahverdyan , D. B. Saakian

Suppose that $m$ senders want to transmit classical information to $n$ receivers with zero probability of error using a noisy multipartite communication channel. The senders are allowed to exchange classical, but not quantum, messages among…

Quantum Physics · Physics 2009-06-25 Runyao Duan , Yaoyun Shi

A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of…

Quantum Physics · Physics 2013-05-29 Robert Koenig , Stephanie Wehner

We prove that any perfect quantum strategy for the two-prover game encoding a constraint satisfaction problem (CSP) can be simulated via a perfect classical strategy with an extra classical communication channel, whose size depends only on…

Quantum Physics · Physics 2025-04-01 Demian Banakh , Lorenzo Ciardo , Marcin Kozik , Jan Tułowiecki

Phenomena induced by the existence of entanglement, such as nonlocal correlations, exhibit characteristic properties of quantum mechanics distinguishing from classical theories. When entanglement is accompanied by classical communication,…

Quantum Physics · Physics 2018-01-03 Seiseki Akibue , Masaki Owari , Go Kato , Mio Murao

We investigate the dense coding in the case of non-symmetric Hilbert spaces of the sender and receiver's particles sharing the quantum maximally entangled state. The efficiency of classical information gain is also considered. We conclude…

Quantum Physics · Physics 2009-11-10 Fengli Yan , Meiyu Wang

We describe two quantum channels that individually cannot send any information, even classical, without some chance of decoding error. But together a single use of each channel can send quantum information perfectly reliably. This proves…

Quantum Physics · Physics 2011-12-19 Jianxin Chen , Toby S. Cubitt , Aram W. Harrow , Graeme Smith

This thesis will be focused on the classical capacity of quantum channels, one of the first areas treated by quantum information theorists. The problem is fairly solved since some years. Nevertheless, this work will give me a reason to…

Quantum Physics · Physics 2016-09-08 David A. Herrera-Martí

We present a formal quantum mechanical analysis of the communication protocol of Prevedel {\it et al.}\ [Phys. Rev. Lett. \textbf{106}, 110505 (2011)], in which entanglement shared by sender and receiver is used to enhance, beyond that…

Quantum Physics · Physics 2011-09-07 H. Thomas Williams , Paul Bourdon

A promising platform for semi-device-independent quantum information is prepare-and-measure experiments restricted only by a bound on the energy of the communication. Here, we investigate the role of shared entanglement in such scenarios.…

Quantum Physics · Physics 2026-03-19 Carles Roch I Carceller , Armin Tavakoli

The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender and receiver) is needed in order to simulate many copies of a quantum channel in the presence of free classical communication. In this…

Quantum Physics · Physics 2015-11-03 Mario Berta , Fernando Brandao , Matthias Christandl , Stephanie Wehner

A phase reference has been a standard requirement in continuous-variable quantum sensing and communication protocols. However, maintaining a phase reference is challenging due to environmental fluctuations, preventing quantum phenomena such…

Quantum Physics · Physics 2021-02-12 Quntao Zhuang

It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic channel and network conditions. However, these algorithms achieve a hypothetical rate region which does not take into account the overhead…

Networking and Internet Architecture · Computer Science 2019-11-12 Mehmet Karaca , Tansu Alpcan , Ozgur Ercetin
‹ Prev 1 4 5 6 7 8 10 Next ›