{"id":"W2949835993","doi":"10.48550/arxiv.1310.3235","title":"Hardness of decoding quantum stabilizer codes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Berlekamp–Welch algorithm; Degeneracy (biology); Sequential decoding; Algorithm; Code (set theory); Mathematics; Quantum; Computer science; Concatenated error correction code; Block code; Physics; Quantum mechanics; Set (abstract data type)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001620204,0.0006185669,0.001907512,0.0005741349,0.001312375,0.003876667,0.001548137,0.003081547,0.006444782],"category_scores_gemma":[0.01811246,0.0005150214,0.0009695113,0.0009503691,0.003382524,0.005783758,0.002515471,0.003857018,0.001208155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002294988,"about_ca_system_score_gemma":0.002233903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002355187,"about_ca_topic_score_gemma":0.00128119,"domain_scores_codex":[0.9948264,0.001435095,0.0002539845,0.0009598121,0.00186841,0.0006562279],"domain_scores_gemma":[0.9847038,0.01225003,0.0005298996,0.001518967,0.0007372259,0.0002601054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007780897,0.0002176114,0.002458238,0.0005383654,0.0000885736,0.0003615763,0.0008161978,0.2698063,0.0103349,0.6542798,0.01311228,0.04720811],"study_design_scores_gemma":[0.00008790353,0.00004068894,0.0004567807,0.00003772727,0.00001448928,0.000125736,0.0001424607,0.3114437,0.004835343,0.6802779,0.002505078,0.00003217253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4550817,0.001241765,0.4694211,0.01431153,0.0002585075,0.0002352173,0.00235608,0.001279866,0.05581425],"genre_scores_gemma":[0.9497491,0.0006646951,0.03921444,0.0006660162,0.0002458988,0.0001548418,0.001301595,0.0003331769,0.007670118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006444782,"threshold_uncertainty_score":0.02155995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0541364149125702,"score_gpt":0.192474095429419,"score_spread":0.1383376805168488,"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."}}