{"id":"W4301028498","doi":"10.48550/arxiv.0907.1623","title":"Faster quantum algorithm for evaluating game trees","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Quantum algorithm; Binary logarithm; Mathematics; Upper and lower bounds; Omega; Quantum walk; Time complexity; Quantum; Discrete mathematics; Algorithm; Physics; Quantum mechanics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006123769,0.0005202902,0.0005412585,0.0003293869,0.0002676303,0.0003047106,0.002435945,0.0003379022,0.000008523672],"category_scores_gemma":[0.00004968278,0.0005505967,0.0004733952,0.0004793192,0.00008418666,0.000229256,0.001622343,0.0007467022,0.00003036891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001344765,"about_ca_system_score_gemma":0.0002523059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004264106,"about_ca_topic_score_gemma":0.000008991136,"domain_scores_codex":[0.99692,0.0002116963,0.0003324298,0.001671876,0.0001835705,0.0006804632],"domain_scores_gemma":[0.9975001,0.000278329,0.0003851286,0.001367922,0.0002552862,0.0002132034],"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.00001488888,0.00011596,0.00003753099,0.00005592352,0.00009375064,0.0001219907,0.0004493045,0.688292,0.00003807923,0.02804203,0.0002876905,0.2824508],"study_design_scores_gemma":[0.0006327651,0.0002782313,0.0003487313,0.0001578682,0.00005712862,0.00001123167,0.00002480453,0.886809,0.00004962414,0.1105162,0.0005315756,0.0005828255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1016547,0.000124337,0.8958156,0.0002320824,0.0009377277,0.0005250806,0.00002996385,0.0004467961,0.000233726],"genre_scores_gemma":[0.8215494,0.00003812215,0.1766784,0.0002967702,0.0004306344,0.000003016993,0.00003113367,0.00003989623,0.0009326013],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7198948,"threshold_uncertainty_score":0.9996945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07216432397148756,"score_gpt":0.229824433939707,"score_spread":0.1576601099682195,"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."}}