M. Fannes, B. Haegeman, M. Mosonyi, D. Vanpeteghem
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)$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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.
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$.
It is easy to verify the equivalence of the quantum Markov property and the strong additivity of entropy for graded quantum systems as well. However, the structure of Markov states for graded systems is different from that for tensor product systems. For three-composed graded systems there are U(1)-gauge invariant Markov states whose restriction to the pair of marginal subsystems is non-separable.
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.
It is known that the additivity conjecture of Holevo capacity, output minimum entoropy, and the entanglement of formation (EoF), are equivalent with each other. Among them, the output minimum entropy is simplest, and hence many researchers are focusing on this quantity. Here, we suggest yet another entanglement measure, whose strong superadditivity and additivity are equivalent to the additivity of the quantities mentioned above. This quantity is as simple as the output minimum entropy, and in existing proofs of additivity conjecture of the output minimum entropy for the specific examples, the…
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…
The proof of additivity of entanglement of formation for some special cases is given. The strong concavity of von Neumann entropy due to strong subadditivity of von Neumann entropy is presented. Some general relations concerning about the entanglement of formation are proposed.
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 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 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…
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…
Constructive counterexamples to the additivity of minimum output Rényi entropy of quantum channels for all $p>1$
本文构造了针对所有p>1的量子通道最小输出Rényi熵的反例，通过高几何纠缠度量的子空间构造，展示了亚加性性质，并应用于纠缠见证器和混合态的扰动保持性。
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.
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.
It is shown that for real finite dimensional Hilbert spaces the additivity property of the minimum output entropy for quantum channels is always true.
New additivity properties of the relative entropy of entanglement and its generalizations
本文证明了当至少一个态属于特定类别时纠缠相对熵的可加性，并将其推广到基于α-z Rényi相对熵的单调量，同时给出了多种量子态的闭式表达式。
The goal of this note is to show that the analysis of the minimum output p-Renyi entropy of a typical quantum channel essentially amounts to applying Milman's version of Dvoretzky's Theorem about almost Euclidean sections of high-dimensional convex bodies. This conceptually simplifies the (nonconstructive) argument by Hayden-Winter disproving the additivity conjecture for the minimal output p-Renyi entropy (for p>1).
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 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.
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.
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.
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.
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…
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.
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.
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…
Does the sum of correlations in subsystems constitute the correlation in the total system? Such a concept can be expressed by an additivity relationship of correlations. From a strong subadditivity condition of von Neumann entropy, four different additivity relations in total correlation are derived and quantified. Based upon the classification of the additivity in total correlation, we identify the corresponding additive relationships in entanglement. It is also discussed that similar relationships are satisfied for quantum discord of pure states, but it is not always true for mixed states.
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…
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.
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 establish relations between tripartite pure state entanglement and additivity properties of the bipartite relative entropy of entanglement. Our results pertain to the asymptotic limit of local manipulations on a large number of copies of the state. We show that additivity of the relative entropy would imply that there are at least two inequivalent types of asymptotic tripartite entanglement. The methods used include the application of some useful lemmas that enable us to analytically calculate the relative entropy for some classes of bipartite states.
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…
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 investigate the Weyl channels being covariant with respect to the maximum commutative group of unitary operators. This class includes the quantum depolarizing channel and the "two-Pauli" channel as well. Then, we show that our estimation of the output entropy for a tensor product of the phase damping channel and the identity channel based upon the decreasing property of the relative entropy allows to prove the additivity conjecture for the minimal output entropy for the quantum depolarizing channel in any prime dimesnsion and for the "two Pauli" channel in the qubit case.
From Permutation Symmetry to Communication Bounds and Additivity
本文证明完全置换不变性限制量子信道通信优势，使渐近优化简化为单次使用，并建立强逆定理与输出熵界，揭示可加性结果的统一结构。
New constructive counterexamples to additivity of minimum output Rényi p-entropy of quantum channels
该研究受Grudka等人相关成果启发，构造了几类新的量子信道反例，证明其最小输出Rényi p熵在p>2时不满足可加性，这类信道具有反对称子空间的扩张与子空间特征。
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…
A constructive violation of additivity of minimum output von Neumann entropy
本文通过有限维构造模仿自由Haar酉行为，给出了最小输出冯·诺依曼熵非可加性的显式非随机例子，并证明同一信道对任意p也违反Rényi熵可加性。
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…
Mixed-state additivity properties of magic monotones based on quantum relative entropies for single-qubit states and beyond
本文证明了单量子比特态在稳定子保真度、魔幻相对熵及α-z Rényi魔幻相对熵下的乘性或可加性，识别出连续可加魔幻单调性，并给出若干态的闭式表达式及魔幻态蒸馏开销的更紧下界。
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 …
We make a number of simplifications in Gour and Friedland's proof of local additivity of minimum output entropy of a quantum channel. We follow them in reframing the question as one about entanglement entropy of bipartite states associated with a $d_B \times d_E $ matrix. We use a different approach to reduce the general case to that of a square positive definite matrix. We use the integral representation of the log to obtain expressions for the first and second derivatives of the entropy, and then exploit the modular operator and functional calculus to streamline the proof following their und…
We investigate decoherence induced by a quantum channel in terms of minimal output entropy and of map entropy. The latter is the von Neumann entropy of the Jamiolkowski state of the channel. Both quantities admit q-Renyi versions. We prove additivity of the map entropy for all q. For the case q = 2, we show that the depolarizing channel has the smallest map entropy among all channels with a given minimal output Renyi entropy of order two. This allows us to characterize pairs of channels such that the output entropy of their tensor product acting on a maximally entangled input state is larger t…
The goal of this note is to show that Hastings' counterexample to the additivity of minimal output von Neumann entropy can be readily deduced from a sharp version of Dvoretzky's theorem on almost spherical sections of convex bodies.
We argue that one of the following statements must be true: (a) extensive violations of quantum information theory's additivity conjectures exist or (b) there exists a set of `disentangled' black hole microstates that can account for the entire Bekenstein-Hawking entropy, up to at most a subleading $O(1)$ correction. Possibility (a) would be a significant result in quantum communication theory, demonstrating that entanglement can enhance the ability to transmit information much more than has currently been established. Option (b) would provide new insight into the microphysics of black holes. …
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…
Almost One Bit Violation of Minimum-Output Rényi Entropy Additivity Simultaneously at All Orders
该研究证明最小输出Rényi熵可加性可在所有非负阶数同时违反近一位，通过自由群构造和Haagerup估计实现，并给出最优输出维数尺度。
In a previous paper, we proved that the limit of the collection of possible eigenvalues of output states of a random quantum channel is a deterministic, compact set K_{k,t}. We also showed that the set K_{k,t} is obtained, up to an intersection, as the unit ball of the dual of a free compression norm. In this paper, we identify the maximum of l^p norms on the set K_{k,t} and prove that the maximum is attained on a vector of shape (a,b,...,b) where a > b. In particular, we compute the precise limit value of the minimum output entropy of a single random quantum channel. As a corollary, we show t…
We show that the minimum von-Neumann entropy output of a quantum channel is locally additive. Hasting's counterexample for the additivity conjecture, makes this result quite surprising. In particular, it indicates that the non-additivity of the minimum entropy output is a global effect of quantum channels.
The additivity of the minimal output entropy and that of the $χ$-capacity are known to be equivalent for finite-dimensional irreducibly covariant channels. In this paper we formulate a list of conditions allowing to establish similar equivalence for infinite-dimensional covariant channels with constrained input. This is then applied to Bosonic Gaussian channels with quadratic input constraint to extend the classical capacity results of the recent paper \cite{ghg} to the case where the complex structures associated with the channel and with the constraint operator need not commute. In particula…
The challenge of equality in the strong subadditivity inequality of entropy is approached via a general additivity of correlation information in terms of nonoverlapping clusters of subsystems in multipartite states (density operators). A family of tripartite states satisfying equality is derived.
Inevitable Negativity: Additivity Commands Negative Quantum Channel Entropy
本文利用特定超信道提出构造性、公理化和操作性三种等价的信道优超方法，建立信道不确定性框架，并证明量子信道熵必然为负。
Recently Hastings proved the existence of random unitary channels which violate the additivity conjecture. In this paper we use Hastings' method to derive new bounds for the entanglement of random subspaces of bipartite systems. As an application we use these bounds to prove the existence of non-unital channels which violate additivity of minimal output entropy.
Counterexamples to additivity of minimum output $p$-Rényi entropy of quantum channels for all $p\ge 0$
研究量子信道最小输出 \(p -\) 雷尼熵可加性问题，通过结合两种随机投影构造，证明对于 \(p > 3/4\) 或 \(0\leq p < 1/4\) 存在反例，缩小未解决区间并改进输出维度阈值。
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 show that the minimum Renyi entropy output of a quantum channel is locally additive for Renyi parameter alpha>1. While our work extends the results of [10] (in which local additivity was proven for alpha=1), it is based on several new techniques that incorporate the multiplicative nature of p-norms, in contrast to the additivity property of the von-Neumann entropy. Our results demonstrate that the counterexamples to the Renyi additivity conjectures exhibit global effects of quantum channels. Interestingly, the approach presented here can not be extended to Renyi entropies with parameter alp…
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…
Monotonicity under coarse-graining is a crucial property of the quantum relative entropy. The aim of this paper is to investigate the condition of equality in the monotonicity theorem and in its consequences such as the strong sub-additivity of the von Neumann entropy, the Golden-Thompson trace inequality and the monotonicity of the Holevo quantity.The relation to quantum Markovian states is briefly indicated.
It is now well-known that, with high probability, the additivity of minimum output entropy does not hold for a pair of a random quantum channel and its complex conjugate. We investigate asymptotic behavior of output states of $r$-tensor powers of such pairs, as the dimension of inputs grows. We compute the limit output states for any sequence of well-behaved inputs, which consist of a large class of input states having a nice set of parameters. Then, we show that among these input states tensor products of Bell states give asymptotically the least output entropy, giving positive mathematical e…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。