{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009497199,0.0003783326,0.0005477313,0.0008321215,0.0006365136,0.0008411365,0.001754375,0.0004107424,0.000001812244],"category_scores_gemma":[0.0003430686,0.0003460799,0.00006251402,0.001236128,0.001524762,0.0001963818,0.004429671,0.0007153026,0.000004188359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006816303,"about_ca_system_score_gemma":0.0009597449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005644837,"about_ca_topic_score_gemma":0.000004418142,"domain_scores_codex":[0.9967371,0.00003100434,0.0003193265,0.001706284,0.0004435086,0.0007627365],"domain_scores_gemma":[0.9980139,0.0001613743,0.0002125332,0.0009870044,0.0004455031,0.0001796551],"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.000004979327,0.0001171424,0.0000637248,0.0001445428,0.00004800484,0.0001354664,0.0007219275,0.0001025475,0.01030012,0.01586369,0.001176767,0.9713211],"study_design_scores_gemma":[0.0002796897,0.000245105,0.0001250355,0.0001242598,0.00001695472,0.0003319518,0.000050302,0.9809942,0.002204569,0.01307359,0.002106,0.0004483108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4586325,0.003682725,0.5214401,0.01275316,0.001743355,0.0007960426,0.00004914082,0.0008351109,0.00006781297],"genre_scores_gemma":[0.4172494,0.000278754,0.5814634,0.0003948768,0.0003153445,0.0001065853,0.00001192342,0.00004036854,0.0001393558],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9808917,"threshold_uncertainty_score":0.9998991,"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."}}