Universal classical-quantum channel resolvability and private channel coding

• URL: http://arxiv.org/abs/2510.02883v1
• Date: Fri, 03 Oct 2025 10:40:44 GMT
• Title: Universal classical-quantum channel resolvability and private channel coding
• Authors: Takaya Matsuura, Masahito Hayashi, Min-Hsiu Hsieh,
• Abstract summary: We address the problem of constructing fully universal private channel coding protocols for c-q channels.<n>We identify an explicit structural property of codebooks that guarantees universal channel resolvability.<n>We show that our fully universal private channel coding achieves the known optimal rate.
• Score: 41.33804459071106
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We address the problem of constructing fully universal private channel coding protocols for classical-quantum (c-q) channels. Previous work constructed universal decoding strategies, but the encoder relied on random coding, which prevents fully universal code construction. In this work, we resolve this gap by identifying an explicit structural property of codebooks -- namely, the spectral expansion of an associated Schreier graph -- that guarantees universal channel resolvability. Our analysis reveals how this property can be related to channel resolvability through the theory of induced representation. Our main technical result shows that when the transition matrix of a graph associated with a codebook has a large spectral gap, the channel output induced by uniformly sampled codewords is asymptotically indistinguishable from the target output distribution, independently of the channel. This establishes the first deterministic, channel-independent construction of resolvability codebooks. Building on this, we construct a fully universal private channel coding protocol by combining it with universal c-q channel coding based on the Schur-Weyl duality. With appropriate modifications to the requirements on codebooks of universal c-q channel coding, we show that our fully universal private channel coding achieves the known optimal rate. This work thus sheds new light on the expander property of a graph in the context of secure communication.

Related papers

• CP Loss: Channel-wise Perceptual Loss for Time Series Forecasting [67.3477355449697]
  We propose a Channel-wise Perceptual Loss (CP Loss) for time-series data.<n>We learn a unique perceptual space for each channel that is adapted to its characteristics.<n>Loss is calculated within these perception spaces to optimize the model.
  arXiv  Detail & Related papers  (2026-01-25T15:31:37Z)
• Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation [0.47267770920095536]
  This work implements logical Clifford and T gates through novel ancilla-mediated protocols.<n>Our implementation is deterministic, does not consume ancilla registers, does not modify the underlying data codes or registers, and is generic over all stabilizer codes.
  arXiv  Detail & Related papers  (2026-01-16T03:06:56Z)
• Generalization Bounds for Transformer Channel Decoders [61.55280736553095]
  This paper studies the generalization performance of ECCT from a learning-theoretic perspective.<n>To the best of our knowledge, this work provides the first theoretical generalization guarantees for this class of decoders.
  arXiv  Detail & Related papers  (2026-01-11T15:56:37Z)
• Flexible polar encoding for information reconciliation in QKD [2.627883025193776]
  Quantum Key Distribution (QKD) enables two parties to establish a common secret key that is information-theoretically secure. Errors that are generally considered to be due to the adversary's tempering with the quantum channel need to be corrected using classical communication over a public channel. We show that the reliability sequence can be derived and used to design an encoder independent of the choice of decoder.
  arXiv  Detail & Related papers  (2023-11-30T16:01:10Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Low-overhead pieceable fault-tolerant construction of logical controlled-phase circuit for degenerate quantum code [11.106110829349221]
  We search for a non-transversal but fault-tolerant construction of a logical controlled-phase gate for quantum code. We find a 3-piece fault-tolerant logical CZ circuit on this code.
  arXiv  Detail & Related papers  (2021-05-15T04:06:12Z)
• A Semiclassical Proof of Duality Between the Classical BSC and the Quantum PSC [13.16823105226952]
  Renes developed a theory of channel duality for classical-input quantum-output (CQ) channels. One special case of this duality is a connection between coding for error correction (resp. wire-tap secrecy) on the quantum pure-state channel (PSC) and coding for wire-tap secrecy (resp. error correction) on the classical binary symmetric channel (BSC)
  arXiv  Detail & Related papers  (2021-03-16T17:55:38Z)
• 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)
• 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.