Channel Polarization of Two-dimensional-input Quantum Symmetric Channels

Abstract

Being attracted by the property of classical polar code, researchers are trying to find its analogue in quantum fields, which is called quantum polar code. The first step and the key to design quantum polar code is to find out for the quantity which can measure the quality of quantum channels, whether there is a polarization phenomenon which is similar to classical channel polarization. Coherent information is believed to be the quantum analogue of classical mutual information and the quantity to measure the capacity of quantum channel. In this paper, we define a class of quantum channels called quantum symmetric channels, and prove that for quantum symmetric channels, under the similar channel combining and splitting process as in the classical channel polarization, the maximum single letter coherent information of the coordinate channels will polarize. That is to say, there is a channel polarization phenomenon in quantum symmetric channels.

References in corpus (26)

• Surface codes: Towards practical large-scale quantum computation
• Quantifying Coherence
• Quantum Computing with Very Noisy Devices
• Measuring Quantum Coherence with Entanglement
• The capacity of the noisy quantum channel
• Quantum data processing and error correction
• Superadditivity of communication capacity using entangled inputs
• High threshold universal quantum computation on the surface code
• Information transmission through a noisy quantum channel
• Quantum codes on a lattice with boundary
• Quantum Communication With Zero-Capacity Channels
• Scalable quantum circuit and control for a superconducting surface code
• Fault-tolerant thresholds for quantum error correction with the surface code
• Constructions and Noise Threshold of Hyperbolic Surface Codes
• Unbounded number of channel uses are required to see quantum capacity
• High threshold error correction for the surface code
• Surface code with decoherence: An analysis of three superconducting architectures
• Efficient Quantum Polar Coding
• Concatenated Quantum Codes
• Proof of finite surface code threshold for matching
• Towards practical classical processing for the surface code: timing analysis
• Optimal complexity correction of correlated errors in the surface code
• Polar codes in network quantum information theory
• Polar codes in quantum information theory
• A linear-time benchmarking tool for generalized surface codes
• Quantum Polarization of Qudit Channels