{"id":"W2259367099","doi":"10.26421/qic16.11-12-6","title":"Solving constrained quadratic binary problems via quantum adiabatic evolution","year":2016,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Mitacs","keywords":"Adiabatic process; Quadratic unconstrained binary optimization; Mathematical optimization; Quadratic programming; Mathematics; Quantum; Quadratic equation; Binary number; A priori and a posteriori; Applied mathematics; Computer science; Quantum computer; Quantum mechanics; Physics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007441215,0.000544252,0.0005216029,0.0006960503,0.0004975027,0.000900455,0.0006591757,0.0003520968,0.000007189014],"category_scores_gemma":[0.00009476353,0.0004655349,0.0001612703,0.0003957696,0.0001523788,0.001699344,0.0008262686,0.0006258785,0.00008606111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001901483,"about_ca_system_score_gemma":0.0004049925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007144937,"about_ca_topic_score_gemma":0.000003119211,"domain_scores_codex":[0.9968162,0.0002375568,0.001216425,0.0005792885,0.0006183897,0.0005322004],"domain_scores_gemma":[0.9976068,0.0002659108,0.001016572,0.0005287414,0.0003613794,0.0002205954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003044751,0.0001455509,0.0001780945,0.002291454,0.0001621816,0.00001235664,0.01000994,0.3200476,0.0003204757,0.2327908,0.0009743402,0.4330367],"study_design_scores_gemma":[0.0005494933,0.0001846913,0.001150394,0.000663216,0.00002018079,0.00006423869,0.00007572064,0.832081,0.00001333658,0.1644606,0.0002095296,0.0005276319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06864955,0.0003864186,0.9258205,0.001668409,0.001629424,0.0008027771,0.00002323772,0.0007128082,0.0003069226],"genre_scores_gemma":[0.9832743,0.0000431435,0.01593788,0.0003069708,0.0001642779,0.00006474045,0.000175577,0.00002165234,0.00001148781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9146248,"threshold_uncertainty_score":0.9997796,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01056666197721056,"score_gpt":0.23181869628771,"score_spread":0.2212520343104994,"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."}}