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:2602.17065 · International Conference on Communications

Quantum-Channel Matrix Optimization for Holevo Bound Enhancement

Hong Niu, Chau Yuen, Alexei Ashikhmin, Lajos Hanzo

quant-phcs.ITSubmitted Feb 19, 2026• Announced Feb 20, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum communication holds the potential to revolutionize information transmission by enabling secure data exchange that exceeds the limits of classical systems. One of the key performance metrics in quantum information theory, namely the Holevo bound, quantifies the amount of classical information that can be transmitted reliably over a quantum channel. However, computing and optimizing the Holevo bound remains a challenging task due to its dependence on both the quantum input ensemble and the quantum channel. In order to maximize the Holevo bound, we propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble. We provide a detailed complexity analysis for the proposed algorithm. Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.

Comments
6 pages, 4 figures, accepted by 2026 IEEE International Conference on Communications (ICC)

Related papers

Riemannian Optimization for Holevo Capacity

Chengkai Zhu, Renfeng Peng, Bin Gao +1 more

Computing the classical capacity of a noisy quantum channel is crucial for understanding the limits of communication over quantum channels. However, its evaluation remains challenging due to the difficulty of computing the Holevo capacity and the even greater difficulty of regularization. In this work, we formulate the computation of the Holevo capacity as an optimization problem on a product manifold constructed from probability distributions and their corresponding pure input states for a quantum channel. A Riemannian gradient descent algorithm is proposed to solve the problem, providing lower bounds on the classical capacity of general quantum channels and outperforming existing methods in numerical experiments in both efficiency and scale.

arXiv:2501.11576•IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•1 citation

Upper Bounds for the Holevo Information Quantity and Their Use

Максим Евгеньевич Широков

We present a family of easily computable upper bounds for the Holevo (information) quantity of an ensemble of quantum states depending on a reference state (as a free parameter). These upper bounds are obtained by combining probabilistic and metric characteristics of the ensemble. We show that an appropriate choice of the reference state gives tight upper bounds for the Holevo quantity which in many cases improve the estimates existing in the literature. We also present an upper bound for the Holevo quantity of a generalized ensemble of quantum states with finite average energy depending on the metric divergence of an ensemble. In the case of a multi-mode quantum oscillator, this upper bound is tight for large energy. Upper bounds for the Holevo capacity of finite-dimensional quantum channels depending on metric characteristics of the channel output are obtained.

arXiv:1703.05671•Problems of Information Transmission•Jul 1, 2019•4 citations

Quantum-optimal information encoding using noisy passive linear optics

Andrew Tanggara, Ranjith Nair, Syed M. Assad +5 more

The amount of information that a noisy channel can transmit has been one of the primary subjects of interest in information theory. In this work we consider a practically-motivated family of optical quantum channels that can be implemented without an external energy source. We optimize the Holevo information over procedures that encode information in attenuations and phase-shifts applied by these channels on a resource state of finite energy. It is shown that for any given input state and environment temperature, the maximum Holevo information can be achieved by an encoding procedure that uniformly distributes the channel's phase-shift parameter. Moreover for large families of input states, any maximizing encoding scheme has a finite number of channel attenuation values, simplifying the codewords to a finite number of rings around the origin in the output phase space. The above results and numerical evidence suggests that this property holds for all resource states. Our results are directly applicable to the quantum reading of an optical memory in the presence of environmental thermal noise.

arXiv:2304.12365•Quantum•Jan 4, 2024•0 citations

Holevo Capacity of Discrete Weyl Channels

Junaid ur Rehman, Youngmin Jeong, Jeong San Kim +1 more

Holevo capacity is the maximum rate at which a quantum channel can reliably transmit classical information without entanglement. However, calculating the Holevo capacity of arbitrary quantum channels is a nontrivial and computationally expensive task since it requires the numerical optimization over all possible input quantum states. In this paper, we consider discrete Weyl channels (DWCs) and exploit their symmetry properties to model DWC as a classical symmetric channel. We characterize lower and upper bounds on the Holevo capacity of DWCs using simple computational formulae. Then, we provide a sufficient and necessary condition where the upper and lower bounds coincide. The framework in this paper enables us to characterize the exact Holevo capacity for most of the known special cases of DWCs.

arXiv:2003.01942•Scientific Reports•Nov 23, 2018•24 citations

Thermodynamic constraints on information transmission in quantum ensembles

André T. Cesário, Tiago Debarba

The processing of quantum information is limited by fundamental physical constraints on how information can be encoded, transmitted, and extracted. In particular, the nonorthogonality of quantum states limits their distinguishability, and thermodynamic constraints, including the energetic cost of state preparation and quantum operations, further restrict the viability of realistic information protocols. This work explores the impact of such constraints on the preparation, evolution, and readout of quantum information. We demonstrate that preparing the system for encoding and measurement affects the distinguishability and purity of the resulting ensemble of states. Furthermore, we analyze a noisy communication channel and propose an optimal protocol for encoding and decoding the transmitted information. For this realistic protocol, we show that the maximum probability of successfully retrieving the information is equal to the maximum correlation that can be achieved between the system and the register. The protocol uses only Gibbs states as free resources, ensuring minimal thermodynamic cost. Based on this, we provide a thermodynamic interpretation of the Holevo information, which quantifies the capacity of the transmitted information and establishes a fundamental limit on its retrieval in thermodynamically constrained scenarios.

arXiv:2503.16646•Physical Review A•Aug 26, 2025•0 citations

HOLEVO BOUND FOR CLASSICAL INFORMATION TRANSMITTED THROUGH ENTANGLED STATES

L. C. Kwek, Changhun Oh

Recently, seemingly conflicting results were obtained for the efficiency of the transmission of classical signals over quantum channels. In one study, it was shown that entangled states can improve the transmission of classical information in a two-Pauli channel. However, in another study, Bruss et al showed that entanglement cannot possibly improve transmission of classical information in a depolarizing channel. By studying the Holevo information in a general quantum channel, we analyze the efficiency of such transmission of classical states.

Foundations of Quantum Mechanics in the Light of New Technology•Oct 1, 2002•0 citations
Quantum communication holds the potential to revolutionize information transmission by enabling secure data exchange that exceeds the limits of classical systems. One of the key performance metrics in quantum information theory, namely the Holevo bound, quantifies the amount of classical information that can be transmitted reliably over a quantum channel. However, computing and optimizing the Holevo bound remains a challenging task due to its dependence on both the quantum input ensemble and the quantum channel. In order to maximize the Holevo bound, we propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble. We provide a detailed complexity analysis for the proposed algorithm. Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
Computing the classical capacity of a noisy quantum channel is crucial for understanding the limits of communication over quantum channels. However, its evaluation remains challenging due to the difficulty of computing the Holevo capacity and the even greater difficulty of regularization. In this work, we formulate the computation of the Holevo capacity as an optimization problem on a product manifold constructed from probability distributions and their corresponding pure input states for a quantum channel. A Riemannian gradient descent algorithm is proposed to solve the problem, providing lower bounds on the classical capacity of general quantum channels and outperforming existing methods in numerical experiments in both efficiency and scale.
We present a family of easily computable upper bounds for the Holevo (information) quantity of an ensemble of quantum states depending on a reference state (as a free parameter). These upper bounds are obtained by combining probabilistic and metric characteristics of the ensemble. We show that an appropriate choice of the reference state gives tight upper bounds for the Holevo quantity which in many cases improve the estimates existing in the literature. We also present an upper bound for the Holevo quantity of a generalized ensemble of quantum states with finite average energy depending on the metric divergence of an ensemble. In the case of a multi-mode quantum oscillator, this upper bound is tight for large energy. Upper bounds for the Holevo capacity of finite-dimensional quantum channels depending on metric characteristics of the channel output are obtained.
The amount of information that a noisy channel can transmit has been one of the primary subjects of interest in information theory. In this work we consider a practically-motivated family of optical quantum channels that can be implemented without an external energy source. We optimize the Holevo information over procedures that encode information in attenuations and phase-shifts applied by these channels on a resource state of finite energy. It is shown that for any given input state and environment temperature, the maximum Holevo information can be achieved by an encoding procedure that uniformly distributes the channel's phase-shift parameter. Moreover for large families of input states, any maximizing encoding scheme has a finite number of channel attenuation values, simplifying the codewords to a finite number of rings around the origin in the output phase space. The above results and numerical evidence suggests that this property holds for all resource states. Our results are directly applicable to the quantum reading of an optical memory in the presence of environmental thermal noise.
Holevo capacity is the maximum rate at which a quantum channel can reliably transmit classical information without entanglement. However, calculating the Holevo capacity of arbitrary quantum channels is a nontrivial and computationally expensive task since it requires the numerical optimization over all possible input quantum states. In this paper, we consider discrete Weyl channels (DWCs) and exploit their symmetry properties to model DWC as a classical symmetric channel. We characterize lower and upper bounds on the Holevo capacity of DWCs using simple computational formulae. Then, we provide a sufficient and necessary condition where the upper and lower bounds coincide. The framework in this paper enables us to characterize the exact Holevo capacity for most of the known special cases of DWCs.
The processing of quantum information is limited by fundamental physical constraints on how information can be encoded, transmitted, and extracted. In particular, the nonorthogonality of quantum states limits their distinguishability, and thermodynamic constraints, including the energetic cost of state preparation and quantum operations, further restrict the viability of realistic information protocols. This work explores the impact of such constraints on the preparation, evolution, and readout of quantum information. We demonstrate that preparing the system for encoding and measurement affects the distinguishability and purity of the resulting ensemble of states. Furthermore, we analyze a noisy communication channel and propose an optimal protocol for encoding and decoding the transmitted information. For this realistic protocol, we show that the maximum probability of successfully retrieving the information is equal to the maximum correlation that can be achieved between the system and the register. The protocol uses only Gibbs states as free resources, ensuring minimal thermodynamic cost. Based on this, we provide a thermodynamic interpretation of the Holevo information, which quantifies the capacity of the transmitted information and establishes a fundamental limit on its retrieval in thermodynamically constrained scenarios.
Recently, seemingly conflicting results were obtained for the efficiency of the transmission of classical signals over quantum channels. In one study, it was shown that entangled states can improve the transmission of classical information in a two-Pauli channel. However, in another study, Bruss et al showed that entanglement cannot possibly improve transmission of classical information in a depolarizing channel. By studying the Holevo information in a general quantum channel, we analyze the efficiency of such transmission of classical states.