Physics – Quantum Physics
Scientific paper
2010-09-07
Physical Review A 83, 052331 (2011)
Physics
Quantum Physics
5 pages, no figure. Final version for publication
Scientific paper
10.1103/PhysRevA.83.052331
Though the theory of quantum error correction is intimately related to the classical coding theory, in particular, one can construct quantum error correction codes (QECCs) from classical codes with the dual containing property, this does not necessarily imply that the computational complexity of decoding QECCs is the same as their classical counterparts. Instead, decoding QECCs can be very much different from decoding classical codes due to the degeneracy property. Intuitively, one expect degeneracy would simplify the decoding since two different errors might not and need not be distinguished in order to correct them. However, we show that general quantum decoding problem is NP-hard regardless of the quantum codes being degenerate or non-degenerate. This finding implies that no considerably fast decoding algorithm exists for the general quantum decoding problems, and suggests the existence of a quantum cryptosystem based on the hardness of decoding QECCs.
Gall François Le
Hsieh Min-Hsiu
No associations
LandOfFree
NP-hardness of decoding quantum error-correction codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with NP-hardness of decoding quantum error-correction codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and NP-hardness of decoding quantum error-correction codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-704839