{"id":"W2042331427","doi":"10.1103/physreve.77.036708","title":"Short-loop algorithm for quantum Monte Carlo simulations","year":2008,"lang":"en","type":"article","venue":"Physical Review E","topic":"Quantum many-body systems","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Kavli Institute for Theoretical Physics, University of California, Santa Barbara; National Science Council; National Center for Theoretical Sciences","keywords":"Monte Carlo method; Loop (graph theory); Algorithm; Computer science; Quantum Monte Carlo; Hybrid Monte Carlo; Statistical physics; Quantum computer; Lattice (music); Quantum; Scheme (mathematics); Simplicity; Monte Carlo algorithm; Monte Carlo molecular modeling; Monte Carlo method in statistical physics; Physics; Markov chain Monte Carlo; Mathematics; Quantum mechanics; Statistics","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.00009548703,0.0002220714,0.0005652466,0.00002369283,0.0001893597,0.00001755828,0.0002022514,0.00001720913,0.00004919052],"category_scores_gemma":[0.00002023326,0.0001895532,0.0003983074,0.0002024823,0.00005677397,0.000147569,0.00004255211,0.0001292708,0.0001565193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000218305,"about_ca_system_score_gemma":0.00004453917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007679827,"about_ca_topic_score_gemma":8.274374e-7,"domain_scores_codex":[0.9987169,0.00005874669,0.0003504132,0.0003264497,0.0002242486,0.0003232623],"domain_scores_gemma":[0.9990224,0.0002072189,0.00009913125,0.0004068732,0.0001334706,0.0001308855],"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.00001515188,0.002296607,0.008073701,0.002108487,0.000732528,0.00001335101,0.000736592,0.001061689,0.001485438,0.3372144,0.05310608,0.593156],"study_design_scores_gemma":[0.0004280267,0.00009901588,0.00099221,0.0007532552,0.000216702,0.000002546877,0.00002486022,0.9050069,0.0002534392,0.005486069,0.08619165,0.0005452888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8595858,0.01536409,0.1123694,0.0008877597,0.0008526218,0.005415957,0.001010107,0.0002901336,0.004224116],"genre_scores_gemma":[0.9974697,0.0001539692,0.0003772012,0.0001125558,0.001177663,0.0002518718,0.00006080441,0.00003807699,0.0003581086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9039453,"threshold_uncertainty_score":0.7729756,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04264859129898584,"score_gpt":0.3347089402772337,"score_spread":0.2920603489782479,"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."}}