Polar Codes for Quantum Reading
- URL: http://arxiv.org/abs/2012.07198v2
- Date: Fri, 18 Dec 2020 13:35:24 GMT
- Title: Polar Codes for Quantum Reading
- Authors: Francisco Revson F. Pereira and Stefano Mancini
- Abstract summary: We show how to construct low complexity encoding schemes that are interesting for channel discrimination.
We also show that the error probability of the scheme proposed decays exponentially with respect to the code length.
An analysis of the optimal quantum states to be used as probes is given.
- Score: 0.0
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: Quantum reading provides a general framework where to formulate the
statistical discrimination of quantum channels. Several paths have been taken
for such a 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 to: how to construct low complexity encoding schemes
that are interesting for channel discrimination and, more importantly, how to
develop capacity-achieving protocols. The aim of this paper is to present a
solution to these questions using polar codes. Firstly, we characterize the
rate and reliability of the channels under polar encoding. We also show that
the error probability of the scheme proposed decays exponentially with respect
to the code length. Lastly, an analysis of the optimal quantum states to be
used as probes is given.
Related papers
- Resolvability of classical-quantum channels [54.825573549226924]
We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input.
For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
arXiv Detail & Related papers (2024-10-22T05:18:43Z) - Quantum Lego Expansion Pack: Enumerators from Tensor Networks [1.489619600985197]
We provide the first tensor network method for computing quantum weight enumerators in the most general form.
For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance.
We show that these enumerators can be used to compute logical error rates exactly and thus construct decoders for any i.i.d. single qubit or qudit error channels.
arXiv Detail & Related papers (2023-08-09T18:00:02Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Quantum Error Correction via Noise Guessing Decoding [0.0]
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation.
This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
arXiv Detail & Related papers (2022-08-04T16:18:20Z) - Conservation laws and quantum error correction: towards a generalised
matching decoder [2.1756081703276]
We explore decoding algorithms for the surface code, a prototypical quantum low-density parity-check code.
The decoder works by exploiting underlying structure that arises due to materialised symmetries among surface-code stabilizer elements.
We propose a systematic way of constructing a minimum-weight perfect-matching decoder for codes with certain characteristic properties.
arXiv Detail & Related papers (2022-07-13T18:00:00Z) - Quantum polar stabilizer codes based on polarization of pure quantum
channel don't work for quantum computing [9.084924083651133]
No one has designed a quantum polar coding scheme which applies to quantum computing yet.
We propose a more reasonable quantum polar stabilizer code construction algorithm than any previous ones.
We find a class of quantum stabilizer codes with coding rate 0.5 for pure Pauli X, Z and Y noise.
arXiv Detail & Related papers (2022-04-25T13:47:56Z) - Resource Optimisation of Coherently Controlled Quantum Computations with
the PBS-calculus [55.2480439325792]
Coherent control of quantum computations can be used to improve some quantum protocols and algorithms.
We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
arXiv Detail & Related papers (2022-02-10T18:59:52Z) - Error Probability Mitigation in Quantum Reading using Classical Codes [4.125187280299247]
Several tools can be applied in quantum reading to reduce the error probability in distinguishing the ensemble of channels.
Three families of codes are considered: Reed-Solomon codes, BCH codes, and Reed-Muller codes.
BCH codes in conjunction with Dolinar receiver turn out to be the optimal strategy for error mitigation in the quantum reading task.
arXiv Detail & Related papers (2021-11-22T11:52:37Z) - Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs.
Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder.
In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.