Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.29373

Convergence Analysis of the Quantum Blahut-Arimoto Algorithm and the Contraction Coefficient of Qubit Amplitude-Damping Channels

Junke Han, Yonglong Li

quant-phSubmitted Oct 21, 2026• Announced Oct 22, 2026• 0 citations
arXivHTMLPDF

Abstract

In this work, we investigate the convergence rate of the quantum Blahut-Arimoto (BA) algorithm proposed for computing the coherent information of less noisy quantum channels. Previous work established exponential convergence under certain restrictive assumptions on the channel. Using a Taylor expansion around a positive definite optimizer, we show that, for an injective degradable channel whose degrading channel has a relative-entropy contraction coefficient strictly less than one, the algorithm converges at an exponential rate after sufficiently many iterations. We further verify this condition for qubit amplitude-damping (AD) channels in the relevant parameter regime. In addition, by analyzing the Bogoliubov-Kubo-Mori (BKM) metric on the Bloch ball, we derive an explicit characterization of the relative-entropy contraction coefficient of qubit AD channels. The proposed approach is further extended to calculate the relative contraction coefficient and the relative expansion coefficient of two qubit AD channels.

AI Summary

The paper studies when the quantum Blahut–Arimoto (BA) algorithm for maximizing coherent information converges exponentially, despite the failure of previously used global relative-entropy expansion assumptions. It also computes relative-entropy contraction and channel-comparison coefficients for qubit amplitude-damping (AD) channels. For an injective degradable channel $\Phi$ with degrading map $\mathcal D$ satisfying $\eta(\mathcal D)<1$, coherent information is strictly concave and has a unique optimizer. If that optimizer $\rho^\star$ is full rank, BA converges exponentially after sufficiently many iterations: its objective gap is bounded by $\gamma(1-a/\gamma)^{t-N_0}D(\rho^\star\|\rho^{(N_0)})$. The proof supplies $a=\lambda_{\min}(\rho^\star)\lambda_{\min}(\Phi^\dagger\Phi)[1-\eta(\mathcal D)]/4$, combining convergence to the optimizer, a local quadratic bound via quantum $\chi^2$ divergence, injectivity, and strong data processing. The assumptions are verified for qubit dephasing away from complete dephasing and AD with damping $0\le p<1/2$. For AD, Bloch-ball symmetry and comparison of BKM-metric quadratic forms reduce the contraction coefficient exactly to $\eta(\mathcal A_p)=\sup_{0\le r<1}(1-p)\frac{r}{\operatorname{arctanh}r}\frac{\operatorname{arctanh}[p+(1-p)r]}{p+(1-p)r}$. An analogous restricted one-variable formula determines relative contraction between two AD channels. Their relative expansion coefficient has the closed form $\check\eta(\mathcal A_{p_2},\mathcal A_{p_1})=p_1(1-p_2)/[p_2(1-p_1)]$ for $0<p_1<p_2<1$. The convergence guarantee is asymptotic rather than a global exponential bound, requires a full-rank optimizer and the stated channel conditions, and does not quantify the entry time $N_0$. The contraction characterization remains a scalar optimization rather than a closed-form value.

Little sign of AI-generated textStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
44 pages

Related papers

Non-Commutative Blahut-Arimoto Algorithms

Mario Berta, Navneeth Ramakrishnan, Raban Iten +1 more

We generalize alternating optimization algorithms of Blahut-Arimoto type to the quantum setting. In particular, we give iterative algorithms to compute the mutual information of quantum channels, the Holevo quantity of classical-quantum channels, the coherent information of less noisy quantum channels, and the thermodynamic capacity of quantum channels. Our convergence analysis is based on quantum entropy inequalities and leads to a priori additive $\varepsilon$-approximations after $\mathcal{O}\left(\varepsilon^{-1}\log N\right)$ iterations, where $N$ denotes the input dimension of the channel. We complement our analysis with an a posteriori stopping criterion which allows us to terminate the algorithm after significantly fewer iterations compared to the a priori criterion in numerical examples. Finally, we discuss heuristics to accelerate the convergence.

•May 3, 2019•5 citations

Quantum Blahut-Arimoto Algorithms

Navneeth Ramakrishnan, Raban Iten, Volkher B. Scholz +1 more

We generalize alternating optimization algorithms of Blahut-Arimoto type to the quantum setting. In particular, we give iterative algorithms to compute the mutual information of quantum channels, the thermodynamic capacity of quantum channels, the coherent information of less noisy quantum channels, and the Holevo quantity of classical-quantum channels. Our convergence analysis is based on quantum entropy inequalities and leads to a priori additive ε-approximations after O (ε-1log N) iterations, where N denotes the input dimension of the channel. We complement our analysis with an a posteriori stopping criterion which allows us to terminate the algorithm after significantly fewer iterations compared to the a priori criterion in numerical examples. Finally, we discuss heuristics to accelerate the convergence.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•8 citations

A Posteriori Certification Framework for Generalized Quantum Arimoto-Blahut Algorithms

Geng Liu, Masahito Hayashi

The generalized quantum Arimoto--Blahut (QAB) algorithm is a powerful derivative-free iterative method in quantum information theory. A key obstacle to its broader use is that existing convergence guarantees typically rely on analytical conditions that are either overly restrictive or difficult to verify for concrete problems. We address this issue by introducing an a posteriori certification viewpoint: instead of requiring fully a priori verifiable assumptions, we provide convergence and error guarantees that can be validated directly from the iterates produced by the algorithm. Specifically, we prove a generalized global convergence theorem showing that, under convexity and a substantially weaker numerically verifiable condition, the QAB iteration converges to the global minimizer. This theorem yields a practical certification procedure: by checking explicit inequalities along the computed trajectory, one can certify global optimality and bound the suboptimality of the obtained value. As an application, we develop a certified iterative scheme for computing the quantum relative entropy of channels, a fundamental measure of distinguishability in quantum dynamics. This quantity is notoriously challenging to evaluate numerically: gradient-based methods are impeded by the complexity of matrix functions such as square roots and logarithms, while recent semidefinite programming approaches can become computationally and memory intensive at high precision. Our method avoids these bottlenecks by combining the QAB iteration with a posteriori certification, yielding an efficient and scalable algorithm. Numerical experiments demonstrate rapid convergence and improved scalability and adaptivity compared with SDP-based approaches.

quant-pharXiv:2601.09301•IEEE International Symposium on Information Theory (ISIT)•Jan 15, 2026•1 citation

Computing Quantum Channel Capacities

Navneeth Ramakrishnan, Raban Iten, Volkher B. Scholz +1 more

The capacity of noisy quantum channels characterizes the highest rate at which information can be reliably transmitted and it is therefore of practical as well as fundamental importance. Capacities of classical channels are computed using alternating optimization schemes, called Blahut-Arimoto algorithms. In this work, we generalize classical Blahut-Arimoto algorithms to the quantum setting. In particular, we give efficient iterative schemes to compute the capacity of channels with classical input and quantum output, the quantum capacity of less noisy channels, the thermodynamic capacity of quantum channels, as well as the entanglement-assisted capacity of quantum channels. We give rigorousa priorianda posterioribounds on the estimation error by employing quantum entropy inequalities and demonstrate fast convergence of our algorithms in numerical experiments.

arXiv:1905.01286•IEEE Transactions on Information Theory•Oct 28, 2020•38 citations

A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms

Kerry He, James Saunderson, Hamza Fawzi

The Blahut-Arimoto algorithm is a well-known method to compute classical channel capacities and rate-distortion functions. Recent works have extended this algorithm to compute various quantum analogs of these quantities. In this paper, we show how these Blahut-Arimoto algorithms are special instances of mirror descent, which is a type of Bregman proximal method, and a well-studied generalization of gradient descent for constrained convex optimization. Using recently developed convex analysis tools, we show how analysis based on relative smoothness and strong convexity recovers known sublinear and linear convergence rates for Blahut-Arimoto algorithms. This Bregman proximal viewpoint allows us to derive related algorithms with similar convergence guarantees to solve problems in information theory for which Blahut-Arimoto-type algorithms are not directly applicable. We apply this framework to compute energy-constrained classical and quantum channel capacities, classical and quantum rate-distortion functions, and approximations of the relative entropy of entanglement, all with provable convergence guarantees.

arXiv:2306.04492•IEEE Transactions on Information Theory•Jun 11, 2024•11 citations

A Mirror-Descent Algorithm for Computing the Petz-Rényi Capacity of Classical-Quantum Channels

Yu-Hong Lai, Hao-Chung Cheng

We study the computation of the $α$-Rényi capacity of a classical-quantum (c-q) channel for $α\in(0,1)$. We propose an exponentiated-gradient (mirror descent) iteration that generalizes the Blahut-Arimoto algorithm. Our analysis establishes relative smoothness with respect to the entropy geometry, guaranteeing a global sublinear convergence of the objective values. Furthermore, under a natural tangent-space nondegeneracy condition (and a mild spectral lower bound in one regime), we prove local linear (geometric) convergence in Kullback-Leibler divergence on a truncated probability simplex, with an explicit contraction factor once the local curvature constants are bounded.

quant-pharXiv:2601.10558•IEEE International Symposium on Information Theory (ISIT)•Jan 16, 2026•2 citations
In this work, we investigate the convergence rate of the quantum Blahut-Arimoto (BA) algorithm proposed for computing the coherent information of less noisy quantum channels. Previous work established exponential convergence under certain restrictive assumptions on the channel. Using a Taylor expansion around a positive definite optimizer, we show that, for an injective degradable channel whose degrading channel has a relative-entropy contraction coefficient strictly less than one, the algorithm converges at an exponential rate after sufficiently many iterations. We further verify this condition for qubit amplitude-damping (AD) channels in the relevant parameter regime.
In addition, by analyzing the Bogoliubov-Kubo-Mori (BKM) metric on the Bloch ball, we derive an explicit characterization of the relative-entropy contraction coefficient of qubit AD channels. The proposed approach is further extended to calculate the relative contraction coefficient and the relative expansion coefficient of two qubit AD channels.
The paper studies when the quantum Blahut–Arimoto (BA) algorithm for maximizing coherent information converges exponentially, despite the failure of previously used global relative-entropy expansion assumptions. It also computes relative-entropy contraction and channel-comparison coefficients for qubit amplitude-damping (AD) channels.
For an injective degradable channel Φ\PhiΦ with degrading map D\mathcal DD satisfying η(D)<1\eta(\mathcal D)<1η(D)<1, coherent information is strictly concave and has a unique optimizer. If that optimizer ρ⋆\rho^\starρ⋆ is full rank, BA converges exponentially after sufficiently many iterations: its objective gap is bounded by γ(1−a/γ)t−N0D(ρ⋆∥ρ(N0))\gamma(1-a/\gamma)^{t-N_0}D(\rho^\star\|\rho^{(N_0)})γ(1−a/γ)t−N0​D(ρ⋆∥ρ(N0​)). The proof supplies a=λmin⁡(ρ⋆)λmin⁡(Φ†Φ)[1−η(D)]/4a=\lambda_{\min}(\rho^\star)\lambda_{\min}(\Phi^\dagger\Phi)[1-\eta(\mathcal D)]/4a=λmin​(ρ⋆)λmin​(Φ†Φ)[1−η(D)]/4, combining convergence to the optimizer, a local quadratic bound via quantum χ2\chi^2χ2 divergence, injectivity, and strong data processing. The assumptions are verified for qubit dephasing away from complete dephasing and AD with damping 0≤p<1/20\le p<1/20≤p<1/2.
For AD, Bloch-ball symmetry and comparison of BKM-metric quadratic forms reduce the contraction coefficient exactly to η(Ap)=sup⁡0≤r<1(1−p)rarctanh⁡rarctanh⁡[p+(1−p)r]p+(1−p)r\eta(\mathcal A_p)=\sup_{0\le r<1}(1-p)\frac{r}{\operatorname{arctanh}r}\frac{\operatorname{arctanh}[p+(1-p)r]}{p+(1-p)r}η(Ap​)=sup0≤r<1​(1−p)arctanhrr​p+(1−p)rarctanh[p+(1−p)r]​. An analogous restricted one-variable formula determines relative contraction between two AD channels. Their relative expansion coefficient has the closed form ηˇ(Ap2,Ap1)=p1(1−p2)/[p2(1−p1)]\check\eta(\mathcal A_{p_2},\mathcal A_{p_1})=p_1(1-p_2)/[p_2(1-p_1)]ηˇ​(Ap2​​,Ap1​​)=p1​(1−p2​)/[p2​(1−p1​)] for 0<p1<p2<10<p_1<p_2<10<p1​<p2​<1.
The convergence guarantee is asymptotic rather than a global exponential bound, requires a full-rank optimizer and the stated channel conditions, and does not quantify the entry time N0N_0N0​. The contraction characterization remains a scalar optimization rather than a closed-form value.
We generalize alternating optimization algorithms of Blahut-Arimoto type to the quantum setting. In particular, we give iterative algorithms to compute the mutual information of quantum channels, the Holevo quantity of classical-quantum channels, the coherent information of less noisy quantum channels, and the thermodynamic capacity of quantum channels. Our convergence analysis is based on quantum entropy inequalities and leads to a priori additive ε\varepsilonε-approximations after O(ε−1log⁡N)\mathcal{O}\left(\varepsilon^{-1}\log N\right)O(ε−1logN) iterations, where NNN denotes the input dimension of the channel. We complement our analysis with an a posteriori stopping criterion which allows us to terminate the algorithm after significantly fewer iterations compared to the a priori criterion in numerical examples. Finally, we discuss heuristics to accelerate the convergence.
We generalize alternating optimization algorithms of Blahut-Arimoto type to the quantum setting. In particular, we give iterative algorithms to compute the mutual information of quantum channels, the thermodynamic capacity of quantum channels, the coherent information of less noisy quantum channels, and the Holevo quantity of classical-quantum channels. Our convergence analysis is based on quantum entropy inequalities and leads to a priori additive ε-approximations after O (ε-1log N) iterations, where N denotes the input dimension of the channel. We complement our analysis with an a posteriori stopping criterion which allows us to terminate the algorithm after significantly fewer iterations compared to the a priori criterion in numerical examples. Finally, we discuss heuristics to accelerate the convergence.
The generalized quantum Arimoto--Blahut (QAB) algorithm is a powerful derivative-free iterative method in quantum information theory. A key obstacle to its broader use is that existing convergence guarantees typically rely on analytical conditions that are either overly restrictive or difficult to verify for concrete problems. We address this issue by introducing an a posteriori certification viewpoint: instead of requiring fully a priori verifiable assumptions, we provide convergence and error guarantees that can be validated directly from the iterates produced by the algorithm. Specifically, we prove a generalized global convergence theorem showing that, under convexity and a substantially weaker numerically verifiable condition, the QAB iteration converges to the global minimizer. This theorem yields a practical certification procedure: by checking explicit inequalities along the computed trajectory, one can certify global optimality and bound the suboptimality of the obtained value. As an application, we develop a certified iterative scheme for computing the quantum relative entropy of channels, a fundamental measure of distinguishability in quantum dynamics. This quantity is notoriously challenging to evaluate numerically: gradient-based methods are impeded by the complexity of matrix functions such as square roots and logarithms, while recent semidefinite programming approaches can become computationally and memory intensive at high precision. Our method avoids these bottlenecks by combining the QAB iteration with a posteriori certification, yielding an efficient and scalable algorithm. Numerical experiments demonstrate rapid convergence and improved scalability and adaptivity compared with SDP-based approaches.
The capacity of noisy quantum channels characterizes the highest rate at which information can be reliably transmitted and it is therefore of practical as well as fundamental importance. Capacities of classical channels are computed using alternating optimization schemes, called Blahut-Arimoto algorithms. In this work, we generalize classical Blahut-Arimoto algorithms to the quantum setting. In particular, we give efficient iterative schemes to compute the capacity of channels with classical input and quantum output, the quantum capacity of less noisy channels, the thermodynamic capacity of quantum channels, as well as the entanglement-assisted capacity of quantum channels. We give rigorousa priorianda posterioribounds on the estimation error by employing quantum entropy inequalities and demonstrate fast convergence of our algorithms in numerical experiments.
The Blahut-Arimoto algorithm is a well-known method to compute classical channel capacities and rate-distortion functions. Recent works have extended this algorithm to compute various quantum analogs of these quantities. In this paper, we show how these Blahut-Arimoto algorithms are special instances of mirror descent, which is a type of Bregman proximal method, and a well-studied generalization of gradient descent for constrained convex optimization. Using recently developed convex analysis tools, we show how analysis based on relative smoothness and strong convexity recovers known sublinear and linear convergence rates for Blahut-Arimoto algorithms. This Bregman proximal viewpoint allows us to derive related algorithms with similar convergence guarantees to solve problems in information theory for which Blahut-Arimoto-type algorithms are not directly applicable. We apply this framework to compute energy-constrained classical and quantum channel capacities, classical and quantum rate-distortion functions, and approximations of the relative entropy of entanglement, all with provable convergence guarantees.
We study the computation of the ααα-Rényi capacity of a classical-quantum (c-q) channel for α∈(0,1)α\in(0,1)α∈(0,1). We propose an exponentiated-gradient (mirror descent) iteration that generalizes the Blahut-Arimoto algorithm. Our analysis establishes relative smoothness with respect to the entropy geometry, guaranteeing a global sublinear convergence of the objective values. Furthermore, under a natural tangent-space nondegeneracy condition (and a mild spectral lower bound in one regime), we prove local linear (geometric) convergence in Kullback-Leibler divergence on a truncated probability simplex, with an explicit contraction factor once the local curvature constants are bounded.