{"id":"W3106467701","doi":"10.1103/physrevlett.125.210501","title":"Optimal Universal Programming of Unitary Gates","year":2020,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute","funders":"Air Force Office of Scientific Research; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Croucher Foundation; National Natural Science Foundation of China; Foundational Questions Institute","keywords":"Unitary state; Quantum circuit; Quantum; Computer science; Quantum information; Quantum gate; Quantum Fourier transform; Quantum computer; Limit (mathematics); Quantum error correction; Discrete mathematics; Quantum mechanics; Physics; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.002538498,0.0007211881,0.001297394,0.0006326884,0.0007881559,0.002311416,0.001712983,0.001472961,0.002826154],"category_scores_gemma":[0.02236594,0.0006277682,0.0007492348,0.0006996415,0.004311037,0.005570921,0.003431366,0.003034335,0.0002832623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002310518,"about_ca_system_score_gemma":0.002282186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001472433,"about_ca_topic_score_gemma":0.001196147,"domain_scores_codex":[0.9974709,0.0009625622,0.0001221327,0.0006272391,0.0004470238,0.0003702792],"domain_scores_gemma":[0.988389,0.009203853,0.0004895141,0.001103895,0.0004960917,0.0003175689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001616965,0.00008034692,0.0004325198,0.0001710575,0.00002782587,0.00004847298,0.0001904593,0.1772862,0.00219838,0.7929599,0.001132249,0.02531089],"study_design_scores_gemma":[0.00002216945,0.00004495516,0.00009825078,0.00002484908,0.000007296961,0.00001445504,0.00003030919,0.4345587,0.001360652,0.5633256,0.0004991916,0.00001351758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1666385,0.0004961606,0.8157298,0.001548896,0.00006218131,0.00009981173,0.000153008,0.0005059663,0.01476569],"genre_scores_gemma":[0.8408115,0.0004876108,0.152188,0.000386712,0.0001042685,0.0003562442,0.0002254172,0.000196714,0.00524357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002826154,"threshold_uncertainty_score":0.01676404,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01418540242628396,"score_gpt":0.2516760210829402,"score_spread":0.2374906186566562,"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."}}