{"id":"W2894247456","doi":"10.1103/physrevlett.123.020501","title":"Cellular-Automaton Decoders with Provable Thresholds for Topological Codes","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Institute for Quantum Information and Matter, California Institute of Technology; Intelligence Advanced Research Projects Activity; Institut Périmètre de physique théorique; National Science Foundation; Government of Canada; Industry Canada; Simons Foundation; U.S. Department of Energy","keywords":"Toric code; Cellular automaton; Computer science; Euclidean geometry; Lattice (music); Code (set theory); Algorithm; Decoding methods; Topology (electrical circuits); Discrete mathematics; Quantum; Physics; Mathematics; Quantum computer; Combinatorics; Quantum mechanics; Geometry","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.0005659741,0.0003216573,0.0005585177,0.0004263714,0.0005057631,0.001185889,0.0008482049,0.0009420432,0.002336669],"category_scores_gemma":[0.005648199,0.0001832666,0.0003442726,0.0003505427,0.001271781,0.001126544,0.00105191,0.001144542,0.0004624008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009754499,"about_ca_system_score_gemma":0.0008161557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007106813,"about_ca_topic_score_gemma":0.0009122111,"domain_scores_codex":[0.9994189,0.000122244,0.00004577741,0.00008325845,0.0002199985,0.0001098688],"domain_scores_gemma":[0.9973704,0.001448776,0.0001879237,0.0004264341,0.0004167926,0.0001496074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002347576,0.00008279058,0.001435226,0.0001119091,0.00002717724,0.0001727437,0.0001909401,0.2320819,0.03425513,0.7035896,0.001679827,0.02613797],"study_design_scores_gemma":[0.00002932262,0.00005927791,0.0001469158,0.00001519425,0.000008461303,0.00006874266,0.00003283019,0.798097,0.02037013,0.1799628,0.001186301,0.00002303118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3314136,0.0004243718,0.6481605,0.0005709553,0.0001247057,0.00006790304,0.0002299794,0.001292344,0.01771579],"genre_scores_gemma":[0.9597849,0.000104967,0.03813512,0.0000862868,0.0000191784,0.00007425459,0.00009320676,0.00007329409,0.001628791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002336669,"threshold_uncertainty_score":0.00781697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01047981389552739,"score_gpt":0.2595567823039589,"score_spread":0.2490769684084315,"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."}}