{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760674,0.0007402385,0.0009637586,0.0006734864,0.001503901,0.003185934,0.002318869,0.001546724,0.01546612],"category_scores_gemma":[0.004471875,0.0009722105,0.002247541,0.001612765,0.002180751,0.009101941,0.003188663,0.005233678,0.003037571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001228643,"about_ca_system_score_gemma":0.001721673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001249656,"about_ca_topic_score_gemma":0.002088122,"domain_scores_codex":[0.9986848,0.0003836053,0.00008738788,0.0002978498,0.0003717609,0.000174566],"domain_scores_gemma":[0.9977064,0.001573993,0.00006899108,0.0004218763,0.0001542324,0.00007448511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001767517,0.0002339968,0.0004283171,0.0003801459,0.00006505019,0.00008164057,0.0002574861,0.0201964,0.003821908,0.873235,0.008444944,0.09267834],"study_design_scores_gemma":[0.00005912803,0.0001056487,0.0005006723,0.00008124152,0.00005030852,0.0001351827,0.0001005448,0.1081523,0.006752003,0.8634832,0.02053097,0.00004886441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07160892,0.005220038,0.7728035,0.005376869,0.0007186484,0.0002643437,0.0005993811,0.001491611,0.1419167],"genre_scores_gemma":[0.5213553,0.003760912,0.4152184,0.0008710261,0.000877936,0.0003089297,0.001201957,0.0006223875,0.05578307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01546612,"threshold_uncertainty_score":0.05173934,"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."}}