{"id":"W2747088929","doi":"10.1007/978-3-319-66167-4_9","title":"Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Quadratic unconstrained binary optimization; Maximum satisfiability problem; Scalability; Qubit; Encoding (memory); Theoretical computer science; Quantum computer; Quadratic equation; Algorithm; Quantum; Artificial intelligence; Boolean function; Mathematics","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008294969,0.0005865842,0.0005735172,0.0005824399,0.001119534,0.001608854,0.001762328,0.0002361159,0.000003041116],"category_scores_gemma":[0.0001268811,0.0004701188,0.00006643518,0.0001813958,0.001462778,0.0006479468,0.002156713,0.0008536057,0.000004410422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008076957,"about_ca_system_score_gemma":0.0005035112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005043121,"about_ca_topic_score_gemma":0.00007355138,"domain_scores_codex":[0.9962215,0.00003073061,0.0004444112,0.001933442,0.000721901,0.0006480268],"domain_scores_gemma":[0.9968301,0.0004747938,0.0005009176,0.001747045,0.0001946516,0.0002524987],"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.00001998858,0.00003115256,0.0005647099,0.0001234043,0.00003225888,0.002018557,0.002215353,0.01073516,0.00004063391,0.01045845,0.00002276441,0.9737376],"study_design_scores_gemma":[0.0003129062,0.0005372411,0.002463609,0.0009312129,0.00001711102,0.004562168,3.573505e-7,0.9099777,0.00003249445,0.07918862,0.001266223,0.0007103212],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003271185,0.0009583385,0.9915293,0.001967613,0.0007527196,0.0004064412,0.000004069151,0.00017568,0.0009345975],"genre_scores_gemma":[0.3783196,0.0001044615,0.6198122,0.000577545,0.0005441464,0.00001219089,0.00000961175,0.00005947103,0.0005607908],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9730272,"threshold_uncertainty_score":0.9997751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01503819851531909,"score_gpt":0.2484976732968198,"score_spread":0.2334594747815007,"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."}}