English
Related papers

Related papers: Random Coding Bound for the Reliability Function i…

200 papers

In a previous paper, we introduced a semi-device-independent scheme consisting of an untrusted source sending quantum states to an untrusted measuring device, with the sole assumption that the average energy of the states emitted by the…

Quantum Physics · Physics 2019-05-23 Thomas Van Himbeeck , Stefano Pironio

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the…

Quantum Physics · Physics 2010-03-19 Francesco Buscemi , Nilanjana Datta

We investigate quantum teleportation through noisy quantum channels by solving analytically and numerically a master equation in the Lindblad form. We calculate the fidelity as a function of decoherence rates and angles of a state to be…

Quantum Physics · Physics 2009-11-07 Sangchul Oh , Soonchil Lee , Hai-woong Lee

We prove the security of quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities, and the full power allowed by the rules of classical and…

Quantum Physics · Physics 2007-05-23 Eli Biham , Michel Boyer , P. Oscar Boykin , Tal Mor , Vwani Roychowdhury

We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer…

Quantum Physics · Physics 2019-04-29 Holger Boche , Christian Deppe , Janis Nötzel , Andreas Winter

Randomness is intrinsic to quantum mechanics; the outcome of a measurement on a quantum state is a random variable. This feature has been applied to randomness certification, where one party must decide whether the data they receive is…

Quantum Physics · Physics 2026-04-07 Liam P. McGuinness

We present an alternative framework for quantifying the coherence of quantum channels, which contains three conditions: the faithfulness, nonincreasing under sets of all the incoherent superchannels and the additivity. Based on the…

Quantum Physics · Physics 2022-04-20 Shi-Yun Kong , Ya-Juan Wu , Qiao-Qiao Lv , Zhi-Xi Wang , Shao-Ming Fei

We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under…

Information Theory · Computer Science 2019-06-26 Uzi Pereg , Yossef Steinberg

In this paper we obtain a lower bound of exponent of average probability of error for classical quantum multiple access channel, which implies that for all rate pairs in the capacity region is achievable by a code with exponential…

Quantum Physics · Physics 2017-02-08 Masahito Hayashi , Ning Cai

In this work we prove that the possibility of superactivation of quantum channel capacities is determined by the mathematical properties of the quantum relative entropy function. Before our work this fundamental and purely mathematical…

Quantum Physics · Physics 2012-06-26 Laszlo Gyongyosi , Sandor Imre

In analogy with its classical counterpart, a noisy quantum channel is characterized by a loss, a quantity that depends on the channel input and the quantum operation performed by the channel. The loss reflects the transmission quality: if…

Quantum Physics · Physics 2011-07-19 Nicolas J. Cerf

The classical randomization criterion is an important result of statistical decision theory. Recently, a quantum analogue has been proposed, giving equivalent conditions for two sets of quantum states, ensuring existence of a quantum…

Quantum Physics · Physics 2014-04-16 Anna Jencova

We show how to use properties of the quantum conditional mutual information to obtain continuity bounds for information characteristics of quantum channels depending on their input dimension. First we prove tight estimates for variation of…

Quantum Physics · Physics 2021-09-28 M. E. Shirokov

Quantum theory allows for randomness generation in a device-independent setting, where no detailed description of the experimental device is required. Here we derive a general upper bound on the amount of randomness that can be generated in…

Quantum Physics · Physics 2019-05-29 Marie Ioannou , Jonatan Bohr Brask , Nicolas Brunner

We extend a recent method to detect lower bounds to the quantum capacity of quantum communication channels by considering realistic scenarios with general input probe states and arbitrary detection procedures at the output. Realistic…

Quantum Physics · Physics 2018-01-09 Chiara Macchiavello , Massimiliano F. Sacchi

Necessary and sufficient conditions for approximation of a general channel by a general source are proved. For the special case in which the channel input is deterministic, which corresponds to source simulation, we prove a stronger…

Information Theory · Computer Science 2009-08-18 Yucel Altug , Aaron B. Wagner

Copying information is an elementary operation in classical information processing. However, copying seems rather different in the quantum regime. Since the discovery of the universal quantum cloning machine, much has been found from the…

Quantum Physics · Physics 2007-05-23 K. Maruyama , P. L. Knight

We obtain continuity bounds for basic information characteristics of quantum channels depending on their input dimension (if it is finite) and on the input energy bound (if the input dimension is infinite). We pay a special attention to the…

Quantum Physics · Physics 2021-09-28 M. E. Shirokov

This work investigates the application of quantum machine learning techniques for classical and quantum communication across different qubit channel models. By employing parameterized quantum circuits and a flexible channel noise model, we…

Quantum Physics · Physics 2023-07-14 Lakshika Rathi , Stephen DiAdamo , Alireza Shabani

We consider the problem of universal decoding for arbitrary unknown channels in the random coding regime. For a given random coding distribution and a given class of metric decoders, we propose a generic universal decoder whose average…

Information Theory · Computer Science 2016-11-17 Neri Merhav
‹ Prev 1 4 5 6 7 8 10 Next ›