{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008220941,0.0007001217,0.0008851734,0.0006742997,0.0008889984,0.001320377,0.001615714,0.0009633469,0.01224383],"category_scores_gemma":[0.002896811,0.0003873094,0.001041289,0.001008975,0.0008776234,0.003098084,0.001861095,0.001504476,0.002273145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001701834,"about_ca_system_score_gemma":0.002648438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003473636,"about_ca_topic_score_gemma":0.004762632,"domain_scores_codex":[0.9985496,0.0002698352,0.00008649162,0.0002978555,0.0005340115,0.0002620643],"domain_scores_gemma":[0.9988781,0.0004462574,0.00007513246,0.0002923979,0.0002329808,0.00007515989],"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.0006906961,0.0004628077,0.001704479,0.0004995088,0.0001340661,0.0002647965,0.0004795888,0.1020587,0.03657584,0.3608767,0.01909257,0.4771602],"study_design_scores_gemma":[0.0002267809,0.0001920405,0.0004514268,0.00003213022,0.00006275708,0.0001727189,0.00009374298,0.6822895,0.01783962,0.287544,0.01103717,0.0000580324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02264409,0.0001579814,0.9637504,0.0004515062,0.0000786545,0.0001952617,0.0001888706,0.003948219,0.008585083],"genre_scores_gemma":[0.3317844,0.000130769,0.6599002,0.0002893394,0.00005285699,0.0002684252,0.0005464024,0.0004852149,0.006542398],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01224383,"threshold_uncertainty_score":0.04095972,"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."}}