{"id":"W2582746905","doi":"10.1007/s11128-017-1639-2","title":"A subgradient approach for constrained binary optimization via quantum adiabatic evolution","year":2017,"lang":"en","type":"preprint","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"QLT (Canada)","funders":"","keywords":"Subgradient method; Quadratic unconstrained binary optimization; Mathematical optimization; Quantum; Lagrangian relaxation; Quadratic programming; Quadratic equation; Adiabatic process; Quantum phase estimation algorithm; Applied mathematics; Computer science; Quantum computer; Binary number; Mathematics; Quantum annealing; Physics; Quantum mechanics; Quantum error correction","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","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001075066,0.0006046421,0.000615339,0.0006851137,0.001441377,0.002224536,0.00184778,0.0004717753,0.000002655018],"category_scores_gemma":[0.0002826444,0.0005816085,0.0002749874,0.0003266794,0.0001830309,0.002801153,0.0008589869,0.0007384935,0.000008214411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002851118,"about_ca_system_score_gemma":0.0009597666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004220912,"about_ca_topic_score_gemma":5.80628e-7,"domain_scores_codex":[0.9967003,0.00009708686,0.001160048,0.0007101267,0.0006318087,0.000700669],"domain_scores_gemma":[0.9958426,0.00009133567,0.002014108,0.001123799,0.0007252195,0.0002028924],"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.00002275415,0.00008000048,0.00001168277,0.002015014,0.00003448792,0.000001320342,0.00304368,0.9043997,0.00001235651,0.01331334,0.0001772652,0.07688842],"study_design_scores_gemma":[0.0006590468,0.0001493226,0.00008464605,0.0005825082,0.00004333334,0.00004561873,0.00009846793,0.9802451,0.00002566261,0.01703657,0.0003247636,0.0007049387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002721403,0.0005877356,0.9921506,0.0005351052,0.001314233,0.001441245,0.00005095737,0.0007316335,0.0004670617],"genre_scores_gemma":[0.6353725,0.00001429872,0.363329,0.0001340278,0.0002077972,0.0002397864,0.0006607062,0.0000286035,0.00001325456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6326512,"threshold_uncertainty_score":0.9998586,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01593767461817021,"score_gpt":0.2488040224145937,"score_spread":0.2328663477964235,"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."}}