English
Related papers

Related papers: Quantum coding in non-inertial frames

200 papers

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

In this contribution, we investigate the entanglement behavior of a composite system consists of two different dimensional subsystems in non-inertial frames. In particular, we consider a composite system of qubit(two-dimensional) subsystem,…

Quantum Physics · Physics 2016-02-09 Nasser Metwally

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information…

Quantum Physics · Physics 2021-10-26 Xin Wang

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

All communication channels are at bottom quantum mechanical. Quantum mechanics contributes both obstacles to communication in the form of noise, and opportunities in the use of intrinsically quantum representations for information. This…

Quantum Physics · Physics 2007-05-23 Seth Lloyd

Shared entanglement can significantly amplify classical correlations between systems interacting over a limited quantum channel. A natural avenue is to use entanglement of the same dimension as the channel because this allows for unitary…

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…

Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum…

Quantum Physics · Physics 2009-11-07 G. Bowen

The uplink of a cloud radio access network architecture is studied in which decoding at the cloud takes place via network function virtualization on commercial off-the-shelf servers. In order to mitigate the impact of straggling decoders in…

Information Theory · Computer Science 2018-08-29 Malihe Aliasgari , Jörg Kliewer , Osvaldo Simeone

We investigate the quantum capacity of noisy quantum channels which can be represented by coupling a system to an effectively small environment. A capacity formula is derived for all cases where both system and environment are…

Quantum Physics · Physics 2009-11-13 Michael M. Wolf , David Perez-Garcia

Quantum networks distributed over distances greater than a few kilometers will be limited by the time required for information to propagate between nodes. We analyze protocols that are able to circumvent this bottleneck by employing…

We consider the problem of transmitting classical and quantum information reliably over an entanglement-assisted quantum channel. Our main result is a capacity theorem that gives a three-dimensional achievable rate region. Points in the…

Quantum Physics · Physics 2010-08-23 Min-Hsiu Hsieh , Mark M. Wilde

We study communication between an inertial observer and one of two causally-disconnected counter accelerating observers. We will restrict the quantum channel considering inertial-to-accelerated bipartite classical and quantum communication…

Quantum Physics · Physics 2012-12-27 Eduardo Martin-Martinez , Dominic Hosler , Miguel Montero

The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to…

Quantum Physics · Physics 2007-05-23 Susumu Osawa , Hiroshi Nagaoka

We determine the secrecy capacity of the compound channel with quantum wiretapper and channel state information at the transmitter. Moreover, we derive a lower bound on the secrecy capacity of this channel without channel state information…

Information Theory · Computer Science 2015-06-15 Holger Boche , Minglai Cai , Ning Cai , Christian Deppe

Quantum networks entangle remote nodes by distributing quantum states, which inevitably suffer from decoherence while traversing quantum channels. Pertinent decoherence mechanisms govern the channel capacity, its reach, and the quality and…

Quantum Physics · Physics 2018-11-08 Daniel E. Jones , Brian T. Kirby , Michael Brodsky

We determine the optimal achievable rate at which entanglement can be reliably transmitted when the memoryless channel used during transmission is unknown both to sender and receiver. To be more precise, we assume that both of them only…

Quantum Physics · Physics 2009-04-21 Igor Bjelakovic , Holger Boche , Janis Noetzel

Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in…

Quantum Physics · Physics 2018-10-10 Haoyu Qi , Qingle Wang , Mark M. Wilde

Dynamics of coded information over Bloch channels is investigated for different values of the channel's parameters. We show that, the suppressing of the travelling coded information over Bloch channel can be increased by decreasing the…

Quantum Physics · Physics 2015-05-19 Nasser Metwally

We study universal quantum codes for entanglement-assisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the…

Quantum Physics · Physics 2017-04-28 Mario Berta , Hrant Gharibyan , Michael Walter