English
Related papers

Related papers: Quantum-capacity bounds in spin-network communicat…

200 papers

Quantum capacity, as the ultimate transmission rate of quantum communication, is characterized by regularized coherent information. In this work, we reformulate approximations of the quantum capacity by operator space norms and give both…

Quantum Physics · Physics 2019-11-06 Li Gao , Marius Junge , Nicholas LaRacuente

Information must take up space, must weigh, and its flux must be limited. Quantum limits on communication and information storage leading to these conclusions are here described. Quantum channel capacity theory is reviewed for both steady…

Quantum Physics · Physics 2015-06-26 Jacob D. Bekenstein , Marcelo Schiffer

We prove that a broad array of capacities of a quantum channel are continuous. That is, two channels that are close with respect to the diamond norm have correspondingly similar communication capabilities. We first show that the classical…

Quantum Physics · Physics 2009-09-09 Debbie Leung , Graeme Smith

The Lieb-Robinson bound sets a theoretical upper limit on the speed at which information can propagate in non-relativistic quantum spin networks. In its original version, it results in an exponentially exploding function of the evolution…

Quantum Physics · Physics 2019-11-13 Stefano Chessa , Vittorio Giovannetti

By extending the concept of energy-constrained diamond norms, we obtain continuity bounds on the dynamics of both closed and open quantum systems in infinite-dimensions, which are stronger than previously known bounds. We extensively…

Quantum Physics · Physics 2020-01-08 Simon Becker , Nilanjana Datta

We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…

Quantum Physics · Physics 2008-08-28 Graeme Smith , John A. Smolin , Andreas Winter

Quantum network is the key to enable distributed quantum information processing. As the single-link communication rate decays exponentially with the distance, to enable reliable end-to-end quantum communication, the number of nodes needs to…

Quantum Physics · Physics 2021-08-17 Quntao Zhuang , Bingzhi Zhang

Recently the theory of communication developed by Shannon has been extended to the quantum realm by exploiting the rules of quantum theory. This latter stems on complex vector spaces. However complex (as well as real) numbers are just…

Information Theory · Computer Science 2018-04-23 Samad Khabbazi Oskouei , Stefano Mancini

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

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

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…

We investigate the maximum rates for transmitting quantum information, distilling entanglement, and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way…

Quantum Physics · Physics 2017-11-30 Riccardo Laurenza , Stefano Pirandola

We raise the question whether there is a way to characterize the quantum information transport properties of a medium or material. For this analysis the special features of quantum information have to be taken into account. We find that…

Quantum Physics · Physics 2013-03-22 Johan Aberg , Stefan Hengl , Renato Renner

A quantum network consists of independent sources distributing entangled states to distant nodes which can then perform entangled measurements, thus establishing correlations across the entire network. But how strong can these correlations…

Quantum Physics · Physics 2019-08-21 Marc-Olivier Renou , Yuyi Wang , Sadra Boreiri , Salman Beigi , Nicolas Gisin , Nicolas Brunner

We propose new Lieb-Robinson bounds (bounds on the speed of propagation of information in quantum systems) with an explicit dependence on the interaction strengths of the Hamiltonian. For systems with more than two interactions it is found…

Mathematical Physics · Physics 2014-11-20 Isabeau Prémont-Schwarz , Jeff Hnybida

An upper limit is given to the amount of quantum information that can be transmitted reliably down a noisy, decoherent quantum channel. A class of quantum error-correcting codes is presented that allow the information transmitted to attain…

Quantum Physics · Physics 2009-10-30 Seth Lloyd

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

A class of diamond networks are studied where the broadcast component is modelled by two independent bit-pipes. New upper and low bounds are derived on the capacity which improve previous bounds. The upper bound is in the form of a max-min…

Information Theory · Computer Science 2014-01-24 Shirin Saeedi Bidokhti , Gerhard Kramer

In this thesis, we are interested in the limits of quantum communication with and without entanglement, and with and without noise assumptions on the communication setup. When a sender and a receiver are connected by a communication line…

Quantum Physics · Physics 2024-12-31 Paula Belzig

A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes…

Information Theory · Computer Science 2015-10-06 Shirin Saeedi Bidokhti , Gerhard Kramer
‹ Prev 1 2 3 10 Next ›