{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002946892,0.0003545685,0.0005399442,0.0002829623,0.0001488414,0.0001311943,0.002380631,0.0002518685,0.00003142661],"category_scores_gemma":[0.00004559638,0.0003634968,0.0002818139,0.0005030113,0.0001659176,0.0002259026,0.00289844,0.0006298783,0.00004319994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008181872,"about_ca_system_score_gemma":0.0002006544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003064703,"about_ca_topic_score_gemma":0.00001356304,"domain_scores_codex":[0.9979066,0.0001739947,0.0003016894,0.0010649,0.0001348581,0.000417918],"domain_scores_gemma":[0.9976258,0.0001817895,0.0003951497,0.001383946,0.000245035,0.0001682684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001355394,0.0001554548,0.001960026,0.0002938847,0.0001389262,0.00009321565,0.0007889093,0.7090706,0.0002188253,0.2825834,0.000581721,0.004101475],"study_design_scores_gemma":[0.0002414792,0.00004660701,0.0008974872,0.0001772234,0.0000278312,0.000004972084,0.00004447123,0.9346579,0.0003636277,0.06287672,0.0002726003,0.0003890427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5494222,0.00006633675,0.4488962,0.00005589086,0.0007617661,0.0001630825,0.0000108974,0.000170532,0.0004531168],"genre_scores_gemma":[0.9895056,0.00005979543,0.009952092,0.00003814609,0.00007264423,7.099728e-7,0.000006015627,0.00002015845,0.0003448668],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4400834,"threshold_uncertainty_score":0.9998817,"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."}}