{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003936956,0.0003656892,0.0003256541,0.0001240646,0.0005051828,0.0003012004,0.001564404,0.0002469398,0.000005244563],"category_scores_gemma":[0.00002410788,0.0002990185,0.0002248787,0.0002587564,0.0001781253,0.0002043623,0.001543883,0.0005133846,0.00001338269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000710723,"about_ca_system_score_gemma":0.0001697798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007413988,"about_ca_topic_score_gemma":0.00008222055,"domain_scores_codex":[0.9980203,0.00006821015,0.0002201665,0.001166688,0.0001135079,0.0004111426],"domain_scores_gemma":[0.9979257,0.0002164673,0.0002519318,0.001286499,0.0001756581,0.0001437253],"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.0002208443,0.0001667668,0.000611888,0.0001528731,0.0002254978,0.0001157868,0.002659015,0.8942964,0.00008770592,0.09593339,0.001782648,0.003747172],"study_design_scores_gemma":[0.0004587302,0.0001375745,0.0006422456,0.00007697333,0.00006945583,0.00001204476,0.00002070123,0.9651083,0.00008262732,0.02901079,0.003989829,0.0003907351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3867483,0.0003148479,0.6103246,0.0002075178,0.0009839879,0.0006292698,0.00002982442,0.0001933417,0.0005683302],"genre_scores_gemma":[0.9949876,0.0001287628,0.003383949,0.000189874,0.000194257,0.000004680843,0.00001063605,0.00002238769,0.001077822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6082393,"threshold_uncertainty_score":0.9999462,"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."}}