Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2006.12652 · Quantum Information and Computation

Multilevel polarization for quantum Channels

Ashutosh Goswami, Mehdi Mhalla, Valentin Savin

Published Apr 27, 2021• 1 citation
arXivHTMLPDF

Abstract

Recently, a purely quantum version of polar codes has been proposed in~\cite{DGMS19} based on a quantum channel combining and splitting procedure, where a randomly chosen two-qubit Clifford unitary acts as a channel combining operation. Here, we consider the quantum polar code construction using the same channel combining and splitting procedure as in~\cite{DGMS19}, but with a fixed two-qubit Clifford unitary. For the family of Pauli channels, we show that polarization happens in multi-levels, where synthesized quantum virtual channels tend to become completely noisy, half-noisy, or noiseless. Further, we present a quantum polar code exploiting the multilevel nature of polarization, and provide an efficient decoding for this code. We show that half-noisy channels can be frozen by fixing their inputs in either the amplitude or the phase basis, which allows reducing the number of preshared EPR pairs compared to the construction in~\cite{DGMS19}. We provide an upper bound on the number of preshared EPR pairs, which is an equality in the case of the quantum erasure channel. To improve the speed of polarization, we propose an alternative construction, which again polarizes in multi-levels, and the previous upper bound on the number of preshared EPR pairs also holds. For a quantum erasure channel, we confirm by numerical analysis that the multilevel polarization happens relatively faster for the alternative construction.

DOI
10.26421/qic21.7-8-4

Related papers

Polarization of Quantum Channels Using Clifford-Based Channel Combining

Frédéric Dupuis, Ashutosh Goswami, Mehdi Mhalla +1 more

We provide a purely quantum version of polar codes, achieving the symmetric coherent information of any qubit-input quantum channel. Our scheme relies on a recursive channel combining and splitting construction, where a two-qubit gate randomly chosen from the Clifford group is used to combine two single-qubit channels. The inputs to the synthesized bad channels are frozen by preshared EPR pairs between the sender and the receiver, so our scheme is entanglement assisted. We further show that quantum polarization can be achieved by choosing the channel combining Clifford operator randomly, from a much smaller subset of only nine two-qubit Clifford gates. Subsequently, we show that a Pauli channel polarizes if and only if a specific classical channel over a four-symbol input set polarizes. We exploit this equivalence to prove fast polarization for Pauli channels, and to devise an efficient successive cancellation based decoding algorithm for such channels. Finally, we present a code construction based on chaining several quantum polar codes, which is shown to require a rate of preshared entanglement that vanishes asymptotically.

arXiv:1904.04713•IEEE Transactions on Information Theory•Mar 2, 2021•11 citations

Purely Quantum Polar Codes

Frédéric Dupuis, Ashutosh Goswami, Mehdi Mhalla +1 more

We provide a purely quantum version of polar codes, achieving the coherent information of any quantum channel. Our scheme relies on a recursive channel combining and splitting construction, where a two-qubit gate randomly chosen from the Clifford group is used to combine two single-qubit channels. The inputs to the synthesized bad channels are frozen by preshared EPR pairs between the sender and the receiver, so our scheme is entanglement assisted. We further show that quantum polarization can be achieved by choosing the channel combining Clifford operator randomly, from a much smaller subset of only 9 two-qubit Clifford gates. Subsequently, we show that a Pauli channel polarizes if and only if a specific classical channel over four symbol input set polarizes. We exploit this equivalence to prove fast polarization for Pauli channels, and to devise an efficient successive cancellation based decoding algorithm for such channels. Finally, we present a code construction based on chaining several quantum polar codes, which is shown to require a rate of preshared entanglement that vanishes asymptotically.

•Aug 25, 2019•1 citation

Purely Quantum Polar Codes

Frédéric Dupuis, Ashutosh Goswami, Mehdi Mhalla +1 more

We provide a purely quantum version of polar codes, achieving the coherent information of any quantum channel. Our scheme relies on a recursive channel combining and splitting construction, where random two-qubit Clifford gates are used to combine two single-qubit channels. The inputs to the synthesized bad channels are frozen by sharing EPR pairs between the sender and the receiver, so our scheme is entanglement assisted. We further show that a Pauli channel polarizes if and only if a specific classical channel over a four-symbol input set polarizes. We exploit this equivalence to prove fast polarization for Pauli channels, and to devise an efficient successive cancellation based decoding algorithm for such channels.

IEEE Information Theory Workshop (ITW)•Aug 1, 2019•10 citations

Quantum Polarization of Qudit Channels

Ashutosh Goswami, Mehdi Mhalla, Valentin Savin

We provide a generalization of quantum polar codes to quantum channels with qudit-input, achieving the symmetric coherent information of the channel. Our scheme relies on a channel combining and splitting construction, where a two-qudit unitary randomly chosen from a unitary 2-design is used to combine two instances of a qudit-input channel. The inputs to the synthesized bad channels are frozen by sharing EPR pairs between the sender and the receiver, so our scheme is entanglement assisted. Using the fact that the generalized two-qudit Clifford group forms a unitary 2-design, we conclude that the channel combining operation can be chosen from this set. Moreover, we show that polarization also happens for a much smaller subset of two-qudit Cliffords, which is not a unitary 2-design. Finally, we show how to decode the proposed quantum polar codes on Pauli qudit channels.

arXiv:2101.10194•IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•4 citations

Polar Codes for Classical-Quantum Channels

Mark M. Wilde, Saikat Guha

Holevo, Schumacher, and Westmoreland's coding theorem guarantees the existence of codes that are capacity-achieving for the task of sending classical data over a channel with classical inputs and quantum outputs. Although they demonstrated the existence of such codes, their proof does not provide an explicit construction of codes for this task. The aim of this paper is to fill this gap by constructing near-explicit “polar” codes that are capacity-achieving. The codes exploit the channel polarization phenomenon observed by Arikan for the case of classical channels. Channel polarization is an effect in which one can synthesize a set of channels, by “channel combining” and “channel splitting,” in which a fraction of the synthesized channels are perfect for data transmission, while the other channels are completely useless for data transmission, with the good fraction equal to the capacity of the channel. The channel polarization effect then leads to a simple scheme for data transmission: send the information bits through the perfect channels and “frozen” bits through the useless ones. The main technical contributions of this paper are threefold. First, we leverage several known results from the quantum information literature to demonstrate that the channel polarization effect occurs for channels with classical inputs and quantum outputs. We then construct linear polar codes based on this effect, and the encoding complexity isO(NlogN), whereNis the blocklength of the code. We also demonstrate that a quantum successive cancellation decoder works well, in the sense that the word error rate decays exponentially with the blocklength of the code. For this last result, we exploit Sen's recent “noncommutative union bound” that holds for a sequence of projectors applied to a quantum state.

arXiv:1109.2591•IEEE Transactions on Information Theory•Sep 14, 2012•115 citations

Efficient Polar Coding of Quantum Information

Joseph M. Renes, Frédéric Dupuis, Renato Renner

Polar coding, introduced 2008 by Arıkan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here, we study the use of polar codes for the transmission of quantum information. Focusing on the case of qubit Pauli channels and qubit erasure channels, we use classical polar codes to construct a coding scheme that asymptotically achieves a net transmission rate equal to the coherent information using efficient encoding and decoding operations and code construction. Our codes generally require preshared entanglement between sender and receiver, but for channels with a sufficiently low noise level we demonstrate that the rate of preshared entanglement required is zero.

arXiv:1109.3195•Physical Review Letters•Aug 1, 2012•69 citations
Recently, a purely quantum version of polar codes has been proposed in~\cite{DGMS19} based on a quantum channel combining and splitting procedure, where a randomly chosen two-qubit Clifford unitary acts as a channel combining operation. Here, we consider the quantum polar code construction using the same channel combining and splitting procedure as in~\cite{DGMS19}, but with a fixed two-qubit Clifford unitary. For the family of Pauli channels, we show that polarization happens in multi-levels, where synthesized quantum virtual channels tend to become completely noisy, half-noisy, or noiseless. Further, we present a quantum polar code exploiting the multilevel nature of polarization, and provide an efficient decoding for this code. We show that half-noisy channels can be frozen by fixing their inputs in either the amplitude or the phase basis, which allows reducing the number of preshared EPR pairs compared to the construction in~\cite{DGMS19}. We provide an upper bound on the number of preshared EPR pairs, which is an equality in the case of the quantum erasure channel. To improve the speed of polarization, we propose an alternative construction, which again polarizes in multi-levels, and the previous upper bound on the number of preshared EPR pairs also holds. For a quantum erasure channel, we confirm by numerical analysis that the multilevel polarization happens relatively faster for the alternative construction.
We provide a purely quantum version of polar codes, achieving the symmetric coherent information of any qubit-input quantum channel. Our scheme relies on a recursive channel combining and splitting construction, where a two-qubit gate randomly chosen from the Clifford group is used to combine two single-qubit channels. The inputs to the synthesized bad channels are frozen by preshared EPR pairs between the sender and the receiver, so our scheme is entanglement assisted. We further show that quantum polarization can be achieved by choosing the channel combining Clifford operator randomly, from a much smaller subset of only nine two-qubit Clifford gates. Subsequently, we show that a Pauli channel polarizes if and only if a specific classical channel over a four-symbol input set polarizes. We exploit this equivalence to prove fast polarization for Pauli channels, and to devise an efficient successive cancellation based decoding algorithm for such channels. Finally, we present a code construction based on chaining several quantum polar codes, which is shown to require a rate of preshared entanglement that vanishes asymptotically.
We provide a purely quantum version of polar codes, achieving the coherent information of any quantum channel. Our scheme relies on a recursive channel combining and splitting construction, where a two-qubit gate randomly chosen from the Clifford group is used to combine two single-qubit channels. The inputs to the synthesized bad channels are frozen by preshared EPR pairs between the sender and the receiver, so our scheme is entanglement assisted. We further show that quantum polarization can be achieved by choosing the channel combining Clifford operator randomly, from a much smaller subset of only 9 two-qubit Clifford gates. Subsequently, we show that a Pauli channel polarizes if and only if a specific classical channel over four symbol input set polarizes. We exploit this equivalence to prove fast polarization for Pauli channels, and to devise an efficient successive cancellation based decoding algorithm for such channels. Finally, we present a code construction based on chaining several quantum polar codes, which is shown to require a rate of preshared entanglement that vanishes asymptotically.
We provide a purely quantum version of polar codes, achieving the coherent information of any quantum channel. Our scheme relies on a recursive channel combining and splitting construction, where random two-qubit Clifford gates are used to combine two single-qubit channels. The inputs to the synthesized bad channels are frozen by sharing EPR pairs between the sender and the receiver, so our scheme is entanglement assisted. We further show that a Pauli channel polarizes if and only if a specific classical channel over a four-symbol input set polarizes. We exploit this equivalence to prove fast polarization for Pauli channels, and to devise an efficient successive cancellation based decoding algorithm for such channels.
We provide a generalization of quantum polar codes to quantum channels with qudit-input, achieving the symmetric coherent information of the channel. Our scheme relies on a channel combining and splitting construction, where a two-qudit unitary randomly chosen from a unitary 2-design is used to combine two instances of a qudit-input channel. The inputs to the synthesized bad channels are frozen by sharing EPR pairs between the sender and the receiver, so our scheme is entanglement assisted. Using the fact that the generalized two-qudit Clifford group forms a unitary 2-design, we conclude that the channel combining operation can be chosen from this set. Moreover, we show that polarization also happens for a much smaller subset of two-qudit Cliffords, which is not a unitary 2-design. Finally, we show how to decode the proposed quantum polar codes on Pauli qudit channels.
Holevo, Schumacher, and Westmoreland's coding theorem guarantees the existence of codes that are capacity-achieving for the task of sending classical data over a channel with classical inputs and quantum outputs. Although they demonstrated the existence of such codes, their proof does not provide an explicit construction of codes for this task. The aim of this paper is to fill this gap by constructing near-explicit “polar” codes that are capacity-achieving. The codes exploit the channel polarization phenomenon observed by Arikan for the case of classical channels. Channel polarization is an effect in which one can synthesize a set of channels, by “channel combining” and “channel splitting,” in which a fraction of the synthesized channels are perfect for data transmission, while the other channels are completely useless for data transmission, with the good fraction equal to the capacity of the channel. The channel polarization effect then leads to a simple scheme for data transmission: send the information bits through the perfect channels and “frozen” bits through the useless ones. The main technical contributions of this paper are threefold. First, we leverage several known results from the quantum information literature to demonstrate that the channel polarization effect occurs for channels with classical inputs and quantum outputs. We then construct linear polar codes based on this effect, and the encoding complexity isO(NlogN), whereNis the blocklength of the code. We also demonstrate that a quantum successive cancellation decoder works well, in the sense that the word error rate decays exponentially with the blocklength of the code. For this last result, we exploit Sen's recent “noncommutative union bound” that holds for a sequence of projectors applied to a quantum state.
Polar coding, introduced 2008 by Arıkan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here, we study the use of polar codes for the transmission of quantum information. Focusing on the case of qubit Pauli channels and qubit erasure channels, we use classical polar codes to construct a coding scheme that asymptotically achieves a net transmission rate equal to the coherent information using efficient encoding and decoding operations and code construction. Our codes generally require preshared entanglement between sender and receiver, but for channels with a sufficiently low noise level we demonstrate that the rate of preshared entanglement required is zero.