{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001187556,0.0004123844,0.0008706229,0.0005464241,0.0007172932,0.001362234,0.001363097,0.001110908,0.002421036],"category_scores_gemma":[0.01383354,0.000264724,0.0004052511,0.0006715402,0.001822812,0.004256603,0.001637714,0.001933282,0.0004370344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001283209,"about_ca_system_score_gemma":0.0007472193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002346405,"about_ca_topic_score_gemma":0.0001836712,"domain_scores_codex":[0.9986369,0.0003056017,0.00005344267,0.0001933209,0.0006141158,0.0001965443],"domain_scores_gemma":[0.9933736,0.003940642,0.0003498996,0.001620393,0.0004547728,0.000260652],"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.0004275928,0.0001048837,0.0004645062,0.0002142907,0.00003306401,0.0001746148,0.000150193,0.09670055,0.02416546,0.8439297,0.002606112,0.03102889],"study_design_scores_gemma":[0.00005345724,0.0000889842,0.0002275073,0.00002811266,0.00002001657,0.0001712958,0.00003360505,0.4411149,0.0114608,0.5438573,0.002922243,0.00002176912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2959841,0.001351016,0.6678208,0.004220618,0.0004727627,0.00008571953,0.0001074433,0.001720518,0.02823694],"genre_scores_gemma":[0.9344568,0.0003986739,0.06209528,0.0002626428,0.0001545323,0.00007953351,0.00004603732,0.0001259309,0.002380671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002421036,"threshold_uncertainty_score":0.009310424,"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."}}