English
Related papers

Related papers: On channels with positive quantum zero-error capac…

200 papers

We study information transmission over a fully correlated amplitude damping channel acting on two qubits. We derive the single-shot classical channel capacity and show that entanglement is needed to achieve the channel best performance. We…

Quantum Physics · Physics 2013-11-01 A. D'Arrigo , G. Benenti , G. Falci , C. Macchiavello

We consider the process consisting of preparation, transmission through a quantum channel, and subsequent measurement of quantum states. The communication complexity of the channel is the minimal amount of classical communication required…

Quantum Physics · Physics 2014-11-21 Alberto Montina , Stefan Wolf

A pure-loss bosonic channel is a simple model for communication over free-space or fiber-optic links. More generally, phase-insensitive bosonic channels model other kinds of noise, such as thermalizing or amplifying processes. Recent work…

Quantum Physics · Physics 2016-03-22 Mark M. Wilde , Joseph M. Renes , Saikat Guha

Identification over quantum broadcast channels is considered. As opposed to the information transmission task, the decoder only identifies whether a message of his choosing was sent or not. This relaxation allows for a double-exponential…

Quantum Physics · Physics 2023-08-02 Johannes Rosenberger , Christian Deppe , Uzi Pereg

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

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

We consider energy-constrained infinite-dimensional quantum channels from a given system (satisfying a certain condition) to any other systems. We show that dealing with basic capacities of these channels we may assume (accepting…

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

The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have…

Quantum Physics · Physics 2007-05-23 Charles H. Bennett , Peter W. Shor , John A. Smolin , Ashish V. Thapliyal

Given one or more uses of a classical channel, only a certain number of messages can be transmitted with zero probability of error. The study of this number and its asymptotic behaviour constitutes the field of classical zero-error…

Quantum Physics · Physics 2010-11-01 Toby S. Cubitt , Debbie Leung , William Matthews , Andreas Winter

The highest fidelity of quantum error-correcting codes of length n and rate R is proven to be lower bounded by 1 - exp [-n E(R)+ o(n)] for some function E(R) on noisy quantum channels that are subject to not necessarily independent errors.…

Quantum Physics · Physics 2015-06-26 Mitsuru Hamada

We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum…

Quantum Physics · Physics 2019-03-19 Anurag Anshu , Rahul Jain , Naqueeb Ahmad Warsi

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…

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

Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the…

Quantum Physics · Physics 2019-03-19 Anurag Anshu , Rahul Jain , Naqueeb Ahmad Warsi

Incorporating sample efficiency, by requiring the number of states consumed by broadcasting does not exceed that of a naive prepare-and-distribute strategy, gives rise to the no practical quantum broadcasting theorem. To navigate this…

Quantum Physics · Physics 2026-03-20 Ximing Wang , Yunlong Xiao

The Quantum Reverse Shannon Theorem has been a milestone in quantum information theory. It states that asymptotically reliable simulation of a quantum channel, assisted by unlimited shared entanglement, requires a rate of classical…

Quantum Physics · Physics 2025-02-18 Ke Li , Yongsheng Yao

We review in a unified way a recently proposed method to detect properties of unknown quantum channels and lower bounds to quantum capacities, without resorting to full quantum process tomography. The method is based on the preparation of a…

Quantum Physics · Physics 2017-12-19 Chiara Macchiavello , Massimiliano F. Sacchi

The pure-loss channel is a fundamental model for describing noise in bosonic quantum platforms. It is characterised by a single parameter, the transmissivity, which quantifies the fraction of the input energy that reaches the output of the…

We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans.…

Quantum Physics · Physics 2015-06-01 Joseph M. Renes

The zero-error channel capacity is the maximum asymptotic rate that can be reached with error probability exactly zero, instead of a vanishing error probability. The nature of this problem, essentially combinatorial rather than…

Information Theory · Computer Science 2020-01-13 Nicolas Charpenay , Maël Le Treust
‹ Prev 1 3 4 5 6 7 10 Next ›