Reproduce “Universality Sacrifices Reliability in Classical-Quantum Channel Coding” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Kaito Watanabe, Masahito Hayashi, Takaya Matsuura, Hao-Chung Cheng

The authors characterize universal reliability for classical-to-quantum channels, where classical symbols produce quantum states and a receiver measures them without full channel knowledge. They prove matching high-rate achievable and converse exponents for constant-composition codes, with a converse for unitary-invariant decoders. In a binary-qubit example, an unknown shared phase forces a strict gap from channel-aware reliability; low-rate optimality remains unresolved.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.