|
Volumn , Issue , 2012, Pages 208-211
|
On the hardness of decoding quantum stabilizer codes under the depolarizing channel
|
Author keywords
[No Author keywords available]
|
Indexed keywords
BERLEKAMP;
BINARY LINEAR CODES;
BOUNDED DISTANCE DECODING;
CHANNEL MODEL;
CODE-BASED CRYPTOGRAPHY;
COMPLEXITY CLASS;
DECODING ALGORITHM;
DECODING ERRORS;
MCELIECE;
MOST LIKELY;
NP-HARD;
POLYNOMIAL-TIME;
QUANTUM STABILIZER CODES;
STABILIZER CODES;
COMPUTATIONAL COMPLEXITY;
DEPOLARIZATION;
INFORMATION THEORY;
QUANTUM COMPUTERS;
DECODING;
|
EID: 84873557654
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (13)
|
References (13)
|