{"id":"W2562046152","doi":"10.48550/arxiv.1801.08653","title":"Efficient Combinatorial Optimization Using Quantum Annealing","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Quantum annealing; Quadratic unconstrained binary optimization; Heuristics; Computer science; Quantum; Quantum computer; Ising model; Simulated annealing; Clique; Graph; Theoretical computer science; Algorithm; Mathematics; Statistical physics; Combinatorics; Quantum mechanics; Physics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.000775323,0.0005992377,0.0009186022,0.0006038573,0.0005366589,0.001102731,0.0009883747,0.001136407,0.003447357],"category_scores_gemma":[0.002738808,0.0004654122,0.0008618885,0.0007692376,0.0009031934,0.0009362534,0.0009514985,0.001128201,0.0004573325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126722,"about_ca_system_score_gemma":0.001337226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003646285,"about_ca_topic_score_gemma":0.005110031,"domain_scores_codex":[0.9994181,0.0002870589,0.00001781848,0.00008081424,0.0001339299,0.00006224198],"domain_scores_gemma":[0.9989352,0.0007716712,0.00005170243,0.0001426638,0.00007006796,0.00002884713],"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.00004969838,0.00006449094,0.0002844011,0.00008311776,0.00003972656,0.00003172562,0.0000472737,0.9204381,0.001605683,0.04237781,0.001483997,0.03349407],"study_design_scores_gemma":[0.00001574927,0.00001613375,0.00007402206,0.000004578646,0.000003551382,0.000005571198,0.00000933447,0.9839391,0.0003107378,0.0149103,0.0007081368,0.000002821623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08648564,0.0007562335,0.8783376,0.0009023196,0.000113317,0.0001909157,0.0001655605,0.001171716,0.0318767],"genre_scores_gemma":[0.5610296,0.0003427482,0.4327543,0.0002387482,0.00005040737,0.0003596293,0.0002673945,0.0002025382,0.004754684],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003646285,"threshold_uncertainty_score":0.01153255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04575292858148585,"score_gpt":0.1972359380443834,"score_spread":0.1514830094628976,"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."}}