Related papers: Bounding quantum capacities via partial orders and…
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.
The unique and often-weird properties of quantum mechanics allow an information carrier to propagate through multiple trajectories of quantum channels simultaneously. This ultimately leads us to quantum trajectories with an indefinite…
The capacity of accelerated channel is investigated for different classes of initial states. It is shown that, the capacities of the travelling channels depend on the frame in which the accelerated channels are observed in and the initial…
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…
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…
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 computing is a new computational paradigm with the potential to solve certain computationally challenging problems much faster than traditional approaches. Civil engineering encompasses many computationally challenging problems,…
Quantum information theory is the study of the achievable limits of information processing within quantum mechanics. Many different types of information can be accommodated within quantum mechanics, including classical information, coherent…
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…
The quantum capacity of a memoryless channel is often used as a single figure of merit to characterize its ability to transmit quantum information coherently. The capacity determines the maximal rate at which we can code reliably over…
This article provides an elementary introduction to Gaussian channels and their capacities. We review results on the classical, quantum, and entanglement assisted capacities and discuss related entropic quantities as well as additivity…
Quantum communication channels differ from their classical counterparts because their capacities can be superadditive. The principle of monogamy of entanglement suggests that superadditive improvements in the transmission capacity of a…
Complementarity was originally introduced as a qualitative concept for the discussion of properties of quantum mechanical objects that are classically incompatible. More recently, complementarity has become a \emph{quantitative} relation…
We investigate superadditivity of quantum capacity through private channels whose Choi-Jamiolkowski operators are private states. This perspective links the security structure of private states to quantum capacity and clarifies the role of…
Quantum discord quantifies quantum correlations beyond entanglement and assumes nonzero values, which are notoriously hard to compute, for almost all quantum states. Here we provide computable tight bounds for the quantum discord for…
Thermal attenuator channels model the decoherence of quantum systems interacting with a thermal bath, e.g., a two-level system subject to thermal noise and an electromagnetic signal travelling through a fiber or in free-space. Hence…
Communication over a noisy channel is often conducted in a setting in which different input symbols to the channel incur a certain cost. For example, for bosonic quantum channels, the cost associated with an input state is the number of…
Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…
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…
The information capacities and ``distillability'' of a quantum channel are studied in the presence of auxiliary resources. These include prior entanglement shared between the sender and receiver and free classical bits of forward and…