Add to ORKGOur task of quantum list decoding for a classical block code is to recover from a given quantumly corrupted codeword a short list containing all messages whose codewords have high "presence" in this quantumly corrupted codeword. All known families of efficiently quantum list decodable codes, nonetheless, have exponentially-small message rate. We show that certain generalized Reed-Solomon codes concatenated with Hadamard codes of polynomially-small rate and constant codeword alphabet size have efficient quantum list decoding algorithms, provided that target codewords should have relatively high presence in a given quantumly corrupted codeword
A quantum-convolutional code was introduced recently as an alternative way to protect vital quantum ...
Quantum error correction is an important building block for reliable quantum information processing....
Noise is a major obstacle in the development of practical schemes for quantum computation and commun...
Our task of quantum list decoding for a classical block code is to recover from a given quantumly co...
One of the founding results of lattice based cryptography is a quantum reduction from the Short Inte...
After a brief introduction to both quantum computation and quantum error correction, we show how to ...
Recently, Renes proposed a quantum algorithm called belief propagation with quantum messages (BPQM) ...
AbstractA locally decodable code (LDC) encodes n-bit strings x in m-bit codewords C(x) in such a way...
This thesis provides bounds on the performance of quantum error correcting codes when used for quant...
We study a quantum analogue of locally decodable error-correcting codes. A $q$-query emph{locally de...
In this paper, we present a theory of quantum serial turbo codes, describe their iterative decoding ...
We study quantum communication in the presence of adversarial noise. In this setting, communicating ...
In this correspondence, we study quantum communication in the presence of adversarial noise. In this...
We consider the problem of optimally decoding a quantum error correction code -- that is to find the...
Abstract—Quantum error correction is an important building block for reliable quantum information pr...
A quantum-convolutional code was introduced recently as an alternative way to protect vital quantum ...
Quantum error correction is an important building block for reliable quantum information processing....
Noise is a major obstacle in the development of practical schemes for quantum computation and commun...
Our task of quantum list decoding for a classical block code is to recover from a given quantumly co...
One of the founding results of lattice based cryptography is a quantum reduction from the Short Inte...
After a brief introduction to both quantum computation and quantum error correction, we show how to ...
Recently, Renes proposed a quantum algorithm called belief propagation with quantum messages (BPQM) ...
AbstractA locally decodable code (LDC) encodes n-bit strings x in m-bit codewords C(x) in such a way...
This thesis provides bounds on the performance of quantum error correcting codes when used for quant...
We study a quantum analogue of locally decodable error-correcting codes. A $q$-query emph{locally de...
In this paper, we present a theory of quantum serial turbo codes, describe their iterative decoding ...
We study quantum communication in the presence of adversarial noise. In this setting, communicating ...
In this correspondence, we study quantum communication in the presence of adversarial noise. In this...
We consider the problem of optimally decoding a quantum error correction code -- that is to find the...
Abstract—Quantum error correction is an important building block for reliable quantum information pr...
A quantum-convolutional code was introduced recently as an alternative way to protect vital quantum ...
Quantum error correction is an important building block for reliable quantum information processing....
Noise is a major obstacle in the development of practical schemes for quantum computation and commun...