{"id":"W1828782323","doi":"10.1103/physrevlett.112.010505","title":"Using Concatenated Quantum Codes for Universal Fault-Tolerant Quantum Gates","year":2014,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Concatenation (mathematics); Qubit; Quantum computer; Concatenated error correction code; Fault tolerance; Algorithm; Quantum; Theoretical computer science; Block code; Mathematics; Quantum mechanics; Physics; Distributed computing; Arithmetic; Decoding methods","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003817272,0.0002964604,0.0006034416,0.00005827623,0.000230021,0.0001115466,0.0008665779,0.00001822234,0.000001887064],"category_scores_gemma":[0.0001057325,0.0002310845,0.0002977313,0.0003739619,0.0001138519,0.0001860821,0.0001813838,0.0002254998,0.00002456517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004159778,"about_ca_system_score_gemma":0.00003052986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004181202,"about_ca_topic_score_gemma":4.936512e-7,"domain_scores_codex":[0.9980937,0.0002097148,0.0003085855,0.000572857,0.0002900111,0.0005251407],"domain_scores_gemma":[0.9985408,0.0005164149,0.0001955659,0.0005076262,0.00008627099,0.0001533163],"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.00006944408,0.0009154943,0.0001401875,0.006963029,0.0004780823,0.00008896684,0.002565537,0.1686036,0.169878,0.5038977,0.02253674,0.1238632],"study_design_scores_gemma":[0.0003337508,0.00009564668,0.00004744228,0.0009122893,0.00004415057,0.00001236296,0.000003684568,0.979076,0.0004542398,0.00276897,0.01591926,0.0003322545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2497923,0.001225145,0.7339286,0.01397682,0.0003515637,0.000449246,0.000007654036,0.0002521763,0.00001650909],"genre_scores_gemma":[0.9588435,0.0002648931,0.0212222,0.01914781,0.0004441598,0.00001947997,0.00001761828,0.00003673324,0.000003601485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8104724,"threshold_uncertainty_score":0.9423351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02411908913084955,"score_gpt":0.2920399755091644,"score_spread":0.2679208863783148,"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."}}