{"id":"W4200634639","doi":"10.1103/physreva.105.042418","title":"Topological graph states and quantum error-correction codes","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Alberta","keywords":"Qubit; Toric code; Mathematics; Bipartite graph; Quantum error correction; Discrete mathematics; Topology (electrical circuits); Quantum computer; Quantum; Quantum mechanics; Physics; Graph; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007343001,0.0004797146,0.001287205,0.00006860228,0.0005959143,0.00009498237,0.001120605,0.00002435289,0.00002939999],"category_scores_gemma":[0.0003485786,0.0003573844,0.0005824426,0.001297436,0.0002092023,0.0002269132,0.00124469,0.0009861585,0.00006215063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006109345,"about_ca_system_score_gemma":0.00006516271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004517747,"about_ca_topic_score_gemma":0.000002024283,"domain_scores_codex":[0.9959844,0.0008970006,0.0005405921,0.00108213,0.0008539179,0.0006419914],"domain_scores_gemma":[0.9976726,0.0007564372,0.0003151579,0.0008434163,0.00009864619,0.0003137612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000367674,0.003343692,0.0004522295,0.008430909,0.0002006923,0.0001443451,0.0009544661,0.001451108,0.004572984,0.2258064,0.03683278,0.7177736],"study_design_scores_gemma":[0.0003174264,0.00124533,0.001114192,0.003179522,0.0001967611,0.0001528283,0.00002661793,0.6602519,0.0005484286,0.2622182,0.0697494,0.0009994117],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7288969,0.1911682,0.06006403,0.01528778,0.001296359,0.001957084,0.00004417032,0.0007890858,0.0004963906],"genre_scores_gemma":[0.8837484,0.1050771,0.001422519,0.008705811,0.0005105563,0.0003987624,0.00003614413,0.00004250495,0.00005825162],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7167742,"threshold_uncertainty_score":0.9998878,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01446278982495371,"score_gpt":0.3282931642753013,"score_spread":0.3138303744503476,"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."}}