Zero-Error List Decoding for Classical-Quantum Channels

• URL: http://arxiv.org/abs/2601.09786v1
• Date: Wed, 14 Jan 2026 19:00:02 GMT
• Title: Zero-Error List Decoding for Classical-Quantum Channels
• Authors: Marco Dalai, Filippo Girardi, Ludovico Lami,
• Abstract summary: We study the zero-error capacity of pure-state classical-quantum channels in the setting of list decoding.<n>We provide an achievability bound for list-size two and a converse bound for every fixed list size.
• Score: 13.139603473712425
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The aim of this work is to study the zero-error capacity of pure-state classical-quantum channels in the setting of list decoding. We provide an achievability bound for list-size two and a converse bound holding for every fixed list size. The two bounds coincide for channels whose pairwise absolute state overlaps form a positive semi-definite matrix. Finally, we discuss a remarkable peculiarity of the classical-quantum case: differently from the fully classical setting, the rate at which the sphere-packing bound diverges might not be achievable by zero-error list codes, even when we take the limit of fixed but arbitrarily large list size.

Related papers

• 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)
• Continuous-Variable Quantum MacWilliams Identities [0.0]
  We derive bounds on general quantum error correcting codes against the displacement noise channel.<n>We argue that Gottesman--Kitaev--Preskill codes based on the $E_8$ and Leech lattices achieve optimal distances.
  arXiv  Detail & Related papers  (2025-02-13T17:30:22Z)
• Extendible quantum measurements and limitations on classical communication [4.7846581583644525]
  Unextendibility of quantum states and channels is inextricably linked to the no-cloning theorem of quantum mechanics.<n>We define $k$-extendible measurements for every integer $kge 2$.
  arXiv  Detail & Related papers  (2024-12-24T17:12:45Z)
• Kochen-Specker for many qubits and the classical limit [55.2480439325792]
  It is shown that quantum and classical predictions converge as the number of qubits is increases to the macroscopic scale.<n>This way to explain the classical limit concurs with, and improves, a result previously reported for GHZ states.
  arXiv  Detail & Related papers  (2024-11-26T22:30:58Z)
• 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)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Singleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes [0.0]
  We show that entirely quantum Shannon theoretic methods can be used to derive Singleton bounds on the performance of EACQ error correcting codes. We show that a large part of this region is attainable by certain EACQ codes, whenever the local alphabet size is large enough.
  arXiv  Detail & Related papers  (2022-02-04T15:22:18Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding [67.6686661244228]
  We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code. We establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets.
  arXiv  Detail & Related papers  (2020-11-01T03:26:08Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Generalized Perfect Codes for Symmetric Classical-Quantum Channels [9.797319790710711]
  We extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite dimensional complex Hilbert output space. For certain $N$-qubit classical-quantum channels, we show that codes based on a generalization of Bell states are quasi-perfect.
  arXiv  Detail & Related papers  (2020-07-15T19:22:39Z)

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.