{"id":"W1977085333","doi":"10.1140/epjst/e2015-02344-2","title":"Quantum annealing: The fastest route to quantum computation?","year":2015,"lang":"en","type":"article","venue":"The European Physical Journal Special Topics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum annealing; Adiabatic process; Hamiltonian (control theory); Adiabatic quantum computation; Scaling; Quantum; Computation; Quantum phase transition; Quantum computer; Physics; Quantum phases; Statistical physics; Quantum mechanics; Computer science; Mathematics; Algorithm; Mathematical optimization; Geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.001169526,0.000211933,0.0002102043,0.00004841584,0.0006946793,0.000801849,0.00210971,0.00001777885,0.000001248247],"category_scores_gemma":[0.000136184,0.0001115597,0.0001584672,0.0004817148,0.00009745722,0.0001593174,0.0006870796,0.0007310957,0.0002532957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005249806,"about_ca_system_score_gemma":0.00008679934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009217877,"about_ca_topic_score_gemma":0.00000204473,"domain_scores_codex":[0.9975315,0.0008287728,0.0003238094,0.0002746773,0.0006299079,0.0004113483],"domain_scores_gemma":[0.9986203,0.0001937345,0.000179314,0.0004727476,0.0001951616,0.0003387835],"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.00001523493,0.0001140642,0.00002843144,0.000002483307,0.00003248479,0.0001516595,0.01124557,0.06488913,0.0000377455,0.05000307,0.02752534,0.8459548],"study_design_scores_gemma":[0.0005812483,0.000542226,0.004571123,0.00004995377,0.0000217272,0.000417896,0.0003491168,0.5390906,0.00004546886,0.1358325,0.3180808,0.0004172432],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.287761,0.0001857958,0.4751115,0.09603997,0.01224051,0.0006892575,0.00001114792,0.0004840699,0.1274768],"genre_scores_gemma":[0.7392317,0.000008466774,0.007397167,0.003245668,0.249444,0.00000193224,0.000002368326,0.00006587614,0.0006028173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8455375,"threshold_uncertainty_score":0.7732248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03106930639117512,"score_gpt":0.2736810072418878,"score_spread":0.2426117008507127,"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."}}