Nassero, RajaiRenes, Joseph M.2018-12-132018-12-132018-12-132018-11-0110.1109/TIT.2018.2869460https://infoscience.epfl.ch/handle/20.500.14299/152055WOS:000448029300032We prove polarization theorems for arbitrary classical-quantum (cq) channels. The input alphabet is endowed with an arbitrary Abelian group operation, and an Anion-style transformation is applied using this operation. It is shown that as the number of polarization steps becomes large, the synthetic cq-channels polarize to deterministic homomorphism channels that project their input to a quotient group of the input alphabet. This result is used to construct polar codes for arbitrary cq-channels and arbitrary cq multiple access channels. The encoder can be implemented in O(N log N) operations, where N is the blocklength of the code. A quantum successive cancellation decoder for the constructed codes is proposed. It is shown that the probability of error of this decoder decays faster than 2(-N beta) for any beta < (1/2).Computer Science, Information SystemsEngineering, Electrical & ElectronicComputer ScienceEngineeringpolar codesclassical-quantum channelholevo informationcapacity-achieving codesmultiple-access channelmemoryless channelsergodic-theorypolarizationcapacitytext::journal::journal article::research article