{"id":"W1479892629","doi":"10.26421/qic14.9-10-1","title":"Fault-tolerant renormalization group decoder for abelian topological codes","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Abelian group; Generalization; Decoding methods; Logarithm; Mathematics; Code (set theory); Discrete mathematics; Fault tolerance; Computer science; Matching (statistics); Algorithm; Combinatorics; Topology (electrical circuits); Set (abstract data type)","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.0004764971,0.0002657631,0.0004064774,0.0004636445,0.0005029138,0.0007000957,0.0008538333,0.0009943988,0.001524338],"category_scores_gemma":[0.002703267,0.0001333723,0.0003636852,0.000368703,0.0009615375,0.0009594452,0.001093208,0.0007916341,0.0005064474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008823873,"about_ca_system_score_gemma":0.0008820993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007017874,"about_ca_topic_score_gemma":0.0008165167,"domain_scores_codex":[0.9995145,0.0001203516,0.00003243506,0.00006022783,0.0002039182,0.0000686696],"domain_scores_gemma":[0.99902,0.0003436757,0.00009284772,0.0003425889,0.0001537636,0.00004713413],"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.0003691164,0.0001025295,0.001265724,0.0001173772,0.00004494674,0.000334121,0.000315307,0.1514846,0.06956019,0.6958376,0.002926012,0.07764243],"study_design_scores_gemma":[0.00004783594,0.00007756813,0.0002596145,0.00001187673,0.000007478798,0.0001489182,0.00002214992,0.8175596,0.04012224,0.1388169,0.00288501,0.00004073482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.272926,0.0001904337,0.7107247,0.0008171801,0.0001682918,0.0001028378,0.00016159,0.001465507,0.0134434],"genre_scores_gemma":[0.7645842,0.00007690302,0.2313363,0.0002200538,0.00003386311,0.00009160582,0.000117392,0.000128634,0.003411029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001524338,"threshold_uncertainty_score":0.006402194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01007864777184532,"score_gpt":0.2487124666169714,"score_spread":0.238633818845126,"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."}}