{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003560011,0.0003134985,0.0004968442,0.000615742,0.0001871446,0.00007922643,0.0008922946,0.0003155371,0.000004341473],"category_scores_gemma":[0.0001416778,0.0002881693,0.0001299414,0.0006636187,0.0002897653,0.0002753539,0.0004308364,0.0003069946,0.000003742444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006424927,"about_ca_system_score_gemma":0.0001527817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002733347,"about_ca_topic_score_gemma":0.000008447039,"domain_scores_codex":[0.9980655,0.00003724197,0.0004229556,0.0007412078,0.0002292703,0.0005038223],"domain_scores_gemma":[0.9985752,0.0000831196,0.0003115633,0.000774581,0.0001448783,0.0001106988],"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.0001384041,0.0005088517,0.004316981,0.0004497909,0.0004777085,0.0000441805,0.001174881,0.1951387,0.0214436,0.4340547,0.002987281,0.3392649],"study_design_scores_gemma":[0.001580398,0.0004636155,0.0002276109,0.0001102358,0.00002980308,0.0000885399,0.00003752691,0.9575862,0.005351092,0.002752831,0.03138837,0.000383745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08484306,0.0002582961,0.8997583,0.01260619,0.001186971,0.0007698167,0.00003175016,0.0004674461,0.00007814269],"genre_scores_gemma":[0.2620614,0.00002467423,0.7376069,0.0001329739,0.00004999531,0.00002636871,0.000008733534,0.00001970587,0.00006917456],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7624475,"threshold_uncertainty_score":0.999957,"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."}}