We survey what is known about the information transmitting capacities of quantum channels, and give a proposal for how to calculate some of these capacities using linear programming.
We propose a method to detect lower bounds to quantum capacities of a noisy quantum communication channel by means of few measurements. The method is easily implementable and does not require any knowledge about the channel. We test its efficiency by studying its performance for most well known single qubit noisy channels and for the generalised Pauli channel in arbitrary finite dimension.
Classical capacity of unital qubit channels is well known, whereas that of nonunital qubit channels is not. We find lower and upper bounds on classical capacity of nonunital qubit channels by using a recently developed decomposition technique relating nonunital and unital positive qubit maps.
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 fixed bipartite entangled state at the channel input or, equivalently, an ensemble of an overcomplete set of single-system states, along with few local measurements at the channel output.
We introduce potential capacities of quantum channels in an operational way and provide upper bounds for these quantities, which quantify the ultimate limit of usefulness of a channel for a given task in the best possible context. Unfortunately, except for a few isolated cases, potential capacities seem to be as hard to compute as their "plain" analogues. We thus study upper bounds on some potential capacities: For the classical capacity, we give an upper bound in terms of the entanglement of formation. To establish a bound for the quantum and private capacity, we first "lift" the channel to a…
We test a general method to detect lower bounds of the quantum channel capacity for two-qubit correlated channels. We consider in particular correlated dephasing, depolarising and amplitude damping channels. We show that the method is easily implementable, it does not require a priori knowledge about the channels, and it is very efficient, since it does not rely on full quantum process tomography.
Reciprocal pairs of quantum channels are defined as completely positive transformations which admit a rigid, distance-preserving, yet not completely-positive transformation that allows to reproduce the outcome of one from the corresponding outcome of the other. From a classical perspective these transmission lines should exhibit the same communication efficiency. This is no longer the case in the quantum setting: explicit asymmetric behaviours are reported studying the classical communication capacities of reciprocal pairs of depolarizing and Weyl-covariant channels.
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 certification relies on a new bound for the coherent information of a quantum channel that can be applied with arbitrary bipartite mixed input states and generalized output measurements.
We present upper bounds on the quantum and private capacity of single-mode, phase-insentitive Bosonic Gaussian Channels based on degradable extensions. Our findings are state-of-the-art in the following parameter regions: low temperature and high transmissivity for the thermal attenuator, low temperature for additive Gaussian noise, high temperature and intermediate amplification for the thermal amplifier.
The capacity of noisy quantum channels characterizes the highest rate at which information can be reliably transmitted and it is therefore of practical as well as fundamental importance. Capacities of classical channels are computed using alternating optimization schemes, called Blahut-Arimoto algorithms. In this work, we generalize classical Blahut-Arimoto algorithms to the quantum setting. In particular, we give efficient iterative schemes to compute the capacity of channels with classical input and quantum output, the quantum capacity of less noisy channels, the thermodynamic capacity of qu…
We present an effcient experimental procedure that certifies non vanishing quantum capacities for qubit noisy channels. Our method is based on the use of a fixed bipartite entangled state, where the system qubit is sent to the channel input. A particular set of local measurements is performed at the channel output and the ancilla qubit mode, obtaining lower bounds to the quantum capacities for any unknown channel with no need of a quantum process tomography. The entangled qubits have a Bell state configuration and are encoded in photon polarization. The lower bounds are found by estimating the…
Capacities of quantum channels and decoherence times both quantify the extent to which quantum information can withstand degradation by interactions with its environment. However, calculating capacities directly is known to be intractable in general. Much recent work has focused on upper bounding certain capacities in terms of more tractable quantities such as specific norms from operator theory. In the meantime, there has also been substantial recent progress on estimating decoherence times with techniques from analysis and geometry, even though many hard questions remain open. In this articl…
Quantum communication channels and quantum memories are the fundamental building blocks of large-scale quantum communication networks. Estimating their capacity to transmit and store quantum information is crucial in order to assess the performance of quantum communication systems, and to detect useful communication paths among the nodes of future quantum networks. However, the estimation of quantum capacities is a challenging task for continuous variable systems, such as the radiation field, for which a complete characterization via quantum tomography is practically unfeasible. Here we introd…
Strong Converses for Quantum Channel Capacities from Blowing-Up Lemmata
School of Mathematics, Institute for Research in Fundamental Sciences (IPM)(基础科学研究所数学学院);Centre for Quantum Technologies, National University of Singapore(新加坡国立大学量子技术中心);Department of Electrical and Computer Engineering, National University of Singapore(新加坡国立大学电气与计算机工程系)
We consider quantum key distribution (QKD) and entanglement distribution using a single-sender multiple-receiver pure-loss bosonic broadcast channel. We determine the unconstrained capacity region for the distillation of bipartite entanglement and secret key between the sender and each receiver, whenever they are allowed arbitrary public classical communication. A practical implication of our result is that the capacity region demonstrated drastically improves upon rates achievable using a naive time-sharing strategy, which has been employed in previously demonstrated network QKD systems. We s…
We study quantum channels that vary on time in a deterministic way, that is, they change in an independent but not identical way from one to another use. We derive coding theorems for the classical entanglement assisted and unassisted capacities. We then specialize the theory to lossy bosonic quantum channels and show the existence of contrasting examples where capacities can or cannot be drawn from the limiting behavior of the lossy parameter.
Following initial work by Gregoratti and Werner [J. Mod. Optics 50, 913-933, 2003 and quant-ph/0403092] and Hayden and King [quant-ph/0409026], we study the problem of the capacity of a quantum channel assisted by a "friendly (channel) environment" that can locally measure and communicate classical messages to the receiver. Previous work [quant-ph/0505038] has yielded a capacity formula for the quantum capacity under this kind of help from the environment. Here we study the problem of the environment-assisted classical capacity, which exhibits a somewhat richer structure (at least, it seems to…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In this way, we obtain single-letter characterizations of the entanglement-assisted classical capacities for both channel models. Moreover, we show that the entanglement-assisted classical capacity does exhibit no strong converse property for some compound quantum channels for the average as well as the maximal error criterion. A strong converse to the entangle…
Fast convergence of Dynamic Capacities of GNS-Symmetric Quantum Channels
Univ Lyon, Inria, ENS Lyon, UCBL, LIP(里昂大学,法国国家信息与自动化研究所,巴黎高等师范学院里昂校区,里昂第一大学,信息处理实验室);School of Mathematics and Statistics, Wuhan University(武汉大学数学与统计学院);Wuhan Institute of Quantum Technology(武汉量子技术研究院);Department of Mathematical Sciences, Chalmers University of Technology and University of Gothenburg(查尔姆斯理工大学和哥德堡大学数学科学系);Wallenberg Centre for Quantum Technology, Chalmers University of Technology(查尔姆斯理工大学瓦伦堡量子技术中心)
In this article we consider flagged extensions of convex combination of quantum channels, and find general sufficient conditions for the degradability of the flagged extension. An immediate application is a bound on the quantum $Q$ and private $P$ capacities of any channel being a mixture of a unitary map and another channel, with the probability associated to the unitary component being larger than $1/2$. We then specialize our sufficient conditions to flagged Pauli channels, obtaining a family of upper bounds on quantum and private capacities of Pauli channels. In particular, we establish ne…
Quantum amplifier channels are at the core of several physical processes. Not only do they model the optical process of spontaneous parametric down-conversion, but the transformation corresponding to an amplifier channel also describes the physics of the dynamical Casimir effect in superconducting circuits, the Unruh effect, and Hawking radiation. Here we study the communication capabilities of quantum amplifier channels. Invoking a recently established minimum output-entropy theorem for single-mode phase-insensitive Gaussian channels, we determine capacities of quantum-limited amplifier chann…
Quantum communication is an important branch of quantum information science, promising unconditional security to classical communication and providing the building block of a future large-scale quantum network. Noise in realistic quantum communication channels imposes fundamental limits on the communication rates of various quantum communication tasks. It is therefore crucial to identify or bound the quantum capacities of a quantum channel. Here, we consider Gaussian channels that model energy loss and thermal noise errors in realistic optical and microwave communication channels and study the…
The set of Multi-level Amplitude Damping (MAD) quantum channels is introduced as a generalization of the standard qubit Amplitude Damping Channel to quantum systems of finite dimension $d$. In the special case of $d=3$, by exploiting degradability, data-processing inequalities, and channel isomorphism, we compute the associated quantum and private classical capacities for a rather wide class of maps, extending the set of solvable models known so far. We proceed then to the evaluation of the entanglement assisted, quantum and classical, capacities.
Classical capacities under physical constraints: More capacity with less entanglement
Harish-Chandra Research Institute, A CI of Homi Bhabha National Institute(哈里什-昌德拉研究所,霍米·巴巴国立学院成员);QICI Quantum Information and Computation Initiative, Department of Computer Science, The University of Hong Kong(香港大学计算机科学系量子信息计算倡议)