{"id":"W2094848842","doi":"10.1109/tit.2015.2422294","title":"Hardness of Decoding Quantum Stabilizer Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Lockheed Martin Corporation","keywords":"Decoding methods; List decoding; Sequential decoding; Berlekamp–Welch algorithm; Quantum convolutional code; Algorithm; Mathematics; Concatenated error correction code; Degeneracy (biology); Code (set theory); Computer science; Linear code; Discrete mathematics; Block code","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007538447,0.0001172996,0.0001512975,0.0002432497,0.0001280168,0.00008266221,0.0004052561,0.00005398369,0.00001412322],"category_scores_gemma":[0.00002163791,0.0001006668,0.00007912678,0.0003353271,0.00006236712,0.001018951,0.000004214125,0.0001684994,0.00007090665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003681852,"about_ca_system_score_gemma":0.0001023612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001000208,"about_ca_topic_score_gemma":0.000001176271,"domain_scores_codex":[0.9989688,0.0001086653,0.0003509928,0.0001090037,0.0002952997,0.0001671989],"domain_scores_gemma":[0.9990594,0.0001661042,0.0001415018,0.0003538385,0.000179133,0.00009997151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001039124,0.0001430887,0.000006910468,0.00006858875,0.00005124814,8.984035e-7,0.01533368,0.4100838,0.0001457005,0.1623303,0.0004287063,0.4113032],"study_design_scores_gemma":[0.000682395,0.0002003183,0.00003934663,0.00005821985,0.00000989368,0.00002237251,0.0006933925,0.9452866,0.02123633,0.02969787,0.001850854,0.0002224318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02607591,0.0000127086,0.9710243,0.000120197,0.001153286,0.0001096969,0.00001388206,0.0001738979,0.001316105],"genre_scores_gemma":[0.9833508,0.000003621555,0.01637972,0.0001875629,0.00001601394,0.000009610576,0.000001494194,0.000005017555,0.00004616346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9572749,"threshold_uncertainty_score":0.4105071,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01790631183185298,"score_gpt":0.2424243118143725,"score_spread":0.2245179999825195,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}