{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006748912,0.0002474208,0.0005777142,0.0003765846,0.0004739571,0.0006399106,0.001071089,0.001175205,0.002436427],"category_scores_gemma":[0.004269929,0.0002887099,0.0004712857,0.0003967276,0.0008708316,0.0007625929,0.0007221585,0.0006415524,0.0002856731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001109243,"about_ca_system_score_gemma":0.0009280377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01092297,"about_ca_topic_score_gemma":0.007392289,"domain_scores_codex":[0.9996654,0.0001485961,0.00001078274,0.00003191066,0.00007825485,0.0000651232],"domain_scores_gemma":[0.9985869,0.0009378864,0.00007153953,0.0001938946,0.0001531567,0.00005659308],"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.00002499984,0.00001625246,0.0003164237,0.00001821952,0.000008339563,0.00002514692,0.00005283816,0.9529765,0.001318777,0.04248605,0.000129712,0.002626843],"study_design_scores_gemma":[0.000002390687,0.000002985154,0.00003288977,8.96258e-7,8.058844e-7,0.000001911712,0.000001910663,0.9978489,0.0001549724,0.001861568,0.00008940488,0.000001380331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4375585,0.0002705659,0.5393529,0.0003892057,0.00005842577,0.0001105301,0.0001878737,0.0008535526,0.02121851],"genre_scores_gemma":[0.9411054,0.0000899478,0.05630244,0.00004792451,0.000009031384,0.0001561143,0.00009619851,0.00008532491,0.002107587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01092297,"threshold_uncertainty_score":0.0217188,"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."}}