{"id":"W2890327304","doi":"10.22331/q-2020-01-13-221","title":"Quantum algorithms and lower bounds for convex optimization","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Army Research Office; Advanced Scientific Computing Research; Multidisciplinary University Research Initiative; Canadian Institute for Advanced Research; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Omega; Quantum; Convex optimization; Regular polygon; Function (biology); Convex body; Quadratic equation; Mathematics; Quantum algorithm; Convex function; Algorithm; Combinatorics; Quantum computer; Quantum mechanics; Physics; Geometry","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002128073,0.000223941,0.0002751315,0.000064471,0.0002755722,0.0003119212,0.0005397879,0.00009080832,0.00001059491],"category_scores_gemma":[0.0001024208,0.0002019918,0.00009165287,0.0003304404,0.00007953331,0.0002519694,0.000236078,0.0001768293,0.00001340761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001332752,"about_ca_system_score_gemma":0.00006561913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009328918,"about_ca_topic_score_gemma":3.637133e-7,"domain_scores_codex":[0.9984254,0.00004794815,0.0002798021,0.0006236137,0.0002272717,0.0003959936],"domain_scores_gemma":[0.9990668,0.0001650229,0.0001119329,0.00031239,0.0001005831,0.0002432409],"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.0001989433,0.0003938241,0.0003340505,0.0004860703,0.0002131287,0.0001407963,0.008872412,0.2026711,0.001575188,0.5664379,0.02233004,0.1963465],"study_design_scores_gemma":[0.0005694104,0.0005245017,0.00007791804,0.00001950025,0.000008788718,0.00001965596,0.00002678688,0.9797705,0.0001303398,0.005210579,0.01336168,0.0002803295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01313598,0.0003374312,0.9753574,0.009646787,0.0007811501,0.0002874683,0.0000125747,0.000363582,0.00007763659],"genre_scores_gemma":[0.6503319,0.00005096138,0.34465,0.004090315,0.0007106907,0.00003353968,0.0000197088,0.00004979428,0.00006310947],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7770994,"threshold_uncertainty_score":0.8236988,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01799641430285038,"score_gpt":0.2425841019860163,"score_spread":0.2245876876831659,"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."}}