Convergence Properties of Good Quantum Codes for Classical Communication

• URL: http://arxiv.org/abs/2601.11498v1
• Date: Fri, 16 Jan 2026 18:22:05 GMT
• Title: Convergence Properties of Good Quantum Codes for Classical Communication
• Authors: Alptug Aytekin, Mohamed Nomeir, Lei Hu, Sennur Ulukus,
• Abstract summary: We show the uniqueness of the optimal output distribution, to be able to talk more concretely about the optimal output distribution.<n>We extend the vanishing error probability results to the quantum case, by using techniques that are close in spirit to the classical case.
• Score: 46.17112353277822
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An important part of the information theory folklore had been about the output statistics of codes that achieve the capacity and how the empirical distributions compare to the output distributions induced by the optimal input in the channel capacity problem. Results for a variety of such empirical output distributions of good codes have been known in the literature, such as the comparison of the output distribution of the code to the optimal output distribution in vanishing and non-vanishing error probability cases. Motivated by these, we aim to achieve similar results for the quantum codes that are used for classical communication, that is the setting in which the classical messages are communicated through quantum codewords that pass through a noisy quantum channel. We first show the uniqueness of the optimal output distribution, to be able to talk more concretely about the optimal output distribution. Then, we extend the vanishing error probability results to the quantum case, by using techniques that are close in spirit to the classical case. We also extend non-vanishing error probability results to the quantum case on block codes, by using the second-order converses for such codes based on hypercontractivity results for the quantum generalized depolarizing semi-groups.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  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.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem [13.098901971644656]
  We prove a one-shot random coding bound for classical-quantum channel coding.<n>Our result extends to various quantum packing-type problems.<n>This shows that a kind of pretty-good measurement is equivalent to a randomized Holevo-Helstrom measurement.
  arXiv  Detail & Related papers  (2025-07-08T17:59:58Z)
• Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
  This work shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states.<n>This result enables us to tighten the capacity lower bound for DI over quantum channels beyond the simultaneous decoding approach.
  arXiv  Detail & Related papers  (2025-04-29T17:57:36Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [49.126395046088014]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets.<n>Our main findings are that the maximum length of messages thus identifiable scales superlinearly as $R,nlog n$ with the block length $n$.<n>We show that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Rate-Limited Quantum-to-Classical Optimal Transport in Finite and Continuous-Variable Quantum Systems [11.152271223282463]
  We consider the rate-limited quantum-to-classical optimal transport in terms of output-constrained rate-distortion coding. We develop a coding framework for continuous-variable quantum systems by employing a clipping projection and a dequantization block. For the Gaussian quantum systems, we derive an analytical solution for rate-limited Wasserstein distance of order 2.
  arXiv  Detail & Related papers  (2023-05-17T07:16:20Z)
• Entanglement Distribution and Quantum Teleportation in Higher Dimension over the Superposition of Causal Orders of Quantum Channels [13.359442837017202]
  We develop and formulate the theoretical framework for transmission of classical information through entanglement distribution of qudits over two quantum channels. Results show that entanglement distribution of a qudit provides a considerable gain in fidelity even with increase in noise.
  arXiv  Detail & Related papers  (2023-03-19T15:06:24Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Explicit construction of optimal witnesses for input-output correlations attainable by quantum channels [3.441021278275805]
  We consider the problem of characterizing the set of classical noisy channels that can be obtained from a quantum channel. We consider various classes of linear witnesses and compute their optimum values in closed form for several classes of quantum channels. The witnesses that we consider here are formulated as communication games, in which Alice's aim is to exploit a single use of a given quantum channel to help Bob guess some information she has received from an external referee.
  arXiv  Detail & Related papers  (2020-09-02T07:34:23Z)

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.