相关论文: On the multiplicativity conjecture for quantum cha…

Estimating the information transmission capability of a quantum channel remains one of the fundamental problems in quantum information processing. In contrast to classical channels, the information-carrying capability of quantum channels is…

Classical communication capacity of a channel can be enhanced either through a device called a 'quantum switch' or by putting the channel in a quantum superposition. The gains in the two cases, although different, have their origin in the…

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…

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…

In this paper we give several equivalent formulations of the additivity conjecture for constrained channels, which formally is substantially stronger than the unconstrained additivity. To this end a characteristic property of the optimal…

We investigate multiparty communication scenarios where information is sent from several sender to several receivers. We establish a relation between the quantum capacity of multiparty communication channels and their distillability…

Some new examples of quantum channels for which the infimum of the output entropy is additive under taking a tensor product of channels are given.

We consider bistochastic quantum channels generated by unitary representations of the discret group. The proof of the additivity conjecture for the quantum depolarizing channel $\Phi$ based on the decreasing property of the relative entropy…

We develop an approximation approach to infinite dimensional quantum channels based on detailed investigation of the continuity properties of entropic characteristics of quantum channels and operations (trace-nonincreasing completely…

In this paper, we study the multiplicative behaviour of quantum channels, mathematically described by trace preserving, completely positive maps on matrix algebras. It turns out that the multiplicative domain of a unital quantum channel has…

We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…

Additivity of the Holevo capacity is proved for product channels, under the condition that one of the channels is in a certain class of unital qubit channels, with the other completely arbitrary. This qubit class includes the depolarizing…

We introduce an infinite sequence of quantum channels for which the Holevo capacity is additive. The channel series is closely related to the quantum channels arising from universal quantum cloning machines. The additivity proof is…

The quantum capacity of degradable quantum channels has been proven to be additive. On the other hand, there is no general rule for the behavior of quantum capacity for non-degradable quantum channels. We introduce the set of partially…

Quantum addition channels have been recently introduced in the context of deriving entropic power inequalities for finite dimensional quantum systems. We prove a reverse entropy power equality which can be used to analytically prove an…

We prove the claim made in the title by showing that approximately randomising maps of large dimension are counterexamples to the multiplicativity conjecture.

The amount of information transmissible through a communications channel is determined by the noise characteristics of the channel and by the quantities of available transmission resources. In classical information theory, the amount of…

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…

Quantum channels represent a broad spectrum of operations crucial to quantum information theory, encompassing everything from the transmission of quantum information to the manipulation of various resources. In the domain of states, the…

Two quantum channels are called compatible if they can be obtained as marginals from a single broadcasting channel; otherwise they are incompatible. We derive a characterization of the compatibility relation in terms of concatenation and…