{"id":"W1540106918","doi":"10.26421/qic12.11-12-10","title":"Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Binary Golay code; Qubit; Fault tolerance; Computer science; Quantum computer; Algorithm; Overhead (engineering); Noise (video); Error detection and correction; Hamming bound; Code (set theory); Mathematics; Quantum; Set (abstract data type); Block code; Hamming code; Decoding methods; Physics; Quantum mechanics","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.001714025,0.001218485,0.001259818,0.001344832,0.001414771,0.002646845,0.001864276,0.001636454,0.005785667],"category_scores_gemma":[0.01388473,0.0004957856,0.000838108,0.001047838,0.00356881,0.00356784,0.002540547,0.00349383,0.001008489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003501871,"about_ca_system_score_gemma":0.002170869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001437055,"about_ca_topic_score_gemma":0.001305725,"domain_scores_codex":[0.9978751,0.0003241991,0.00008851531,0.0003047109,0.0008557825,0.0005517707],"domain_scores_gemma":[0.9870234,0.00966842,0.0007670596,0.001196683,0.0008752062,0.000469258],"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.0006816462,0.0002201778,0.001461181,0.0003974339,0.00006923788,0.0002878038,0.0003390373,0.2683681,0.03039703,0.6624506,0.00479019,0.0305377],"study_design_scores_gemma":[0.00005787721,0.0001464817,0.0003888156,0.0001095876,0.00004761372,0.0002103071,0.00005529855,0.6664684,0.02499558,0.3049166,0.002521509,0.00008181782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2820032,0.004297695,0.6255317,0.00418569,0.0003351298,0.0002026925,0.0007060813,0.002470857,0.08026685],"genre_scores_gemma":[0.9418336,0.0009963888,0.05078013,0.0004723407,0.0001431994,0.0002145688,0.000297984,0.0003029058,0.004959073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005785667,"threshold_uncertainty_score":0.02540803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01386412253971376,"score_gpt":0.2658587244044163,"score_spread":0.2519946018647025,"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."}}