English
Related papers

Related papers: Entanglement-Assisted Capacity of Quantum Multiple…

200 papers

Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-existing entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code,…

Quantum Physics · Physics 2009-11-13 Min-Hsiu Hsieh , Igor Devetak , Todd Brun

We address the problem of coding for classical multiple-access channels (MACs) with the assistance of non-signaling correlations between parties. It is well-known that non-signaling assistance does not change the capacity of classical…

Information Theory · Computer Science 2023-09-14 Omar Fawzi , Paul Fermé

We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ \frac{k}{n} = \frac{1}{3}…

Quantum Physics · Physics 2024-10-15 Soham Ghosh , Evagoras Stylianou , Holger Boche

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

Dynamical response functions are fundamental quantities to describe the excited-state properties in quantum many-body systems. Quantum algorithms have been proposed to evaluate these quantities by means of quantum phase estimation (QPE),…

Quantum Physics · Physics 2024-08-27 Rei Sakuma , Shu Kanno , Kenji Sugisaki , Takashi Abe , Naoki Yamamoto

An unexpected breakdown in the existing theory of quantum serial turbo coding is that a quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic. These properties are essential for quantum turbo code families to…

Quantum Physics · Physics 2014-01-28 Mark M. Wilde , Min-Hsiu Hsieh , Zunaira Babar

In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; the embedding of the classical input into quantum is always possible and therefore the classical entanglement-assisted capacity C_{ea} under…

Quantum Physics · Physics 2015-03-16 A. S. Holevo

In this paper we consider the classical capacities of quantum-classical channels corresponding to measurement of observables. Special attention is paid to the case of continuous observables. We give the formulas for unassisted and…

Quantum Physics · Physics 2012-04-24 A. S. Holevo

This paper is essentially a lecture from the author's course on quantum information theory, which is devoted to the result of C. H. Bennett, P. W. Shor, J. A. Smolin and A. V. Thapliyal (quant-ph/0106052) concerning entanglement-assisted…

Quantum Physics · Physics 2009-11-07 A. S. Holevo

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

The entanglement-assisted classical capacity of a quantum channel is known to provide the formal quantum generalization of Shannon's classical channel capacity theorem, in the sense that it admits a single-letter characterization in terms…

Quantum Physics · Physics 2016-05-31 Nilanjana Datta , Marco Tomamichel , Mark M. Wilde

We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple…

Quantum Physics · Physics 2017-08-17 Stefano Pirandola

We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty version of the fully quantum Slepian-Wolf protocol for two…

Quantum Physics · Physics 2012-07-06 David Avis , Patrick Hayden , Ivan Savov

We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of…

Quantum Physics · Physics 2013-06-20 Nilanjana Datta , Min-Hsiu Hsieh

As an alternative to entanglement entropies, the capacity of entanglement becomes a promising candidate to probe and estimate the degree of entanglement of quantum bipartite systems. In this work, we study the typical behavior of…

Mathematical Physics · Physics 2023-01-24 Lu Wei

Optimally encoding classical information in a quantum system is one of the oldest and most fundamental challenges of quantum information theory. Holevo's bound places a hard upper limit on such encodings, while the…

Quantum Physics · Physics 2020-05-28 Dawei Ding , Hrant Gharibyan , Patrick Hayden , Michael Walter

We consider quantum key distribution (QKD) and entanglement distribution using a single-sender multiple-receiver pure-loss bosonic broadcast channel. We determine the unconstrained capacity region for the distillation of bipartite…

Quantum Physics · Physics 2018-03-13 Masahiro Takeoka , Kaushik P. Seshadreesan , Mark M. Wilde

We consider the transmission of classical information over a quantum channel by two senders. The channel capacity region is shown to be a convex hull bound by the Von Neumann entropy and the conditional Von Neumann entropy. We discuss some…

Quantum Physics · Physics 2009-10-31 Minxin Huang , Yongde Zhang , Guang Hou

With entanglement-assisted (EA) formalism, arbitrary classical linear codes are allowed to transform into EAQECCs by using pre-shared entanglement between the sender and the receiver. In this paper, based on classical cyclic MDS codes by…

Information Theory · Computer Science 2021-05-05 Liangdong Lu , Wenping Ma , Ruihu Li , Hao Cao

The necessary and sufficient condition of the channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence of the formulation is to invoke an {\em elementary} MAC where sizes of…

Information Theory · Computer Science 2007-08-09 Yoichiro Watanabe , Koichi Kamoi