Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 1 h ago
PreprintarXiv licencearXiv

From Symmetry to Secrecy: Covariant Classical--Quantum Wiretap Channels

Abstract

For classical--quantum wiretap channels with a transitive covariant input action, both output ensembles admit a description as unitary group orbits of fixed seed states. We use this structure to construct finite-block preprocessing schemes whose private information is an entropy difference evaluated at two distributions related by group convolution. Applying the construction to product groups allows correlations across any fixed number of channel uses. We give a sufficient condition for the associated uniform-input bound to equal the single-use private information. Constant-composition channel codes and universal2 hashing achieve the resulting rates, with trace-distance leakage controlled by sandwiched Rényi information. For uniform outer randomization, the representation structure reduces the comparison-state optimization to Eve's invariant states. For the hybrid binary channel considered by Tikku, Berta and Renes, numerical optimization at three and four uses gives rates above our numerical estimate of the optimized noisy-repetition benchmark wherever that estimate is positive on the tested grid. The improvement comes from noise distributions beyond the family of independent physical flips and a symmetric logical flip. We also prove nonadditivity at an explicit channel parameter using a two-use encoder, an analytic single-use converse, and certified entropy bounds. Finally, we relate the hybrid model to binary phase-shift keying with a fixed receiver measurement.

Related

  1. Secrecy Outage Analysis over Correlated Composite Generalized-Gamma Fading Channels
    Muhammad Adil, Pranavkumar Pathak, Salman A. Alqahtani
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  2. Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy
    Masahito Hayashi, Yanling Chen
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Information-Spectrum General Formulas for the Capacity Region of Classical-Quantum Multiple Access Channels
    Takuya Kubo, Hiroshi Nagaoka
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  4. Classical communication over quantum channels: does entanglement help in nature?
    Peixue Wu
    arXivPreprintCC BY 4.0Full textMathematical physicsQuantum physics & quantum informationarXiv
  5. Classical Commitment over Quantum Channels with Limited Entanglement Assistance
    Remi A. Chou
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
BibTeX
@misc{hayashi2026from,
  title = {{From Symmetry to Secrecy: Covariant Classical--Quantum Wiretap Channels}},
  author = {Masahito Hayashi and Farzin Salek},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.03580},
  eprint = {2610.03580},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.03580},
}
RIS
TY  - UNPB
TI  - From Symmetry to Secrecy: Covariant Classical--Quantum Wiretap Channels
AU  - Masahito Hayashi
AU  - Farzin Salek
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.03580
UR  - https://arxiv.org/abs/2610.03580
AB  - For classical--quantum wiretap channels with a transitive covariant input action, both output ensembles admit a description as unitary group orbits of fixed seed states. We use this structure to construct finite-block preprocessing schemes whose private information is an entropy difference evaluated at two distributions related by group convolution. Applying the construction to product groups allows correlations across any fixed number of channel uses. We give a sufficient condition for the associated uniform-input bound to equal the single-use private information. Constant-composition channel codes and universal_2 hashing achieve the resulting rates, with trace-distance leakage controlled by sandwiched Rényi information. For uniform outer randomization, the representation structure reduces the comparison-state optimization to Eve's invariant states. For the hybrid binary channel considered by Tikku, Berta and Renes, numerical optimization at three and four uses gives rates above our numerical estimate of the optimized noisy-repetition benchmark wherever that estimate is positive on the tested grid. The improvement comes from noise distributions beyond the family of independent physical flips and a symmetric logical flip. We also prove nonadditivity at an explicit channel parameter using a two-use encoder, an analytic single-use converse, and certified entropy bounds. Finally, we relate the hybrid model to binary phase-shift keying with a fixed receiver measurement.
ER  -