{"id":"W3104428150","doi":"10.17169/refubium-28427","title":"Stochastic gradient descent for hybrid quantum-classical optimization","year":2020,"lang":"en","type":"article","venue":"Refubium (Universitätsbibliothek der Freien Universität Berlin)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":204,"is_retracted":false,"has_abstract":true,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Freie Universität Berlin; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung; John Templeton Foundation","keywords":"Stochastic gradient descent; Gradient descent; Stochastic optimization; Quantum circuit; Parameterized complexity; Quantum; Computer science; Mathematical optimization; Convergence (economics); Context (archaeology); Quantum machine learning; Hamiltonian (control theory); Mathematics; Quantum algorithm; Applied mathematics; Algorithm; Artificial intelligence; Quantum error correction; Artificial neural network; Quantum mechanics; Physics","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.0001946041,0.0004541053,0.0004772968,0.001321332,0.0007529898,0.0003146285,0.001999802,0.0001429164,0.00006212467],"category_scores_gemma":[0.00006076799,0.0004885966,0.0003409288,0.00329733,0.0001635744,0.002611409,0.0007512303,0.000404535,0.00005670322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002387112,"about_ca_system_score_gemma":0.0002468714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001851803,"about_ca_topic_score_gemma":0.000003230355,"domain_scores_codex":[0.9970073,0.0001277619,0.0003022184,0.001181568,0.000549452,0.0008317288],"domain_scores_gemma":[0.9978349,0.0002523235,0.0002571988,0.0006691061,0.0002939721,0.0006924764],"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.0002231789,0.0002655207,0.00002043888,0.0001011078,0.0003074067,0.000282782,0.0029195,0.8352098,0.0004543467,0.1417789,0.007544767,0.01089227],"study_design_scores_gemma":[0.00186628,0.0005178223,0.00003163918,0.00004795203,0.000114909,0.00005510892,0.0003114493,0.9814355,0.00014868,0.001110131,0.01375708,0.0006034481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01084669,0.0001625876,0.9764048,0.01042356,0.000497452,0.0005983528,0.00005681115,0.0006124118,0.0003972685],"genre_scores_gemma":[0.791928,0.00004858351,0.2054141,0.001600057,0.0004151682,0.000004412284,0.00009342527,0.00007669774,0.000419576],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7810813,"threshold_uncertainty_score":0.9997566,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01765926947071176,"score_gpt":0.2123784191780906,"score_spread":0.1947191497073788,"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."}}