{"id":"W1863205561","doi":"10.1088/1751-8113/48/41/415301","title":"Recursive simulation of quantum annealing","year":2015,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Engineering and Physical Sciences Research Council","keywords":"Adiabatic process; Quantum annealing; Unitary state; Quantum; Statistical physics; Figure of merit; Adiabatic quantum computation; Computer science; Simulated annealing; Exploit; Quantum phase estimation algorithm; Formalism (music); Quantum computer; Computer simulation; Algorithm; Quantum simulator; Applied mathematics; Physics; Mathematics; Quantum mechanics; Simulation","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.0006341509,0.00008601038,0.0002748557,0.00003823642,0.00002734337,0.00004137868,0.0002437107,0.00003707085,0.00000273659],"category_scores_gemma":[0.0003186237,0.00005645254,0.00008403607,0.0001364589,0.0002066953,0.0001210888,0.0001087596,0.0001734593,0.00000200212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007673015,"about_ca_system_score_gemma":0.00004585705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.470871e-7,"about_ca_topic_score_gemma":2.964841e-9,"domain_scores_codex":[0.9990194,0.0000744994,0.0003606547,0.00009225504,0.0003290357,0.0001240929],"domain_scores_gemma":[0.9987127,0.0005128615,0.0002249807,0.0001322237,0.000255919,0.0001613056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001457046,0.00008435488,0.000005283562,0.00002586588,0.00001520894,0.000008590598,0.001196814,0.01209741,0.00004161969,0.9781841,0.00001128466,0.008314882],"study_design_scores_gemma":[0.0001488442,0.0001792602,0.000004785133,0.0000622587,0.000007584038,0.00003805415,0.0000288709,0.4885067,0.0003196821,0.5106624,0.000007179598,0.00003441981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2765552,0.00005104759,0.7227537,0.0003896983,0.00007127719,0.00002735622,5.050632e-7,0.000006840982,0.0001444499],"genre_scores_gemma":[0.9439843,0.000002251614,0.05582199,0.00003144379,0.0001537326,1.726925e-7,9.530523e-8,0.000004681266,0.000001372459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6674291,"threshold_uncertainty_score":0.2302068,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01893006590111423,"score_gpt":0.2698914251473155,"score_spread":0.2509613592462012,"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."}}