{"id":"W3100566623","doi":"","title":"Quantum gradient descent and Newton’s method for constrained polynomial optimization","year":2019,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Army Research Office; Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Gradient descent; Maxima and minima; Quantum phase estimation algorithm; Quantum; Quantum algorithm; Mathematical optimization; Descent direction; Convergence (economics); Dimension (graph theory); Newton's method in optimization; Polynomial; Applied mathematics; Algorithm; Iterative method; Physics; Local convergence; Quantum error correction; Mathematics; Computer science; Mathematical analysis; Quantum mechanics","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.0010687,0.0008135274,0.0008873816,0.0007377649,0.0005718468,0.0009077577,0.0009782601,0.001316139,0.004939787],"category_scores_gemma":[0.003793446,0.0004399937,0.0007528914,0.001226489,0.001716543,0.001288085,0.001313072,0.002127748,0.001997337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001111081,"about_ca_system_score_gemma":0.001602237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003626817,"about_ca_topic_score_gemma":0.004063174,"domain_scores_codex":[0.9993235,0.0002535052,0.00002239093,0.00008016582,0.0002743827,0.00004611818],"domain_scores_gemma":[0.9993507,0.0002956319,0.0000498827,0.00009782117,0.0001702969,0.00003564749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006769852,0.00003908916,0.0002029911,0.0001916341,0.00004998726,0.00007864588,0.0000904506,0.1999729,0.00344306,0.7016692,0.008527715,0.08566675],"study_design_scores_gemma":[0.00002270132,0.00002191237,0.0001460403,0.00002527085,0.000006767806,0.00004709173,0.0000103965,0.8327011,0.00122717,0.1471289,0.01863777,0.00002477157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001681045,0.00100389,0.9890019,0.0004032586,0.0001399054,0.00003922592,0.0000551841,0.0001872817,0.007488394],"genre_scores_gemma":[0.1034816,0.002191945,0.8757862,0.0003899232,0.0002776265,0.0002933456,0.0001863068,0.0004926734,0.01690035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004939787,"threshold_uncertainty_score":0.01652527,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008808084638841113,"score_gpt":0.2438243361600957,"score_spread":0.2350162515212546,"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."}}