English
Related papers

Related papers: Strong Converse Exponent for Entanglement-Assisted…

200 papers

Dense coding is the seminal example of how entanglement can boost qubit communication, from sending one bit to sending two bits. This is made possible by projecting separate particles onto a maximally entangled basis. We investigate more…

Constructing large-scale quantum resources is an important foundation for further improving the efficiency and scalability of quantum communication. Here, we present an efficient extraction and stable control scheme of 40 pairs of entangled…

Quantum Physics · Physics 2025-08-11 Xuan Liu , Shaoping Shi , Yimiao Wu , Xuan Wang , Long Tian , Wei Li , Yajun Wang , Yaohui Zheng

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

The squashed entanglement of a quantum channel is an additive function of quantum channels, which finds application as an upper bound on the rate at which secret key and entanglement can be generated when using a quantum channel a large…

Quantum Physics · Physics 2016-04-26 Kaushik P. Seshadreesan , Masahiro Takeoka , Mark M. Wilde

Several relations between the Holevo capacity and the entanglement-assisted classical capacity of a quantum channel are proved, necessary and sufficient conditions for their coincidence are obtained. In particular, it is shown that these…

Quantum Physics · Physics 2012-08-10 M. E. Shirokov

Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing, where Receiver 1 can send classical messages to Receiver 2. Another…

Information Theory · Computer Science 2021-06-18 Uzi Pereg , Christian Deppe , Holger Boche

Quantum resources, such as entanglement or quantum communication, offer significant communication advantages in information processing. We develop an operational framework for realizing these communication advantages in resource-constrained…

Quantum Physics · Physics 2026-04-16 Brian Doolittle , Felix Leditzky , Eric Chitambar

The Holevo quantity provides an upper bound for the mutual information between the sender of a classical message encoded in quantum carriers and the receiver. Applying the strong sub-additivity of entropy we prove that the Holevo quantity…

Quantum Physics · Physics 2015-05-18 Wojciech Roga , Mark Fannes , Karol Zyczkowski

We study message identification over a q-ary uniform permutation channel, where the transmitted vector is permuted by a permutation chosen uniformly at random. For discrete memoryless channels(DMCs), the number of identifiable messages…

Information Theory · Computer Science 2024-09-23 Abhishek Sarkar , Bikash Kumar Dey

Werner states have a host of interesting properties, which often serve to illuminate the unusual properties of quantum information. Starting from these states, one may define a family of quantum channels, known as the Holevo-Werner…

Quantum Physics · Physics 2018-11-15 Thomas P. W. Cope , Kenneth Goodenough , Stefano Pirandola

This work explores entanglement-assisted communication, where quantum entanglement resources enable the transmission of classical information at an enhanced rate. We consider a scenario where entanglement is distributed ahead of time based…

Quantum Physics · Physics 2023-08-01 Stephen DiAdamo , Janis Nötzel

In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical model, our bound extends the well known upper bound of Kremer, Nisan and…

Information Theory · Computer Science 2008-02-29 Rahul Jain , Shengyu Zhang

Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy…

Quantum Physics · Physics 2026-02-20 Mario Berta , Hao-Chung Cheng , Yongsheng Yao

The R\'enyi and Shannon entropies are information-theoretic measures which have enabled to formulate the position-momentum uncertainty principle in a much more adequate and stringent way than the (variance-based) Heisenberg-like relation.…

Quantum Physics · Physics 2013-05-24 Pablo Sánchez-Moreno , Steeve Zozor , Jesus S. Dehesa

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

For a discrete memoryless channel with finite input and output alphabets, we prove convergence of a parametric family of iterative computations of the optimal correct-decoding exponent. The exponent, as a function of communication rate, is…

Information Theory · Computer Science 2020-05-18 Sergey Tridenski , Anelia Somekh-Baruch , Ram Zamir

Suppose Alice and Bob share a maximally entangled state of any finite dimension and each perform two-outcome measurements on the respective part of the state. It is known, due to the recent result of Regev and Toner, that if a classical…

Quantum Physics · Physics 2015-05-13 T. Vértesi , E. Bene

We review recent results on the simulation of quantum channels, the reduction of adaptive protocols (teleportation stretching), and the derivation of converse bounds for quantum and private communication, as established in PLOB [Pirandola,…

We investigate the use of noisy entanglement as a resource in classical communication via a quantum channel. In particular, we are interested in the question whether for any entangled state, including bound entangled states, there exists a…

Quantum Physics · Physics 2019-07-31 Stefan Bäuml , Andreas Winter , Dong Yang

We consider a broadcast channel with a degraded message set, in which a single transmitter sends a common message to two receivers and a private message to one of the receivers only. The main goal of this work is to find new lower bounds to…

Information Theory · Computer Science 2009-06-09 Yonatan Kaspi , Neri Merhav
‹ Prev 1 8 9 10 Next ›