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

IEEE International Symposium on Information Theory (ISIT)

Polar Codes for Quantum Reading

Francisco Revson F. Pereira, Stefano Mancini

Published Jul 12, 2021• 2 citations
Publisher

Abstract

Quantum reading provides a general framework to formulate the statistical discrimination of quantum channels. Applying classical codes to this task gives at least two open questions: how to construct low complexity encoding schemes that are interesting for channel discrimination and, how to develop capacity-achieving protocols. The aim of this paper is to present a solution to these questions using polar codes. We characterize the rate and reliability of the channels under polar encoding. Additionally, it is shown that the error probability of the proposed scheme decays exponentially with respect to the code length. A full version of this paper is accessible at https://arxiv.org/abs/2012.07198v2

DOI
10.1109/isit45174.2021.9517807

Related papers

Polar Codes for Quantum Reading

Francisco Revson F. Pereira, Stefano Mancini

Quantum readout provides a general framework for formulating statistical discrimination of quantum channels. Several paths have been taken for such this problem. However, there is much to be done in the avenue of optimizing channel discrimination using classical codes. At least two open questions can be pointed out: how to construct low complexity encoding schemes that are interesting for channel discrimination and, more importantly, how to develop capacity-achieving protocols. This paper aims at presenting a solution to these questions using polar codes. Firstly, we characterize the information rate and reliability parameter of the channels under polar encoding. We also show that the error probability of the scheme proposed decays exponentially with the square root of the code length. Secondly, an analysis of the optimal quantum states to be used as probes is given.

arXiv:2012.07198•IEEE Transactions on Information Theory•Mar 16, 2022•4 citations

Polar codes in quantum information theory

Christoph Hirche

Polar codes are the first capacity achieving and efficiently implementable codes for classical communication. Recently they have also been generalized to communication over classical-quantum and quantum channels. In this work we present our recent results for polar coding in quantum information theory, including applications to classical-quantum multiple access channels, interference channels and compound communication settings, including the first proof of channel coding achieving the Han-Kobayashi rate region of the interference channel without the need of a simultaneous decoder. Moreover we add to the existing framework by extending polar codes to achieve the asymmetric capacity and improving the block error probability for classical-quantum channels. In addition we use polar codes to prove a new achievable rate region for the classical-quantum broadcast channel. We also discuss polar codes for quantum communication over quantum channels and state results towards codes for compound quantum channels in this setting. We conclude by stating a list of interesting open questions to invite further research on the topic.

arXiv:1501.03737•Jan 15, 2015•10 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

Concatenated Capacity-Achieving Polar Codes for Optical Quantum Channels

László Gyöngyösi, Sándor Imre

We construct concatenated capacity-achieving quantum codes for noisy optical quantum channels. We demonstrate that the error-probability of capacity-achieving quantum polar encoding can be reduced by the proposed low-complexity concatenation scheme.

Frontiers in Optics•Jan 1, 2012•0 citations

Concatenated Capacity-Achieving Polar Codes for Optical Quantum Channels

László Gyöngyösi, Sándor Imre

We construct concatenated capacity-achieving quantum codes for noisy optical quantum channels. We demonstrate that the error-probability of capacity-achieving quantum polar encoding can be reduced by the proposed low-complexity concatenation scheme.

arXiv:1302.3110•Feb 13, 2013•0 citations

Error Probability Mitigation in Quantum Reading Using Classical Codes

Francisco Revson F. Pereira, Stefano Mancini

A general framework describing the statistical discrimination of an ensemble of quantum channels is given by the name quantum reading. Several tools can be applied in quantum reading to reduce the error probability in distinguishing the ensemble of channels. Classical and quantum codes can be envisioned for this goal. The aim of this paper is to present a simple but fruitful protocol for this task using classical error-correcting codes. Three families of codes are considered: Reed-Solomon codes, BCH codes, and Reed-Muller codes. In conjunction with the use of codes, we also analyze the role of the receiver. In particular, heterodyne and Dolinar receivers are taken into consideration. The encoding and measurement schemes are connected by the probing step. As probes, we consider coherent states. In such a simple manner, interesting results are obtained. As we show, there is a threshold below which using codes surpass optimal and sophisticated schemes for any fixed rate and code. BCH codes in conjunction with Dolinar receiver turn out to be the optimal strategy for error mitigation in quantum reading.

arXiv:2111.11135•Entropy•Dec 21, 2021•1 citation
Quantum reading provides a general framework to formulate the statistical discrimination of quantum channels. Applying classical codes to this task gives at least two open questions: how to construct low complexity encoding schemes that are interesting for channel discrimination and, how to develop capacity-achieving protocols. The aim of this paper is to present a solution to these questions using polar codes. We characterize the rate and reliability of the channels under polar encoding. Additionally, it is shown that the error probability of the proposed scheme decays exponentially with respect to the code length. A full version of this paper is accessible at https://arxiv.org/abs/2012.07198v2
Quantum readout provides a general framework for formulating statistical discrimination of quantum channels. Several paths have been taken for such this problem. However, there is much to be done in the avenue of optimizing channel discrimination using classical codes. At least two open questions can be pointed out: how to construct low complexity encoding schemes that are interesting for channel discrimination and, more importantly, how to develop capacity-achieving protocols. This paper aims at presenting a solution to these questions using polar codes. Firstly, we characterize the information rate and reliability parameter of the channels under polar encoding. We also show that the error probability of the scheme proposed decays exponentially with the square root of the code length. Secondly, an analysis of the optimal quantum states to be used as probes is given.
Polar codes are the first capacity achieving and efficiently implementable codes for classical communication. Recently they have also been generalized to communication over classical-quantum and quantum channels. In this work we present our recent results for polar coding in quantum information theory, including applications to classical-quantum multiple access channels, interference channels and compound communication settings, including the first proof of channel coding achieving the Han-Kobayashi rate region of the interference channel without the need of a simultaneous decoder. Moreover we add to the existing framework by extending polar codes to achieve the asymmetric capacity and improving the block error probability for classical-quantum channels. In addition we use polar codes to prove a new achievable rate region for the classical-quantum broadcast channel. We also discuss polar codes for quantum communication over quantum channels and state results towards codes for compound quantum channels in this setting. We conclude by stating a list of interesting open questions to invite further research on the topic.
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.
A general framework describing the statistical discrimination of an ensemble of quantum channels is given by the name quantum reading. Several tools can be applied in quantum reading to reduce the error probability in distinguishing the ensemble of channels. Classical and quantum codes can be envisioned for this goal. The aim of this paper is to present a simple but fruitful protocol for this task using classical error-correcting codes. Three families of codes are considered: Reed-Solomon codes, BCH codes, and Reed-Muller codes. In conjunction with the use of codes, we also analyze the role of the receiver. In particular, heterodyne and Dolinar receivers are taken into consideration. The encoding and measurement schemes are connected by the probing step. As probes, we consider coherent states. In such a simple manner, interesting results are obtained. As we show, there is a threshold below which using codes surpass optimal and sophisticated schemes for any fixed rate and code. BCH codes in conjunction with Dolinar receiver turn out to be the optimal strategy for error mitigation in quantum reading.