English
Related papers

Related papers: Arbitrarily Small Amounts of Correlation for Arbit…

200 papers

Quantum coherence is one of the fundamental aspects distinguishing classical and quantum theories. Coherence between different energy eigenstates is particularly important, as it serves as a valuable resource under the law of energy…

Quantum Physics · Physics 2024-05-07 Naoto Shiraishi , Ryuji Takagi

In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical…

Quantum Physics · Physics 2009-11-13 I. Bjelakovic , H. Boche , J. Noetzel

The ability to distribute entanglement over complex quantum networks is an important step towards a quantum internet. Recently, there has been significant theoretical effort, mainly focusing on the distribution of bipartite entanglement via…

Quantum Physics · Physics 2017-05-19 Stefan Bäuml , Koji Azuma

Using random Gaussian vectors and an information-uncertainty relation, we give a proof that the coherent information is an achievable rate for entanglement transmission through a noisy quantum channel. The codes are random subspaces…

Quantum Physics · Physics 2012-07-06 Patrick Hayden , Peter W. Shor , Andreas Winter

We investigate prepare-and-measure scenarios in which a sender and a receiver use entanglement to send quantum information over a channel with limited capacity. We formalise this framework, identify its basic properties and provide…

Quantum Physics · Physics 2026-04-07 Elna Svegborn , Jef Pauwels , Armin Tavakoli

We derive universal codes for simultaneous transmission of classical messages and entanglement through quantum channels, possibly under attack of a malignant third party. These codes are robust to different kinds of channel uncertainty. To…

Mathematical Physics · Physics 2019-03-27 Holger Boche , Gisbert Janßen , Sajad Saeedinaeeni

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

In this work we design a specific simulation tool for quantum channels which is based on the use of a control system. This allows us to simulate an average quantum channel which is expressed in terms of an ensemble of channels, even when…

Quantum Physics · Physics 2018-12-19 Stefano Pirandola , Riccardo Laurenza , Leonardo Banchi

In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Yan Xin , Hari Krishna Garg

It is easy to show coincidence of the entanglement-assisted classical capacity and the Holevo capacity for any c-q channel between finite dimensional quantum systems. In this paper we prove the converse assertion: coincidence of the…

Quantum Physics · Physics 2012-07-24 M. E. Shirokov

Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the…

Quantum Physics · Physics 2009-11-10 Dennis Kretschmann , Reinhard F Werner

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

We analyze the quantum binary adder channel, i.e. the quantum generalization of the classical, and well-studied, binary adder channel: in this model qubits rather than classical bits are transmitted. This of course is as special case of the…

Quantum Physics · Physics 2007-05-23 Gleb V. Klimovitch , Andreas Winter

Transmission of quantum entanglement will play a crucial role in future networks and long-distance quantum communications. Quantum Key Distribution, the working mechanism of quantum repeaters and the various quantum communication protocols…

Quantum Physics · Physics 2013-10-08 Laszlo Gyongyosi

This work investigates the fundamental limits of implementing network oblivious transfer via noisy multiple access channels and broadcast channels between honest-but-curious parties when the parties have access to general tripartite…

Information Theory · Computer Science 2026-02-04 Hadi Aghaee , Christian Deppe , Holger Boche

Two familiar notions of correlation are rediscovered as the extreme operating points for distributed synthesis of a discrete memoryless channel, in which a stochastic channel output is generated based on a compressed description of the…

Information Theory · Computer Science 2016-11-18 Paul Cuff

The information capacities and ``distillability'' of a quantum channel are studied in the presence of auxiliary resources. These include prior entanglement shared between the sender and receiver and free classical bits of forward and…

Quantum Physics · Physics 2009-11-10 Vittorio Giovannetti

Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the…

Quantum Physics · Physics 2025-10-03 Adam Taylor , Michael Hanks , Hyukjoon Kwon , M. S. Kim

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…

A new universal coding/decoding scheme for random access with collision detection is given in the case of two senders. The result is used to give an achievable joint source-channel coding error exponent for multiple access channels in the…

Information Theory · Computer Science 2013-09-19 Lóránt Farkas , Tamás Kói
‹ Prev 1 3 4 5 6 7 10 Next ›