{"id":"W3119276036","doi":"10.1038/s41534-022-00624-1","title":"A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits","year":2022,"lang":"lv","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Algorithm; 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":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001868681,0.0006278491,0.0006753883,0.0006473626,0.002407364,0.001046755,0.001777899,0.0001942155,0.0001411044],"category_scores_gemma":[0.0002615594,0.000695743,0.0004365203,0.0009580463,0.0001144379,0.001831672,0.00110071,0.0009226206,0.0004797476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004285057,"about_ca_system_score_gemma":0.0006643399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006403288,"about_ca_topic_score_gemma":9.711091e-7,"domain_scores_codex":[0.9951141,0.00033958,0.001391524,0.0006870287,0.001209832,0.001257941],"domain_scores_gemma":[0.9968356,0.0007209958,0.0009871051,0.0008765619,0.000275616,0.0003040672],"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.00006313607,0.0003108649,0.000006436617,0.0001563915,0.00009666922,0.00002391129,0.007450502,0.05062453,0.00007615035,0.001860323,0.01069865,0.9286324],"study_design_scores_gemma":[0.001210129,0.001689378,0.0001116052,0.00008610621,0.00006276781,0.0004833399,0.0003198673,0.9146518,0.00008704193,0.0003675569,0.08014403,0.0007864356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02869955,0.0003058646,0.962526,0.001408578,0.003921236,0.001425434,0.0005176109,0.0005663918,0.0006293351],"genre_scores_gemma":[0.9001145,0.0000425572,0.0929652,0.002724278,0.002111245,0.0005674041,0.0007044779,0.0001421904,0.000628087],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.927846,"threshold_uncertainty_score":0.9999902,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01184136367561551,"score_gpt":0.2274512841865178,"score_spread":0.2156099205109023,"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."}}