{"id":"W2951321479","doi":"10.48550/arxiv.1106.2190","title":"Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Binary Golay code; Computer science; Qubit; Overhead (engineering); Algorithm; Fault tolerance; Noise (video); Quantum computer; Error detection and correction; Hamming bound; Code (set theory); Mathematics; Parallel computing; Set (abstract data type); Quantum; Block code; Hamming code; Decoding methods; Physics; Quantum mechanics; Distributed computing","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770185,0.001192643,0.001268216,0.001262074,0.001326488,0.00250024,0.001781329,0.001633451,0.005351534],"category_scores_gemma":[0.01503672,0.0004854192,0.0008474377,0.0009805985,0.003515448,0.0033474,0.002426226,0.003372909,0.0009548977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003339194,"about_ca_system_score_gemma":0.002044278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001224333,"about_ca_topic_score_gemma":0.001194887,"domain_scores_codex":[0.9977872,0.0003634124,0.00009153606,0.0003167165,0.0008972328,0.0005438428],"domain_scores_gemma":[0.9851021,0.01135683,0.0008517069,0.001255074,0.0009389103,0.0004954403],"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.0008570424,0.0002636266,0.002134585,0.0004651359,0.00008722849,0.0003407894,0.0003556054,0.3822989,0.03395269,0.5412806,0.004659748,0.0333041],"study_design_scores_gemma":[0.00005795831,0.0001543951,0.0004619392,0.00009351219,0.00004955688,0.0001895797,0.00004982919,0.7338059,0.0228507,0.2402797,0.00193702,0.00006985316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3314373,0.004093422,0.5870965,0.004030724,0.0002986597,0.0002077708,0.0006910413,0.002593529,0.06955095],"genre_scores_gemma":[0.9479161,0.0008584856,0.04541915,0.0004060811,0.0001249244,0.0002049028,0.0003095601,0.0002809126,0.004479855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005351534,"threshold_uncertainty_score":0.02422774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04908596611915239,"score_gpt":0.2038027092353923,"score_spread":0.1547167431162399,"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."}}