{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003170932,0.0001095371,0.00009619038,0.0001935608,0.0001773819,0.0001769743,0.0002071008,0.00005734677,0.00006912903],"category_scores_gemma":[0.000003473201,0.00009514352,0.00003965968,0.0002064975,0.00003017167,0.001062545,0.00000334614,0.0001619131,0.0001749877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002207907,"about_ca_system_score_gemma":0.00002732128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004522134,"about_ca_topic_score_gemma":3.761612e-7,"domain_scores_codex":[0.9992939,0.0000549984,0.0002050223,0.0001276679,0.0001801369,0.00013829],"domain_scores_gemma":[0.9994033,0.0001270457,0.0000775996,0.0002791503,0.00006260469,0.00005027382],"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.0000135159,0.00001571713,0.000002153946,0.00001578982,0.0000112745,1.684587e-7,0.001349787,0.8830786,0.00001907326,0.01453369,0.00003694134,0.1009232],"study_design_scores_gemma":[0.0003328453,0.00008717475,0.00005055742,0.00002664577,0.00000401127,0.00001768593,0.00008654338,0.99505,0.001059325,0.002002822,0.001146711,0.0001356633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01122273,0.00001107094,0.9858317,0.0002357059,0.0006033662,0.0001692274,0.0000067668,0.0001913093,0.001728069],"genre_scores_gemma":[0.956243,0.00002229431,0.04256652,0.0008740393,0.00001850888,0.00001106649,0.000003389084,0.000006281898,0.0002548791],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9450203,"threshold_uncertainty_score":0.387984,"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."}}