{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001851656,0.0007058262,0.001025739,0.000442189,0.0006436758,0.001242922,0.001159055,0.001376113,0.004340556],"category_scores_gemma":[0.00495704,0.0004604632,0.0005914673,0.0007856727,0.00152125,0.001553292,0.002479731,0.002886597,0.0004882091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008596646,"about_ca_system_score_gemma":0.001229901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002029709,"about_ca_topic_score_gemma":0.001983766,"domain_scores_codex":[0.9990434,0.0004515975,0.00003030033,0.0001128933,0.0002633821,0.00009839748],"domain_scores_gemma":[0.9985933,0.001071941,0.00008248743,0.00008510968,0.000105885,0.00006134507],"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.00008321591,0.0000677566,0.0002259791,0.0002089091,0.00003871941,0.0000869841,0.000117398,0.5042856,0.002523165,0.4401872,0.002996083,0.04917908],"study_design_scores_gemma":[0.00001800833,0.0000185907,0.00004220694,0.00001104338,0.000003746915,0.0000134656,0.00001124862,0.909304,0.0003702005,0.08919069,0.00101135,0.000005396767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009167295,0.0002283046,0.9820696,0.0005330147,0.00004063891,0.00003496724,0.00003942474,0.00007980186,0.00780688],"genre_scores_gemma":[0.3958699,0.0005639887,0.5921416,0.000434053,0.000164142,0.0003084949,0.0002172728,0.0002118434,0.01008876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004340556,"threshold_uncertainty_score":0.01452065,"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."}}