{"id":"W2952110573","doi":"10.48550/arxiv.1310.2984","title":"Fault-Tolerant Quantum Computation with Constant Overhead","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"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; Overhead (engineering); Quantum error correction; Constant (computer programming); Quantum; Topology (electrical circuits); Mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001990308,0.0005173606,0.0005199774,0.0002895794,0.0002891385,0.0003502915,0.001585329,0.0002699528,0.00001600316],"category_scores_gemma":[0.00001198318,0.0004716573,0.0001897245,0.0006019825,0.0002130044,0.0002947755,0.001507117,0.0009434361,0.0001107437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001474705,"about_ca_system_score_gemma":0.0003338697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003629263,"about_ca_topic_score_gemma":0.00002333969,"domain_scores_codex":[0.9973025,0.0001873048,0.000288027,0.001459211,0.000206612,0.0005563286],"domain_scores_gemma":[0.9978194,0.0001714129,0.0004019796,0.001077213,0.0002753539,0.0002546452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002093736,0.00008964909,0.0002754788,0.00007551776,0.00009079272,0.000407181,0.0003651203,0.8872435,0.00001476798,0.1083306,0.000327416,0.002759027],"study_design_scores_gemma":[0.000639963,0.0001574953,0.0006794683,0.0002873094,0.00003838533,0.00004238203,0.00005368061,0.9557093,0.00002589116,0.04144222,0.0002666517,0.0006572758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4171734,0.00005587047,0.5808157,0.0001759339,0.0004491143,0.0002947519,0.00001143347,0.0003668887,0.00065684],"genre_scores_gemma":[0.9865418,0.00003322583,0.01285689,0.0001607941,0.00009702968,0.000001348451,0.00002295259,0.00003002439,0.0002559061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5693684,"threshold_uncertainty_score":0.9997735,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03554215293170759,"score_gpt":0.1837530444283393,"score_spread":0.1482108914966317,"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."}}