{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005933582,0.0001672808,0.0001419256,0.00009870311,0.0005662915,0.0005539245,0.0001863064,0.00006903508,0.000001276005],"category_scores_gemma":[0.00003486203,0.0001202601,0.00004755879,0.0001936572,0.00005873707,0.001756815,0.0001017658,0.0001185642,0.00001367543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002337566,"about_ca_system_score_gemma":0.00003927585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009521966,"about_ca_topic_score_gemma":0.000003082424,"domain_scores_codex":[0.9988973,0.0000343471,0.0003739298,0.0001601569,0.0002498184,0.0002845177],"domain_scores_gemma":[0.9991257,0.0002191521,0.0002102831,0.0001939692,0.0001456512,0.0001052678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002090379,0.0001580897,0.001120049,0.0002636049,0.000086911,7.581946e-7,0.03534445,0.1559484,0.0001910781,0.2384821,0.006388433,0.5618072],"study_design_scores_gemma":[0.0005209384,0.0001479156,0.005426626,0.00002005636,0.00001130488,0.00003516417,0.0001215143,0.9722487,0.00005085275,0.002546072,0.01869671,0.0001741979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2516005,0.0004178774,0.7457018,0.0009992154,0.00059497,0.000422238,0.000008542662,0.0001226829,0.000132141],"genre_scores_gemma":[0.9893727,0.00003766554,0.009463848,0.0008762706,0.0001464501,0.00003923152,0.00003812445,0.00000660145,0.00001914185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8163003,"threshold_uncertainty_score":0.5341507,"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."}}