{"id":"W1959392488","doi":"10.26421/qic14.15-16-5","title":"Fault-Tolerant quantum computation with constant overhead","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; Canadian Institute for Advanced Research","funders":"Division of Mathematical Sciences; Institut Périmètre de physique théorique; Industry Canada; Government of Canada","keywords":"Qubit; Quantum computer; Fault tolerance; Computer science; Quantum error correction; Overhead (engineering); Constant (computer programming); Quantum; Quantum convolutional code; Mathematics; Topology (electrical circuits); Discrete mathematics; Quantum mechanics; Physics; Distributed computing; 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":[],"consensus_categories":[],"category_scores_codex":[0.0004832224,0.0002762535,0.0002806534,0.0002900725,0.000421424,0.0006217837,0.0002670421,0.00008712028,0.000002681766],"category_scores_gemma":[0.00003695213,0.0002248359,0.00005082754,0.0004813231,0.00009983977,0.001551086,0.0001086914,0.0002269225,0.00005579958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003620113,"about_ca_system_score_gemma":0.00008442064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004478499,"about_ca_topic_score_gemma":0.000003959403,"domain_scores_codex":[0.9981273,0.0001353955,0.0005773442,0.0003136803,0.0005053341,0.0003408948],"domain_scores_gemma":[0.9987474,0.0002163497,0.0003816136,0.0002278379,0.0002652189,0.0001615966],"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.00004671067,0.00005648967,0.0001865223,0.0001098276,0.00002811035,0.000003285588,0.003293371,0.2119987,0.00003653461,0.3354309,0.0004785151,0.4483311],"study_design_scores_gemma":[0.001133715,0.0004392556,0.003056978,0.00008840927,0.000008647642,0.0001215923,0.0001670566,0.9765347,0.0000375109,0.01538119,0.002689659,0.0003413464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1838017,0.00003608651,0.8134151,0.0009453865,0.0002937567,0.0002344763,0.00000396701,0.0003863812,0.0008831384],"genre_scores_gemma":[0.961852,0.000009371479,0.03700885,0.0009796746,0.00005668288,0.00001026943,0.00006685994,0.00001075663,0.000005515944],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7780503,"threshold_uncertainty_score":0.916854,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007549946387218678,"score_gpt":0.22724153338666,"score_spread":0.2196915869994414,"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."}}