{"id":"W2590232898","doi":"10.1088/1367-2630/ab2a9e","title":"Quantum gradient descent and Newton’s method for constrained polynomial optimization","year":2019,"lang":"en","type":"preprint","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Army Research Office; Ministry of Education - Singapore; National Research Foundation Singapore; National Research Foundation","keywords":"Gradient descent; Mathematical optimization; Maxima and minima; Quantum phase estimation algorithm; Quantum; Mathematics; Dimension (graph theory); Quantum algorithm; Convergence (economics); Descent direction; Computer science; Newton's method in optimization; Optimization problem; Quantum computer; Algorithm; Iterative method; Applied mathematics; Local convergence; Quantum error correction; Artificial neural network; Artificial intelligence","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.001079219,0.0005119013,0.0007077047,0.0005893152,0.00052865,0.0007747765,0.0009450418,0.001056839,0.003789088],"category_scores_gemma":[0.004017675,0.0003458305,0.0005150563,0.0008295884,0.001712501,0.001114752,0.001083691,0.001208905,0.0008419881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001096865,"about_ca_system_score_gemma":0.001392347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003455048,"about_ca_topic_score_gemma":0.003663223,"domain_scores_codex":[0.9994335,0.0002378924,0.00001626723,0.00005339305,0.0002157926,0.00004320389],"domain_scores_gemma":[0.9990284,0.0005147756,0.00006325398,0.0001147625,0.0002290826,0.00004969073],"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.00006918681,0.00003333769,0.0002013617,0.0000899934,0.00002985711,0.00005689231,0.00006401102,0.4252898,0.002467766,0.5283331,0.002847459,0.04051726],"study_design_scores_gemma":[0.000008585638,0.000007641513,0.00004728789,0.000005121094,0.00000159305,0.000008805046,0.000003430682,0.9489422,0.000374752,0.04910696,0.001487923,0.000005684304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008250697,0.0003508243,0.9842168,0.000400111,0.00007473685,0.00003307366,0.00003944602,0.0001279145,0.006506426],"genre_scores_gemma":[0.2772198,0.0006666522,0.7089486,0.0002247694,0.0001379342,0.0001955033,0.000107778,0.000337249,0.01216184],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003789088,"threshold_uncertainty_score":0.01267582,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02034239458671864,"score_gpt":0.277050652985788,"score_spread":0.2567082583990694,"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."}}