{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002938564,0.0001282066,0.0001460067,0.0001557994,0.0003947279,0.0001125963,0.0002391959,0.00003875963,0.000003573095],"category_scores_gemma":[0.00007721315,0.00008772572,0.00004577259,0.0003102569,0.00008902773,0.0006209605,0.00008084653,0.0001394736,0.00002246807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001347776,"about_ca_system_score_gemma":0.0000422193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000186087,"about_ca_topic_score_gemma":6.007098e-7,"domain_scores_codex":[0.9989874,0.00008846109,0.0003739895,0.0001252314,0.0002775626,0.0001473635],"domain_scores_gemma":[0.9989748,0.000406662,0.0002639436,0.0001681239,0.0001395798,0.00004691843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001970098,0.00004121869,0.0001086382,0.00003015583,0.00001892236,0.000002663511,0.01448653,0.06417765,0.00004210931,0.8679141,0.001269834,0.05188842],"study_design_scores_gemma":[0.0002339275,0.0001679804,0.00235736,0.0000403687,0.000002037114,0.00004543428,0.000175038,0.975225,0.0002733892,0.02102686,0.0003439877,0.0001086131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4834276,0.00002072923,0.5152891,0.000700238,0.00012733,0.0001001786,0.000002591529,0.00006067935,0.000271492],"genre_scores_gemma":[0.9928283,0.00002782682,0.006292456,0.0008048524,0.0000202641,0.00000531165,0.00001332813,0.000003289076,0.000004377067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9110473,"threshold_uncertainty_score":0.3577351,"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."}}