{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002045723,0.0002109748,0.0004312961,0.00002635382,0.00009104593,0.00008410445,0.0006861686,0.00001348074,0.000007007542],"category_scores_gemma":[0.00001728544,0.000133076,0.0001760014,0.0002467683,0.0000636146,0.0001466856,0.0001365362,0.0001763005,0.00006490979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001991315,"about_ca_system_score_gemma":0.000029656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004108313,"about_ca_topic_score_gemma":4.3528e-7,"domain_scores_codex":[0.9985747,0.00005744871,0.0001772715,0.0005180345,0.0002649601,0.0004076278],"domain_scores_gemma":[0.9990392,0.0002094288,0.00009818001,0.0005249685,0.00003679497,0.00009145243],"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.000170699,0.002298009,0.006008589,0.01926058,0.000687132,0.0002235842,0.00213769,0.0595166,0.12356,0.4191437,0.03925439,0.3277391],"study_design_scores_gemma":[0.0006379826,0.0005741737,0.0002528005,0.001387822,0.00004275524,0.0000323268,0.000004165611,0.9664674,0.002644831,0.003498103,0.02385251,0.000605151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6046286,0.001766871,0.3741314,0.01764885,0.0001767767,0.001147958,0.000002849876,0.0002872122,0.0002095432],"genre_scores_gemma":[0.895593,0.0001401034,0.07807616,0.02580456,0.0002068971,0.0001134407,0.000007764138,0.000026569,0.00003148456],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9069508,"threshold_uncertainty_score":0.5426681,"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."}}