{"id":"W1784285531","doi":"10.1103/physrevlett.107.040501","title":"Computational Difficulty of Computing the Density of States","year":2011,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute","funders":"National Science Foundation","keywords":"Degeneracy (biology); Complexity class; Quantum computer; Quantum complexity theory; Physics; Class (philosophy); Quantum; Statistical physics; Quantum mechanics; Ground state; Computational complexity theory; Computer science; Algorithm; Bioinformatics","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.0002197288,0.0001066532,0.0002935567,0.00001839014,0.00006165232,0.000007514874,0.000618524,0.000004417131,0.000001820605],"category_scores_gemma":[0.00002758736,0.00006373417,0.0001561448,0.0002630024,0.0001365232,0.00004880928,0.0002262123,0.0001284097,0.000004544783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005782469,"about_ca_system_score_gemma":0.00001404673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002715394,"about_ca_topic_score_gemma":2.372286e-7,"domain_scores_codex":[0.9990209,0.0001196869,0.0002624033,0.0001869736,0.0002627243,0.0001472685],"domain_scores_gemma":[0.9990633,0.0003003284,0.0002278333,0.0002967799,0.00007608417,0.00003567839],"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.00003275127,0.002731733,0.01153697,0.00811066,0.0006842754,0.00005724994,0.0479635,0.3136137,0.02129725,0.1587657,0.01067632,0.4245299],"study_design_scores_gemma":[0.0001162491,0.00005796155,0.05083758,0.0007169585,0.00002452726,0.000009092853,0.000007065879,0.9428661,0.001220938,0.003908602,0.00009641253,0.0001385506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7105022,0.0003768967,0.2871233,0.001758765,0.0000587442,0.000121751,0.00000199684,0.00002980218,0.00002658724],"genre_scores_gemma":[0.9730819,0.00005256382,0.02390816,0.002910118,0.00003962877,0.000001047256,0.000002040596,0.000004188531,3.568342e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6292524,"threshold_uncertainty_score":0.2599004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01853490460789385,"score_gpt":0.2602632369004464,"score_spread":0.2417283322925525,"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."}}