{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002729428,0.001022193,0.001288348,0.0005743584,0.0004946605,0.001453212,0.001307804,0.001609751,0.003084243],"category_scores_gemma":[0.007738866,0.0005642333,0.0006642523,0.000670156,0.001752435,0.001347981,0.001764022,0.002109986,0.0008522357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001758883,"about_ca_system_score_gemma":0.001724691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003263119,"about_ca_topic_score_gemma":0.003513555,"domain_scores_codex":[0.9987082,0.0006163254,0.00004984973,0.0001772711,0.0003448832,0.0001033935],"domain_scores_gemma":[0.9975491,0.001736706,0.0001319276,0.0001988242,0.0002952648,0.00008823679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006447973,0.00004336199,0.0003340011,0.0001334237,0.00006124809,0.00004730011,0.00004250533,0.8520731,0.001014201,0.1203553,0.002065351,0.02376576],"study_design_scores_gemma":[0.000004767945,0.000009629575,0.00003737037,0.000005919927,0.000002138122,0.000004571329,0.000002335501,0.9749469,0.0001686192,0.02442741,0.0003867983,0.000003472944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005469902,0.0003519987,0.9904275,0.0004247514,0.00003791917,0.00003333614,0.00005314496,0.0003346434,0.002866845],"genre_scores_gemma":[0.515827,0.0006368206,0.4728056,0.0006822484,0.0001546645,0.0004353998,0.0003941425,0.0005193807,0.008544832],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003263119,"threshold_uncertainty_score":0.01443475,"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."}}