A D V E R T |
I S E M E N T |
| Math Sites: lean ages 13-∞ readme referees parents | >>> MAITH GAMES <<< | all 372 compute stand |
|
LEVEL 1 OF 1 · The classical capacity of generalized amplitude damping
Classical capacity and entropy inequalities for generalized amplitude damping
expertly designed by an internal OpenAI model · released 2026-09-24
· original PDF
IntroductionAmplitude damping models a qubit that loses an excitation to its surroundings. At nonzero stationary excited-state population, transitions in both directions are possible; generalized amplitude damping describes this relaxation together with the decay of coherence. We determine how much classical information can be transmitted through repeated, independent uses of this channel when a sender may encode each message into an arbitrary state of the entire input block. We also determine how its one-shot and regularized classical capacities behave when it is used in parallel with an arbitrary finite-dimensional partner channel. This permission is essential. Although a channel acts independently at each site, an input signal can be entangled across sites, and the receiver can measure the outputs collectively. The pure-signal coding theorem of Hausladen, Jozsa, Schumacher, Westmoreland, and Wootters [8] established the role of collective decoding. The mixed-signal coding theorems of Holevo and Schumacher–Westmoreland [10, 16], applied to arbitrary input blocks, express the unassisted classical capacity as a regularization of the Holevo information over arbitrarily long blocks. Optimizing a single use gives an achievable rate, but does not by itself rule out an advantage from entangled signals. General Holevo additivity fails [7], so removing regularization requires an argument specific to the channel. For ordinary amplitude damping, Bennett, Shor, Smolin, and Thapliyal [2] described the one-parameter optimization over two equiprobable pure signals with opposite phases. Giovannetti and Fazio [6] explicitly derived the optimized one-use expression and its attaining ensemble. Leditzky, Kaur, Datta, and Wilde [15] identified its unrestricted classical capacity as an open problem in their 2018 study of approximate additivity. The geometry of two-signal qubit optimizers was developed by Cortese [4] and Berry [3]. Hou and Fang [11] characterized the generalized channel’s one-use Holevo optimum and evaluated the resulting scalar optimization numerically. Khatri, Sharma, and Wilde [12] placed that characterization alongside upper bounds on the unrestricted capacity. More recently, Fang [5] derived a close converse bound throughout the generalized family; that bound leaves a gap from the one-use value in general. Tang, Zhu, Bai, and Wang [18] established Holevo and classical-capacity additivity with arbitrary finite-dimensional partners for qubit channels admitting a pure output, including ordinary amplitude damping. Their triangular block entropy inequality [18] is the zero-block estimate recalled below. At positive damping and strictly interior thermal occupation, the generalized channel has no pure output, so that channel criterion does not apply. We extend the triangular estimate to the thermal block structure by a convex mixture that preserves its scalar entropy term. Both zero-block factorizations in this mixture have the same scalar contribution; entropy concavity therefore preserves the lower bound needed for the thermal channel. Some parameter regimes already have exact capacity formulas from broader additivity theorems. King’s theorem for unital qubit channels [13] applies at stationary occupation \(1/2\), and Shor’s entanglement-breaking theorem [17] applies in the corresponding region of the generalized family; see [12] for that specialization. Those theorems permit an arbitrary partner channel. The entropy argument below covers every parameter pair. Its rectangular form also gives additivity of one-shot Holevo capacity and minimum output entropy with every finite-dimensional partner, and regularization gives additivity of unassisted classical capacity for the same pair. Definitions and resultAll vector spaces are finite dimensional, and a star denotes the adjoint. Write \(\mathcal B(\mathcal H)\) for the algebra of linear operators on a complex Hilbert space \(\mathcal H\). For a positive semidefinite matrix, not necessarily normalized, write \[\mathcal S(P)=-\mathop{\mathrm{Tr}}(P\ln P),\qquad 0\ln0=0.\] Thus \(\mathcal S\) is entropy in nats on states. Write \[H(q_1,\ldots,q_m)=-\sum_iq_i\ln q_i,\qquad h(q)=-q\ln q-(1-q)\ln(1-q)\] for the entropy of a probability vector and the binary entropy, respectively. The determinant entropy function is \[ g(u)=h\!\left(\frac{1+\sqrt{1-4u}}2\right), \qquad 0\le u\le\frac14. \tag{1}\] A two-by-two state of determinant \(u\) has entropy \(g(u)\), by its characteristic polynomial. For \(\gamma,\nu\in[0,1]\), define the generalized amplitude-damping channel by \[ \mathcal A_{\gamma,\nu} \begin{pmatrix}1-q&z\\\overline z&q\end{pmatrix} =\begin{pmatrix}1-t&\sqrt{1-\gamma}\,z\\ \sqrt{1-\gamma}\,\overline z&t\end{pmatrix}, \qquad t=(1-\gamma)q+\gamma\nu. \tag{2}\] The input is a state when \(0\le q\le1\) and \(|z|^2\le q(1-q)\). Here \(\nu\) is the stationary excited-state population; this explicit convention fixes any possible ambiguity in thermal parameters. We measure Holevo information and capacity in bits: \[ \chi(\mathcal N)=\frac1{\ln2} \sup_{\{q_a,\rho_a\}} \left\{\mathcal S\!\left(\sum_aq_a\mathcal N(\rho_a)\right) -\sum_aq_a\mathcal S\bigl(\mathcal N(\rho_a)\bigr)\right\}. \tag{3}\] The supremum runs over all finite ensembles of input states, with \(q_a\ge0\) and \(\sum_aq_a=1\). For a tensor-power channel, the states are unrestricted on the entire input space. An \(n\)-use classical code assigns a state on the full input space to each of its \(M_n\) equiprobable messages and uses one measurement on all \(n\) outputs. The unassisted classical capacity \(C(\mathcal N)\) is the supremum of rates \(R\) for which such codes have average decoding error tending to zero and \(\liminf_{n\to\infty}n^{-1}\log_2 M_n\ge R\). There is no preshared entanglement or feedback. The channel is memoryless, so its \(n\)-use action is \(\mathcal N^{\otimes n}\). The coding theorem gives \[ C(\mathcal N)=\sup_{n\ge1}\frac1n\chi(\mathcal N^{\otimes n}). \tag{4}\] Indeed, the mixed-signal coding theorem [10, 16] applies to any fixed finite ensemble of block inputs, treating each block as one letter. It achieves rates below the ensemble’s Holevo information per physical channel use; see [10] for the finite-alphabet statement. Conversely, the Holevo bound and Fano’s inequality applied to the uniform output ensemble of any \(n\)-use code with average error \(\epsilon_n\) give \[(1-\epsilon_n)\log_2 M_n \le \chi(\mathcal N^{\otimes n})+\frac{h(\epsilon_n)}{\ln2}.\] The normalized asymptotic limit equals the supremum in (4): if \(a_n=\chi(\mathcal N^{\otimes n})\), product ensembles give \(a_{m+n}\ge a_m+a_n\), and \(0\le a_n\le n\log_2 d_{\mathrm{out}}\), where \(d_{\mathrm{out}}\) is the output dimension. For fixed \(k\), writing \(n=qk+r\) gives \(a_n\ge q a_k\); taking a lower limit and then the supremum over \(k\) proves the assertion. This coding result supplies the operational interpretation of the entropy optimization below. For a finite-dimensional channel, define its minimum output entropy in nats by \[ S_{\min}(\mathcal N)=\min_{\rho}\mathcal S\bigl(\mathcal N(\rho)\bigr), \tag{5}\] where \(\rho\) ranges over all input density matrices. The minimum exists because the input state space is compact and entropy is continuous in finite dimensions. Theorem 1. For all \(\gamma,\nu\in[0,1]\) and every integer \(n\ge1\), \[ \chi(\mathcal A_{\gamma,\nu}^{\otimes n}) =n\chi(\mathcal A_{\gamma,\nu}) =\frac n{\ln2}\max_{0\le p\le1} \{h((1-\gamma)p+\gamma\nu)-g(v_{\gamma,\nu}(p))\}, \tag{6}\] where \[ v_{\gamma,\nu}(p) =\gamma\nu(1-\nu)+\gamma(1-\gamma)(p-\nu)^2. \tag{7}\] In particular, \(C(\mathcal A_{\gamma,\nu})=\chi(\mathcal A_{\gamma,\nu})\). If \(p\) maximizes (6), independent products of the two equiprobable signals \[ \phi_\pm=\sqrt{1-p}\,\lvert 0\rangle\ \pm\sqrt p\,\lvert 1\rangle \tag{8}\] attain the Holevo information at every block length. The tensor-power upper bound includes all entangled block signals; a product ensemble attains it. Equation (4) turns this finite-block optimum into an asymptotic reliable rate with collective decoding. The rectangular thermal inequality developed below gives the following stronger consequence. Corollary 2 (Additivity with a finite-dimensional partner). Let \(\gamma,\nu\in[0,1]\), put \(\mathcal A=\mathcal A_{\gamma,\nu}\), and let \(\mathcal N:\mathcal B(\mathcal H_{\mathrm{in}})\to \mathcal B(\mathcal H_{\mathrm{out}})\) be completely positive and trace preserving, where \(\mathcal H_{\mathrm{in}}\) and \(\mathcal H_{\mathrm{out}}\) are nonzero finite-dimensional complex Hilbert spaces. Then \[\begin{align*} \chi(\mathcal A\otimes\mathcal N) &=\chi(\mathcal A)+\chi(\mathcal N),\tag{9}\\ S_{\min}(\mathcal A\otimes\mathcal N) &=S_{\min}(\mathcal A)+S_{\min}(\mathcal N),\tag{10}\\ C(\mathcal A\otimes\mathcal N) &=C(\mathcal A)+C(\mathcal N). \tag{11}\end{align*}\] Here \(\chi\) is the unconstrained one-shot Holevo capacity in (3), and \(C\) is the regularized unassisted classical capacity in (4). The partner retains its full regularization: \(C(\mathcal N)\) can differ from \(\chi(\mathcal N)\). Proof strategyFor a pure one-qubit input with excitation probability \(p\), the output determinant is \(v_{\gamma,\nu}(p)\) and its entropy is \(e(p):=g(v_{\gamma,\nu}(p))\). The central estimate extends this exact one-site value to every pure \(n\)-qubit input \(\psi\): \[ \mathcal S\bigl(\mathcal A_{\gamma,\nu}^{\otimes n}(\lvert \psi\rangle\langle \psi\rvert)\bigr) \ge\sum_{j=1}^n e(p_j), \tag{12}\] where \(p_j\) is the probability of outcome \(1\) at site \(j\) in the computational basis. A bound only on the unconstrained minimum output entropy would lose these populations and would not suffice for the Holevo optimization. To prove (12), split the input according to its first qubit: \(\psi=\sqrt{1-p_1}\lvert 0\rangle\otimes\psi_0+ \sqrt{p_1}\lvert 1\rangle\otimes\psi_1\). The normalized conditional vectors \(\psi_0,\psi_1\) can be nonorthogonal and can remain entangled on the other sites. For the channel on those sites choose a Kraus representation \(\mathcal N(P)=\sum_J L_JPL_J^*\). Define column \(J\) of \(X\) as \(L_J\psi_0\) and column \(J\) of \(Y\) as \(L_J\psi_1\). Their Gram products are the two branch outputs, and \(XY^*\) is the image of the cross operator between the branches. The thermal block inequality gives \[\mathcal S(\text{full output})\ge e(p_1) +(1-p_1)\mathcal S(XX^*)+p_1\mathcal S(YY^*).\] This one-step application does not require \(\mathcal N\) to be a damping tensor power: its Kraus columns may have any finite rectangular shape. For a damping tensor power, convexity of \(e\) combines the conditional populations into the original site populations, and iteration gives (12) without restricting the input vector. The matrix proof leading to this recursion is developed in [sec:block,sec:thermal]. For a zero-block factor \(M=\bigl(\begin{smallmatrix}A&B\\ C&0\end{smallmatrix}\bigr)\), with squared Hilbert–Schmidt masses \(x=\mathop{\mathrm{Tr}}(AA^*)\), \(y=\mathop{\mathrm{Tr}}(BB^*)\), \(z=\mathop{\mathrm{Tr}}(CC^*)\) summing to one, the entropy contribution beyond the weighted block entropies is at least \(g(yz)\). We express the entropy deficit as an integral of log-determinant differences. Joint convexity permits simultaneous averaging over coordinate signs; this reduces the estimate to a concave scalar deficit. Zero padding preserves the result for rectangular blocks, which are required by the Kraus construction. The thermal extension uses two such factorizations whose products of corner masses agree, so the same \(g\) term survives their convex mixture. Finally, for an ensemble with mean populations \(\overline p_j\), the entropy of the ensemble-average output is at most \(\sum_j h((1-\gamma)\overline p_j+\gamma\nu)\), by the diagonal-entropy bound in the computational basis and classical subadditivity. Entropy concavity and convexity of \(e\) first extend (12) to mixed inputs. Averaging this bound and using convexity of \(e\) bounds the average of the individual output entropies from below by \(\sum_j e(\overline p_j)\). The difference gives the upper bound in 1; products of the phase pair (8) attain it. For an arbitrary partner, the branch outputs form an ensemble whose mean is the second output marginal. The entropy of the mean full output is at most the binary entropy of its first output population plus the entropy of that same marginal. Subtraction leaves one scalar damping objective plus at most \((\ln2)\chi(\mathcal N)\). The minimum-output equality follows from the same one-step estimate, and the capacity equality follows by iterating against \(\mathcal N^{\otimes n}\) before regularizing. 4 proves the recursion and population convexity, 5 carries out the ensemble optimization, and 6 derives the arbitrary-partner consequences. 7 records the ordinary, unital, and endpoint formulas. 8 gives direct Hessian proofs of the scalar concavity and log-determinant convexity, providing an independent analytic route to the same zero-block estimate. An entropy inequality with one zero blockOur first objective is to separate the entropy produced by the block pattern from the entropies within its three nonzero entries. The rectangular formulation is needed because a channel output and its Kraus index space can have different dimensions. The following is the case of the triangular block entropy inequality of Tang, Zhu, Bai, and Wang [18] in which all blocks have the same rectangular shape, after permuting block rows. We give a direct proof in the form needed for the thermal extension. Theorem 3. Let \(A,B,C\in\mathbb C^{d\times e}\), and put \[M=\begin{pmatrix}A&B\\ C&0\end{pmatrix},\qquad x=\mathop{\mathrm{Tr}}(AA^*),\quad y=\mathop{\mathrm{Tr}}(BB^*),\quad z=\mathop{\mathrm{Tr}}(CC^*).\] If \(x+y+z=1\), then \[ \mathcal S(MM^*)\ge x\mathcal S(AA^*/x)+y\mathcal S(BB^*/y)+z\mathcal S(CC^*/z)+g(yz), \tag{13}\] where each term with zero weight is omitted. The scalar matrix \(\bigl(\begin{smallmatrix}\sqrt x&\sqrt y\\\sqrt z&0\end{smallmatrix}\bigr)\) has squared singular values with sum \(1\) and product \(yz\). The term \(g(yz)\) is their entropy. To separate this contribution from the entropies inside the three blocks, write the entropy deficit as \[\Delta=\mathcal S(AA^*)+\mathcal S(BB^*)+\mathcal S(CC^*)-\mathcal S(MM^*).\] Since \(\mathcal S(AA^*)=x\mathcal S(AA^*/x)-x\ln x\) for \(x>0\), and similarly for the other blocks, the theorem is equivalent to \[\Delta\le H(x,y,z)-g(yz).\] We will express \(\Delta\) as an integral of log-determinant differences. Joint convexity then permits averaging over coordinate signs, and homogeneous scalar concavity combines the resulting coordinates. This integral and averaging route is also used in [18]. Block norm compression provides a related perspective. King [14] compared the Schatten norm of a positive two-by-two block matrix with the norm of the scalar matrix of block norms. Audenaert [1] studied the corresponding comparison for arbitrary two-row block matrices and proved several special cases. The entropy argument below allows noncommuting blocks and does not require the general norm-compression conjecture. From entropy to log determinantsThe direct sum of the three individual Gram matrices and the full Gram matrix have equal trace. The following identity converts their entropy difference into an integral, including when their dimensions or ranks differ. Lemma 4. If \(U,V\ge0\) have equal trace, with possibly different sizes, then \[ \mathcal S(U)-\mathcal S(V) =\int_0^\infty \bigl[\ln\det(I+rU)-\ln\det(I+rV)\bigr]\frac{\,\mathrm dr}{r^2}. \tag{14}\] The integral converges absolutely. Proof. Let \(f(r)\) denote the bracket. Equal trace gives \(f(r)=O(r^2)\) at zero, while \(f(r)=O(\ln r)\) at infinity. Hence the integral converges absolutely and \(f(r)/r\) vanishes at both endpoints. Integration by parts reduces it to \(\int_0^\infty f'(r)\,\mathrm dr/r\). If \(a_i\) and \(b_j\) are the positive eigenvalues of \(U\) and \(V\), then \[\frac{f'(r)}r =\sum_i\frac{a_i}{r(1+ra_i)} -\sum_j\frac{b_j}{r(1+rb_j)}.\] A primitive of the term for \(a>0\) is \(a\ln\bigl(r/(1+ra)\bigr)\). In the signed sum, its lower endpoint limit is zero because the coefficients of \(\ln r\) cancel by equal trace. Its upper endpoint contribution is \(-a\ln a\). Taking their difference gives \(\mathcal S(U)-\mathcal S(V)\). Zero eigenvalues contribute nothing. ◻ Joint convexity by a contractionThe log-determinant function used in the averaging step is the following. Its joint convexity follows by specialization and continuity from Hiai’s trace-function theorem [9]. We give a direct proof: the contraction argument is the specialization of [18] to a two-by-two block matrix. Lemma 5. For each fixed \(Z\in\mathbb C^{N\times N}\), the function \[ G_Z(D,E)=\ln\det(D+ZE^{-1}Z^*)-\ln\det D, \qquad D,E>0, \tag{15}\] is jointly convex on pairs of positive definite Hermitian matrices. Proof. Set \[\mathcal D=\begin{pmatrix}D&0\\0&E\end{pmatrix},\qquad \mathcal C=\begin{pmatrix}D&Z\\-Z^*&E\end{pmatrix}.\] The block determinant identity gives \[\det\mathcal C=\det E\det(D+ZE^{-1}Z^*)>0, \qquad G_Z(D,E)=\ln\det\mathcal C-\ln\det\mathcal D.\] Although \(\mathcal C\) is not generally Hermitian, its determinant is positive and its logarithm here is the real logarithm. Along an affine line in \((D,E)\), let \(\mathcal H\) be the derivative of \(\mathcal D\), which is also the derivative of \(\mathcal C\). The determinant derivative formula gives \[ G_Z''=\mathop{\mathrm{Tr}}(\mathcal D^{-1}\mathcal H\mathcal D^{-1}\mathcal H) -\mathop{\mathrm{Tr}}(\mathcal C^{-1}\mathcal H\mathcal C^{-1}\mathcal H). \tag{16}\] At the point under consideration put \[L=\mathcal D^{-1/2}\mathcal H\mathcal D^{-1/2},\qquad K=\mathcal D^{-1/2}(\mathcal C-\mathcal D)\mathcal D^{-1/2}.\] Then \(L=L^*\) and \(K^*=-K\). Consequently \(\|(I+K)v\|_2^2=\|v\|_2^2+\|Kv\|_2^2\) for every vector \(v\), and \(R=(I+K)^{-1}\) exists with operator norm at most one. Cyclicity of trace rewrites (16) as \[G_Z''=\|L\|_{\mathrm{HS}}^2-\mathop{\mathrm{Tr}}((RL)^2).\] The last trace is real because both log determinants along the line are real. For any complex matrix \(B\), entrywise Cauchy–Schwarz gives \(|\mathop{\mathrm{Tr}}(B^2)|=|\sum_{i,j}B_{ij}B_{ji}|\le\|B\|_{\mathrm{HS}}^2\). Therefore \[\mathop{\mathrm{Tr}}((RL)^2)\le|\mathop{\mathrm{Tr}}((RL)^2)| \le\|RL\|_{\mathrm{HS}}^2\le\|L\|_{\mathrm{HS}}^2.\] Every second directional derivative is thus nonnegative. The positive definite domain is convex, so \(G_Z\) is convex along each line segment, as required. ◻ The scalar deficit and its homogeneityWe next use the same convexity to control the scalar entropy deficits that sign averaging will produce. For \(x,y,z\ge0\), define \[\begin{align*} m&=x+y+z,\qquad \lambda_\pm=\frac{m\pm\sqrt{m^2-4yz}}2, \tag{17}\\ F(x,y,z)&=-x\ln x-y\ln y-z\ln z +\lambda_+\ln\lambda_++\lambda_-\ln\lambda_-. \tag{18}\end{align*}\] Here \(m^2\ge4yz\), and \(\lambda_\pm\) are nonnegative with sum \(m\) and product \(yz\). Thus \(F\) is continuous on the nonnegative octant, with the usual convention at zero. On the probability simplex it is exactly the deficit in our target: \(F(x,y,z)=H(x,y,z)-g(yz)\). Lemma 6. The function \(F\) is positively homogeneous of degree one and concave on the probability simplex. For every finite collection of nonnegative triples, \[ \sum_i F(x_i,y_i,z_i) \le F\!\left(\sum_i x_i,\sum_i y_i,\sum_i z_i\right). \tag{19}\] Proof. The nonnegative entries in the two lists \((x,y,z)\) and \((\lambda_+,\lambda_-)\) have the same sum. Applying 4 to the corresponding diagonal matrices gives \[\begin{align*} F(x,y,z) &=\int_0^\infty \ln\frac{(1+rx)(1+ry)(1+rz)} {(1+r\lambda_+)(1+r\lambda_-)}\frac{\,\mathrm dr}{r^2}\\ &=\int_0^\infty\left[\ln(1+rx) -\ln\!\left(1+\frac{rx}{(1+ry)(1+rz)}\right)\right] \frac{\,\mathrm dr}{r^2}. \tag{20}\end{align*}\] The second equality uses \((1+r\lambda_+)(1+r\lambda_-)=1+r(x+y+z)+r^2yz\); the integral is absolutely convergent by the lemma. For \(x=1\) its bracket is \[\ln(1+r)-G_{\sqrt r}(1+ry,1+rz).\] By 5, this is concave in \((y,z)\) for every \(r>0\). Integrating the concavity inequality shows that \(F(1,\cdot,\cdot)\) is concave on the nonnegative quadrant. Under scaling of \((x,y,z)\) by a positive constant, both \(\lambda_\pm\) scale by the same constant. Their sum is \(m\), so the logarithms of the scaling constant cancel in (18). This proves homogeneity, including scale zero by continuity. For a nonempty collection with all \(x_i>0\), set \(x=\sum_i x_i\). Homogeneity and the preceding concavity now give \[\begin{align*} \sum_iF(x_i,y_i,z_i) &=x\sum_i\frac{x_i}{x}F(1,y_i/x_i,z_i/x_i)\\ &\le xF\!\left(1,\frac{\sum_i y_i}{x}, \frac{\sum_i z_i}{x}\right) =F\!\left(x,\sum_i y_i,\sum_i z_i\right). \end{align*}\] For a collection containing zero first coordinates, replace every \(x_i\) by \(x_i+\varepsilon\), apply this inequality, and let \(\varepsilon\downarrow0\). Continuity of \(F\) gives (19), even when every \(x_i=0\). The empty collection gives zero on both sides. Finally, applying superadditivity to the two triples \(\theta a\) and \((1-\theta)b\) and using homogeneity gives \(F(\theta a+(1-\theta)b)\ge\theta F(a)+(1-\theta)F(b)\) for nonnegative triples \(a,b\) and \(0\le\theta\le1\). In particular, \(F\) is concave on the probability simplex. ◻ Sign averaging and the block estimateThe two convexity consequences are now in place. The Schur complement will put the matrix deficit into the form involving \(G_Z\); averaging over signs will replace its matrix arguments by diagonal entries; and 6 will combine the resulting scalar deficits. Proof of 3. First suppose that all three blocks are square of size \(N\), and temporarily allow arbitrary nonnegative masses \(x,y,z\). The matrices \[U=AA^*\oplus BB^*\oplus CC^*,\qquad V=MM^*\] have equal trace. For \(r>0\), put \(D=I+rBB^*\) and \(E=I+rC^*C\). The Schur complement of \(I+rCC^*\) in \(I+rMM^*\) yields \[ \det(I+rMM^*) =\det(I+rCC^*)\det(D+rAE^{-1}A^*), \tag{21}\] where \(I-rC^*(I+rCC^*)^{-1}C=(I+rC^*C)^{-1}\). Consequently the integrand bracket in (14) is \[ \ln\det(I+rAA^*)-G_{\sqrt r A}(D,E). \tag{22}\] Choose a singular-value decomposition \(A=U_A\Sigma V_A^*\). Replacing \((A,B,C)\) by \((\Sigma,U_A^*B,CV_A)\) amounts to multiplying \(M\) on the left and right by block-diagonal unitaries; all entropies and masses are preserved. In these coordinates write \[A=\mathop{\mathrm{diag}}(\sqrt{x_1},\ldots,\sqrt{x_N}),\qquad y_i=(BB^*)_{ii},\qquad z_i=(C^*C)_{ii}.\] These entries are nonnegative and satisfy \(\sum_i(x_i,y_i,z_i)=(x,y,z)\). For each \(\varepsilon\in\{-1,1\}^N\), let \(S_\varepsilon=\mathop{\mathrm{diag}}(\varepsilon_1,\ldots,\varepsilon_N)\). Because \(S_\varepsilon A S_\varepsilon=A\), \[G_{\sqrt r A}(S_\varepsilon DS_\varepsilon, S_\varepsilon ES_\varepsilon) =G_{\sqrt r A}(D,E).\] Averaging simultaneously over all signs removes the off-diagonal entries of both arguments. Joint convexity from 5 therefore gives \[G_{\sqrt r A}(D,E)\ge G_{\sqrt r A}\bigl(\mathop{\mathrm{diag}}(1+ry_i),\mathop{\mathrm{diag}}(1+rz_i)\bigr).\] Because \(G\) is subtracted in (22), that bracket is bounded above by \[\begin{align*} &\sum_i\left[\ln(1+rx_i) -\ln\!\left(1+\frac{rx_i}{(1+ry_i)(1+rz_i)}\right)\right]\\ &\hspace{12mm}= \sum_i\ln\frac{(1+rx_i)(1+ry_i)(1+rz_i)} {1+r(x_i+y_i+z_i)+r^2y_iz_i}. \tag{23}\end{align*}\] By (20), each summand integrates against \(\,\mathrm dr/r^2\) to \(F(x_i,y_i,z_i)\), and these finitely many integrals converge absolutely. Integrating the inequality and applying 6 proves \[ \mathcal S(AA^*)+\mathcal S(BB^*)+\mathcal S(CC^*)-\mathcal S(MM^*) \le\sum_iF(x_i,y_i,z_i)\le F(x,y,z). \tag{24}\] When \(x+y+z=1\), the last expression is \(H(x,y,z)-g(yz)\). For \(x>0\), \(\mathcal S(AA^*)=x\mathcal S(AA^*/x)-x\ln x\), and the same identity holds for the other two blocks. Substitution gives (13). If a mass vanishes, the corresponding block is zero, and its contribution is zero. Thus the proof includes every boundary case; all inverses used above are of positive definite matrices even when \(A,B,C\) are singular. Finally, for \(d\times e\) blocks let \(N=\max(d,e)\) and choose the coordinate isometries \(J:\mathbb C^d\to\mathbb C^N\) and \(K:\mathbb C^e\to\mathbb C^N\). Replace each block \(A\) by \(JAK^*\), and likewise for \(B,C\). The resulting square block matrix is \((J\oplus J)M(K\oplus K)^*\), so this operation only adds zero singular values to \(M\) and to each block. All masses and entropies in (13) are unchanged. The square case therefore proves the rectangular case as well. ◻ A scalar convexity fact for the channel applicationThe scalar deficit estimate completes the zero-block theorem. The later channel argument also needs a different property of the same entropy function: its convexity as a function of the square root of the determinant. We record it separately. Lemma 7. The function \(s\mapsto g(s^2)\) is nondecreasing and convex on \([0,1/2]\). Consequently, \(g\) is nondecreasing on \([0,1/4]\). Proof. For \(0<u<1/4\), put \[t=\sqrt{1-4u},\qquad L=\frac{\mathop{\mathrm{atanh}}t}{t},\qquad \mathop{\mathrm{atanh}}t=\frac12\ln\frac{1+t}{1-t}.\] Differentiating the definition of \(g\) gives \[ g'(u)=2L,\qquad g''(u)=\frac{4L-1/u}{t^2},\qquad ug''(u)+\frac12g'(u)=\frac{L-1}{t^2}\ge0. \tag{25}\] The last inequality follows from \(\mathop{\mathrm{atanh}}t\ge t\), since \((\mathop{\mathrm{atanh}}t)'=(1-t^2)^{-1}\ge1\) and both functions vanish at zero. For \(0<s<1/2\), these identities give \[\frac{\mathrm d}{\mathrm ds}g(s^2)=2s g'(s^2)\ge0,\qquad \frac{\mathrm d^2}{\mathrm ds^2}g(s^2) =4\left(s^2g''(s^2)+\frac12g'(s^2)\right)\ge0.\] Continuity supplies both conclusions at the endpoints; no boundary derivatives are required. Since \(u\mapsto\sqrt u\) is nondecreasing, \(g(u)=g((\sqrt u)^2)\) is nondecreasing as well. ◻ The function \(\kappa\mapsto g(\kappa^2/4)/\ln2\) is the entropy–concurrence function of Wootters [19]. Its monotonicity and convexity are the scalar properties just proved. We use these properties, rather than any additivity statement about entanglement of formation. A thermal block entropy inequalityThe zero-block theorem does not apply directly when thermal excitation and decay both occur. We will express the resulting state as a convex mixture of two states to which it does apply, preserving the same scalar entropy term in each. We first recall two elementary entropy facts, including their proofs to fix the directions of the inequalities used below. For a state \(P\), \[ \mathcal S(P)\le H(\mathop{\mathrm{diag}}P). \tag{26}\] Indeed, its diagonal is obtained from its eigenvalue vector by the doubly stochastic matrix of squared absolute unitary entries. Concavity of \(-s\ln s\), applied row by row and then summed, gives (26). Entropy is also concave on states: \[ \mathcal S\!\left(\sum_iw_iP_i\right)\ge\sum_iw_i\mathcal S(P_i). \tag{27}\] To see this, choose a basis diagonalizing the mixture, apply classical entropy concavity in that basis, and then use (26) on each \(P_i\). The next result is the extension needed for thermal channels. Theorem 8. Let \(X,Y\) be complex matrices of the same rectangular shape with \(\mathop{\mathrm{Tr}}(XX^*)=\mathop{\mathrm{Tr}}(YY^*)=1\). Suppose \(\alpha,\beta,\eta,\delta\ge0\) sum to one and \[ \alpha\delta-\beta\eta=K^2,\qquad K\ge0. \tag{28}\] Set \[ T=\begin{pmatrix} \alpha XX^*+\beta YY^*&KXY^*\\ KYX^*&\eta XX^*+\delta YY^* \end{pmatrix},\qquad U_0=\alpha+\beta,\quad U_1=\eta+\delta, \tag{29}\] and \(u=U_0U_1-K^2\). Then \(T\) is a state, \(0\le u\le1/4\), and \[ \mathcal S(T)\ge(\alpha+\eta)\mathcal S(XX^*) +(\beta+\delta)\mathcal S(YY^*)+g(u). \tag{30}\] Proof. The coefficient identity gives \[ u=\beta U_1+\eta U_0. \tag{31}\] It follows that \(0\le u\le U_0U_1\le1/4\). Suppose first that \(u>0\), so \(U_0,U_1>0\). To construct the mixture, keep \(X,Y,K\) and the row sums \(U_0,U_1\) fixed. Writing \(\alpha=U_0-\beta\) and \(\delta=U_1-\eta\), the coefficient condition (28) becomes the line equation \(U_1\beta+U_0\eta=u\). Its nonnegative solutions form the segment joining \((\beta,\eta)=(u/U_1,0)\) and \((0,u/U_0)\). At either endpoint one coefficient vanishes, permitting a zero-block Gram factorization. The fixed row sums and cross coefficient retain the same value of \(u\). These endpoints and the weights expressing the original coefficients as their convex mixture are \[ \begin{array}{c|cccc|c} i&\alpha_i&\beta_i&\eta_i&\delta_i&w_i\\ \hline 1&K^2/U_1&u/U_1&0&U_1&\beta U_1/u\\[2pt] 2&U_0&0&u/U_0&K^2/U_0&\eta U_0/u \end{array} \tag{32}\] Both coefficient sets are nonnegative and have the original row sums \(U_0,U_1\), since \(K^2+u=U_0U_1\). Each therefore sums to one and satisfies \(\alpha_i\delta_i=K^2\). Moreover, \(w_1+w_2=1\) by (31), and \[\sum_iw_i\beta_i=\beta,\qquad \sum_iw_i\eta_i=\eta.\] The fixed row sums then recover \(\alpha\) and \(\delta\) as well. Let \(T_i\) denote (29) with the \(i\)th coefficient set. Both \(T_i\) have cross block \(KXY^*\), so \(T=w_1T_1+w_2T_2\). They have Gram factorizations \[ \begin{split} M_1&=\begin{pmatrix} \sqrt{\alpha_1}X&\sqrt{\beta_1}Y\\ \sqrt{\delta_1}Y&0 \end{pmatrix},\\ M_2&=\begin{pmatrix} \sqrt{\alpha_2}X&0\\ \sqrt{\delta_2}Y&\sqrt{\eta_2}X \end{pmatrix},\qquad T_i=M_iM_i^*. \end{split} \tag{33}\] In particular, \(T_i\) and \(T\) are positive semidefinite of trace one. Apply 3 to \(M_1\) and to \(M_2\) after swapping its two block rows. The swap is unitary on the output space and preserves entropy. The respective products of the off-corner block masses are \[\beta_1\delta_1=u,\qquad \eta_2\alpha_2=u.\] Thus the same scalar term occurs in both inequalities: \[\mathcal S(T_i)\ge(\alpha_i+\eta_i)\mathcal S(XX^*) +(\beta_i+\delta_i)\mathcal S(YY^*)+g(u).\] Concavity (27) and recovery of the original coefficients now give (30). Zero weights in (32) do not change this argument. It remains to consider \(u=0\). If a row sum vanishes, all its nonnegative coefficients vanish and \(K=0\). The other diagonal block is a convex mixture of \(XX^*\) and \(YY^*\), so positivity, normalization, and (30) follow from (27) and \(g(0)=0\). If both row sums are positive, (31) forces \(\beta=\eta=0\), and \(K=\sqrt{\alpha\delta}\). Then the first factorization in (33), with coefficients \((\alpha,0,0,\delta)\), applies directly. It proves positivity and reduces (30) to 3 with a zero block mass. These cases exhaust the possibilities. ◻ Remark 9. No orthogonality condition on \(X,Y\) and no commutativity of their Gram products is used. The bound is sharp when \(X=Y\): in that case \(T=\bigl(\begin{smallmatrix}U_0&K\\K&U_1\end{smallmatrix}\bigr) \otimes XX^*\), whose entropy is \(g(u)+\mathcal S(XX^*)\). From the thermal inequality to channel outputsWe first turn the thermal matrix inequality into an entropy bound for \(\mathcal A_{\gamma,\nu}\otimes\mathcal N\), with any finite-dimensional partner channel \(\mathcal N\). Its two matrices will encode the outputs of conditional input branches; a common Kraus index will preserve their cross operator. We then iterate this bound for repeated damping uses, retaining the input population at every site. The one-qubit entropy and its convexityFix \(\gamma,\nu\in[0,1]\) and abbreviate \(\mathcal A=\mathcal A_{\gamma,\nu}\). Put \[ k=\sqrt{1-\gamma},\qquad b=\gamma(1-\nu),\qquad c=\gamma\nu,\qquad a=1-c,\qquad d=1-b. \tag{34}\] Then \[ a+c=b+d=1,\qquad ad-bc=k^2. \tag{35}\] The population transition matrix is \(\bigl(\begin{smallmatrix}a&b\\c&d\end{smallmatrix}\bigr)\) and the coherence multiplier is \(k\). A Kraus representation is \[ \begin{aligned} L_0&=\sqrt{1-\nu}\,\mathop{\mathrm{diag}}(1,k),& L_1&=\sqrt b\,\lvert 0\rangle\langle 1\rvert,\\ L_2&=\sqrt\nu\,\mathop{\mathrm{diag}}(k,1),& L_3&=\sqrt c\,\lvert 1\rangle\langle 0\rvert. \end{aligned} \tag{36}\] Direct multiplication gives \(\mathcal A(P)=\sum_{i=0}^3L_iPL_i^*\) and \(\sum_{i=0}^3L_i^*L_i=I\), including all parameter endpoints. For \(p\in[0,1]\), define \[ \begin{split} v(p)&=(a(1-p)+bp)(c(1-p)+dp)-k^2p(1-p)\\ &=ac(1-p)^2+bdp^2+2bcp(1-p),\qquad e(p)=g(v(p)). \end{split} \tag{37}\] Any pure qubit state of excitation probability \(p\) has coherence modulus \(\sqrt{p(1-p)}\). Hence \(v(p)\) is its output determinant and \(e(p)\) its output entropy. In particular, \(v(p)\in[0,1/4]\). Expanding (34) in (37) gives (7). If \(\gamma>0\) and \(0<\nu<1\), then \(v(p)\ge\gamma\nu(1-\nu)>0\) for every \(p\). Every pure input therefore has a positive definite output. A mixed input is a convex combination of pure inputs, so its output is positive definite as well. Thus these thermal parameters lie outside the pure-output class treated by Tang, Zhu, Bai, and Wang [18]. Lemma 10. For every \(\gamma,\nu\in[0,1]\), the function \(p\mapsto g(\gamma\nu(1-\nu)+\gamma(1-\gamma)(p-\nu)^2)\) is convex on \([0,1]\). Proof. The completed-square formula (7) gives \[\sqrt{v(p)}= \left\|\begin{pmatrix} \sqrt{\gamma\nu(1-\nu)}\\ \sqrt{\gamma(1-\gamma)}\,(p-\nu) \end{pmatrix}\right\|_2.\] This is a convex function of \(p\), being the norm of an affine vector, even when either coefficient vanishes. By 7, \(s\mapsto g(s^2)\) is nondecreasing and convex on \([0,1/2]\), which contains the range of \(\sqrt{v}\). A nondecreasing convex function of a convex function is convex: apply the inner convexity, then monotonicity, then the outer convexity. This proves the assertion, with no parameter exclusions. ◻ A single damping use with an arbitrary partnerThe following estimate is the channel form of 8. Its scalar term is the pure one-qubit entropy \(e(p)\), and the remaining terms are the output entropies of the two conditional branches. Lemma 11. Let \(\gamma,\nu\in[0,1]\), put \(\mathcal A=\mathcal A_{\gamma,\nu}\) and \(e(p)=g(v_{\gamma,\nu}(p))\), and let \(\mathcal N:\mathcal B(\mathcal H_{\mathrm{in}})\to \mathcal B(\mathcal H_{\mathrm{out}})\) be completely positive and trace preserving on nonzero finite-dimensional complex Hilbert spaces. For a unit vector \(\psi\in\mathbb C^2\otimes\mathcal H_{\mathrm{in}}\), write \[\psi=\sqrt{1-p}\,\lvert 0\rangle\otimes\psi_0 +\sqrt p\,\lvert 1\rangle\otimes\psi_1, \qquad 0\le p\le1,\] where each \(\psi_i\) is a unit vector and a zero-weight branch may be chosen arbitrarily. Then \[ \begin{split} \mathcal S\bigl((\mathcal A\otimes\mathcal N)(\lvert \psi\rangle\langle \psi\rvert)\bigr) &\ge e(p)+(1-p)\mathcal S\bigl(\mathcal N(\lvert \psi_0\rangle\langle \psi_0\rvert)\bigr)\\ &\quad+p\mathcal S\bigl(\mathcal N(\lvert \psi_1\rangle\langle \psi_1\rvert)\bigr). \end{split} \tag{38}\] Proof. Choose a finite Kraus representation \[\mathcal N(P)=\sum_{\ell=1}^r V_\ell P V_\ell^*, \qquad \sum_{\ell=1}^r V_\ell^*V_\ell=I.\] Here \(V_\ell:\mathcal H_{\mathrm{in}}\to\mathcal H_{\mathrm{out}}\). Complete positivity in finite dimensions gives such a finite family; the last identity is trace preservation. If \(d_{\mathrm{out}}=\dim\mathcal H_{\mathrm{out}}\), form \(X,Y\in\mathbb C^{d_{\mathrm{out}}\times r}\) by giving their \(\ell\)th columns the values \(V_\ell\psi_0\) and \(V_\ell\psi_1\), respectively. The common column index gives the three Gram identities and normalizations \[ \begin{split} XX^*&=\mathcal N(\lvert \psi_0\rangle\langle \psi_0\rvert),\qquad YY^*=\mathcal N(\lvert \psi_1\rangle\langle \psi_1\rvert),\\ XY^*&=\mathcal N(\lvert \psi_0\rangle\langle \psi_1\rvert),\qquad \mathop{\mathrm{Tr}}(XX^*)=\mathop{\mathrm{Tr}}(YY^*)=1. \end{split} \tag{39}\] No equality between \(d_{\mathrm{out}}\), \(r\), and the input dimension is required, and the branch vectors need not be orthogonal. Set \(x=1-p\) and \(y=p\), and use \(a,b,c,d,k\) from (34). Applying the two channels to the branch decomposition gives \[(\mathcal A\otimes\mathcal N)(\lvert \psi\rangle\langle \psi\rvert)= \begin{pmatrix} axXX^*+byYY^*&k\sqrt{xy}\,XY^*\\ k\sqrt{xy}\,YX^*&cxXX^*+dyYY^* \end{pmatrix}.\] This is (29) with \[ \alpha=ax,\quad\beta=by,\quad\eta=cx,\quad\delta=dy, \qquad K=k\sqrt{xy}. \tag{40}\] The coefficients are nonnegative, sum to one, and satisfy \(\alpha\delta-\beta\eta=(ad-bc)xy=K^2\). Their column sums are \(\alpha+\eta=x\) and \(\beta+\delta=y\). Moreover, their scalar parameter is \[u=(ax+by)(cx+dy)-k^2xy=v(p).\] Thus 8 applies to the arbitrary rectangular matrices \(X,Y\) and gives (38). The theorem includes \(u=0\), and the zero-weight branch terms vanish, so this argument includes \(p=0,1\) and every boundary value of \(\gamma,\nu\). ◻ Iteration over a blockWe now take the partner to be the channel on the remaining qubits. Convexity of \(e\) will combine the conditional populations at each later site into that site’s original population. Proposition 12. For every \(\gamma,\nu\in[0,1]\), put \(\mathcal A=\mathcal A_{\gamma,\nu}\) and \(e(p)=g(v_{\gamma,\nu}(p))\). For every integer \(n\ge1\) and every unit vector \(\psi\) on \(n\) qubits, let \(p_j\) be the probability of outcome \(1\) at site \(j\) in the computational basis. Then \[ \mathcal S\bigl(\mathcal A^{\otimes n}(\lvert \psi\rangle\langle \psi\rvert)\bigr) \ge\sum_{j=1}^n e(p_j). \tag{41}\] Proof. For \(n=1\) there is equality by (37). Suppose the claim holds for \(n-1\) and write an arbitrary pure input as \[ \psi=\sqrt x\,\lvert 0\rangle\otimes\psi_0 +\sqrt y\,\lvert 1\rangle\otimes\psi_1, \qquad x=1-p_1,\quad y=p_1. \tag{42}\] The branch vectors are normalized but need not be orthogonal. For a zero-weight branch choose any unit vector. The decomposition is valid for every input vector, and each conditional vector may be entangled across the remaining sites. Apply 11 with \(\mathcal N=\mathcal A^{\otimes(n-1)}\), and write \(\sigma_i=\mathcal A^{\otimes(n-1)}(\lvert \psi_i\rangle\langle \psi_i\rvert)\) for the two branch outputs. The lemma gives the explicit recursion \[ \mathcal S\bigl(\mathcal A^{\otimes n}(\lvert \psi\rangle\langle \psi\rvert)\bigr) \ge e(p_1)+x\mathcal S(\sigma_0)+y\mathcal S(\sigma_1). \tag{43}\] Apply the induction hypothesis to both pure branch inputs. If \(p_{j|i}\) is the excitation probability of site \(j>1\) in \(\psi_i\), then \[p_j=xp_{j|0}+yp_{j|1}.\] This identity follows from \(\langle0|1\rangle=0\) on the first site; it does not require \(\psi_0\perp\psi_1\). By 10, \[x\mathcal S(\sigma_0)+y\mathcal S(\sigma_1) \ge\sum_{j=2}^n\bigl(xe(p_{j|0})+ye(p_{j|1})\bigr) \ge\sum_{j=2}^ne(p_j).\] Together with (43), this proves the induction step. All terms from zero-weight branches have zero coefficient, so the argument also includes \(p_1=0,1\). ◻ The same population bound holds for mixed inputs. This form will let us bound every signal in a Holevo ensemble directly. Corollary 13. For every \(\gamma,\nu\in[0,1]\), integer \(n\ge1\), and density matrix \(\rho\) on \((\mathbb C^2)^{\otimes n}\), let \(p_j\) be its excitation probability at site \(j\). Then \[\mathcal S\bigl(\mathcal A_{\gamma,\nu}^{\otimes n}(\rho)\bigr) \ge\sum_{j=1}^n g(v_{\gamma,\nu}(p_j)).\] Proof. Take a finite pure-state decomposition \(\rho=\sum_aq_a\lvert \psi_a\rangle\langle \psi_a\rvert\), and let \(p_{a,j}\) be the corresponding populations. Entropy concavity, 12, and convexity from 10 give \[\mathcal S\bigl(\mathcal A^{\otimes n}(\rho)\bigr) \ge\sum_aq_a\sum_j e(p_{a,j}) \ge\sum_j e\!\left(\sum_aq_ap_{a,j}\right)=\sum_j e(p_j).\] ◻ The ensemble bound and its attainmentWe now turn the population-dependent entropy bound into the full Holevo assertion. This step is essential: an unconstrained minimum-output-entropy bound alone would not give the result. Proof of 1. Fix any finite ensemble \(\{q_a,\rho_a\}\) for \(n\) uses. Each \(\rho_a\) is an arbitrary density matrix on all \(n\) input qubits and may be mixed or entangled across sites. Put \[p_{a,j}=\text{excitation probability at site $j$ in $\rho_a$}, \qquad \overline p_j=\sum_aq_ap_{a,j}.\] The mixed-input bound in 13 and the convexity of \(e\) from 10 give \[ \sum_aq_a\mathcal S\bigl(\mathcal A^{\otimes n}(\rho_a)\bigr) \ge\sum_{j=1}^n\sum_aq_ae(p_{a,j}) \ge\sum_{j=1}^ne(\overline p_j). \tag{44}\] Let \(\overline\sigma=\sum_aq_a\mathcal A^{\otimes n}(\rho_a)\). By (26), its entropy is at most the Shannon entropy of its joint computational-basis output distribution. The marginal probability of outcome \(1\) at site \(j\) is \(t_j=(1-\gamma)\overline p_j+\gamma\nu\): the other channel factors are trace preserving, so the reduced output is the one-site channel applied to the reduced input. For any joint distribution, the chain rule and concavity give \[H(Z_1,\ldots,Z_n) =\sum_{j=1}^nH(Z_j\mid Z_1,\ldots,Z_{j-1}) \le\sum_{j=1}^nH(Z_j).\] Here the chain rule follows by factoring each nonzero joint probability into conditional probabilities, and each average conditional entropy is at most its marginal entropy by concavity. Consequently \[ \mathcal S(\overline\sigma)\le \sum_{j=1}^nh((1-\gamma)\overline p_j+\gamma\nu). \tag{45}\] Subtracting (44) from (45) and taking the supremum over ensembles yields \[ (\ln2)\chi(\mathcal A^{\otimes n}) \le n\max_{0\le p\le1} \{h((1-\gamma)p+\gamma\nu)-e(p)\}. \tag{46}\] For the matching lower bound, the continuous objective attains its maximum on \([0,1]\). Choose any maximizer \(p\) and use the equiprobable pair (8). Their individual output entropies equal \(e(p)\); their opposite coherences cancel in the average output, which is diagonal with excited-state population \((1-\gamma)p+\gamma\nu\). Hence this ensemble attains the right-hand one-use objective exactly for every \(\nu\). On \(n\) uses take the \(2^n\) products of these vectors, with equal probabilities \(2^{-n}\). Each individual output and their average are tensor products. Entropy is additive on such products by their product eigenvalues, so the resulting finite ensemble attains \(n\) times the one-use objective. At \(p=0\) or \(1\), repeated labels can simply be merged. This attains (46) at every \(n\). Substitution of (37) and (7) proves (6), and (4) gives the capacity statement. ◻ Additivity with a finite-dimensional partnerThe branch estimate in 11 applies to every finite-dimensional partner. We now use it to prove the three assertions of 2. For the Holevo bound, the key point is that the conditional partner outputs form an ensemble whose mean is exactly the partner marginal of the mean full output. Proof of Corollary 2. For the Holevo upper bound, it suffices to consider pure-state ensembles. Every mixed input has a finite spectral decomposition. Refining each signal into its pure components leaves the mean output unchanged and, by entropy concavity (27), does not increase the mean individual output entropy. Thus refinement cannot decrease Holevo information; see also Schumacher–Westmoreland [16]. The refined pure inputs may still be entangled between the two factors. Fix a finite ensemble \(\{q_a,\lvert \psi_a\rangle\langle \psi_a\rvert\}\) of such inputs. For each signal use the decomposition in Lemma 11, with population \(p_a\) and branch vectors \(\psi_{a,0},\psi_{a,1}\). Put \[\begin{gathered} \overline p=\sum_aq_ap_a,\qquad w_{a,0}=q_a(1-p_a),\qquad w_{a,1}=q_ap_a,\\ \tau_{a,i}=\mathcal N(\lvert \psi_{a,i}\rangle\langle \psi_{a,i}\rvert). \end{gathered}\] Here and below \(i\in\{0,1\}\). The nonnegative weights \(w_{a,i}\) sum to one. If \(\overline\rho=\sum_aq_a\lvert \psi_a\rangle\langle \psi_a\rvert\) and \(\overline\rho_B\) is its partial trace over the first input qubit, then \[ \begin{aligned} \overline\rho_B&=\sum_{a,i}w_{a,i}\lvert \psi_{a,i}\rangle\langle \psi_{a,i}\rvert,\\ \overline\tau:=\sum_{a,i}w_{a,i}\tau_{a,i} &=\mathcal N(\overline\rho_B) =\mathop{\mathrm{Tr}}_{\mathbb C^2}\bigl((\mathcal A\otimes\mathcal N)(\overline\rho)\bigr). \end{aligned} \tag{47}\] The cross terms disappear in the first identity because \(\langle0|1\rangle=0\), regardless of any overlap between the branch vectors. The last identity uses trace preservation of \(\mathcal A\). Thus the branch ensemble for \(\mathcal N\) has exactly the second marginal of the mean full output. Write \(\sigma_a=(\mathcal A\otimes\mathcal N)(\lvert \psi_a\rangle\langle \psi_a\rvert)\) and \(\overline\sigma=\sum_aq_a\sigma_a\). The first output marginal has excited-state population \(t(\overline p)=(1-\gamma)\overline p+\gamma\nu\); here trace preservation of \(\mathcal N\) identifies that marginal with \(\mathcal A\) applied to the first input marginal. Apply the diagonal-entropy bound (26) in the product of the first output’s computational basis and an eigenbasis of \(\overline\tau\). The resulting joint distribution has marginals \((1-t(\overline p),t(\overline p))\) and the eigenvalue distribution of \(\overline\tau\). Classical subadditivity, as proved in 5, gives \[ \mathcal S(\overline\sigma) \le h(t(\overline p))+\mathcal S(\overline\tau). \tag{48}\] On the other hand, Lemma 11 and the convexity in Lemma 10 imply \[ \begin{split} \sum_aq_a\mathcal S(\sigma_a) &\ge\sum_aq_ae(p_a)+\sum_{a,i}w_{a,i}\mathcal S(\tau_{a,i})\\ &\ge e(\overline p)+\sum_{a,i}w_{a,i}\mathcal S(\tau_{a,i}). \end{split} \tag{49}\] Subtracting (49) from (48) yields \[\begin{align*} \mathcal S(\overline\sigma)-\sum_aq_a\mathcal S(\sigma_a) &\le h(t(\overline p))-e(\overline p)\\ &\quad+\mathcal S(\overline\tau)-\sum_{a,i}w_{a,i}\mathcal S(\tau_{a,i})\\ &\le (\ln2)\bigl(\chi(\mathcal A)+\chi(\mathcal N)\bigr). \end{align*}\] For the last line, the one-use case of 1 bounds the scalar term, and (3) bounds the Holevo information of the branch ensemble, whose mean is (47). Taking the supremum proves the upper bound in (9). For the reverse bound, take the phase-pair ensemble attaining \(\chi(\mathcal A)\) and, for each \(\varepsilon>0\), a finite ensemble with Holevo information greater than \(\chi(\mathcal N)-\varepsilon\). Their product ensemble has the sum of their Holevo informations, because both the mean outputs and individual outputs are tensor products. Taking the supremum proves (9). For minimum output entropy, concavity (27) shows that some pure input attains the minimum of any finite-dimensional channel: a pure-state decomposition cannot have every component output entropy larger than that of the mixed input. For \(\mathcal A\), the pure qubit calculation (37) therefore gives \[ S_{\min}(\mathcal A)=\min_{0\le p\le1}e(p) =g\bigl(\gamma\nu(1-\nu)\bigr). \tag{50}\] Indeed, the completed square in (7) is minimized at \(p=\nu\), and 7 implies that \(g\) is nondecreasing. Any pure qubit state with that population attains the minimum, including at the parameter endpoints. The right-hand side of (38) is at least \(S_{\min}(\mathcal A)+S_{\min}(\mathcal N)\). Hence the same is true of every output entropy of every pure input for \(\mathcal A\otimes\mathcal N\), and concavity extends the lower bound to mixed inputs. Tensoring minimizing input states for the two factors gives the reverse inequality, since entropy is additive on product states. This proves (10). Finally, a permutation of tensor factors identifies \((\mathcal A\otimes\mathcal N)^{\otimes n}\) with \(\mathcal A^{\otimes n}\otimes\mathcal N^{\otimes n}\) up to input and output unitaries, which do not change \(\chi\). Repeated application of (9) gives, for every integer \(n\ge1\), \[ \chi\bigl((\mathcal A\otimes\mathcal N)^{\otimes n}\bigr) =n\chi(\mathcal A)+\chi(\mathcal N^{\otimes n}). \tag{51}\] At each step the partner is a tensor product of the remaining copies of \(\mathcal A\) with \(\mathcal N^{\otimes n}\), hence is again finite dimensional and completely positive trace preserving. Applying (4) to (51) gives \[C(\mathcal A\otimes\mathcal N) =\chi(\mathcal A)+\sup_{n\ge1}\frac1n\chi(\mathcal N^{\otimes n}) =C(\mathcal A)+C(\mathcal N),\] where the last equality uses \(C(\mathcal A)=\chi(\mathcal A)\) from 1. This proves (11). In particular, no restriction has been placed on entanglement among the inputs to the partner’s copies in (51). ◻ Ordinary damping, the unital case, and endpointsThe population convention makes several special cases transparent. Throughout this section, capacities and Holevo information are in bits, while \(h\) and \(g\) remain in nats. Tang, Zhu, Bai, and Wang [18] established the ordinary-damping capacity and its additivity with arbitrary finite-dimensional partners. The following specialization recovers their capacity formula in the present parameters. Corollary 14 (Ordinary amplitude damping). For \(\gamma\in[0,1]\), let \(\mathcal A_\gamma\) be the qubit channel with Kraus operators \[K_0=\mathop{\mathrm{diag}}(1,\sqrt{1-\gamma}),\qquad K_1=\sqrt\gamma\,\lvert 0\rangle\langle 1\rvert.\] For every integer \(n\ge1\), \[\chi(\mathcal A_\gamma^{\otimes n})=n C(\mathcal A_\gamma) =\frac n{\ln2}\max_{0\le p\le1} \{h((1-\gamma)p)-g(\gamma(1-\gamma)p^2)\}.\] Proof. The Kraus operators give (2) with \(\nu=0\). The conclusion follows from 1 after this substitution. ◻ The scalar maximum and the opposite-phase attaining ensemble agree with Giovannetti–Fazio [6], whose transmissivity is \(1-\gamma\) in our convention. That one-use optimization becomes the unrestricted classical capacity through the finite-power identity. Let \(\mathsf X=\bigl(\begin{smallmatrix}0&1\\1&0\end{smallmatrix}\bigr)\). Direct substitution in (2) gives \[\mathcal A_{\gamma,1-\nu}(\rho) =\mathsf X\mathcal A_{\gamma,\nu}(\mathsf X\rho\mathsf X)\mathsf X.\] Unitary conjugations preserve the Holevo optimization, so the capacity is invariant under \(\nu\mapsto1-\nu\). In particular, \(\nu=1\) has the ordinary-channel capacity as well, with the signal population replaced by \(1-p\). The next formula also follows from King’s general unital-qubit theorem [13]. We recover it directly from the present scalar optimization. Corollary 15 (Unital midpoint). For every \(\gamma\in[0,1]\), \[C(\mathcal A_{\gamma,1/2}) =1-\frac1{\ln2}g(\gamma/4) =1-\frac1{\ln2}h\!\left(\frac{1+\sqrt{1-\gamma}}2\right).\] The pair \((\lvert 0\rangle\pm\lvert 1\rangle)/\sqrt2\) attains the one-use Holevo information, and its independent products attain every finite-power Holevo optimum. Proof. Write the one-use objective in nats as \[f(p)=h((1-\gamma)p+\gamma/2) -g\bigl(\gamma/4+\gamma(1-\gamma)(p-1/2)^2\bigr).\] It is concave: its first term is concave, and its second term is the negative of the convex function in 10. Also \(f(1-p)=f(p)\), using \(h(1-t)=h(t)\). Thus \(f(1/2)\ge(f(p)+f(1-p))/2=f(p)\). Evaluating the maximum at \(p=1/2\) and using 1 proves the formulas and the attainment claim. ◻ At \(\gamma=0\), the channel is the identity, \(v_{\gamma,\nu}=0\), and the capacity is one bit per use. At \(\gamma=1\), it replaces every input by \(\mathop{\mathrm{diag}}(1-\nu,\nu)\), so its capacity is zero: the two terms in the objective both equal \(h(\nu)\). These conclusions include all four corners of the parameter square. Alternative Hessian proofsThe main proof obtains scalar concavity and matrix log-determinant convexity from the same contraction argument. Here we give direct Hessian proofs of the two analytic statements. They provide an alternative route to [lem:scalar,lem:logdet]; the entropy integral, Schur complement, sign averaging, and rectangular embedding in 2 are unchanged. The Hessian of the scalar deficitRecall the function \(F\) from (18). Its homogeneity follows by the scaling cancellation already proved in 6. We verify concavity directly on the probability simplex, where \(F(x,y,z)=H(x,y,z)-g(yz)\), using the derivatives (25). For \(0<u<1/4\), write \(t=\sqrt{1-4u}\) and \(L=\mathop{\mathrm{atanh}}(t)/t\). Alternative proof of 6. In the simplex interior, set \(x=1-y-z\) and \(u=yz\). The negative Hessian of \(F(1-y-z,y,z)\) is \[J=\begin{pmatrix} \dfrac1y+\dfrac1x+z^2g''(u)&\dfrac1x+g'(u)+ug''(u)\\[5pt] \dfrac1x+g'(u)+ug''(u)&\dfrac1z+\dfrac1x+y^2g''(u) \end{pmatrix}.\] Expanding its determinant and substituting (25) and \(x+y+z=1\) yields \[\begin{align*} \det J &=\frac1{xu}+\frac{y+z-4u}{x}g''(u) -\frac2xg'(u)-g'(u)^2-2ug'(u)g''(u)\\ &=\frac{1-4uL^2}{ut^2}>0. \tag{52}\end{align*}\] Indeed, for \(0<t<1\), \[\mathop{\mathrm{atanh}}t<\frac{t}{\sqrt{1-t^2}},\] as both sides vanish at zero and their derivatives are respectively \((1-t^2)^{-1}\) and \((1-t^2)^{-3/2}\). Since \(4u=1-t^2\), this proves the strict inequality in (52). Furthermore, \[\begin{pmatrix}y&z\end{pmatrix}J\begin{pmatrix}y\\z\end{pmatrix} =\frac{y+z}{x} +4u\left(ug''(u)+\frac12g'(u)\right)>0.\] A real symmetric \(2\times2\) matrix with positive determinant has eigenvalues of the same sign; this positive quadratic form forces both to be positive. Hence \(F\) is concave in the simplex interior, and continuity extends concavity to the closed simplex. To prove (19), omit zero triples and put \(m_i=x_i+y_i+z_i\), \(m=\sum_i m_i\). For \(m>0\), homogeneity and simplex concavity give \[\sum_i F(x_i,y_i,z_i) =m\sum_i\frac{m_i}{m} F\!\left(\frac{x_i}{m_i},\frac{y_i}{m_i},\frac{z_i}{m_i}\right) \le F\!\left(\sum_i x_i,\sum_i y_i,\sum_i z_i\right).\] If \(m=0\), all terms vanish. ◻ The Hessian of the log-determinant differenceThe contraction proof avoids choosing singular-vector coordinates. The following calculation instead diagonalizes the fixed matrix and expresses the second derivative as a sum of nonnegative squares. It proves 5 directly for the same domain, including singular \(Z\). Alternative proof of 5. At any point \((D_0,E_0)\), use the fixed congruences \[D=D_0^{1/2}\widetilde D D_0^{1/2},\qquad E=E_0^{1/2}\widetilde E E_0^{1/2},\qquad W=D_0^{-1/2}ZE_0^{-1/2}.\] The determinant factors cancel to give \(G_Z(D,E)=G_W(\widetilde D,\widetilde E)\). These invertible linear changes preserve affine lines. Independent unitary changes in the two spaces then put \(W\) in singular-value form \(Y=\mathop{\mathrm{diag}}(v_1,\ldots,v_N)\) with \(v_i\ge0\). It therefore suffices to prove nonnegativity of the second derivative at \((I,I)\) for this \(Y\) and arbitrary Hermitian directions \(P,Q\). Set \(R=(I+YY^*)^{-1}\) and \(N_0=P-YQY^*\). Using \((I+sQ)^{-1}=I-sQ+s^2Q^2+O(s^3)\) gives \[ \left.\frac{\mathrm d^2}{\mathrm ds^2} G_Y(I+sP,I+sQ)\right|_{s=0} =\mathop{\mathrm{Tr}}\bigl(P^2+2RYQ^2Y^*-RN_0RN_0\bigr). \tag{53}\] For completeness, the log-determinant expansion used here is \[\ln\det(H+sK+s^2L_0) =\ln\det H+s\mathop{\mathrm{Tr}}(H^{-1}K) +s^2\left(\mathop{\mathrm{Tr}}(H^{-1}L_0) -\frac12\mathop{\mathrm{Tr}}(H^{-1}KH^{-1}K)\right)+O(s^3),\] for \(H>0\) and Hermitian \(K,L_0\). It follows by factoring \(H^{1/2}\) and applying the scalar logarithm expansion to the eigenvalues of the resulting Hermitian increment. No commutativity is assumed. Write \(r_i=(1+v_i^2)^{-1}\) and \(c_i=v_i/(1+v_i^2)\). Expanding the trace in (53) in entries gives \[\begin{align*} \sum_{i,j}\bigl[&(1-r_ir_j)|P_{ij}|^2 +\{2(1-r_i)-(1-r_i)(1-r_j)\}|Q_{ij}|^2\\ &\hspace{34mm}+2c_ic_j\operatorname{Re} (P_{ij}\overline{Q_{ij}})\bigr]. \end{align*}\] Since \(Q\) is Hermitian, \(|Q_{ij}|^2=|Q_{ji}|^2\). Pairing the \((i,j)\) and \((j,i)\) terms replaces their coefficient by \[\frac12\bigl[2(1-r_i)+2(1-r_j) -2(1-r_i)(1-r_j)\bigr]=1-r_ir_j.\] This identity also holds when \(i=j\). Completing the square therefore rewrites the second derivative as \[ \sum_{i,j}\left[ (1-r_ir_j-c_ic_j)(|P_{ij}|^2+|Q_{ij}|^2) +c_ic_j|P_{ij}+Q_{ij}|^2\right]. \tag{54}\] Every coefficient is nonnegative: \(c_ic_j\ge0\), and \[1-r_ir_j-c_ic_j =\frac{(v_i-v_j)^2+v_iv_j+v_i^2v_j^2} {(1+v_i^2)(1+v_j^2)}\ge0.\] Thus the second derivative is nonnegative in every Hermitian direction at every positive definite pair. The domain is convex, so the asserted joint convexity follows along each line segment. ◻
|
| ||||||||
|