{"id":"W3035968252","doi":"10.1088/2058-9565/ac2d3a","title":"A polynomial time and space heuristic algorithm for T-count","year":2021,"lang":"en","type":"preprint","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Government of Canada","keywords":"Dimension (graph theory); Gate count; Mathematics; Heuristic; Quantum computer; Discrete mathematics; Polynomial; Integer (computer science); Combinatorics; Time complexity; Algorithm; Computer science; Quantum; Physics; Mathematical optimization; Quantum mechanics","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.0009035806,0.001165656,0.001425324,0.001343153,0.001286383,0.00230966,0.002537148,0.001825534,0.01519822],"category_scores_gemma":[0.004515163,0.000478935,0.001674709,0.001497196,0.001397979,0.002813983,0.00222925,0.00221957,0.002251772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002581034,"about_ca_system_score_gemma":0.003467339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004733266,"about_ca_topic_score_gemma":0.006551863,"domain_scores_codex":[0.998512,0.0002814146,0.00008741435,0.0003829969,0.0003480797,0.0003882039],"domain_scores_gemma":[0.9973664,0.001587214,0.0002046088,0.0004457744,0.0002306966,0.0001653854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002897122,0.001479856,0.002940599,0.001183086,0.0001989215,0.0005811442,0.0005739153,0.2700231,0.01871982,0.1679101,0.05154184,0.4819505],"study_design_scores_gemma":[0.0005201737,0.000280459,0.0004328529,0.00006627279,0.00004919733,0.0002527981,0.0001952072,0.8251097,0.005454895,0.1619314,0.005669367,0.00003767635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1503541,0.000825029,0.7965756,0.003970732,0.0002780634,0.001303687,0.001523529,0.008655379,0.03651385],"genre_scores_gemma":[0.4608218,0.0001371248,0.5277273,0.0005400695,0.0001122283,0.0005231749,0.0019506,0.000571374,0.007616326],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01519822,"threshold_uncertainty_score":0.05084306,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007198735408062885,"score_gpt":0.2370207292869873,"score_spread":0.2298219938789244,"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."}}