{"id":"W2952736688","doi":"10.48550/arxiv.1006.1362","title":"A renormalization group decoding algorithm for topological quantum codes","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds Québécois de la Recherche sur la Nature et les Technologies; Compute Canada","keywords":"Toric code; Block code; Algorithm; Quantum algorithm; Quantum computer; Qubit; Mathematics; Quantum error correction; Topology (electrical circuits); Discrete mathematics; Computer science; Decoding methods; Quantum; Physics; Quantum mechanics; Combinatorics","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.000888289,0.0005277693,0.0006248034,0.0009379587,0.0006853095,0.0009364041,0.001214026,0.001424472,0.002315053],"category_scores_gemma":[0.007974754,0.0002792551,0.0004666743,0.0008296485,0.001060302,0.001665212,0.001512822,0.001436203,0.0010226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009179552,"about_ca_system_score_gemma":0.001340569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001823209,"about_ca_topic_score_gemma":0.001883255,"domain_scores_codex":[0.9994076,0.0001667417,0.00003455085,0.0000997233,0.0002370827,0.00005429509],"domain_scores_gemma":[0.9981328,0.0009992149,0.0001059057,0.00029912,0.0003998345,0.00006325172],"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.0002246439,0.00008186683,0.001035358,0.0001010379,0.00005855414,0.0001755538,0.0002985858,0.4517367,0.01526827,0.2586606,0.004900428,0.2674584],"study_design_scores_gemma":[0.00002480768,0.00002256825,0.00006884513,0.000006890737,0.000005864736,0.00003066471,0.00001122178,0.9304787,0.002691981,0.06530786,0.001338272,0.00001228564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01616833,0.0000720232,0.9814035,0.0002515982,0.00004981199,0.00003876078,0.00005500849,0.0004420813,0.001519011],"genre_scores_gemma":[0.2287757,0.0001485727,0.7660469,0.0001639586,0.00008571661,0.0001817985,0.0002649088,0.0002837144,0.004048756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002315053,"threshold_uncertainty_score":0.00774461,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0474779430395763,"score_gpt":0.2074368806001136,"score_spread":0.1599589375605373,"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."}}