{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007042381,0.0001178408,0.0002687002,0.00001685687,0.00003780353,0.00001991029,0.0005996859,0.000004667022,0.000002245072],"category_scores_gemma":[0.00003185662,0.00009496242,0.0001416134,0.000431076,0.00005803792,0.0001115324,0.0002238423,0.0001638031,0.00001641387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006754838,"about_ca_system_score_gemma":0.00001609295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005320982,"about_ca_topic_score_gemma":3.218346e-8,"domain_scores_codex":[0.9991443,0.00006667568,0.0001484322,0.0002520425,0.0001981446,0.0001904293],"domain_scores_gemma":[0.9994883,0.00008679493,0.00008165115,0.0002091597,0.00002556089,0.0001085548],"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.00001921903,0.00045169,0.0002567997,0.006294911,0.0002201423,0.0002649165,0.007017161,0.06610547,0.03283526,0.02036172,0.009334424,0.8568383],"study_design_scores_gemma":[0.0001976707,0.0002197552,0.0001723123,0.0009555747,0.00003577311,0.000007570187,0.00001043259,0.970906,0.0009767166,0.00009058412,0.02614208,0.0002855241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.604223,0.004774028,0.2808682,0.1092179,0.00011176,0.0004178295,0.000003083559,0.0003087479,0.0000753986],"genre_scores_gemma":[0.8760326,0.000297213,0.09666531,0.02670339,0.0002774383,0.000005015182,0.000003851862,0.00001408761,0.00000108733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9048005,"threshold_uncertainty_score":0.3872455,"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."}}