{"id":"W2037354050","doi":"10.1103/physrevlett.101.130504","title":"Quantum Simulations of Classical Annealing Processes","year":2008,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum annealing; Quantum; Simulated annealing; Quadratic equation; Quantum algorithm; Bounded function; Quantum walk; Quantum process; Statistical physics; Physics; Computer science; Quantum mechanics; Mathematics; Algorithm; Quantum dynamics; Mathematical analysis","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.0005544728,0.0002358687,0.0004721347,0.0002669929,0.000570748,0.0008848786,0.0009564788,0.0009384651,0.003777941],"category_scores_gemma":[0.002139034,0.0002612762,0.0004228915,0.0003424872,0.001397431,0.001181066,0.0007144834,0.000730194,0.0003665322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007397397,"about_ca_system_score_gemma":0.000774348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002669287,"about_ca_topic_score_gemma":0.001927825,"domain_scores_codex":[0.9995252,0.000193137,0.00001897955,0.00005228894,0.0001470561,0.00006343269],"domain_scores_gemma":[0.999315,0.0003821874,0.00003537428,0.0001326087,0.00008593634,0.00004886835],"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.00006705027,0.00005636332,0.000411454,0.0000367027,0.0000237496,0.0000619223,0.00007136899,0.6959869,0.00309765,0.2948689,0.0006049942,0.00471289],"study_design_scores_gemma":[0.00001527045,0.000007994114,0.0000340422,0.000001928319,0.000002124501,0.000004818004,0.000004403996,0.9767736,0.0007586706,0.02171323,0.0006786999,0.000005183813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2552573,0.000320816,0.7073709,0.0009496282,0.00018535,0.0001360235,0.000165259,0.0007390805,0.03487562],"genre_scores_gemma":[0.8998621,0.000164383,0.09537634,0.000179932,0.00003280165,0.0001765225,0.0001017047,0.00009453181,0.004011678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003777941,"threshold_uncertainty_score":0.01263851,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0254600421547923,"score_gpt":0.2896286570121105,"score_spread":0.2641686148573182,"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."}}