{"id":"W2308615846","doi":"10.1109/tit.2019.2906374","title":"T-Count Optimization and Reed–Muller Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Upper and lower bounds; Controlled NOT gate; Quantum gate; Power of two; Sequential decoding; Integer (computer science)","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.001146097,0.001039902,0.0007839937,0.0007108136,0.0005729931,0.001401043,0.00109308,0.001126044,0.003082915],"category_scores_gemma":[0.007013529,0.0003945305,0.0006773598,0.0009466796,0.001845573,0.002690598,0.001336394,0.00189736,0.0004959201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001918985,"about_ca_system_score_gemma":0.001446866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001140801,"about_ca_topic_score_gemma":0.001112095,"domain_scores_codex":[0.9985036,0.0005222885,0.00005331439,0.0003022123,0.0003694038,0.0002492349],"domain_scores_gemma":[0.9961958,0.002769466,0.0004655869,0.0002560918,0.0002046397,0.000108349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003481755,0.0001284813,0.0007786854,0.0003107891,0.00005351615,0.000146167,0.0001645407,0.5490425,0.01006956,0.3810874,0.001942274,0.05592787],"study_design_scores_gemma":[0.00003879308,0.0001350002,0.0001656908,0.0000260256,0.00001265503,0.00006176362,0.0000333731,0.794012,0.006371376,0.1978144,0.001311231,0.00001772275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1114766,0.001126633,0.8710672,0.001125597,0.00007437058,0.0001151223,0.0001327074,0.0004049851,0.0144769],"genre_scores_gemma":[0.7483459,0.0009914897,0.2428995,0.0002855195,0.0001229116,0.0002378524,0.0001830623,0.0002487829,0.006684898],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003082915,"threshold_uncertainty_score":0.01392329,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004116110082280556,"score_gpt":0.1944803577710045,"score_spread":0.190364247688724,"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."}}