{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290995,0.000460865,0.0009332662,0.0006063811,0.0007754439,0.001628554,0.001520697,0.001181854,0.002779216],"category_scores_gemma":[0.01535884,0.0002969381,0.0004538599,0.0007419505,0.001852905,0.004600034,0.001973587,0.00230563,0.0004943011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001449064,"about_ca_system_score_gemma":0.0007995695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002432489,"about_ca_topic_score_gemma":0.0001940031,"domain_scores_codex":[0.9983742,0.0003703176,0.00006544781,0.0002461807,0.0007079231,0.0002358382],"domain_scores_gemma":[0.9918105,0.004805728,0.0004436923,0.002101324,0.0005326863,0.0003060631],"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.0005136143,0.0001216807,0.0005915494,0.0002349962,0.00003962302,0.0001729305,0.0001725152,0.1031154,0.02162958,0.835441,0.003217065,0.0347501],"study_design_scores_gemma":[0.00005129955,0.00007834103,0.0002242541,0.00002665567,0.00001984118,0.0001553884,0.00003245206,0.4373819,0.009785105,0.5494096,0.002815053,0.00002005753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3238091,0.001263049,0.6389444,0.004671639,0.0004629137,0.00009931029,0.0001414393,0.001871283,0.02873693],"genre_scores_gemma":[0.9386524,0.000366369,0.05747418,0.0002538425,0.0001647197,0.00008936495,0.00005943743,0.0001391052,0.002800575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002779216,"threshold_uncertainty_score":0.01051372,"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."}}