{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004755777,0.0002739908,0.0005454478,0.0001108557,0.00008823594,0.0002734122,0.0007340563,0.0001400164,0.000001209791],"category_scores_gemma":[0.00004754184,0.0002338081,0.0002927725,0.0001067006,0.00003446804,0.0001337948,0.000484673,0.0006237077,5.056592e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006887661,"about_ca_system_score_gemma":0.0007161591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000234194,"about_ca_topic_score_gemma":5.535531e-7,"domain_scores_codex":[0.9984483,0.0001041928,0.0005163773,0.0003581775,0.0003065005,0.0002664871],"domain_scores_gemma":[0.9980131,0.0002418944,0.0009414142,0.0003445016,0.0002578177,0.0002012278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002712606,0.00005070711,0.00001042628,0.00007808574,0.00008518369,0.000004988613,0.0006636969,0.8240719,0.0001544415,0.005412374,0.002137478,0.1673036],"study_design_scores_gemma":[0.001000198,0.0003210714,0.00004545658,0.0002487496,0.00005779927,0.0001004294,0.00001176554,0.9738041,0.0004756321,0.02282462,0.000874182,0.0002359836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003336294,0.0003229655,0.991331,0.002044827,0.002616855,0.0002970738,0.00001173341,0.00002725289,0.00001203253],"genre_scores_gemma":[0.03373414,0.00006638349,0.9640023,0.0001951313,0.001937913,0.00000155255,0.000005585797,0.00002507241,0.00003199239],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1670676,"threshold_uncertainty_score":0.9534419,"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."}}