{"id":"W1850344377","doi":"10.26421/qic8.10-8","title":"On the iterative decoding of sparse quantum codes","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Belief propagation; Decoding methods; Algorithm; List decoding; Theoretical computer science; Sequential decoding; Quantum computer; Quantum error correction; Quantum; Concatenated error correction code; Block code; Quantum mechanics; Physics","routes":{"ca_aff":true,"ca_fund":false,"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.001348111,0.0007787087,0.0008186842,0.0007709184,0.0005206264,0.0009943018,0.001043162,0.001331938,0.001865471],"category_scores_gemma":[0.01185957,0.0003245299,0.0005153592,0.00148385,0.00215186,0.001704936,0.001812071,0.001482826,0.0007845691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006762629,"about_ca_system_score_gemma":0.00116597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001789292,"about_ca_topic_score_gemma":0.001481225,"domain_scores_codex":[0.9987469,0.0004885526,0.00004692393,0.0001291784,0.0004502535,0.0001382214],"domain_scores_gemma":[0.9956635,0.00302529,0.0002516306,0.000413183,0.0005647227,0.0000817487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001243209,0.00004336654,0.0005013109,0.0001311478,0.0000385156,0.0001397279,0.0002641147,0.5621963,0.005210654,0.3635873,0.002091216,0.06567203],"study_design_scores_gemma":[0.00001229863,0.0000269252,0.00005968053,0.0000165111,0.000006147035,0.00004305705,0.00001440349,0.8293958,0.002584076,0.1668595,0.0009683071,0.00001326906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02407892,0.0003858352,0.9666873,0.0004384779,0.00007876263,0.00003417326,0.00004945337,0.0001330721,0.00811411],"genre_scores_gemma":[0.5394453,0.001859088,0.4479568,0.0004336488,0.0003111442,0.0001837726,0.0002578382,0.0001977084,0.009354727],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001865471,"threshold_uncertainty_score":0.00712955,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02085461096442548,"score_gpt":0.2456400102863635,"score_spread":0.224785399321938,"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."}}