Nilanjana Datta
We prove additivity of the minimum output entropy and the Holevo capacity for rotationally invariant quantum channels acting on spin-1/2 and spin-1 systems. The physical significance of these channels and their relations to other known channels is also discussed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The minimum entropy output is computed for rotationally invariant quantum channels acting on spin-1/2 and spin-1 systems. For the case of two parallel such channels and initial entangled (singlet) state the entropy of the output is higher then the doubled minimal entropy output of the single channel. This gives a certain moral support to the additivity hypothesis. Another related simple function of the channel (minimum entropy gain) is shown to be additive in general.
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 channel. As a byproduct this proves that the Holevo bound is the ultimate information capacity of such qubit channels (assuming no prior entanglement between sender and receiver). Additivity of minimal entropy and multiplicativity of p-norms are also proved under the same assumptions.
We consider bistochastic quantum channels generated by unitary representations of the discret group. The proof of the additivity conjecture for the quantum depolarizing channel $Φ$ based on the decreasing property of the relative entropy is given. We show that the additivity conjecture is true for the channel $Ξ=Ψ\circ Φ$, where $Ψ$ is the phase damping.
Additivity of minimal entropy output is proven for the class of quantum channels $Λ_t (A):=t A^{T}+(1-t)τ(A)$ in the parameter range $-2/(d^2-2)\le t \le 1/(d+1)$.
Additivity of quantum communication channel is discussed in terms of Poisson process to show it is additive in probability. Poisson process is shown to be responsible for entanglement which is a rare event.
Additivity of the minimal output entropy for the family of transpose depolarizing channels introduced by Fannes et al. [quant-ph/0410195] is considered. It is shown that using the method of our previous paper [quant-ph/0403072] allows us to prove the additivity for the range of the parameter values for which the problem was left open in [quant-ph/0410195]. Together with the result of [quant-ph/0410195], this covers the whole family of transpose depolarizing channels.
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 give an elementary self-contained proof that the minimal entropy output of arbitrary products of channels $ρ\mapsto \frac{1}{d-1}(1-ρ^T)$ is additive.
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 ensemble for such a channel is derived, generalizing the maximal distance property. It is shown that the additivity conjecture for constrained channels holds true for certain nontrivial classes of channels. Recently P. Shor showed that conjectured additivity properties for several quantum information quantities are in fact equivalent. After giving an algebraic…
We simplify some conjectures in quantum information theory; the additivity of minimal output entropy, the multiplicativity of maximal output p-norm and the superadditivity of convex closure of output entropy. We construct a unital channel for a given channel so that they share the above additivity properties; we can reduce the conjectures for all channels to those for unital channels.
We prove a lemma which allows one to extend results about the additivity of the minimal output entropy from highly symmetric channels to a much larger class. A similar result holds for the maximal output $p$-norm. Examples are given showing its use in a variety of situations. In particular, we prove the additivity and the multiplicativity for the shifted depolarising channel.
Recently Shor proved equivalence of several open (sub)additivity problems related to the Holevo capacity and the entanglement of formation [15]. In our previous note [6] equivalence of these to the additivity of the Holevo capacity for channels with arbitrary linear constraints was shown. This note is the development of the previous one in the direction of channels with general constraints. Introducing input constraints provides greater flexibility in the treatment of the additivity conjecture. The Holevo capacity of arbitrarily constrained channel is considered and the characteristic property…
The Amosov-Holevo-Werner conjecture implies the additivity of the minimum Re'nyi entropies at the output of a channel. The conjecture is proven true for all Re'nyi entropies of integer order greater than two in a class of Gaussian bosonic channel where the input signal is randomly displaced or where it is coupled linearly to an external environment.
Super-additivity of quantum capacity in simple channels
本文研究了“generalized platypus channel”的信道容量，证明其私有和经典容量均为1，并证实其与qudit erasure channels及multilevel amplitude damping channels结合时仍具量子容量超加性。
A conjecture arising naturally in the investigation of additivity of classical information capacity of quantum channels states that the maximal purity of outputs from a quantum channel, as measured by the p-norm, should be multiplicative with respect to the tensor product of channels. We disprove this conjecture for p>4.79. The same example (with p=infinity) also disproves a conjecture for the multiplicativity of the injective norm of Hilbert space tensor products.
We explore complementarity between output and environment of a quantum channel (or, more generally, CP map), making an observation that the output purity characteristics for complementary CP maps coincide. Hence, validity of the mutiplicativity/additivity conjecture for a class of CP maps implies its validity for complementary maps. The class of CP maps complementary to entanglement-breaking ones is described and is shown to contain diagonal CP maps as a proper subclass, resulting in new class of CP maps (channels) for which the multiplicativity/additivity holds. Covariant and Gaussian channel…
In this paper we use the method of a recent paper (quant-ph/0509101) to compute complementary channels for certain important cases, such as depolarizing and transpose-depolarizing channels. This method allows us to easily obtain the minimal Kraus representations from non--minimal ones. We also study the properties of the output purity of the tensor product of a channel and its complement.
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 properties which enables us to show that the quantum capacity of such channels is not additive.
We prove that the minimal Renyi entropy of order 2 (RE2) output of a positive-partial-transpose(PPT)-inducing channel joint to an arbitrary other channel is equal to the sum of the minimal RE2 output of the individual channels. PPT-inducing channels are channels with a Choi matrix which is bound entangled or separable. The techniques used can be easily recycled to prove additivity for some non-PPT-inducing channels such as the depolarizing and transpose depolarizing channels, though not all known additive channels. We explicitly make the calculations for generalized Werner-Holevo channels as a…
We study the entanglement cost of the states in the contragredient space, which consists of $(d-1)$ $d$-dimensional systems. The cost is always $\log_2 (d-1)$ ebits when the state is divided into bipartite $\C^d \otimes (\C^d)^{d-2}$. Combined with the arguments in \cite{Matsumoto02}, additivity of channel capacity of some quantum channels is also shown.
We prove multiplicativity of maximal output $p$ norm of classical noise channels and thermal noise channels of arbitrary modes for all $p>1$ under the assumption that the input signal states are Gaussian states. As a direct consequence, we also show the additivity of the minimal output entropy and that of the energy-constrained Holevo capacity for those Gaussian channels under Gaussian inputs. To the best of our knowledge, newly discovered majorization relation on symplectic eigenvalues, which is also of independent interest, plays a central role in the proof.
We prove that, when two local quantum channels are used paralleled, the quantum-correlating power (QCP) of the composed channel is no less than the sum of QCP of the two channels. For local channels with zero QCP, the super-activation of QCP is a fairly common effect, and proved to exist except for the trivial case where both of the channels are completely decohering channels or unitary operators. For general quantum channels, we show that the (not-so-common) additivity of QCP can be observed for the situation where a measuring-and-preparing channel is used together with a completely decoherin…
We study the additivity problems for the classical capacity of quantum channels, the minimal output entropy and its convex closure. We show for each of them that additivity for arbitrary pairs of channels holds iff it holds for arbitrary equal pairs, which in turn can be taken to be unital. In a similar sense, weak additivity is shown to imply strong additivity for any convex entanglement monotone. The implications are obtained by considering direct sums of channels (or states) for which we show how to obtain several information theoretic quantities from their values on the summands. This prov…
We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (for minimum entropy output) or superadditivity (for channel capacity) that can occur.
We point out a contrasting role the entanglement plays in communication and estimation scenarios. In the first case it brings noticeable benefits at the measurement stage (output super-additivity), whereas in the latter it is the entanglement of the input probes that enables significant performance enhancement (input super-additivity). We identify a weak estimation regime where a strong connection between concepts crucial to the two fields is demonstrated; the accessible information and the Holevo quantity on one side and the quantum Fisher information related quantities on the other. This all…
The purpose of these notes is to discuss the relation between the additivity questions regarding the quantities (Holevo) capacity of a quantum channel T and entanglement of formation of a given bipartite state. In particular, using the Stinespring dilation theorem, we give a formula for the channel capacity involving entanglement of formation. This can be used to show that additivity of the latter for some states can be inferred from the additivity of capacity for certain channels. We demonstrate this connection for a family of group--covariant channels, allowing us to calculate the entangleme…
A random unitary channel is one that is given by a convex combination of unitary channels. It is shown that the conjectures on the additivity of the minimum output entropy and the multiplicativity of the maximum output $p$-norm can be equivalently restated in terms of random unitary channels. This is done by constructing a random unitary approximation to a general quantum channel. This approximation can be constructed efficiently, and so it is also applied to the computational problem of distinguishing quantum circuits. It is shown that the problem of distinguishing random unitary circuits is …
An example is given of a qubit quantum channel which requires four inputs to maximize the Holevo capacity. The example is one of a family of channels which are related to 3-state channels. The capacity of the product channel is studied and numerical evidence presented which strongly suggests additivity. The numerical evidence also supports a conjecture about the concavity of output entropy as a function of entanglement parameters. However, an example is presented which shows that for some channels this conjecture does not hold for all input states. A numerical algorithm for finding the capacit…
An elementary introduction into algebraic approach to unified quantum information theory and operational approach to quantum entanglement as generalized encoding is given. After introducing compound quantum state and two types of informational divergences, namely, Araki-Umegaki (a-type) and of Belavkin-Staszewski (b-type) quantum relative entropic information, this paper treats two types of quantum mutual information via entanglement and defines two types of corresponding quantum channel capacities as the supremum via the generalized encodings. It proves the additivity property of quantum chan…
The additivity of both the entanglement of formation and the classical channel capacity is known to be a consequence of the strong superadditivity conjecture. We show that, conversely, the strong superadditivity conjecture follows from the additivity of the entanglement of formation; this means that the two conjectures are equivalent and that the additivity of the classical channel capacity is a consequence of them.
Hastings recently reported a randomized construction of channels violating the minimum output entropy additivity conjecture. Here we revisit his argument, presenting a simplified proof. In particular, we do not resort to the exact probability distribution of the Schmidt coefficients of a random bipartite pure state, as in the original proof, but rather derive the necessary large deviation bounds by a concentration of measure argument. Furthermore, we prove non-additivity for the overwhelming majority of channels consisting of a Haar random isometry followed by partial trace over the environmen…
We consider two apparently separated problems: in the first part of the paper we study the concept of a scalable (approximate) programmable quantum gate (SPQG). These are special (approximate) programmable quantum gates, with nice properties that could have implications on the theory of universal computation. Unfortunately, as we prove, such objects do not exist in the domain of usual quantum theory. In the second part the problem of noisy dense coding (and generalizations) is addressed. We observe that the additivity problem for the classical capacity obtained is of apparently greater general…
Constructive counterexamples to the additivity of minimum output Rényi entropy of quantum channels for all $p>1$
本文构造了针对所有p>1的量子通道最小输出Rényi熵的反例，通过高几何纠缠度量的子空间构造，展示了亚加性性质，并应用于纠缠见证器和混合态的扰动保持性。
Machine learning techniques are increasingly being used in fundamental research to solve various challenging problems. Here we explore one such technique to address an important problem in quantum communication scenario. While transferring quantum information through a noisy quantum channel, the utility of the channel is characterized by its quantum capacity. Quantum channels, however, display an intriguing property called super-additivity of coherent information. This makes the calculation of quantum capacity a hard computational problem involving optimization over an exponentially increasing…
Quantum channels can be described via a unitary coupling of system and environment, followed by a trace over the environment state space. Taking the trace instead over the system state space produces a different mapping which we call the conjugate channel. We explore the properties of conjugate channels and describe several different methods of construction. In general, conjugate channels map M_d to M_d' with d < d', and different constructions may differ by conjugation with a partial isometry. We show that a channel and its conjugate have the same minimal output entropy and maximal output p-n…
We consider the additivity of the minimal output entropy and the classical information capacity of a class of quantum channels. For this class of channels the norm of the output is maximized for the output being a normalized projection. We prove the additivity of the minimal output Renyi entropies with entropic parameters contained in [0, 2], generalizing an argument by Alicki and Fannes, and present a number of examples in detail. In order to relate these results to the classical information capacity, we introduce a weak form of covariance of a channel. We then identify several instances of w…
Sufficient conditions for additivity of the zero-error classical capacity of quantum channels
研究量子信道零误差经典容量可加性，通过建立独立数乘法性的充分条件及研究非交换图块形式，给出满足条件的量子信道例子，推导相关条件，为零误差量子通信基本限制提供新见解。
New additivity properties of the relative entropy of entanglement and its generalizations
本文证明了当至少一个态属于特定类别时纠缠相对熵的可加性，并将其推广到基于α-z Rényi相对熵的单调量，同时给出了多种量子态的闭式表达式。
We prove an entropic uncertainty relation for two quantum channels, extending the work of Frank and Lieb for quantum measurements. This is obtained via a generalized strong super-additivity (SSA) of quantum entropy. Motivated by Petz's algebraic SSA inequality, we also obtain a generalized SSA for quantum relative entropy. As a special case, it gives an improved data processing inequality.
We prove the strong super-additivity of the entanglement of formation for stabilizer pure states, and the set of mixed states which minimize their average entropy of entanglement as a mixture of stabilizer pure states sharing the same stabilizer group up to phases. The implications of the result on the additivity of the Holevo capacity of a quantum channel transmitting stabilizer states with Pauli noise is discussed.
Complementing recent progress on the additivity conjecture of quantum information theory, showing that the minimum output p-Renyi entropies of channels are not generally additive for p>1, we demonstrate here by a careful random selection argument that also at p=0, and consequently for sufficiently small p, there exist counterexamples. An explicit construction of two channels from 4 to 3 dimensions is given, which have non-multiplicative minimum output rank; for this pair of channels, numerics strongly suggest that the p-Renyi entropy is non-additive for all p < 0.11. We conjecture however that…
Hastings recently provided a proof of the existence of channels which violate the additivity conjecture for minimal output entropy. In this paper we present an expanded version of Hastings' proof. In addition to a careful elucidation of the details of the proof, we also present bounds for the minimal dimensions needed to obtain a counterexample.
Hastings disproved additivity conjecture for minimum output entropy by using random unitary channels. In this note, we employ his approach to show that minimum output $p-$Rényi entropy is non-additive for $p\in(0,p_0)\cup(1-p_0,1)$ where $p_0\approx 0.2855$.
Completely Bounded Qusi-Norms, Their Mutiplicativity, and New Additivity Results of Quantum Channels
本文通过引入完全有界1→α准范数，证明了量子通道Rényi信息的加法性，并扩展了Devetak等人和Gupta-Wilde的结果，探讨了量子信息任务的二次行为。
We present a constructive example of violation of additivity of minimum output Rényi entropy for each p>2. The example is provided by antisymmetric subspace of a suitable dimension. We discuss possibility of extension of the result to go beyond p>2 and obtain additivity for p=0 for a class of entanglement breaking channels.
We give a direct proof of the additivity of the minimum output entropy of a particular quantum channel which breaks the multiplicativity conjecture. This yields additivity of the classical capacity of this channel, a result obtained by a different method by Matsumoto and Yura [quant-ph/0306009]. Our proof relies heavily upon certain concavity properties of the output entropy which are of independent interest.
The continuity properties of the convex closure of the output entropy of infinite dimensional channels and their applications to the additivity problem are considered. The main result of this paper is the statement that the superadditivity of the convex closure of the output entropy for all finite dimensional channels implies the superadditivity of the convex closure of the output entropy for all infinite dimensional channels, which provides the analogous statements for the strong superadditivity of the EoF and for the additivity of the minimal output entropy. The above result also provides in…
When can noiseless quantum information be sent across noisy quantum devices? And at what maximum rate? These questions lie at the heart of quantum technology, but remain unanswered because of non-additivity -- a fundamental synergy which allows quantum devices (aka quantum channels) to send more information than expected. Previously, non-additivity was known to occur in very noisy channels with coherent information much smaller than that of a perfect channel; but, our work shows non-additivity in a simple low-noise channel. Our results extend even further. We prove a general theorem concerning…
We study a natural generalization of the additivity problem in quantum information theory: given a pair of quantum channels, then what is the set of convex trace functions that attain their maximum on unentangled inputs, if they are applied to the corresponding output state? We prove several results on the structure of the set of those convex functions that are "additive" in this more general sense. In particular, we show that all operator convex functions are additive for the Werner-Holevo channel in 3x3 dimensions, which contains the well-known additivity results for this channel as special …
In this paper we obtain new bounds for the minimum output entropies of random quantum channels. These bounds rely on random matrix techniques arising from free probability theory. We then revisit the counterexamples developed by Hayden and Winter to get violations of the additivity equalities for minimum output Rényi entropies. We show that random channels obtained by randomly coupling the input to a qubit violate the additivity of the $p$-Rényi entropy. For some sequences of random quantum channels, we compute almost surely the limit of their Schatten $S_1 \to S_p$ norms.
We study classical capacities of quantum multi-access channels in geometric terms revealing breaking of additivity of Holevo-like capacity. This effect is purely quantum since, as one points out, any classical multi-access channels have their regions additive. The observed non-additivity in quantum version presented here seems to be the first effect of this type with no additional resources like side classical or quantum information (or entanglement) involved. The simplicity of quantum channels involved resembles butterfly effect in case of classical channel with two senders and two receivers.
Additivity of quantum capacities in simple non-degradable quantum channels
本文提出两类非退化量子信道，其相干信息保持可加性，从而简化量子容量计算，并分析结构约束对强、弱可加性的影响。
We present an alternative framework for quantifying the coherence of quantum channels, which contains three conditions: the faithfulness, nonincreasing under sets of all the incoherent superchannels and the additivity. Based on the characteristics of the coherence of quantum channels and the additivity of independent channels, our framework provides an easier way to certify whether a function is a bona fide coherence measure of quantum channels. Detailed example is given to illustrate the effectiveness and advantages of our framework.
We prove additivity violation of minimum output entropy of quantum channels by straightforward application of ε-net argument and Lévy's lemma. The additivity conjecture was disproved initially by Hastings. Later, a proof via asymptotic geometric analysis was presented by Aubrun, Szarek and Werner, which uses Dudley's bound on Gaussian process (or Dvoretzky's theorem with Schechtman's improvement). In this paper, we develop another proof along Dvoretzky's theorem in Milman's view showing additivity violation in broader regimes than the existing proofs. Importantly, Dvoretzky's theorem works wel…
We study quantum channels with respect to their image, i.e., the image of the set of density operators under the action of the channel. We first characterize the set of quantum channels having polytopic images and show that additivity of the minimal output entropy can be violated in this class. We then provide a complete characterization of quantum channels $T$ that are universally image additive in the sense that for any quantum channel $S$, the image of $T \otimes S$ is the convex hull of the tensor product of the images of $T$ and $S$. These channels turn out to form a strict subset of enta…
We study quantum channels that are close to another channel with weakly additive Holevo information and derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking channels, unital qubit channels, and Hadamard channels. Related to the method of approximate degradability, we define approximation parameters for each class above that measure how close an arbitrary channel is to satisfying the respective property. This gives us upper bounds on the classical capacity in terms of functions of the approximation parameters, as…
The notion of the Holevo capacity for arbitrarily constrained infinite dimensional quantum channels is introduced. It is shown that despite nonexistence of an optimal ensemble in this case it is possible to define the notion of the output optimal average state for such a channel. The characterization of the output optimal average state and a "minimax" expression for the Holevo capacity are obtained. This makes it possible to prove equivalence of several additivity properties for infinite dimensional quantum channels. The notion of the $χ$-function for an infinite dimensional channel is conside…
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 issues. Some of the known results are extended. In particular, it is shown that the quantum conditional entropy is maximized by Gaussian states and that some implications for additivity problems can be extended to the Gaussian setting.
Inspired by Montanaro's work, we introduce the concept of additivity rates of a quantum channel $L$, which give the first order (linear) term of the minimum output $p$-Rényi entropies of $L^{\otimes r}$ as functions of $r$. We lower bound the additivity rates of arbitrary quantum channels using the operator norms of several interesting matrices including partially transposed Choi matrices. As a direct consequence, we obtain upper bounds for the classical capacity of the channels. We study these matrices for random quantum channels defined by random subspaces of a bipartite tensor product space…
Additivity violation of minimum output entropy, which shows non-classical properties in quantum communication, had been proved in most cases for random quantum channels defined by Haar-distributed unitary matrices. In this paper, we investigate random completely positive maps made of Gaussian Unitary Ensembles and Ginibre Ensembles regarding this matter. Using semi-circular systems and circular systems of free probability, we not only show the multiplicativity violation of maximum output norms in the asymptotic regimes but also prove the additivity violation via Haagerup inequality for a new c…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。