Classical-Quantum Channel Resolvability Using Matrix Multiplicative Weight Update Algorithm
🤖 AI Summary
This work addresses the long-standing limitation that distinguishability of classical-quantum (C-Q) channels was previously achievable only through randomized coding schemes, with no known deterministic constructions. For the first time, the authors introduce the Matrix Multiplicative Weight Update Algorithm to this problem, thereby developing a deterministic encoding method. They rigorously prove that C-Q channel distinguishability can indeed be attained via deterministic coding, eliminating the prior reliance on randomness. This breakthrough not only resolves a fundamental open question in quantum information theory but also provides a novel analytical framework and a constructive proof paradigm that may have broader implications for coding and communication in quantum settings.
Application Category
📝 Abstract
We study classical-quantum (C-Q) channel resolvability. C-Q channel resolvability has been proved by only random coding in the literature. In our previous study, we proved channel resolvability by deterministic coding, using multiplicative weight update algorithm. We extend this approach to C-Q channels and prove C-Q channel resolvability by deterministic coding, using the matrix multiplicative weight update algorithm. This is the first approach to C-Q channel resolvability using deterministic coding.
Problem
Research questions and friction points this paper is trying to address.
classical-quantum channel
channel resolvability
deterministic coding
matrix multiplicative weight update
Innovation
Methods, ideas, or system contributions that make the work stand out.
classical-quantum channel resolvability
deterministic coding
matrix multiplicative weight update
quantum information theory
channel simulation
🔎 Similar Papers
2024-08-13International Conferences on Information Science and SystemCitations: 0
