Quantum-Channel Matrix Optimization for Holevo Bound Enhancement

• URL: http://arxiv.org/abs/2602.17065v1
• Date: Thu, 19 Feb 2026 04:15:03 GMT
• Title: Quantum-Channel Matrix Optimization for Holevo Bound Enhancement
• Authors: Hong Niu, Chau Yuen, Alexei Ashikhmin, Lajos Hanzo,
• Abstract summary: We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
• Score: 87.57725685513088
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Passive Environment-Assisted Quantum Communication [0.6280405723042665]
  We examine how passive environment-assisted quantum communication enhances direct quantum information transfer efficiency.<n>A bosonic pure-loss channel, modeled as transmission through a beam splitter with a vacuum input state at the dark port, has zero quantum capacity when transmissivity is below 50%.<n>We explore more experimentally accessible non-Gaussian ancilla states, such as Fock, cat, and squeezed cat states, and numerically determine the optimal encoding and decoding strategies.
  arXiv  Detail & Related papers  (2026-02-25T04:14:47Z)
• Fundamental Quality Bound on Optical Quantum Communication [16.94403919812334]
  We prove that entanglement's entropy sharpens the rate of distillation under non-entangling operations.<n>These findings offer a new perspective on entanglement as a resource for future quantum optical networks.
  arXiv  Detail & Related papers  (2025-10-08T15:12:37Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Optimal Quantum Information Transmission Under a Continuous-Variable Erasure Channel [3.2648790955977915]
  We derive the quantum capacity and entanglement-assisted quantum capacity of the bosonic continuous-variable erasure channel.<n>We then construct random codes based on scrambling information within the typical subspace of the encoding state.<n>We find that information recovery depends on the ratio between the input and output modes.
  arXiv  Detail & Related papers  (2025-10-01T20:02:14Z)
• Improving quantum communication rates with permutation-invariant codes [6.107978190324034]
  We improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes.<n>For each channel family we obtain improved lower bounds on their quantum capacities.
  arXiv  Detail & Related papers  (2025-08-13T17:47:51Z)
• Riemannian Optimization for Holevo Capacity [5.746235925946808]
  We formulate the computation of the Holevo capacity as an optimization problem on a product manifold constructed from probability distributions.<n>A gradient gradient descent algorithm is proposed to solve the problem, providing lower bounds on the classical capacity of general quantum channels.
  arXiv  Detail & Related papers  (2025-01-20T16:26:21Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Explicit decoders using fixed-point amplitude amplification based on QSVT [2.3020018305241337]
  We provide two decoders capable of recovering quantum information when the decoupling condition is satisfied.<n>These are applicable to both entanglement-assisted and non-assisted settings.<n>For any noisy channel, our decoders can be used to achieve a communication rate arbitrarily close to the quantum capacity.
  arXiv  Detail & Related papers  (2024-05-09T18:47:58Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.