{"id":"W3106015846","doi":"10.1007/s10589-016-9844-y","title":"Building an iterative heuristic solver for a quantum annealer","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Mitacs","keywords":"Quadratic unconstrained binary optimization; Solver; Quantum annealing; Heuristic; Quantum; Quadratic equation; Tabu search; Optimization problem; Quantum computer","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0001249633,0.000124942,0.0001112742,0.0001035494,0.0003841314,0.0001653334,0.0002555379,0.0000394808,0.000005881625],"category_scores_gemma":[0.00002127552,0.00009479954,0.00003666855,0.0002323565,0.00006273309,0.0003266815,0.0000721818,0.00004142673,0.000004237816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001882479,"about_ca_system_score_gemma":0.00005207471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.345927e-7,"about_ca_topic_score_gemma":2.502413e-7,"domain_scores_codex":[0.9990451,0.00003510978,0.0002107395,0.0004141992,0.0001294342,0.0001653848],"domain_scores_gemma":[0.9989855,0.0003608599,0.00009975904,0.000194365,0.0002445966,0.0001149691],"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.00000234213,0.00004170394,0.0000149664,0.000005426281,0.000006815571,1.739937e-7,0.00008657094,0.576525,0.00006430232,0.3772173,0.0001126532,0.04592275],"study_design_scores_gemma":[0.0003831109,0.00005642495,0.0002137923,0.00001581853,0.000004480259,0.00001059098,0.000004255435,0.9119626,0.00002391225,0.08408295,0.003097774,0.000144326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001123868,0.00004831346,0.9959854,0.002132149,0.00005895707,0.000404549,0.00003257044,0.0001739034,0.00004031411],"genre_scores_gemma":[0.2387285,0.00000625503,0.7604988,0.0003790609,0.0001327519,0.0001694165,0.00003210111,0.00001130562,0.00004181163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3354376,"threshold_uncertainty_score":0.3865813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01335722077858014,"score_gpt":0.2769790052804113,"score_spread":0.2636217845018311,"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."}}